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
|
/**
* Copyright (c) Rich Hickey. All rights reserved.
* The use and distribution terms for this software are covered by the
* Common Public License 1.0 (http://opensource.org/licenses/cpl.php)
* which can be found in the file CPL.TXT at the root of this distribution.
* By using this software in any fashion, you are agreeing to be bound by
* the terms of this license.
* You must not remove this notice, or any other, from this software.
**/
/* rich Jun 6, 2006 */
package org.clojure.runtime;
import java.util.Iterator;
public class ListMap implements IMap, IMapEntry
{
static public ListMap EMPTY = new ListMap();
static public ListMap create(Object key, Object val){
return new Tail(key, val);
}
public Object key(){
return null;
}
public Object val(){
return null;
}
ListMap rest(){
return this;
}
public int count(){
return 0;
}
public boolean contains(Object key){
return false;
}
public IMapEntry find(Object key){
return null;
}
public IMap add(Object key){
return put(key, null);
}
public ListMap put(Object key, Object val){
return new Tail(key, val);
}
public ListMap remove(Object key){
return this;
}
public Object get(Object key){
return null;
}
public int capacity(){
return 0;
}
static class Iter implements Iterator{
ListMap e;
Iter(ListMap e)
{
this.e = e;
}
public boolean hasNext(){
return e != EMPTY;
}
public Object next(){
ListMap ret = e;
e = e.rest();
return ret;
}
public void remove(){
throw new UnsupportedOperationException();
}
}
public Iterator iterator(){
return new Iter(this);
}
static class Tail extends ListMap{
final Object _key;
final Object _val;
Tail(Object key,Object val){
this._key = key;
this._val = val;
}
ListMap rest(){
return EMPTY;
}
public int count(){
return 1;
}
public Object get(Object key){
if(equalKey(key,_key))
return _val;
return null;
}
public int capacity(){
return 1;
}
public Object key(){
return _key;
}
public Object val(){
return _val;
}
public boolean contains(Object key){
return equalKey(key,_key);
}
public IMapEntry find(Object key){
if(equalKey(key,_key))
return this;
return null;
}
public ListMap put(Object key, Object val){
if(equalKey(key,_key)) //replace
{
if(val == _val)
return this;
return new Tail(key,val);
}
return new Link(key,val,this);
}
public ListMap remove(Object key){
if(equalKey(key,_key))
return EMPTY;
return this;
}
}
static class Link extends ListMap{
final Object _key;
final Object _val;
final ListMap _rest;
Link(Object key,Object val,ListMap rest){
this._key = key;
this._val = val;
this._rest = rest;
}
public Object key(){
return _key;
}
public Object val(){
return _val;
}
ListMap rest(){
return _rest;
}
public int count(){
return 1 + _rest.count();
}
public boolean contains(Object key){
return find(key) != null;
}
public IMapEntry find(Object key){
if(equalKey(key,_key))
return this;
return _rest.find(key);
}
public ListMap put(Object key, Object val){
if(equalKey(key,_key))
{
if(val == _val)
return this;
return new Link(key,val,_rest);
}
ListMap r = _rest.put(key,val);
if(r == _rest) //already there with same value
return this;
return new Link(_key,_val,r);
}
public ListMap remove(Object key){
if(equalKey(key,_key))
return _rest;
ListMap r = _rest.remove(key);
if(r == _rest) //not there
return this;
if(r == EMPTY)
return new Tail(_key,_val);
return new Link(_key, _val, r);
}
public Object get(Object key){
IMapEntry e = find(key);
if(e != null)
return e.val();
return null;
}
public int capacity(){
return count();
}
}
boolean equalKey(Object k1,Object k2){
if(k1 == null)
return k2 == null;
return k1.equals(k2);
}
}
|
