blob: e96cdad0e7b81799c4d3e3c97835befec0d66ada (
plain)
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
|
/**
* 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.
**/
using System;
using System.Threading;
using System.Collections;
namespace clojure.lang
{
public abstract class APersistentMap : Obj, IPersistentMap{
int _hash = -1;
public override Obj withMeta(IPersistentMap meta)
{
if(_meta == meta)
return this;
Obj ret = (Obj)MemberwiseClone();
ret._meta = meta;
return ret;
}
override public bool Equals(Object obj) {
IPersistentMap m = obj as IPersistentMap;
if(obj == null)
return false;
if(m.count() != count() || m.GetHashCode() != GetHashCode())
return false;
for(ISeq s = seq();s!=null;s = s.rest())
{
IMapEntry e = (IMapEntry) s.first();
IMapEntry me = m.find(e.key());
if(me == null || !RT.equal(e.val(),me.val()))
return false;
}
return true;
}
override public int GetHashCode() {
if(_hash == -1)
{
int hash = count();
for(ISeq s = seq();s!=null;s = s.rest())
{
IMapEntry e = (IMapEntry) s.first();
hash ^= RT.hashCombine(RT.hash(e.key()), RT.hash(e.val()));
}
this._hash = hash;
}
return _hash;
}
#region IPersistentMap Members
abstract public IPersistentMap assocEx(object key, object val);
abstract public IPersistentMap without(object key);
public class KeySeq : ASeq{
ISeq _seq;
static public KeySeq create(ISeq seq){
if(seq == null)
return null;
return new KeySeq(seq);
}
private KeySeq(ISeq seq) {
this._seq = seq;
}
public override Object first() {
return ((IMapEntry)_seq.first()).key();
}
public override ISeq rest() {
return create(_seq.rest());
}
}
public class ValSeq : ASeq{
ISeq _seq;
static public ValSeq create(ISeq seq){
if(seq == null)
return null;
return new ValSeq(seq);
}
private ValSeq(ISeq seq) {
this._seq = seq;
}
public override Object first() {
return ((IMapEntry)_seq.first()).val();
}
public override ISeq rest() {
return create(_seq.rest());
}
}
#endregion
#region Associative Members
abstract public bool contains(object key);
abstract public IMapEntry find(object key);
abstract public object get(object key);
abstract public Associative assoc(object key, object val);
#endregion
#region IEnumerable Members
abstract public IEnumerator GetEnumerator();
#endregion
#region IPersistentCollection Members
abstract public int count();
abstract public ISeq seq();
public IPersistentCollection cons(Object o)
{
IMapEntry e = (IMapEntry)o;
return (IPersistentCollection)assoc(e.key(), e.val());
}
#endregion
}
}
|
