GNU
|
Liberty Eiffel
|
Automated Tests
|
Wiki
|
Savannah project
|
Debian packages
|
Documentation
>
libraries
>
AVL_TREE_ITERATOR
+
Point of view
All features
ANY
RECYCLING_POOL
All features
deferred class AVL_TREE_ITERATOR [E_]
Summary
top
Direct parents
Inherit list:
RECYCLABLE
Known children
Insert list:
ITERATOR_ON_AVL_DICTIONARY
,
ITERATOR_ON_AVL_DICTIONARY_ITEMS
,
ITERATOR_ON_AVL_DICTIONARY_KEYS
,
ITERATOR_ON_AVL_SET
Class invariant
top
nodes
/= Void
Overview
top
Features
{}
nodes
: STACK[AVL_TREE_NODE[E_]]
cur
: AVL_TREE_NODE[E_]
go_leftmost
(node: AVL_TREE_NODE[E_])
go_next_node
(node: AVL_TREE_NODE[E_])
go_first
(root: AVL_TREE_NODE[E_])
go_next
{
ANY
}
generation
:
INTEGER_32
{
RECYCLING_POOL
}
recycle
Do whatever needs to be done to free resources or recycle other objects when recycling this one
{}
new_nodes
: STACK[AVL_TREE_NODE[E_]]
nodes_pool
: RECYCLING_POOL[STACK[AVL_TREE_NODE[E_]]]
nodes_pool_memory
: RECYCLING_POOL[STACK[AVL_TREE_NODE[E_]]]
nodes_pools
:
HASHED_DICTIONARY
[
RECYCLING_POOL
[
STACK
[
AVL_TREE_NODE_ANY
]],
FIXED_STRING
]
nodes
: STACK[AVL_TREE_NODE[E_]]
writable attribute
{}
top
cur
: AVL_TREE_NODE[E_]
writable attribute
{}
top
go_leftmost
(node: AVL_TREE_NODE[E_])
effective procedure
{}
top
require
node =
nodes
.top
go_next_node
(node: AVL_TREE_NODE[E_])
effective procedure
{}
top
require
node =
nodes
.top
go_first
(root: AVL_TREE_NODE[E_])
effective procedure
{}
top
go_next
effective procedure
{}
top
require
not
nodes
.is_empty
generation
:
INTEGER_32
writable attribute
{
ANY
}
top
recycle
effective procedure
{
RECYCLING_POOL
}
top
Do whatever needs to be done to free resources or recycle other objects when recycling this one
new_nodes
: STACK[AVL_TREE_NODE[E_]]
effective function
{}
top
nodes_pool
: RECYCLING_POOL[STACK[AVL_TREE_NODE[E_]]]
effective function
{}
top
nodes_pool_memory
: RECYCLING_POOL[STACK[AVL_TREE_NODE[E_]]]
writable attribute
{}
top
nodes_pools
:
HASHED_DICTIONARY
[
RECYCLING_POOL
[
STACK
[
AVL_TREE_NODE_ANY
]],
FIXED_STRING
]
once function
{}
top