FilesExpand file tree

 master

/

RJavaArrayIterator.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

86 lines (72 loc) · 1.64 KB

 master

/

RJavaArrayIterator.java

Copy path

Top

File metadata and controls

• Code
• Blame

86 lines (72 loc) · 1.64 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

import java.lang.reflect.Array ;

public abstract class RJavaArrayIterator {

protected int[] dimensions;

protected int nd ;

protected int[] index ;

protected int[] dimprod ;

protected Object array ;

protected int increment;

protected int position ;

protected int start ;

public Object getArray(){

return array ;

}

/**

* @return the class name of the array

*/

public String getArrayClassName(){

return array.getClass().getName();

}

public int[] getDimensions(){

return dimensions;

}

public RJavaArrayIterator(){

dimensions = null;

index = null ;

dimprod = null ;

array = null ;

}

public RJavaArrayIterator(int[] dimensions){

this.dimensions = dimensions ;

nd = dimensions.length ;

if( nd > 1){

index = new int[ nd-1 ] ;

dimprod = new int[ nd-1 ] ;

for( int i=0; i<(nd-1); i++){

index[i] = 0 ;

dimprod[i] = (i==0) ? dimensions[i] : ( dimensions[i]*dimprod[i-1] );

increment = dimprod[i] ;

}

}

position = 0 ;

start = 0;

}

public RJavaArrayIterator(int d1){

this( new int[]{ d1} ) ;

}

protected Object next( ){

/* get the next array and the position of the first elemtn in the flat array */

Object o = array ;

for( int i=0; i<index.length; i++){

o = Array.get( o, index[i] ) ;

if( i == 0 ) {

start = index[i];

} else {

start += index[i] * dimprod[i-1] ;

}

}

/* increment the index */

for( int i=index.length-1; i>=0; i--){

if( (index[i] + 1) == dimensions[i] ){

index[i] = 0 ;

} else{

index[i] = index[i] + 1 ;

}

}

position++ ;

return o;

}

protected boolean hasNext( ){

return position < increment ;

}

}