Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

position in the bottom level of the skip list. Thus, the hasNext and next
methods of these iterators would each run in constant time using this approach.
The java.util.Sorted Map Interface
Java provides an ordered version of the java.util.Map interface in its
interface called java.util.SortedMap. This interface extends the
java.util.Map interface with methods that take order into account. Like the
parent interface, a SortedMap does not allow for duplicate keys.
Ignoring the fact that dictionaries allow for multiple entries with the same key,
possible correspondences between methods of our ordered dictionary ADT and
methods of interface java.util.SortedMap are shown in Table 9.6.
Table 9.6: Loose correspondences between
methods of the ordered dictionary ADT and methods
of the java.util.SortedMap interface, which
supports other methods as well. The
java.util.SortedMap expression for
predecessors(k) is not an exact correspondence,
however, as the iterator returned would be by
increasing keys and would not include the entry with
key equal to k. There appears to be no efficient way of
getting a true correspondence to predecessors(k)
using java.util.SortedMap methods.
Ordered Dictionary Methods
java.util.SortedMap Methods
first().getKey()
firstKey()
first().getValue()
get(firstKey())
last().getKey()
570