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
|
/**
* Copyright (c) Rich Hickey. All rights reserved.
* The use and distribution terms for this software are covered by the
* Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
* which can be found in the file epl-v10.html 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 May 24, 2009 */
package clojure.lang;
import java.io.Serializable;
public final class ArrayChunk implements IChunk, Serializable {
final Object[] array;
final int off;
final int end;
public ArrayChunk(Object[] array){
this(array, 0, array.length);
}
public ArrayChunk(Object[] array, int off){
this(array, off, array.length);
}
public ArrayChunk(Object[] array, int off, int end){
this.array = array;
this.off = off;
this.end = end;
}
public Object nth(int i){
return array[off + i];
}
public Object nth(int i, Object notFound){
if(i >= 0 && i < count())
return nth(i);
return notFound;
}
public int count(){
return end - off;
}
public IChunk dropFirst(){
if(off==end)
throw new IllegalStateException("dropFirst of empty chunk");
return new ArrayChunk(array, off + 1, end);
}
public Object reduce(IFn f, Object start) {
Object ret = f.invoke(start, array[off]);
for(int x = off + 1; x < end; x++)
ret = f.invoke(ret, array[x]);
return ret;
}
}
|
