summaryrefslogtreecommitdiff
path: root/src/main/java/bjc/esodata/FlatNestIterator.java
blob: 42981f5e7aae54d1a8eec8c85bdc3db2cb8d25a9 (plain)
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
package bjc.esodata;

import java.util.*;

import bjc.data.*;

final class FlatNestIterator<Element> implements ListIterator<Element>
{
	private Deque<ListIterator<Either<Element, NestList<Element>>>> iterators;
	
	public FlatNestIterator(ListIterator<Either<Element, NestList<Element>>> iterator)
	{
		this.iterators = new ArrayDeque<>();
		this.iterators.add(iterator);
	}

	@Override
	public boolean hasNext() {
		boolean result = false;
		do {
			result = iterators.peek().hasNext();
			
			if (result == false) iterators.pop();
		} while (result == false && iterators.isEmpty() == false);
		
		return result;
	}

	@Override
	public Element next() {
		Holder<Element> element = Holder.of(null);
		do {
			element = iterators.peek().next().extract((ele) -> {
				return Holder.of(ele);
			}, (lst) -> {
				// Ignore empty sublists.
				if (lst.size() != 0) iterators.push(lst.listIterator());
				
				return null;
			});
		} while (element == null && hasNext());

		if (element == null) throw new NoSuchElementException();
		
		return element.getValue();
	}

	@Override
	public boolean hasPrevious() {
		boolean result = false;
		do {
			result = iterators.peek().hasPrevious();
			
			if (result == false) iterators.pop();
		} while (result == false && iterators.isEmpty() == false);
		
		return result;
	}

	@Override
	public Element previous() {
		Holder<Element> element = Holder.of(null);
		do {
			element = iterators.peek().previous().extract((ele) -> {
				return Holder.of(ele);
			}, (lst) -> {
				// Ignore empty sublists.
				if (lst.size() != 0) iterators.push(lst.listIterator());
				
				return null;
			});
		} while (element == null && hasPrevious());

		if (element == null) throw new NoSuchElementException();
		
		return element.getValue();
	}

	@Override
	public int nextIndex() {
		return iterators.peek().nextIndex();
	}

	@Override
	public int previousIndex() {
		return iterators.peek().previousIndex();
	}

	@Override
	public void remove() {
		iterators.peek().remove();
	}

	@Override
	public void set(Element e) {
		iterators.peek().set(Either.left(e));
	}

	@Override
	public void add(Element e) {
		iterators.peek().add(Either.left(e));
	}
}