Reference

Structured Container concept Header < structured_set.hpp > Header < structured_map.hpp > Header < ternary_tree.hpp > Header < iterator_wrapper.hpp >

---

Header < structured_set.hpp > synopsis

namespace containers {
  template <class Key,
            class Comp = std::less<typename Key::value_type>,
            class Alloc = std::allocator<Key> >
  class structured_set;

  template <class Key,
            class Comp = std::less<typename Key::value_type>,
            class Alloc = std::allocator<Key> >
  class structured_multiset;
}

Header < structured_map.hpp > synopsis

namespace containers {
  template <class Key,
            class T,
            class Comp = std::less<typename Key::value_type>,
            class Alloc = std::allocator<std::pair<const Key, T> > >
  class structured_map;

  template <class Key,
            class T,
            class Comp = std::less<typename Key::value_type>,
            class Alloc = std::allocator<std::pair<const Key, T> > >
  class structured_multimap;
} 

---

Supplementary header files needed to support structured_set and -map classes.

Header < ternary_tree.hpp > synopsis

namespace containers {

  template <class Key,
            class T,
            class Comp = std::less<typename Key::value_type>,
            class Alloc = std::allocator<std::pair<const Key, T> > >
  class ternary_tree;

  template <class TreeT, class IteratorT> 
      class search_results_list;

} 

Header < iterator_wrapper.hpp > synopsis

namespace iterators {

  template <class T> struct const_traits;
  template <class T> struct nonconst_traits;

  template <class BaseIterT,
            class TraitsT,     // either const_traits<T> or nonconst_traits<T>
            class IterCatT = std::bidirectional_iterator_tag >
  class iterator_wrapper;
}