|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |
toPos
+1, ..., size
-1 to positions
fromPos
, ...,
size
-1 - (toPos
- fromPos
+ 1).
toPos
+1, ..., size
-1 to positions
fromPos
, ...,
size
-1 - (toPos
- fromPos
+ 1).
Collection
interface contains the operations that must
be supported by all data structures that maintain a collection of elements.compare
method does not make sense.
tc
, all tagged elements for which the tag has the given prefix.
CompressedTrieNode
interface must be supported by any
class defining objects to be used as nodes in a compressed trie.min
and the maximum value in max
to avoid
the need to recompute these values.
contains
takes linear time, so it
is overridden by a more efficient method in most data structure
implementations.
element
is in the collection, it is brought
to the root using the splay method.
source
to dest
in this graph.
p
, ..., size
-1 to positions
p+1
, ..., size
.
p
, ..., size
-1 to be at positions
p+1
, ..., size
.
CUTOFF
.
|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |