Skip to content
Navigation Menu
{{ message }}
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayWrapper.java
More file actions
376 lines (332 loc) · 9.37 KB
/
Copy pathArrayWrapper.java
File metadata and controls
376 lines (332 loc) · 9.37 KB
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
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
// :tabSize=2:indentSize=2:noTabs=false:folding=explicit:collapseFolds=1:
import java.lang.reflect.Array ;
/**
* Utility class to deal with arrays
*/
public class ArrayWrapper extends RJavaArrayIterator {
/**
* is this array rectangular
*/
private boolean isRect ;
/**
* The type name of the objects stored
*/
private String typeName ;
/**
* true if the array stores primitive types
*/
private boolean primitive ;
private int length ;
/**
* Constructor
*
* @param array the array to check
* @throws NotAnArrayException if array is not an array
*/
public ArrayWrapper(Object array) throws NotAnArrayException {
super( RJavaArrayTools.getDimensions(array) );
this.array = array ;
typeName = RJavaArrayTools.getObjectTypeName(array );
primitive = RJavaArrayTools.isPrimitiveTypeName( typeName ) ;
if( dimensions.length == 1){
isRect = true ;
} else{
isRect = isRectangular_( array, 0 );
}
// reset the dimensions if the array is not rectangular
if( !isRect ){
dimensions = null ;
length = -1;
} else{
length = 1;
for( int i=0; i<dimensions.length; i++) {
length *= dimensions[i] ;
}
}
}
// making java < 1.5 happy
public ArrayWrapper(int x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
public ArrayWrapper(boolean x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
public ArrayWrapper(byte x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
public ArrayWrapper(long x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
public ArrayWrapper(short x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
public ArrayWrapper(double x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
public ArrayWrapper(char x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
public ArrayWrapper(float x) throws NotAnArrayException { throw new NotAnArrayException("primitive type") ; }
/**
* @return true if the array is rectangular
*/
public boolean isRectangular( ){
return isRect ;
}
/**
* Recursively check all dimensions to see if an array is rectangular
*/
private boolean isRectangular_(Object o, int depth){
if( depth == dimensions.length ) return true ;
int n = Array.getLength(o) ;
if( n != dimensions[depth] ) return false ;
for( int i=0; i<n; i++){
if( !isRectangular_(Array.get(o, i), depth+1) ){
return false;
}
}
return true ;
}
/**
* @return the type name of the objects stored in the wrapped array
*/
public String getObjectTypeName(){
return typeName;
}
/**
* @return true if the array contains java primitive types
*/
public boolean isPrimitive(){
return primitive ;
}
// {{{ flat_* methods
// {{{ flat_int
/**
* Flattens the array into a single dimensionned int array
*/
public int[] flat_int() throws PrimitiveArrayException,FlatException {
if( ! "I".equals(typeName) ) throw new PrimitiveArrayException("int");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (int[])array ;
} else{
int[] payload = new int[length] ;
int k;
while( hasNext() ){
int[] current = (int[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_boolean
/**
* Flattens the array into a single dimensionned boolean array
*
*/
public boolean[] flat_boolean() throws PrimitiveArrayException,FlatException {
if( ! "Z".equals(typeName) ) throw new PrimitiveArrayException("boolean");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (boolean[])array ;
} else{
boolean[] payload = new boolean[length] ;
int k;
while( hasNext() ){
boolean[] current = (boolean[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_byte
/**
* Flattens the array into a single dimensionned byte array
*
*/
public byte[] flat_byte() throws PrimitiveArrayException,FlatException {
if( ! "B".equals(typeName) ) throw new PrimitiveArrayException("byte");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (byte[])array ;
} else{
byte[] payload = new byte[length] ;
int k;
while( hasNext() ){
byte[] current = (byte[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_long
/**
* Flattens the array into a single dimensionned long array
*
*/
public long[] flat_long() throws PrimitiveArrayException,FlatException {
if( ! "J".equals(typeName) ) throw new PrimitiveArrayException("long");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (long[])array ;
} else{
long[] payload = new long[length] ;
int k;
while( hasNext() ){
long[] current = (long[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_short
/**
* Flattens the array into a single dimensionned short array
*
*/
public short[] flat_short() throws PrimitiveArrayException,FlatException {
if( ! "S".equals(typeName) ) throw new PrimitiveArrayException("short");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (short[])array ;
} else{
short[] payload = new short[length] ;
int k;
while( hasNext() ){
short[] current = (short[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_double
/**
* Flattens the array into a single dimensionned double array
*
*/
public double[] flat_double() throws PrimitiveArrayException,FlatException {
if( ! "D".equals(typeName) ) throw new PrimitiveArrayException("double");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (double[])array ;
} else{
double[] payload= new double[length] ;
int k;
while( hasNext() ){
double[] current = (double[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_char
/**
* Flattens the array into a single dimensionned double array
*
*/
public char[] flat_char() throws PrimitiveArrayException,FlatException {
if( ! "C".equals(typeName) ) throw new PrimitiveArrayException("char");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (char[])array ;
} else{
char[] payload = new char[length] ;
int k;
while( hasNext() ){
char[] current = (char[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_float
/**
* Flattens the array into a single dimensionned float array
*
*/
public float[] flat_float() throws PrimitiveArrayException,FlatException {
if( ! "F".equals(typeName) ) throw new PrimitiveArrayException("float");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (float[])array ;
} else{
float[] payload = new float[length] ;
int k;
while( hasNext() ){
float[] current = (float[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// {{{ flat_Object
public Object[] flat_Object() throws FlatException, ObjectArrayException {
if( isPrimitive() ) throw new ObjectArrayException( typeName) ;
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (Object[])array ;
} else{
ClassLoader loader = array.getClass().getClassLoader() ;
Class type = Object.class;
try{
type = Class.forName( typeName, true, array.getClass().getClassLoader() );
} catch( ClassNotFoundException e){}
Object[] payload = (Object[])Array.newInstance( type, length ) ;
int k;
while( hasNext() ){
Object[] current = (Object[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = type.cast( current[j] );
}
}
return payload ;
}
}
// }}}
// {{{ flat_String
/**
* Flattens the array into a single dimensionned String array
*
*/
// this is technically not required as this can be handled
// by flat_Object but this is slightly more efficient so ...
public String[] flat_String() throws PrimitiveArrayException,FlatException {
if( ! "java.lang.String".equals(typeName) ) throw new PrimitiveArrayException("java.lang.String");
if( !isRect ) throw new FlatException();
if( dimensions.length == 1 ){
return (String[])array ;
} else{
String[] payload = new String[length] ;
int k;
while( hasNext() ){
String[] current = (String[])next() ;
k = start ;
for( int j=0; j<current.length; j++, k+=increment){
payload[k] = current[j] ;
}
}
return payload ;
}
}
// }}}
// }}}
}
You can’t perform that action at this time.