summaryrefslogtreecommitdiff
path: root/src/cli/runtime/AnArray.cs
blob: 7664063166beaf47337ff3e7e95d76793e25990e (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
/**
 *   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 AnArray : Obj, IArray {

	public override Obj withMeta(IPersistentMap meta)
		{
		if(_meta == meta)
			return this;
		Obj ret = (Obj)MemberwiseClone();
		ret._meta = meta;
		return ret;
		}


	#region IArray Members

	abstract public int length();

	abstract public object nth(int i);

	abstract public IArray 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 IPersistentMap assoc(Object key, Object val) {
		int i = Convert.ToInt32(key);
        return (IPersistentMap) 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;
	}

}

}