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
|
/**
* 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 */
package clojure.lang;
public class ArraySeq extends ASeq implements IndexedSeq{
final Object[] array;
final int i;
//ISeq _rest;
static public ArraySeq create(){
return null;
}
static public ArraySeq create(Object... array){
if(array == null || array.length == 0)
return null;
return new ArraySeq(array, 0);
}
ArraySeq(Object[] array, int i){
this.array = array;
this.i = i;
// this._rest = this;
}
ArraySeq(IPersistentMap meta, Object[] array, int i){
super(meta);
this.array = array;
this.i = i;
}
public Object first(){
return array[i];
}
public ISeq rest(){
if(i + 1 < array.length)
return new ArraySeq(array, i + 1);
return null;
// if(_rest == this)
// {
// if(i+1 < array.length)
// _rest = new ArraySeq(array, i + 1);
// _rest = null;
// }
// return _rest;
}
public int count(){
return array.length - i;
}
public int index(){
return i;
}
public ArraySeq withMeta(IPersistentMap meta){
return new ArraySeq(meta, array, i);
}
public Object reduce(IFn f) throws Exception{
Object ret = array[i];
for(int x = i+1;x < array.length;x++)
ret = f.invoke(ret, x);
return ret;
}
public Object reduce(IFn f, Object start) throws Exception{
Object ret = f.invoke(start,array[i]);
for(int x = i+1;x < array.length;x++)
ret = f.invoke(ret, x);
return ret;
}
}
|
