-
Notifications
You must be signed in to change notification settings - Fork 0
/
MyAbstractSet.java
78 lines (60 loc) · 1.73 KB
/
MyAbstractSet.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
package mySets;
import java.util.Collection;
abstract class MyAbstractSet <T> implements java.util.Iterator<T> {
MySetElement<T> head;
MyAbstractSet(MySetElement<T> set) {
this.head = set;
}
public MySetIterator iterator() {
return new MySetIterator <>(head);
}
public Object[] toArray() {
throw new java.lang.UnsupportedOperationException();
}
public <T> T[] toArray(T[] a) {
throw new java.lang.UnsupportedOperationException();
}
public boolean contains(Object compareObject) {
for (MyAbstractSet<T> it = this; it.hasNext(); ) {
T t = it.next();
if (t.equals(compareObject)) {
return true;
}
}
return false;
}
public boolean containsAll(Collection<?> c) {
for (Object o: c) {
if (! contains(o)) {
return false;
}
}
return true;
}
public int size() {
int res = 0;
for (MyAbstractSet<T> it = this; it.hasNext(); ) {
T t = it.next();
res ++;
}
return res;
}
public String toString() {
String res = "{";
MySetElement <T> current = head;
while (current != null) {
res += current.value;
if (current.next != null) res += ", ";
current = current.next;
}
return res + "}";
}
@Override
public boolean equals ( Object other ) {
if ( other instanceof MyAbstractSet <? >) {
return this . containsAll (( Collection <? >) other )
&& this . size () == (( MyAbstractSet <? >) other ). size ();
}
return false ;
}
}