Hash Lists

Hash-indexed list containers (TR1/C++11 would probably call it an ordered_map). More...

Classes
class	ash::dense_hashlist< Key, Data, HashFx, EqualKey, Alloc >
	A hashlist with dense_hashtable as a backend. More...
class	ash::sparse_hashlist< Key, Data, HashFx, EqualKey, Alloc >
	A hashlist with sparse_hashtable as a backend. More...

---

Detailed Description

Hash-indexed list containers (TR1/C++11 would probably call it an ordered_map).

A Hash list is a Hash Graph implemented as a linked list which implements the STL concepts Unique Hashed Associative Container , Pair Associative Container , Front Insertion Sequence , and Back Insertion Sequence , with some List functionality as well. Semantics are a combination of STL's list and hash_map/unordered_map, though it is not 100% compatible with either.

VS hash_map/unordered_map:

• Insertion methods require a position argument.
• No operator[] is provided (if the accessed element needed to be inserted, we wouldn't know where to put it in the list).

VS list:

• Insertion methods invalidate existing iterators, and (other than range insertion) return pair<iterator,bool>. The element is only inserted if there is no element in the container with a matching key. The iterator points to either the matched element, or if none was found the inserted element, and the bool tells you whether the insertion was successful.
• No splice(), merge(), or assign() methods are provided, as they cannot be done more efficiently than range insertion.
• No repetition constructor or unique() method are provided, as the Unique Associative Container concept makes them invalid/trivial.
• The resize() method does not take a default element and does not insert any elements.