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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
|
/**
* 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 Jun 19, 2006 */
package clojure.lang;
import java.lang.reflect.Array;
public class ArraySeq extends ASeq implements IndexedSeq, IReduce{
final Object array;
final int i;
final Object[] oa;
//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);
}
static ISeq createFromObject(Object array){
if(array == null || Array.getLength(array) == 0)
return null;
Class aclass = array.getClass();
if(aclass == int[].class)
return new ArraySeq_int(null, (int[]) array, 0);
if(aclass == float[].class)
return new ArraySeq_float(null, (float[]) array, 0);
if(aclass == double[].class)
return new ArraySeq_double(null, (double[]) array, 0);
if(aclass == long[].class)
return new ArraySeq_long(null, (long[]) array, 0);
return new ArraySeq(array, 0);
}
ArraySeq(Object array, int i){
this.array = array;
this.i = i;
this.oa = (Object[]) (array instanceof Object[] ? array : null);
// this._rest = this;
}
ArraySeq(IPersistentMap meta, Object array, int i){
super(meta);
this.array = array;
this.i = i;
this.oa = (Object[]) (array instanceof Object[] ? array : null);
}
public Object first(){
if(oa != null)
return oa[i];
return Reflector.prepRet(Array.get(array, i));
}
public ISeq next(){
if(oa != null)
{
if(i + 1 < oa.length)
return new ArraySeq(array, i + 1);
}
else
{
if(i + 1 < Array.getLength(array))
return new ArraySeq(array, i + 1);
}
return null;
}
public int count(){
if(oa != null)
return oa.length - i;
return Array.getLength(array) - i;
}
public int index(){
return i;
}
public ArraySeq withMeta(IPersistentMap meta){
return new ArraySeq(meta, array, i);
}
public Object reduce(IFn f) throws Exception{
if(oa != null)
{
Object ret = oa[i];
for(int x = i + 1; x < oa.length; x++)
ret = f.invoke(ret, oa[x]);
return ret;
}
Object ret = Reflector.prepRet(Array.get(array, i));
for(int x = i + 1; x < Array.getLength(array); x++)
ret = f.invoke(ret, Reflector.prepRet(Array.get(array, x)));
return ret;
}
public Object reduce(IFn f, Object start) throws Exception{
if(oa != null)
{
Object ret = f.invoke(start, oa[i]);
for(int x = i + 1; x < oa.length; x++)
ret = f.invoke(ret, oa[x]);
return ret;
}
Object ret = f.invoke(start, Reflector.prepRet(Array.get(array, i)));
for(int x = i + 1; x < Array.getLength(array); x++)
ret = f.invoke(ret, Reflector.prepRet(Array.get(array, x)));
return ret;
}
//////////////////////////////////// specialized primitive versions ///////////////////////////////
static public class ArraySeq_int extends ASeq implements IndexedSeq, IReduce{
final int[] array;
final int i;
ArraySeq_int(IPersistentMap meta, int[] array, int i){
super(meta);
this.array = array;
this.i = i;
}
public Object first(){
return array[i];
}
public ISeq next(){
if(i + 1 < array.length)
return new ArraySeq_int(meta(), array, i + 1);
return null;
}
public int count(){
return array.length - i;
}
public int index(){
return i;
}
public ArraySeq_int withMeta(IPersistentMap meta){
return new ArraySeq_int(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, array[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, array[x]);
return ret;
}
}
static public class ArraySeq_float extends ASeq implements IndexedSeq, IReduce{
final float[] array;
final int i;
ArraySeq_float(IPersistentMap meta, float[] array, int i){
super(meta);
this.array = array;
this.i = i;
}
public Object first(){
return array[i];
}
public ISeq next(){
if(i + 1 < array.length)
return new ArraySeq_float(meta(), array, i + 1);
return null;
}
public int count(){
return array.length - i;
}
public int index(){
return i;
}
public ArraySeq_float withMeta(IPersistentMap meta){
return new ArraySeq_float(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, array[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, array[x]);
return ret;
|
