Finds the next node in the tree whose label or value matches the search string.
FUNCTION FIND_TREE_NODE
(item_name VARCHAR2,
search_string VARCHAR2,
search_type NUMBER,
search_by NUMBER,
search_root NODE,
start_point NODE);
FUNCTION FIND_TREE_NODE
(item_id ITEM,
search_string VARCHAR2,
search_type NUMBER,
search_by NUMBER,
search_root NODE,
start_point NODE);
Built-in Type unrestricted function
Returns NODE
Enter Query Mode no
FIND_NEXT
FIND_NEXT_CHILD Searches only the children of the search_root node.
NODE_LABEL
NODE_VALUE
/*
** Built-in: FIND_TREE_NODE
*/
-- This code finds a node with a label of "Doran"
-- within the subtree beginning with the node labeled
-- "Zetie".
DECLARE
htree ITEM;
find_node FTREE.NODE;
BEGIN
-- Find the tree itself.
htree := FIND_ITEM('tree_block.htree3');
-- Find the node with a label "Zetie".
find_node := FTREE.FIND_TREE_NODE(htree,
'Zetie',
FTREE.FIND_NEXT,
FTREE.NODE_LABEL,
FTREE.ROOT_NODE,
FTREE.ROOT_NODE);
-- Find the node with a label "Doran"
-- starting at the first occurance of "Zetie".
find_node := FTREE.FIND_TREE_NODE(htree,
'Doran',
FTREE.FIND_NEXT,
FTREE.NODE_LABEL,
find_node,
find_node);
IF NOT FTREE.ID_NULL(find_node)
then
...
END IF;
END;