1: // @author Frank M. Carrano, Timothy M. Henry
2: // @version 5.0
3: public void add(T newEntry)
4: {
5: Node newNode = new Node(newEntry);
6: Node nodeBefore = getNodeBefore(newEntry);
8: if (isEmpty() || (nodeBefore == null))
9: {
10: // Add at beginning
11: newNode.setNextNode(firstNode);
12: firstNode = newNode;
13: }
14: else
15: {
16: // Add after nodeBefore
17: Node nodeAfter = nodeBefore.getNextNode();
18: newNode.setNextNode(nodeAfter);
19: nodeBefore.setNextNode(newNode);
20: } // end if
22: numberOfEntries++;
23: } // end add