-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDoubleLinkedListIterator.java
More file actions
125 lines (98 loc) · 2.32 KB
/
DoubleLinkedListIterator.java
File metadata and controls
125 lines (98 loc) · 2.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/**
*
* @author Haowei Chen hxc713
*
* @param <T>
*/
public class DoubleLinkedListIterator<T> implements java.util.ListIterator<T> {
// nodeptr marks the current node as we are iterating
private DLNode<T> nodeptr;
private DLNode<T> last;
private DLNode<T> node;
/**
* Create an iterator for a linked list
* @param list the list we are creating an iterator for
*/
public DoubleLinkedListIterator(DoubleLinkedList<T> list) {
nodeptr = list.getFront();
last = list.getBack();
}
/**
* add the input to the current linked list
*/
@Override
public void add(T e) {
if (nodeptr == null)
return;
else {
last.setNext(node);
last = node;
}
}
/**
* Returns true if there are more elements in the iteration
* @return true if there are more elements in the iteration
*/
@Override
public boolean hasNext() {
return nodeptr != null;
}
/**
* Returns true if there are previous elements in the iteration
*/
@Override
public boolean hasPrevious() {
return last != null;
}
/**
* Returns the next element of the iteration and "increments" the iteration
* @return the next element of the iteration
*/
@Override
public T next() {
T save = nodeptr.getElement();
nodeptr = nodeptr.getNext();
return save;
}
/**
* Returns the previous element of the iteration and "increments" the iteration
*/
@Override
public T previous() {
T save = last.getElement();
last = last.getPrevious();
return save;
}
/**
* set the previous or next to the return value
*/
@Override
public void set(T e) {
if (nodeptr.getNext() == null) {
throw new IndexOutOfBoundsException();
}
nodeptr.getPrevious().setElement(e);
}
@Override
public int nextIndex() {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public int previousIndex() {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public void remove() {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
/**
* this method works as an interaction pain
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
}
}