tree.pkg File Reference

Scol Standard Library - Binary-tree API. More...

Classes
struct	STD_TREE_EASY

Typedefs
typedef struct mkSTD_TREE_EASY	STD_TREE_EASY

Functions
	std_treecheckisleft (isLeft)
	std_treeConv (tree)
	std_treeConvF (f)
	std_treeConvI (i)
	std_treeConvLS (lStr)
	std_treeConvLS2 (lStr)
	std_treeConvS (str)
	std_treeConvTS (tStr)
	std_treeConvU (u)
	std_treeGetCB (tree, cbfun)
	std_treeGetNode (tree)
	std_treeNew (data, isLeft)
	Create an easy binary tree. More...
	std_treenewesay (data, isLeft, flag)

Variables
typedef	STD_TREE_DATA
var	STD_TREE_LEFTISSMALLER =0
var	STD_TREE_NODE_F =1
var	STD_TREE_NODE_I =0
var	STD_TREE_NODE_LS =3
var	STD_TREE_NODE_LS2 =4
var	STD_TREE_NODE_S =2
var	STD_TREE_NODE_TS =5
var	STD_TREE_NODE_U =99
var	STD_TREE_RIGHTISSMALLER =1
proto	std_treeGetCB =fun [STD_TREE_EASY fun [u0] I] STD_TREE_EASY

Detailed Description

Scol Standard Library - Binary-tree API.

Author

Scol team

Version

0.1

Copyright

GNU Lesser General Public License 2.0 or later

A binary tree is a tree data structure in which each node has at most two children (referred to as the left child and the right child). This API allows to manipulate these object.

Function Documentation

std_treeNew	(	data	,
		isLeft
	)

Create an easy binary tree.

Prototype : fun [u0 I] STD_TREE_EASY

Parameters

u0	: an initial key.
I	: flag : STD_TREE_LEFTISSMALLER (left tree is smaller) or STD_TREE_RIGHTISSMALLER (right tree is smaller)

Returns

STD_TREE_EASY : the new tree

Variable Documentation

typedef STD_TREE_DATA

Initial value:

= 
      STD_TREE_DATA_I I
      | STD_TREE_DATA_CONV_F F
      | STD_TREE_DATA_CONV_S S
      | STD_TREE_DATA_CONV_LS [S r1]
      | STD_TREE_DATA_CONV_LS2 [[S r1] r1]
      | STD_TREE_DATA_CONV_TS tab S
      | STD_TREE_DATA_CONV_U