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
|
/**
* 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.Collections;
namespace clojure.lang
{
public abstract class APersistentArray : Obj, IPersistentArray {
int _hash = -1;
public virtual IPersistentCollection cons(Object o) {
PersistentArrayList ret = new PersistentArrayList(this, this.count() + 10);
ret = (PersistentArrayList)ret.cons(o);
ret._meta = _meta;
return ret;
}
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) {
if(obj is IPersistentArray)
{
IPersistentArray ma = (IPersistentArray) obj;
if(ma.count() != count())
return false;
for(int i=0;i<count();i++)
{
if(!RT.equal(nth(i),ma.nth(i)))
return false;
}
}
else
{
if(!(obj is Sequential))
return false;
for(ISeq s = seq(), ms = ((IPersistentCollection)obj).seq();s!=null;s = s.rest(), ms = ms.rest())
{
if(ms == null || !RT.equal(s.first(),ms.first()))
return false;
}
}
return true;
}
override public int GetHashCode() {
if(_hash == -1)
{
int hash = 0;
for(int i=0;i<count();i++)
{
hash = RT.hashCombine(hash, RT.hash(nth(i)));
}
this._hash = hash;
}
return _hash;
}
#region IArray Members
abstract public int length();
abstract public object nth(int i);
abstract public IPersistentArray assocN(int i, object val);
#endregion
#region IPersistentCollection Members
abstract public int count();
abstract public ISeq seq();
#endregion
public bool contains(Object key) {
try{
int i = Convert.ToInt32(key);
return i >= 0 && i < count();
}
catch(Exception)
{
return false;
}
}
public IMapEntry find(Object key) {
try
{
int i = Convert.ToInt32(key);
if(i >= 0 && i < count())
return new MapEntry(key,nth(i));
}
catch(Exception)
{
}
return null;
}
public Associative assoc(Object key, Object val) {
int i = Convert.ToInt32(key);
return (Associative)assocN(i, val);
}
public Object get(Object key) {
try
{
int i = Convert.ToInt32(key);
if(i >= 0 && i < count())
return nth(i);
}
catch (Exception)
{
}
return null;
}
}
}
|
