-
Notifications
You must be signed in to change notification settings - Fork 46
/
Copy pathRectangleSpliterator.java
executable file
·79 lines (64 loc) · 2.63 KB
/
RectangleSpliterator.java
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
package spliterators.part1.exercise;
import java.util.Spliterator;
import java.util.Spliterators;
import java.util.function.Consumer;
import java.util.function.IntConsumer;
public class RectangleSpliterator extends Spliterators.AbstractIntSpliterator {
private final int innerLength;
private final int[][] array;
private int startOuterInclusive;
private final int endOuterExclusive;
private int startInnerInclusive;
public RectangleSpliterator(int[][] array) {
this(array, 0, array.length, 0);
}
private RectangleSpliterator(int[][] array, int startOuterInclusive, int endOuterExclusive, int startInnerInclusive) {
super(Long.MAX_VALUE, Spliterator.IMMUTABLE | Spliterator.ORDERED | Spliterator.SIZED | Spliterator.SUBSIZED | Spliterator.NONNULL);
innerLength = array.length == 0 ? 0 : array[0].length;
this.array = array;
this.startOuterInclusive = startOuterInclusive;
this.endOuterExclusive = endOuterExclusive;
this.startInnerInclusive = startInnerInclusive;
}
@Override
public OfInt trySplit() {
int lengh = endOuterExclusive - startOuterInclusive;
if(lengh <=1){
return null;
}
int middle = startOuterInclusive + lengh/2;
final RectangleSpliterator rectangleSpliterator = new
RectangleSpliterator(array, startOuterInclusive, middle, startInnerInclusive);
startOuterInclusive = middle;
startInnerInclusive = 0;
return rectangleSpliterator;
}
@Override
public long estimateSize() {
return ((long) endOuterExclusive - startOuterInclusive)*innerLength - startInnerInclusive;
}
@Override
public boolean tryAdvance(IntConsumer action) {
if(startInnerInclusive < array[0].length){
action.accept(array[startOuterInclusive][startInnerInclusive]);
startInnerInclusive++;
if(startInnerInclusive == array[0].length && startOuterInclusive < endOuterExclusive){
startInnerInclusive = 0;
startOuterInclusive++;
}
return true;
}
return false;
}
@Override
public void forEachRemaining(Consumer<? super Integer> action) {
while (startOuterInclusive < endOuterExclusive){
while (startInnerInclusive < array[0].length){
action.accept(array[startOuterInclusive][startInnerInclusive]);
startInnerInclusive++;
}
startOuterInclusive++;
startInnerInclusive = 0;
}
}
}