-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathIxIntersect.java
More file actions
74 lines (60 loc) · 1.96 KB
/
Copy pathIxIntersect.java
File metadata and controls
74 lines (60 loc) · 1.96 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
/*
* 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 IxIntersect<T> extends IxSource<T, T> {
final Iterable<? extends T> other;
IxIntersect(Iterable<T> source, Iterable<? extends T> other) {
super(source);
this.other = other;
}
@Override
public Iterator<T> iterator() {
return new IntersectIterator<T>(source.iterator(), other.iterator());
}
static final class IntersectIterator<T> extends IxSourceIterator<T, T> {
final Iterator<? extends T> other;
final Set<T> set;
boolean once;
IntersectIterator(Iterator<T> it, Iterator<? extends T> other) {
super(it);
this.other = other;
this.set = new HashSet<T>();
}
@Override
protected boolean moveNext() {
Set<T> secondSet = set;
if (!once) {
once = true;
Iterator<? extends T> o = other;
while (o.hasNext()) {
secondSet.add(o.next());
}
}
Iterator<T> fIt = it;
while (fIt.hasNext()) {
T v = fIt.next();
if (secondSet.contains(v)) {
value = v;
hasValue = true;
return true;
}
}
done = true;
return false;
}
}
}