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
|
/*
* Copyright (C) 2002-2014 Sebastiano Vigna
*
* 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 PACKAGE;
import it.unimi.dsi.fastutil.BidirectionalIterator;
#if #keys(primitive)
import it.unimi.dsi.fastutil.objects.ObjectBidirectionalIterator;
#endif
/** A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
* and the possibility to skip elements backwards.
*
* @see BidirectionalIterator
*/
#if #keys(primitive)
public interface KEY_BIDI_ITERATOR KEY_GENERIC extends KEY_ITERATOR KEY_GENERIC, ObjectBidirectionalIterator<KEY_GENERIC_CLASS> {
#else
public interface KEY_BIDI_ITERATOR KEY_GENERIC extends KEY_ITERATOR KEY_GENERIC, BidirectionalIterator<KEY_GENERIC_CLASS> {
#endif
#if #keys(primitive)
/**
* Returns the previous element as a primitive type.
*
* @return the previous element in the iteration.
* @see java.util.ListIterator#previous()
*/
KEY_TYPE PREV_KEY();
#endif
/** Moves back for the given number of elements.
*
* <P>The effect of this call is exactly the same as that of
* calling {@link #previous()} for <code>n</code> times (possibly stopping
* if {@link #hasPrevious()} becomes false).
*
* @param n the number of elements to skip back.
* @return the number of elements actually skipped.
* @see java.util.Iterator#next()
*/
int back( int n );
}
|
