Repository navigation
Expand file tree
/
Copy pathLinkedSet.java
More file actions
228 lines (171 loc) · 3.91 KB
/
Copy pathLinkedSet.java
File metadata and controls
228 lines (171 loc) · 3.91 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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
package sets;
import java.util.Iterator;
public class LinkedSet<E> implements Set<E> {
private LinkedNode<E> head = null;
private int size;
private int count;
private Set<E> set;
private Set<E> temp;
private Set<E> that;
Iterator<E> iter = this.iterator();
// Constructors
public LinkedSet() {
}
public LinkedSet(E e) {
head = new LinkedNode<E>(e ,null );
}
private LinkedSet(LinkedNode<E> head) {
this.head = head;
}
@Override
public int size() {
// TODO (1)
for(E e : this){
size++;
if(size >= Integer.MAX_VALUE)
return Integer.MAX_VALUE;
}
return size;
}
@Override
public boolean isEmpty() {
// TODO (2)
/*if(set.equals(null)){
return true;
}*/
return head==null;
}
@Override
public Iterator<E> iterator() {
return new LinkedNodeIterator<E>(this.head);
}
@Override
public boolean contains(Object o) {
// TODO (3)
LinkedNode<E>current = head;
while(current!=null){
if(current.getData().equals(o)){
return true;
}
current = current.getNext();
}
return false;
}
@Override
public boolean isSubset(Set<E> that) {
// TODO (4)
if((this.size() > that.size())){
return false;
}
for(E e :this){
if((!that.contains(e)))
return false;
}
return true;
}
@Override
public boolean isSuperset(Set<E> that) {
// TODO (5)
if((this.size() < that.size())){
return false;
}
for(E e :that){
if((!this.contains(e)))
return false;
}
return true;
}
@Override
public Set<E> adjoin(E e) {
// TODO (6)
LinkedNode<E>element = new LinkedNode<E>(e,head);
set =new LinkedSet<E>(element);
return set;
}
@Override
public Set<E> union(Set<E> that) {
// TODO (7)
LinkedSet<E>append = new LinkedSet<E>(head);
for(E t : that){
if(!this.contains(t)){
append =(LinkedSet<E>) append.adjoin(t);
}
}
return append;
}
/*LinkedNode<E>current = head;
while(current!=null){
append.adjoin(current.getData());
current = current.getNext();
}
Iterator<E>union = that.iterator();
while(union.hasNext())
append.adjoin(union.next());
return append;*/
@Override
public Set<E> intersect(Set<E> that) {
// TODO (8)
LinkedSet<E> temp = new LinkedSet<E>();
for(E e : that) {
if(this.contains(e))
temp= (LinkedSet<E>) temp.adjoin(e);
}
return temp;
}
@Override
public Set<E> subtract(Set<E> that) {
LinkedSet<E>append = new LinkedSet<E>(head);
for(E t : that){
if(append.contains(t)){
append =(LinkedSet<E>) append.remove(t);
}
}
return append;
}
// TODO (9)
/*LinkedSet<E> temp = new LinkedSet<E>();
LinkedSet<E> mysect = new LinkedSet<E>();
LinkedSet<E> subtract =new LinkedSet<E>();
LinkedNode<E>current = head;
while(current!=null){
temp.adjoin(current.getData());
current = current.getNext();
}
Iterator<E>common = that.iterator();
while(common.hasNext()){
mysect.adjoin(common.next());
}
Iterator<E> one = temp.iterator();
Iterator<E> two = mysect.iterator();
while(one.hasNext()){
while(two.hasNext())
if(!one.next().equals(two.next())){
subtract.adjoin(two.next());
}*/
@Override
public Set<E> remove(E e) {
// TODO (10)
LinkedSet<E>remove = new LinkedSet<E>();
for(E del : this)
if(!del.equals(e))
remove =(LinkedSet<E>) remove.adjoin(del);
return remove;
}
@Override
@SuppressWarnings("unchecked")
public boolean equals(Object o) {
if (! (o instanceof Set)) {
return false;
}
Set<E> that = (Set<E>)o;
return this.isSubset(that) && that.isSubset(this);
}
@Override
public int hashCode() {
int result = 0;
for (E e : this) {
result += e.hashCode();
}
return result;
}
}