blob: 3f1ebadcd6f1c67cc7e69c77855488cc80c54099 (
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
104
|
package de.lmu.ifi.dbs.elki.utilities.iterator;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2011
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
/**
* Reverse iterator for lists.
*
* @author Erich Schubert
*
* @param <E> Element type
*/
public class ReverseListIterator<E> implements Iterator<E>, ListIterator<E> {
/**
* The actual iterator
*/
final ListIterator<E> iter;
/**
* Constructor.
*
* @param iter List iterator
*/
public ReverseListIterator(ListIterator<E> iter) {
this.iter = iter;
}
/**
* Constructor.
*
* @param list Existing list
*/
public ReverseListIterator(List<E> list) {
this.iter = list.listIterator(list.size());
}
@Override
public boolean hasNext() {
return iter.hasPrevious();
}
@Override
public E next() {
return iter.previous();
}
@Override
public void remove() {
iter.remove();
}
@Override
public boolean hasPrevious() {
return iter.hasNext();
}
@Override
public E previous() {
return iter.next();
}
@Override
public int nextIndex() {
return iter.previousIndex();
}
@Override
public int previousIndex() {
return iter.nextIndex();
}
@Override
public void set(E e) {
iter.set(e);
}
@Override
public void add(E e) {
iter.add(e);
}
}
|
