Overview     Usage     Performance Notes     Links tst 0.68 - 23 Jan 2009

Structured Associative Container Concept

(a preliminary sketch of the formal technical concept description)

A Structured Associative Container is a specialization of the C++ 98 standard concept Sorted Associative Container, with extended interface.

The template parameters are similar to that of the Associated Containers:

structured_set<Key, Comp, Alloc>;
structured_map<Key, Value, Comp, Alloc>;

where:

The Comp and the Alloc types have default template arguments.

In other words Structured containers are like Sorted Associative Containers, BUT

Associated types

In consequence it allows searches involving subparts of keys, ie with shared prefix and/or with shared middle parts.


Deprecated search interface

In the first iteration, additional searches are provided as methods on the containers. This will be changed to use free functions operating on subkey_iterator. The deprecated search methods will still be provided as convenience functions; to migrate your code from present version to the new interface, will mean moving the object name to the first argument, but also to respecify the search_results_list type. (This sloppy-hackish type is by itself reason not to keep the method interface)

See Structured search overview and ternary_tree Structure search section.


ternary_tree 0.68 -- by rasmus ekman -- Page generated with Doxygen 1.5.6 on 23 Jan 2009