initial
[prop.git] / include / AD / contain / rbmap.h
blob9d162f31a78584a3220c914043741318a88826eb
1 //////////////////////////////////////////////////////////////////////////////
2 // NOTICE:
3 //
4 // ADLib, Prop and their related set of tools and documentation are in the
5 // public domain. The author(s) of this software reserve no copyrights on
6 // the source code and any code generated using the tools. You are encouraged
7 // to use ADLib and Prop to develop software, in both academic and commercial
8 // settings, and are free to incorporate any part of ADLib and Prop into
9 // your programs.
11 // Although you are under no obligation to do so, we strongly recommend that
12 // you give away all software developed using our tools.
14 // We also ask that credit be given to us when ADLib and/or Prop are used in
15 // your programs, and that this notice be preserved intact in all the source
16 // code.
18 // This software is still under development and we welcome any suggestions
19 // and help from the users.
21 // Allen Leung
22 // 1994
23 //////////////////////////////////////////////////////////////////////////////
25 #ifndef red_black_tree_based_map_h
26 #define red_black_tree_based_map_h
28 ///////////////////////////////////////////////////////////////////////////
29 // Class RBMap<K,V> is an associative table from type K to type V
30 // implemented using a red-black tree.
31 ///////////////////////////////////////////////////////////////////////////
33 #include <AD/contain/treemap.h>
34 #include <AD/trees/redblack.h>
36 template <class K, class V>
37 class RBMap : public TreeMap< K, V, RBTree<K,V> > {
38 public:
39 RBMap() {}
40 RBMap(const Map<K,V>& m) : TreeMap<K,V,RBTree<K,V> >(m) {}
41 RBMap(const RBMap<K,V>& m) : TreeMap<K,V,RBTree<K,V> >(m) {}
42 ~RBMap() {}
44 typedef TreeMap<K,V,RBTree<K,V> > Super;
45 typedef Super::Key Key;
46 typedef Super::Value Value;
47 typedef Super::Element Element;
50 #endif