bci - Binary cell tree iterator
Module Description
The bci module implements an iterator on the binary tree: bct
Module Words
Iterator Structure
bci%
( - n )
Get the required space for a bci data structure
Iterator creation, initialisation and destruction
bci-init
( w:bct w:bci - )
Initialise the iterator with a binary tree
bci-create
( C: w:bct "name" - R: - w:bci )
Create a named iterator in the dictionary
bci-new
( w:bct - w:bci )
Create an iterator on the heap
bci-free
( w:bci - )
Free the iterator from the heap
Iterator words
bci-get
( w:bci - false | w true )
Get the cell data from the current node
bci-key
( w:bci - false | w true )
Get the key from the current node
bci-set
( w w:bci - )
Set the cell data for the current node
bci-first
( w:bci - w true | false )
Move the iterator to the first node
bci-next
( w:bci - w true | false )
Move the iterator to the next node
bci-move
( w w:bci - f )
Move the iterator to the next node with the cell data
bci-prev
( w:bci - w true | false )
Move the iterator to the previous node
bci-last
( w:bci - w true | false )
Move the iterator to the last node
bci-first?
( w:bci - f )
Check if the iterator is on the first node
bci-last?
( w:bci - f )
Check if the iterator is on the last node
Inspection
bci-dump
( w:bci - )
Dump the iterator
generated 09-Jan-2007 by
ofcfrth-0.2.0