Generic pseudo-templated containers for C. Written entirely in C89 with design inspired by the C++ STL. /// DOCS ARE SLIGHTLY OUTDATED, PROJECT IS STABLE AND STILL BEING DEVELOPED
Separate binary tree structure from AVL tree implementation, leaving support for tree-specific data ("balance factor" for AVL, "color" for red-black, etc).
Add other tree implementations: red-black, AA (made simple™), WAVL, etc.
Allow to select necessary tree algorithm in instantiation macros by specifying either macro definition argument (e.g. GENA_2TREE_BACKEND_AVL, what is preferable and desirable) or constant interface structure with methods (like in interators now, but I would like to leave that approach there and won't apply it more anywhere).
Such functionality will be also needed for hash-based data structures in the future.
All of this is somewhat related to #18 because of multimap / multiset capabilities we need.
Also:
Think about non-binary trees and their usability in such context (e.g. for multimaps / multisets).
Think about the possibility of tree implementations with flattened array, which seems to be quite effective for balanced trees.
Think about storing nodes in a realloc-based or chunk-based buffer.
GENA_2TREE_BACKEND_AVL, what is preferable and desirable) or constant interface structure with methods (like in interators now, but I would like to leave that approach there and won't apply it more anywhere).Such functionality will be also needed for hash-based data structures in the future.
All of this is somewhat related to #18 because of multimap / multiset capabilities we need.
Also:
https://en.wikipedia.org/wiki/Template:CS_trees https://en.wikipedia.org/wiki/Template:Data_structures
https://lj.rossia.org/users/ketmar/1599420.html http://lj.rossia.org/users/ketmar/1605246.html