-
Notifications
You must be signed in to change notification settings - Fork 0
/
FMap.java
333 lines (256 loc) · 7.1 KB
/
FMap.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
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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
/************************************************************/
/* Programmer: An Dang */
/* Email: [email protected] */
/* Time Spent: 4 hours */
/************************************************************/
// FMap<K,V> is either:
// -- EmptyMap
// -- Add( FMap, K, V )
import java.util.* ;
public abstract class FMap<K,V> implements Iterable<K>{
// emptyMap
public static <K,V> FMap<K,V> emptyMap() {
return new EmptyMap<K,V>() ;
}
// emptyMap(c)
public static <K,V> FMap<K,V> emptyMap( java.util.Comparator<? super K> c){
return new EmptyMap<K,V>( c ) ;
}
public abstract Iterator<K> iterator() ;
public abstract FMap<K,V> add( K k0, V v0 ) ;
public abstract boolean isEmpty() ;
public abstract int size() ;
public abstract boolean containsKey( K x ) ;
public abstract V get( K x ) ;
public abstract String toString() ;
public abstract boolean equals( Object x ) ;
public abstract int hashCode() ;
}
// class of empty FMap
class EmptyMap<K,V> extends FMap<K,V>{
java.util.Comparator<? super K> c = null ;
// the comparator for this.add( k0, v0 )'s keys
@SuppressWarnings(value="unchecked")
EmptyMap() {}
EmptyMap(java.util.Comparator<? super K> c ){
this.c = c ;
}
public boolean isEmpty (){
return true ;
}
public int size (){
return 0 ;
}
public boolean containsKey ( K k0 ){
return false ;
}
public V get( K k0 ) {
return null ;
}
public FMap<K,V> add( K k0, V v0 ){
return new Add<K,V> ( this, k0, v0 ) ;
}
public String toString(){
return "{...(" + this.size() + " entries)...}" ;
}
public boolean equals( Object ob ){
FMap temp ;
if (! (ob instanceof FMap ) )
return false ;
else{
temp = (FMap) ob ;
if ( temp.size() == 0 )
return true ;
else
return false ;
}
}
public int hashCode(){
return 924 ;
}
@Override
public Iterator<K> iterator(){
ArrayList<K> currentKeys = new ArrayList<K>() ;
return new KeyIterator<K>( currentKeys ) ;
}
}
// class of non-empty FMap
// Add<K,V>( FMap, K, V )
class Add<K,V> extends FMap<K,V> {
FMap<K,V> m0 ; // the old FMap structure
K k0 ; // the new key
V v0 ; // the new value
Add( FMap<K,V> m0, K k0, V v0 ) {
this.m0 = m0 ;
this.k0 = k0 ;
this.v0 = v0 ;
}
public boolean isEmpty (){
return false ;
}
public int size(){
if ( m0.containsKey( k0 ) )
return m0.size() ;
else
return 1 + m0.size() ;
}
public boolean containsKey ( K x ){
if ( x.equals( k0 ) )
return true ;
else
return m0.containsKey( x ) ;
}
// getMethod is implemented to get the new added key
// if there is two pairs that has the same key
public V get( K x ) {
if ( x.equals( k0 ) )
return v0 ;
else
return m0.get( x ) ;
}
public FMap<K,V> add( K k0, V v0 ){
return new Add<K,V> ( this, k0, v0 ) ;
}
public String toString(){
return "{...(" + this.size() + " entries)...}" ;
}
@SuppressWarnings(value="unchecked")
public boolean equals( Object ob ){
FMap<K,V> temp ;
if (! ( ob instanceof FMap ) )
return false ;
else{
temp = (FMap<K,V>) ob ;
if ( temp.isEmpty() )
return false ;
else if ( samekeys( this, (Add) temp )
&& samepairs( this, this, (Add) temp ))
return true ;
else
return false ;
}
}
public int hashCode(){
K K_temp ;
V V_temp ;
int numKeys ;
int hashCode = 0 ;
ArrayList<K> currentKeys = new ArrayList<K>() ;
getKeys(this, currentKeys) ;
numKeys = currentKeys.size() ;
for( int i = 0 ; i < numKeys ; i++ ){
K_temp = currentKeys.get(i) ;
V_temp = this.get( K_temp ) ;
hashCode += (195 + 5 * (3 + K_temp.hashCode())
+ 7 * ( 11 + V_temp.hashCode() )) ;
}
return hashCode ;
}
@SuppressWarnings(value="unchecked")
@Override
public Iterator<K> iterator(){
java.util.Comparator<? super K> c ;
EmptyMap temp;
Add Add_temp = this ;
FMap <K,V> m0_temp = Add_temp.m0 ;
ArrayList<K> currentKeys = new ArrayList<K>() ;
getKeys(this, currentKeys) ;
// check whether the empty map is EmptyMap() or EmptyMap(c)
// get the empty map comparator object
while( !( m0_temp.isEmpty() ) ){
Add_temp = (Add) m0_temp ;
m0_temp = Add_temp.m0 ;
}
// m0_temp now is the empty map
temp = (EmptyMap) m0_temp;
c = temp.c ;
// check whether emptyMap.c is null or not
// sort the keys here
if( c != null )
Collections.sort(currentKeys, c);
return new KeyIterator<K> ( currentKeys ) ;
}
// get all the keys of an Add, exclude duplicate keys
// store keys in the ArrayList argument
private <K> void getKeys( Add<K,V> m, ArrayList<K> array ){
if ( m.m0.isEmpty() ){
if ( array.contains( m.k0 ) )
return ;
else{
array.add (m.k0) ;
return ;
}
}
else{
if ( array.contains( m.k0 ) )
getKeys( (Add<K,V>) m.m0, array ) ;
else{
array.add( m.k0 ) ;
getKeys( (Add<K,V>) m.m0, array ) ;
}
}
return ;
}
// samekeys: Add x Add -> boolean
// check if the two Adds (same size) has the same set of keys,
private <K,V> boolean samekeys( Add<K,V> m1 , Add<K,V> m2 ){
if ( containAll( m1, m2 ) && containAll( m2, m1 ) )
return true ;
else
return false ;
}
// containAll: Add x Add -> boolean
// check whether first Add contain all the key in second FMap
private <K,V> boolean containAll( Add<K,V> m1 , Add<K,V> m2 ){
//case: m2 = Add( m0 = EmptyMap, k0 , v0 )
if ( m2.m0.isEmpty() ) {
if ( m1.containsKey( m2.k0 ) )
return true ;
else
return false ;
}
//case: m2 = Add( m0 = Add, k0, v0 )
if ( m1.containsKey( m2.k0 ) )
return containAll( m1, (Add<K,V>) m2.m0 ) ;
else
return false ;
}
// sameValues: Add X Add x Add -> boolean
// check if the two maps (same size)
// has the same set of key-value pair
// assumption: the two FMap already have the same keys
// <-> but one may have dublicate keys
private <K,V> boolean samepairs( Add<K,V> m1, Add<K,V> m1copy
, Add<K,V> m2 ){
if ( m1copy.get( m1.k0 ).equals( m2.get( m1.k0 ) ) ){
if ( m1.m0.isEmpty() )
return true;
else
return samepairs ( (Add<K,V>) m1.m0 , m1copy , m2 ) ;
}
else
return false ;
}
}
class KeyIterator<K> implements Iterator<K>{
ArrayList<K> currentKeys ;
// currentKeys is the list of keys of an FMap
// currentKeys has no duplicated and
// already sorted if comparator is specified
KeyIterator( ArrayList<K> Keys ){
this.currentKeys = Keys ;
}
public void remove(){
// some message
throw new UnsupportedOperationException("remove");
}
public boolean hasNext(){
return !( currentKeys.isEmpty() ) ;
}
public K next(){
if( currentKeys.isEmpty() )
throw new NoSuchElementException("next (exception)") ;
else
return currentKeys.remove( 0 ) ;
}
}