The container. Don't call any index methods from this container directly; use a reference to an individual index, which can be obtained via
Enumeration determining what color the node is. Null nodes are assumed to be black.
ordered index implementation
ordered node implementation
simple Slot implementation
TODO: random access index insertAfter ? insertBefore ? fix BitHackery make MutableView a per index thing? modify(r, mod, rollback) contain const/immutable value types other indices? dup make reserve perform reserve on all appropriate indices? ensure MultiIndexContainer is strongly exception safe.
A multi_index node. Holds the value of a single element, plus per-node headers of each index, if any. The headers are all mixed in in the same scope. To prevent naming conflicts, a header field must be accessed with the number of its index.
Specifies how to hook up value signals to indices.
_
_
a hash table index KeyFromValue(value) = key of type KeyType Hash(key) = hash of type size_t Eq(key1, key2) determines equality of key1, key2
_
_
a max heap index
A red black tree index
A red black tree index
A red black tree index
A random access index.
A doubly linked list index.