Package com.zybooks.dsaj.map
package com.zybooks.dsaj.map
Code from the chapter "Maps, Hash Tables, and Skip Lists"
-
ClassDescriptionAbstractHashMap<K,
V> An abstract base class supporting Map implementations that use hash tables with MAD compression.AbstractMap<K,V> An abstract base class to ease the implementation of the Map interface.AbstractMap.MapEntry<K,V> A concrete implementation of the Entry interface to be used within a Map implementation.AbstractSortedMap<K,V> An abstract base class to ease the implementation of the SortedMap interface.ChainHashMap<K,V> Map implementation using hash table with separate chaining.Maintains a database of maximal (cost,performance) pairs.HashMultimap<K,V> An adaptation of a map into a multimap, by mapping to a list of values.Map<K,V> An interface for an associative map which binds a key uniquely to a value.ProbeHashMap<K,V> Map implementation using hash table with linear probing.SortedMap<K,V> A map with additional support for keys from a total ordering.SortedTableMap<K,V> An implementation of a map using a sorted table.UnsortedTableMap<K,V> An implementation of a map using an unsorted table.A program that counts words in a document, printing the most frequent.