Lisaac prototype interface

Lisaac^TM Platform

AVL_TREE

2003-2005 Jérome Boutet, 2003-2007 Benoit Sonntag

Definition of a mathematical set of comparable objects. All common operations on mathematical sets are available.

Inherit/Insert Summary
`parent_avl_constants` No developed.

Slot Summary
`debug_string`
`count`
`root`
`rebalance`
`item_memory`
`set_value_and_key`
`set_value`
`fast_do_insert`
`do_insert`
`left_grown`
`right_grown`
`fast_do_remove`
`do_remove`
`remove_right`
`left_shrunk`
`right_shrunk`
`exchange_and_discard`
`clear_nodes`
`node_height`
`map` Elements in a row for iteration. See `build_map`.
`map_dirty` True when the map needs to be built again for the iterators. See `build_map`.
`new_node`
`a_new_node`
`discard_node`

Adding and removing:
`remove`
`fast_remove`

Looking and searching:
`has` Is element e in the set?
`fast_has` Is element e in the set?

Iterating internals:
`build_map`

Inherit/Insert Detail

parent_avl_constants

.../base/collection/low_level/avl_tree.li line #13
Section:: Insert
Profile:: - Self: SELF. parent_avl_constants : AVL_CONSTANTS

Detail slot

debug_string

.../base/collection/low_level/avl_tree.li line #17
Section:: Public
Profile:: - Self: SELF. debug_string : STRING

count

.../base/collection/low_level/avl_tree.li line #30
Section:: Public
Profile:: + Self: SELF. count : INTEGER

root

.../base/collection/low_level/avl_tree.li line #50
Section:: SELF
Profile:: + Self: SELF. root : AVL_TREE_NODE( V)

rebalance

.../base/collection/low_level/avl_tree.li line #52
Section:: SELF
Profile:: + Self: SELF. rebalance : BOOLEAN

item_memory

.../base/collection/low_level/avl_tree.li line #54
Section:: SELF
Profile:: + Self: SELF. item_memory : V

set_value_and_key

.../base/collection/low_level/avl_tree.li line #56
Section:: SELF
Profile:: - Self: SELF. set_value_and_key n : AVL_TREE_NODE( V)

set_value

.../base/collection/low_level/avl_tree.li line #61
Section:: SELF
Profile:: - Self: SELF. set_value n : AVL_TREE_NODE( V)

fast_do_insert

.../base/collection/low_level/avl_tree.li line #66
Section:: SELF
Profile:: - Self: SELF. fast_do_insert n : AVL_TREE_NODE( V) : AVL_TREE_NODE( V)

do_insert

.../base/collection/low_level/avl_tree.li line #103
Section:: SELF
Profile:: - Self: SELF. do_insert n : AVL_TREE_NODE( V) : AVL_TREE_NODE( V)

left_grown

.../base/collection/low_level/avl_tree.li line #140
Section:: SELF
Profile:: - Self: SELF. left_grown n : AVL_TREE_NODE( V) : AVL_TREE_NODE( V)

right_grown

.../base/collection/low_level/avl_tree.li line #193
Section:: SELF
Profile:: - Self: SELF. right_grown n : AVL_TREE_NODE( V) : AVL_TREE_NODE( V)

fast_do_remove

.../base/collection/low_level/avl_tree.li line #247
Section:: SELF
Profile:: - Self: SELF. fast_do_remove ( n : AVL_TREE_NODE( V), e : V) : AVL_TREE_NODE( V)

do_remove

.../base/collection/low_level/avl_tree.li line #292
Section:: SELF
Profile:: - Self: SELF. do_remove ( n : AVL_TREE_NODE( V), e : V) : AVL_TREE_NODE( V)

remove_right

.../base/collection/low_level/avl_tree.li line #333
Section:: SELF
Profile:: - Self: SELF. remove_right ( n1 : AVL_TREE_NODE( V), n2 : AVL_TREE_NODE( V)) : AVL_TREE_NODE( V)

left_shrunk

.../base/collection/low_level/avl_tree.li line #359
Section:: SELF
Profile:: - Self: SELF. left_shrunk n : AVL_TREE_NODE( V) : AVL_TREE_NODE( V)

right_shrunk

.../base/collection/low_level/avl_tree.li line #417
Section:: SELF
Profile:: - Self: SELF. right_shrunk n : AVL_TREE_NODE( V) : AVL_TREE_NODE( V)

exchange_and_discard

.../base/collection/low_level/avl_tree.li line #474
Section:: SELF
Profile:: - Self: SELF. exchange_and_discard ( n1 : AVL_TREE_NODE( V), n2 : AVL_TREE_NODE( V))

clear_nodes

.../base/collection/low_level/avl_tree.li line #488
Section:: SELF
Profile:: - Self: SELF. clear_nodes node : AVL_TREE_NODE( V)

node_height

.../base/collection/low_level/avl_tree.li line #499
Section:: SELF
Profile:: - Self: SELF. node_height node : AVL_TREE_NODE( V) : INTEGER

map

.../base/collection/low_level/avl_tree.li line #547
Section:: SELF
Profile:: + Self: SELF. map : FAST_ARRAY( AVL_TREE_NODE( V))
Description:: Elements in a row for iteration. See build_map.

map_dirty

.../base/collection/low_level/avl_tree.li line #550
Section:: SELF
Profile:: + Self: SELF. map_dirty : BOOLEAN
Description:: True when the map needs to be built again for the iterators. See build_map.

new_node

.../base/collection/low_level/avl_tree.li line #556
Section:: SELF
Profile:: - Self: SELF. new_node : AVL_TREE_NODE( V)

a_new_node

.../base/collection/low_level/avl_tree.li line #561
Section:: SELF
Profile:: - Self: SELF. a_new_node : AVL_TREE_NODE( V)

discard_node

.../base/collection/low_level/avl_tree.li line #567
Section:: SELF
Profile:: - Self: SELF. discard_node n : AVL_TREE_NODE( V)

Adding and removing:

remove

.../base/collection/low_level/avl_tree.li line #38
Section:: Public
Profile:: - Self: SELF. remove e : V

fast_remove

.../base/collection/low_level/avl_tree.li line #43
Section:: Public
Profile:: - Self: SELF. fast_remove e : V

Looking and searching:

has

.../base/collection/low_level/avl_tree.li line #514
Section:: Public
Profile:: - Self: SELF. has e : V : BOOLEAN
Description:: Is element e in the set?

fast_has

.../base/collection/low_level/avl_tree.li line #520
Section:: Public
Profile:: - Self: SELF. fast_has e : V : BOOLEAN
Description:: Is element e in the set?

Iterating internals:

build_map

.../base/collection/low_level/avl_tree.li line #532
Section:: SELF
Profile:: - Self: SELF. build_map