-
Notifications
You must be signed in to change notification settings - Fork 16
/
CustomHashSet.java
82 lines (68 loc) · 1.91 KB
/
CustomHashSet.java
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
package by.andd3dfx.collections.custom;
import java.util.Collection;
import java.util.Iterator;
/**
* @see <a href="https://youtu.be/aTbKxApYNYk">Video solution</a>
*/
public class CustomHashSet<T> implements Iterable<T> {
private CustomHashMap<T, Object> map = new CustomHashMap<>();
private static final Object DUMMY_VALUE = new Object();
public int size() {
return map.size();
}
public boolean isEmpty() {
return map.isEmpty();
}
public boolean add(T item) {
return map.put(item, DUMMY_VALUE) == null;
}
public boolean addAll(Collection<T> items) {
boolean result = false;
for (var item : items) {
if (add(item)) {
result = true;
}
}
return result;
}
public boolean remove(T item) {
return map.remove(item) == DUMMY_VALUE;
}
public boolean removeAll(Collection<T> items) {
boolean result = false;
for (var item : items) {
if (remove(item)) {
result = true;
}
}
return result;
}
public boolean contains(T item) {
return map.containsKey(item);
}
public boolean containsAll(Collection<T> items) {
for (var item : items) {
if (!map.containsKey(item)) {
return false;
}
}
return true;
}
public void clear() {
map.clear();
}
@Override
public Iterator<T> iterator() {
return map.keyIterator();
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
var it = iterator();
while (it.hasNext()) {
final T item = it.next();
sb.append(item + ", ");
}
return "[" + sb.substring(0, sb.length() - 2) + "]";
}
}