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

(8,3,5)
set(p 3 ,7)
3
(8,7,5)
addAfter(first(),2)
-
(8,2,7,5)
The node list ADT, with its built-in notion of position, is useful in a number of
settings. For example, a program that simulates a game of cards could model each
person's hand as a node list. Since most people keep cards of the same suit
together, inserting and removing cards from a person's hand could be
implemented using the methods of the node list ADT, with the positions being
determined by a natural ordering of the suits. Likewise, a simple text editor
embeds the notion of positional insertion and removal, since such editors typically
perform all updates relative to a cursor, which represents the current position in
the list of characters of text being edited.
A Java interface representing the position ADT is given in Code Fragment 6.4.
Code Fragment 6.4:
ADT.
Java interface for the position
An interface for the node list ADT, called Position List, is given in Code
Fragment 6.5. This interface uses the following exceptions to indicate error
conditions.
BoundaryViolationException: Thrown if an attempt is made at
accessing an element whose position is outside the range of positions of the list
(for example, calling method next on the last position of the sequence).
Invalid Position Exception: Thrown if a position provided as
argument is not valid (for example, it is a null reference or it has no associated
list).
331