A generic implementation of a dictionary basead on the AVL Tree data structure in c++.
The dict.hpp file can be dropped into an existing project in c++ and used.
An example of usage can be found in example.cpp.
For a user-defined data type (UDT), it is necessary to overload assign, relational and comparison operators.
Return an iterator to the begin of the dictionary.
Return an iterator to the end of the dictionary.
Insert the pair (c, v) with types key(TK) and value(TV) respectively. Return an iterator to the inserted pair;
Return an iterator to the element whose key is equal to c.
Remove the element pointed to the i iterator.
Remove the element whose key is equal to c.
This project is licensed under the GNU General Public License v3.0.