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
|
/**
* 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
{
final Entry entries;
final int _count;
public ListMap(){
this.entries = null;
this._count = 0;
}
public ListMap(Object key, Object val){
this.entries = Entry.create(key, val, null);
this._count = 1;
}
ListMap(int count, Entry entries){
this._count = count;
this.entries = entries;
}
static class Entry implements IMapEntry{
final Object _key;
final Object _val;
Entry(Object key,Object val){
this._key = key;
this._val = val;
}
Entry rest(){
return null;
}
static Entry create(Object key,Object val,Entry rest){
if(rest == null)
return new Entry(key,val);
return new EntryLink(key, val, rest);
}
public Object key(){
return _key;
}
public Object val(){
return _val;
}
}
static class EntryLink extends Entry{
final Entry _rest;
EntryLink(Object key,Object val,Entry rest){
super(key,val);
this._rest = rest;
}
Entry rest(){
return _rest;
}
}
public int count(){
return _count;
}
public boolean contains(Object key){
return find(key) != null;
}
public Entry find(Object key){
for(Entry e = entries;e != null;e = e.rest())
{
if(equalKey(key,e._key))
return e;
}
return null;
}
public IMap add(Object key){
return put(key, null);
}
public IMap put(Object key, Object val){
Entry remEntries = doRemove(entries, key);
int incr = (remEntries == entries) ? 1 : 0;
return new ListMap(_count + incr, Entry.create(key, val, remEntries));
}
Entry doRemove(Entry e, Object key){
if(e == null)
return null;
else if(equalKey(key,e._key))
{
return e.rest();
}
else
{
Entry er = doRemove(e.rest(), key);
if(er != e.rest()) //removed in tail
return Entry.create(e._key, e._val, er);
return e;
}
}
public IMap remove(Object key){
Entry remEntries = doRemove(entries, key);
if(remEntries == entries) //didn't have key
return this;
return new ListMap(_count - 1, remEntries);
}
public Object get(Object key){
Entry e = find(key);
if(e != null)
return e._val;
return null;
}
public int capacity(){
return count();
}
static class Iter implements Iterator{
Entry e;
Iter(Entry e)
{
this.e = e;
}
public boolean hasNext(){
return e != null;
}
public Object next(){
Entry ret = e;
e = e.rest();
return ret;
}
public void remove(){
throw new UnsupportedOperationException();
}
}
public Iterator iterator(){
return new Iter(entries);
}
boolean equalKey(Object k1,Object k2){
if(k1 == null)
return k2 == null;
return k1.equals(k2);
}
}
|
