Uses of Class
sdds.DHashTable

Packages that use DHashTable
sdds A set of unchanging (static) data structures, which return clones every time they are modified, and their equivalent dynamic counterparts. 
 

Uses of DHashTable in sdds
 

Methods in sdds that return DHashTable
 DHashTable<K,V> DHashTable.add(K[] keys, V[] values)
          Add multiple key/value mappings to the dynamic hash table.
 DHashTable<K,V> DHashTable.add(K key, V value)
          Add a key/value mapping to the dynamic hash table.
 DHashTable<K,V> DHashTable.addEquals(K[] keys, V[] values)
          Add multiple key/value mappings to the dynamic hash table.
 DHashTable<K,V> DHashTable.addEquals(K key, V value)
          Add a key/value mapping to the dynamic hash table.
 DHashTable<K,V> DHashTable.clone()
          Return a deep copy of the dynamic hash table.
 DHashTable<K,V> DHashTable.remove(K key)
          Remove a key/value mapping from the dynamic hash table.
 DHashTable<K,V> DHashTable.remove(K[] keys)
          Remove multiple key/value mappings from the dynamic hash table.
 DHashTable<K,V> DHashTable.removeEquals(K key)
          Remove a key/value mapping from the dynamic hash table.
 DHashTable<K,V> DHashTable.removeEquals(K[] keys)
          Remove multiple key/value mappings from the dynamic hash table.