Simple Invocation Tree
seek_current
| read
seek_item
| seek_leaf
| is_equal
| seek_pred
| <
seek_leaf
| find_le
| <
| length
| length
| discard
| get_node
| seek_root
| append
seek_left
| append
| get_node
seek_pred
| next_node
| append
| get_node
| seek_right
| length
| discard
seek_right
| append
| get_node
seek_root
| get_node
| clear
seek_succ
| next_node
| append
| get_node
| seek_left
| length
| length
| discard
set
| assert
| min
set_index
| Set_Index
set_length
| min
set_length
| min
set_name
| min
size
| Size
spaces
| value
specials
| value
split_node
| condalloc
| set
| set_length
| insert
| set
| append
| append
| Size
| put_node
string_tools
| build_same_case
suffix
| min
system_log
| Clock
| -