
Public Types | |
| enum | SearchType { EQUAL = 1, LESS = 2, GREATER = 4, LESS_EQUAL = EQUAL | LESS, GREATER_EQUAL = EQUAL | GREATER } |
| typedef Abstractor::key | key |
| typedef Abstractor::handle | handle |
| typedef Abstractor::size | size |
Public Member Functions | |
| Abstractor & | abstractor () |
| abstractor description | |
| handle | insert (handle h) |
| insert description | |
| handle | search (key k, SearchType st=EQUAL) |
| search description | |
| handle | search_least () |
| search_least description | |
| handle | search_greatest () |
| search_greatest description | |
| handle | remove (key k) |
| remove description | |
| handle | subst (handle new_node) |
| subst description | |
| void | purge () |
| purge description | |
| bool | is_empty () |
| is_empty description | |
| AVLTree () | |
| AVLTree description. | |
| template<typename fwd_iter> | |
| bool | build (fwd_iter p, size num_nodes) |
| build description | |
Protected Member Functions | |
| handle | get_lt (handle h) |
| get_lt description | |
| void | set_lt (handle h, handle lh) |
| set_lt description | |
| handle | get_gt (handle h) |
| get_gt description | |
| void | set_gt (handle h, handle gh) |
| set_gt description | |
| int | get_bf (handle h) |
| get_bf description | |
| void | set_bf (handle h, int bf) |
| set_bf description | |
| int | cmp_k_n (key k, handle h) |
| cmp_k_n description | |
| int | cmp_n_n (handle h1, handle h2) |
| cmp_n_n description | |
| handle | null () |
| null description | |
Protected Attributes | |
| abs_plus_root | abs |
Friends | |
| class | Iterator |
Classes | |
| struct | abs_plus_root |
| class | Iterator |
| typedef Abstractor::key KJS::AVLTree< Abstractor, maxDepth, BSet >::key |
| typedef Abstractor::handle KJS::AVLTree< Abstractor, maxDepth, BSet >::handle |
| typedef Abstractor::size KJS::AVLTree< Abstractor, maxDepth, BSet >::size |
| enum KJS::AVLTree::SearchType |
| KJS::AVLTree< Abstractor, maxDepth, BSet >::AVLTree | ( | ) |
| Abstractor& KJS::AVLTree< Abstractor, maxDepth, BSet >::abstractor | ( | ) |
abstractor description
| [in] | : | description |
| [out] | : | description |
| AVLTree< Abstractor, maxDepth, BSet >::handle KJS::AVLTree< Abstractor, maxDepth, BSet >::insert | ( | handle | h | ) | [inline] |
insert description
BSet>insert description.
| [in] | : | description |
| [out] | : | description |
| handle KJS::AVLTree< Abstractor, maxDepth, BSet >::search | ( | key | k, | |
| SearchType | st = EQUAL | |||
| ) | [inline] |
search description
| [in] | : | description |
| [out] | : | description |
| AVLTree< Abstractor, maxDepth, BSet >::handle KJS::AVLTree< Abstractor, maxDepth, BSet >::search_least | ( | ) | [inline] |
search_least description
BSet>search_least description.
| [in] | : | description |
| [out] | : | description |
| AVLTree< Abstractor, maxDepth, BSet >::handle KJS::AVLTree< Abstractor, maxDepth, BSet >::search_greatest | ( | ) | [inline] |
search_greatest description
BSet>search_greatest description.
| [in] | : | description |
| [out] | : | description |
| AVLTree< Abstractor, maxDepth, BSet >::handle KJS::AVLTree< Abstractor, maxDepth, BSet >::remove | ( | key | k | ) | [inline] |
remove description
BSet>remove description.
| [in] | : | description |
| [out] | : | description |
| AVLTree< Abstractor, maxDepth, BSet >::handle KJS::AVLTree< Abstractor, maxDepth, BSet >::subst | ( | handle | new_node | ) | [inline] |
subst description
BSet>subst description.
| [in] | : | description |
| [out] | : | description |
| void KJS::AVLTree< Abstractor, maxDepth, BSet >::purge | ( | ) |
purge description
| [in] | : | description |
| [out] | : | description |
| bool KJS::AVLTree< Abstractor, maxDepth, BSet >::is_empty | ( | ) |
is_empty description
| [in] | : | description |
| [out] | : | description |
| bool KJS::AVLTree< Abstractor, maxDepth, BSet >::build | ( | fwd_iter | p, | |
| size | num_nodes | |||
| ) | [inline] |
build description
| [in] | : | description |
| [out] | : | description |
| handle KJS::AVLTree< Abstractor, maxDepth, BSet >::get_lt | ( | handle | h | ) | [protected] |
get_lt description
| [in] | : | description |
| [out] | : | description |
| void KJS::AVLTree< Abstractor, maxDepth, BSet >::set_lt | ( | handle | h, | |
| handle | lh | |||
| ) | [protected] |
set_lt description
| [in] | : | description |
| [out] | : | description |
| handle KJS::AVLTree< Abstractor, maxDepth, BSet >::get_gt | ( | handle | h | ) | [protected] |
get_gt description
| [in] | : | description |
| [out] | : | description |
| void KJS::AVLTree< Abstractor, maxDepth, BSet >::set_gt | ( | handle | h, | |
| handle | gh | |||
| ) | [protected] |
set_gt description
| [in] | : | description |
| [out] | : | description |
| int KJS::AVLTree< Abstractor, maxDepth, BSet >::get_bf | ( | handle | h | ) | [protected] |
get_bf description
| [in] | : | description |
| [out] | : | description |
| void KJS::AVLTree< Abstractor, maxDepth, BSet >::set_bf | ( | handle | h, | |
| int | bf | |||
| ) | [protected] |
set_bf description
| [in] | : | description |
| [out] | : | description |
| int KJS::AVLTree< Abstractor, maxDepth, BSet >::cmp_k_n | ( | key | k, | |
| handle | h | |||
| ) | [protected] |
cmp_k_n description
| [in] | : | description |
| [out] | : | description |
| int KJS::AVLTree< Abstractor, maxDepth, BSet >::cmp_n_n | ( | handle | h1, | |
| handle | h2 | |||
| ) | [protected] |
cmp_n_n description
| [in] | : | description |
| [out] | : | description |
| handle KJS::AVLTree< Abstractor, maxDepth, BSet >::null | ( | ) | [protected] |
null description
| [in] | : | description |
| [out] | : | description |
friend class Iterator [friend] |
abs_plus_root KJS::AVLTree< Abstractor, maxDepth, BSet >::abs [protected] |