#include <avltree.h>
Public Member Functions | |
| avltree_t () | |
| ~avltree_t () | |
| const t_self & | operator= (const t_self &p_other) |
| avltree_t (const t_self &p_other) | |
| template<typename t_other> | |
| const t_self & | operator= (const t_other &p_other) |
| template<typename t_other> | |
| avltree_t (const t_other &p_other) | |
| template<bool inclusive, bool above, typename t_search> | |
| const t_storage * | find_nearest_item (const t_search &p_search) const |
| template<bool inclusive, bool above, typename t_search> | |
| t_storage * | find_nearest_item (const t_search &p_search) |
| template<typename t_item> | |
| t_storage & | add_item (t_item const &p_item) |
| template<typename t_item> | |
| t_storage & | add_item_ex (t_item const &p_item, bool &p_isnew) |
| template<typename t_item> | |
| void | set_item (const t_item &p_item) |
| template<typename t_item> | |
| const t_storage * | find_item_ptr (t_item const &p_item) const |
| template<typename t_item> | |
| t_storage * | find_item_ptr (t_item const &p_item) |
| WARNING: caller must not alter the item in a way that changes the sort order. | |
| template<typename t_item> | |
| bool | have_item (const t_item &p_item) const |
| void | remove_all () |
| template<typename t_item> | |
| void | remove_item (t_item const &p_item) |
| t_size | get_count () const |
| template<typename t_callback> | |
| void | enumerate (t_callback &p_callback) const |
| template<typename t_callback> | |
| void | __enumerate (t_callback &p_callback) |
| template<typename t_item> | |
| t_storage & | add (const t_item &p_item) |
| template<typename t_item> | |
| t_storage & | add_ex (const t_item &p_item, bool &p_isnew) |
| template<typename t_item> | |
| const t_storage * | find_ptr (t_item const &p_item) const |
| template<typename t_item> | |
| t_storage * | find_ptr (t_item const &p_item) |
| template<typename t_item> | |
| bool | exists (t_item const &p_item) const |
| void | reset () |
| template<typename t_item> | |
| void | remove (t_item const &p_item) |
Classes | |
| struct | t_node |
| pfc::avltree_t< t_storage, t_comparator >::avltree_t | ( | ) | [inline] |
| pfc::avltree_t< t_storage, t_comparator >::~avltree_t | ( | ) | [inline] |
| pfc::avltree_t< t_storage, t_comparator >::avltree_t | ( | const t_self & | p_other | ) | [inline] |
| pfc::avltree_t< t_storage, t_comparator >::avltree_t | ( | const t_other & | p_other | ) | [inline] |
| const t_self& pfc::avltree_t< t_storage, t_comparator >::operator= | ( | const t_self & | p_other | ) | [inline] |
| const t_self& pfc::avltree_t< t_storage, t_comparator >::operator= | ( | const t_other & | p_other | ) | [inline] |
| const t_storage* pfc::avltree_t< t_storage, t_comparator >::find_nearest_item | ( | const t_search & | p_search | ) | const [inline] |
| t_storage* pfc::avltree_t< t_storage, t_comparator >::find_nearest_item | ( | const t_search & | p_search | ) | [inline] |
| t_storage& pfc::avltree_t< t_storage, t_comparator >::add_item | ( | t_item const & | p_item | ) | [inline] |
| t_storage& pfc::avltree_t< t_storage, t_comparator >::add_item_ex | ( | t_item const & | p_item, | |
| bool & | p_isnew | |||
| ) | [inline] |
| void pfc::avltree_t< t_storage, t_comparator >::set_item | ( | const t_item & | p_item | ) | [inline] |
| const t_storage* pfc::avltree_t< t_storage, t_comparator >::find_item_ptr | ( | t_item const & | p_item | ) | const [inline] |
| t_storage* pfc::avltree_t< t_storage, t_comparator >::find_item_ptr | ( | t_item const & | p_item | ) | [inline] |
WARNING: caller must not alter the item in a way that changes the sort order.
| bool pfc::avltree_t< t_storage, t_comparator >::have_item | ( | const t_item & | p_item | ) | const [inline] |
| void pfc::avltree_t< t_storage, t_comparator >::remove_all | ( | ) | [inline] |
| void pfc::avltree_t< t_storage, t_comparator >::remove_item | ( | t_item const & | p_item | ) | [inline] |
| t_size pfc::avltree_t< t_storage, t_comparator >::get_count | ( | ) | const [inline] |
| void pfc::avltree_t< t_storage, t_comparator >::enumerate | ( | t_callback & | p_callback | ) | const [inline] |
| void pfc::avltree_t< t_storage, t_comparator >::__enumerate | ( | t_callback & | p_callback | ) | [inline] |
Allows callback to modify the tree content. WARNING: items must not be altered in a way that changes their sort order.
| t_storage& pfc::avltree_t< t_storage, t_comparator >::add | ( | const t_item & | p_item | ) | [inline] |
| t_storage& pfc::avltree_t< t_storage, t_comparator >::add_ex | ( | const t_item & | p_item, | |
| bool & | p_isnew | |||
| ) | [inline] |
| const t_storage* pfc::avltree_t< t_storage, t_comparator >::find_ptr | ( | t_item const & | p_item | ) | const [inline] |
| t_storage* pfc::avltree_t< t_storage, t_comparator >::find_ptr | ( | t_item const & | p_item | ) | [inline] |
| bool pfc::avltree_t< t_storage, t_comparator >::exists | ( | t_item const & | p_item | ) | const [inline] |
| void pfc::avltree_t< t_storage, t_comparator >::reset | ( | ) | [inline] |
| void pfc::avltree_t< t_storage, t_comparator >::remove | ( | t_item const & | p_item | ) | [inline] |
1.5.5