-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSoundedHashSet.java
More file actions
213 lines (173 loc) · 4.31 KB
/
SoundedHashSet.java
File metadata and controls
213 lines (173 loc) · 4.31 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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
package ch.hslu.AD.SW04.HashTable;
import java.lang.reflect.Array;
import java.nio.BufferOverflowException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;
public class SoundedHashSet<T> implements Set<T> {
private static int DEFAULT_ARRAY_SIZE = 42;
private Node[] items;
private int size = 0;
public SoundedHashSet() {
this(DEFAULT_ARRAY_SIZE);
}
public SoundedHashSet(int size) {
this.initialize(size);
}
public void clear() {
this.initialize(this.items.length);
}
private void initialize(int size) {
@SuppressWarnings("unchecked")
Node[] items = Node[].class.cast(Array.newInstance(Node.class, size));
this.items = items;
this.size = 0;
}
private int getNextIndex(T item) {
int startIndex = item.hashCode() % items.length;
int currentIndex = startIndex;
Node currentNode = items[currentIndex];
while(currentNode != null && !currentNode.isTombstone() && !currentNode.item.equals(item)) {
currentIndex = (currentIndex + 1) % items.length;
if(currentIndex == startIndex) {
throw new BufferOverflowException();
}
currentNode = items[currentIndex];
}
return currentIndex;
}
public int size() {
return size;
}
public boolean add(T item) {
items[getNextIndex(item)] = new Node(item);
size++;
return true;
}
public boolean contains(Object item) {
return searchNode(item) != null;
}
public Node searchNode(Object item) {
int startIndex = item.hashCode() % items.length;
int currentIndex = startIndex;
Node currentNode;
do {
currentNode = items[currentIndex];
if(currentNode != null && !currentNode.isTombstone() && currentNode.item.equals(item)) {
return currentNode; // item found
}
currentIndex = (currentIndex + 1) % items.length;
} while(currentNode != null && currentIndex != startIndex);
return null;
}
public boolean remove(Object item) {
Node node = searchNode(item);
if(node == null) {
return false;
}
node.bury();
size--;
return true;
}
@Override
public String toString() {
List<String> output = new ArrayList<>();
for(Node item : items) {
if(item != null) {
output.add(item.toString());
} else {
output.add("E");
}
}
return String.join(" | ", output);
}
public Iterator<T> iterator() {
return new Iterator<T>() {
private int current = 0;
@Override
public boolean hasNext() {
return getNext(false) != null;
}
private Node getNext(boolean updateCurrent) {
Node currentNode;
for(int i = current; i < items.length; i++) {
currentNode = items[i];
if(currentNode != null && !currentNode.isTombstone()) {
if(updateCurrent) {
current = i + 1;
}
return currentNode;
}
}
return null;
}
@Override
public T next() {
Node node = getNext(true);
if(node == null) {
throw new NoSuchElementException();
}
return node.item;
}
};
}
private class Node {
public T item;
private boolean isTombstone = false;
public Node(T item) {
this.item = item;
}
public boolean isTombstone() {
return isTombstone;
}
@Override
public String toString() {
if(isTombstone) {
return "T";
}
return item.toString();
}
public void bury() {
item = null;
isTombstone = true;
}
}
@Override
public boolean addAll(Collection<? extends T> c) {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public boolean containsAll(Collection<?> c) {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public boolean isEmpty() {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public boolean removeAll(Collection<?> c) {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public boolean retainAll(Collection<?> c) {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public Object[] toArray() {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
@Override
public <T> T[] toArray(T[] a) {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
}