-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathList.java
More file actions
154 lines (135 loc) · 3.18 KB
/
List.java
File metadata and controls
154 lines (135 loc) · 3.18 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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
class ListNode {
SimObject data; //The node holds a SimObject which holds data
float index; // I added this for method insertInOrder
ListNode next;
ListNode(SimObject o)
{
this(o, null);
}
ListNode(SimObject o, ListNode nextNode)
{
data = o;
index = (float)0.0;
next = nextNode;
}
SimObject getSimObject()
{
return data;
}
ListNode getnext()
{
return next;
}
}
public class List
{
private ListNode firstNode;
private ListNode lastNode;
private ListNode newNode;
private ListNode thisNode;
private String name;
public List (String s)
{
name = s;
firstNode = lastNode = null;
}
public List()
{
this("list");
}
public synchronized void insertInOrder
(SimObject insertItem, float newNodeIndex)
// Data in the first argument is inserted according to the value
// in the second argument
{
if (isEmpty() || firstNode.index > newNodeIndex)
insertAtFront(insertItem, newNodeIndex);
else
{
newNode = new ListNode(insertItem);
newNode.index = newNodeIndex;
thisNode = firstNode;
while (thisNode.next != null &&
thisNode.next.index <= newNodeIndex)
thisNode = thisNode.next;
newNode.next = thisNode.next;
thisNode.next = newNode;
if (newNode.next == null) // Reset lastNode if needed
lastNode = newNode;
}
}
public synchronized void insertAtFront(SimObject insertItem)
{
if (isEmpty())
firstNode = lastNode = new ListNode(insertItem);
else
firstNode = new ListNode(insertItem, firstNode);
}
public synchronized void insertAtFront(SimObject insertItem,
float newNodeIndex)
{
if (isEmpty())
firstNode = lastNode = new ListNode(insertItem);
else
firstNode = new ListNode(insertItem, firstNode);
firstNode.index = newNodeIndex;
}
public synchronized void insertAtBack(SimObject insertItem)
{
if (isEmpty())
firstNode = lastNode = new ListNode(insertItem);
else
lastNode = lastNode.next = new ListNode(insertItem);
}
public synchronized SimObject removeFromFront()
throws EmptyListException
{
SimObject removeItem = null;
if (isEmpty())
throw new EmptyListException(name);
removeItem = firstNode.data;
if(firstNode.equals(lastNode))
firstNode = lastNode = null;
else
firstNode = firstNode.next;
return removeItem;
}
public synchronized SimObject removeFromBack()
throws EmptyListException
{
SimObject removeItem = null;
if (isEmpty())
throw new EmptyListException(name);
removeItem = lastNode.data;
if (firstNode.equals(lastNode))
firstNode = lastNode = null;
else
{
ListNode current = firstNode;
while (current.next != lastNode)
current = current.next;
lastNode = current;
current.next = null;
}
return removeItem;
}
public boolean isEmpty()
{
return firstNode == null;
}
public void print()
{
if (isEmpty())
{
System.out.println("Empty " + name);
}
System.out.print("The " + name + " is: ");
ListNode current = firstNode;
while (current != null)
{
System.out.print(current.data.toString() + " ");
current = current.next;
}
System.out.println("\n");
}
}