blob: fa6dfda18e7cfdf42c4b07fcade088442677e8bf (
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
|
/**
* 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 19, 2006 */
using System;
namespace clojure.lang
{
public class Tuple : AnArray{
readonly Object[] array;
readonly public static Tuple EMPTY = new Tuple();
/**
* This ctor captures/aliases the passed array, so do not modify later !
* @param init {key1,val1,key2,val2,...}
*/
public Tuple(params Object[] init){
this.array = init;
}
override public int count() {
return array.Length;
}
override public int length() {
return array.Length;
}
override public Object nth(int i){
return array[i];
}
override public IArray assocN(int i, Object val) {
Object[] newArray = (Object[])array.Clone();
newArray[i] = val;
return new Tuple(newArray);
}
override public bool Equals(Object key){
if(this == key) return true;
if(key == null || !(key is IArray)) return false;
IArray a = (IArray) key;
if(a.length() != array.Length)
return false;
for(int i = 0; i < array.Length; i++)
{
if(!equalKey(array[i],a.nth(i)))
return false;
}
return true;
}
override public int GetHashCode(){
int ret = 0;
for(int i = 0; i < array.Length; i++)
{
Object o = array[i];
if(o != null)
ret ^= o.GetHashCode();
}
return ret;
}
private bool equalKey(Object k1,Object k2){
if(k1 == null)
return k2 == null;
return k1.Equals(k2);
}
override public ISeq seq() {
return ArraySeq.create(array);
}
}
}
|
