-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathIxMinMax.java
More file actions
81 lines (61 loc) · 1.97 KB
/
Copy pathIxMinMax.java
File metadata and controls
81 lines (61 loc) · 1.97 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
/*
* Copyright 2011-2016 David Karnok
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package ix;
import java.util.*;
final class IxMinMax<T> extends IxSource<T, T> {
final Comparator<? super T> comparator;
final int flag;
IxMinMax(Iterable<T> source, Comparator<? super T> comparator, int flag) {
super(source);
this.comparator = comparator;
this.flag = flag;
}
@Override
public Iterator<T> iterator() {
return new MinMaxIterator<T>(source.iterator(), comparator, flag);
}
static final class MinMaxIterator<T> extends IxSourceIterator<T, T> {
final Comparator<? super T> comparator;
final int flag;
MinMaxIterator(Iterator<T> it, Comparator<? super T> comparator, int flag) {
super(it);
this.comparator = comparator;
this.flag = flag;
}
@Override
protected boolean moveNext() {
T v;
Iterator<T> it = this.it;
if (!it.hasNext()) {
done = true;
return false;
}
v = it.next();
Comparator<? super T> f = comparator;
int g = flag;
while (it.hasNext()) {
T w = it.next();
if (f.compare(v, w) * g > 0) {
v = w;
}
}
value = v;
hasValue = true;
done = true;
return true;
}
}
}