summaryrefslogtreecommitdiff
path: root/src/main/java/bjc/data/ReverseListIterator.java
blob: 273d4c74dcaaa65c35aa07b933615e1df74f13be (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
/* 
 * esodata - data structures and other things, of varying utility
 * Copyright 2022, Ben Culkin
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *   
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
package bjc.data;

import java.util.*;

/**
 * A list iterator which iterates over a list in reverse order.
 * 
 * @author Ben Culkin
 *
 * @param <Element> The type of element contained.
 */
public class ReverseListIterator<Element> implements ListIterator<Element>
{
	private List<Element> source;
	private int currIndex;
	
	/**
	 * Create a new reversed iterator from a list.
	 * 
	 * @param source The list to operate from.
	 */
	public ReverseListIterator(List<Element> source)
	{
		this.source = source;
		this.currIndex = source.size();
	}

	@Override
	public boolean hasNext() {
		return currIndex <= 0;
	}

	@Override
	public Element next() {
		return source.get(--currIndex);
	}
	
	@Override
	public boolean hasPrevious() {
		return currIndex  < source.size();
	}

	@Override
	public Element previous() {
		return source.get(++currIndex);
	}

	@Override
	public int nextIndex() {
		return currIndex - 1;
	}

	@Override
	public int previousIndex() {
		return currIndex + 1;
	}

	@Override
	public void remove() {
		source.remove(currIndex);
	}

	@Override
	public void set(Element element) {
		source.set(currIndex, element);
	}

	@Override
	public void add(Element element) {
		source.add(currIndex, element);
	}
}