Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Return the position of the element of S preceding the one at position p; an
error occurs if p is the first position.
next(p):
Return the position of the element of S following the one at position p; an
error occurs if p is the last position.
The above methods allow us to refer to relative positions in a list, starting at the
beginning or end, and to move incrementally up or down the list. These positions
can intuitively be thought of as nodes in the list, but note that there are no specific
references to node objects. Moreover, if we provide a position as an argument to a
list method, then that position must represent a valid position in that list.
Node List Update Methods
In addition to the above methods and the generic methods size and isEmpty,
we also include the following update methods for the node list ADT, which take
position objects as parameters and/or provide position objects as return values.
set(p, e):
Replace the element at position p with e, returning the element formerly
at position p.
addFirst(e):
Insert a new element e into S as the first element.
addLast(e):
Insert a new element e into S as the last element.
addBefore(p, e):
Insert a new element e into S before position p.
addAfter(p, e):
Insert a new element e into S after position p.
remove(p):
Remove and return the element at position p in S, invalidating this
position in S.
328