The HashTable data structure implements a distributed set. An entry in the HashTable consists of a key and data of fixed sizes. The HashTable supports the dictionary operations insert, lookup and delete, as well as providing an iterator to range over the local portion of a HashTable.
DistObj, Snapshot.