_gdsl_bintree.3

一个通用的C语言实现的数据结构

T must be a non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to use. 
.RE
.PP
\fBReturns:\fP
.RS 4
the right sub-tree reference of the low-level binary tree T. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_get_left_ref()\fP 
.RE
.PP

.SS "\fBulong\fP _gdsl_bintree_get_height (const \fB_gdsl_bintree_t\fP T)"
.PP
Get the height of a low-level binary tree. 
.PP
Compute the height of the low-level binary tree T (noted h(T)).
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
nothing. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to use. 
.RE
.PP
\fBReturns:\fP
.RS 4
the height of T. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_get_size()\fP 
.RE
.PP

.SS "\fBulong\fP _gdsl_bintree_get_size (const \fB_gdsl_bintree_t\fP T)"
.PP
Get the size of a low-level binary tree. 
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
nothing. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to use. 
.RE
.PP
\fBReturns:\fP
.RS 4
the number of elements of T (noted |T|). 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_get_height()\fP 
.RE
.PP

.SS "void _gdsl_bintree_set_content (\fB_gdsl_bintree_t\fP T, const \fBgdsl_element_t\fP E)"
.PP
Set the root element of a low-level binary tree. 
.PP
Modify the root element of the low-level binary tree T to E.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T must be a non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to modify. 
.br
\fIE\fP The new T's root content. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_get_content\fP 
.RE
.PP

.SS "void _gdsl_bintree_set_parent (\fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_t\fP P)"
.PP
Set the parent tree of a low-level binary tree. 
.PP
Modify the parent of the low-level binary tree T to P.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T must be a non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to modify. 
.br
\fIP\fP The new T's parent. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_get_parent()\fP 
.RE
.PP

.SS "void _gdsl_bintree_set_left (\fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_t\fP L)"
.PP
Set left sub-tree of a low-level binary tree. 
.PP
Modify the left sub-tree of the low-level binary tree T to L.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T must be a non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to modify. 
.br
\fIL\fP The new T's left sub-tree. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_set_right()\fP 
.PP
\fB_gdsl_bintree_get_left()\fP 
.PP
\fB_gdsl_bintree_get_right()\fP 
.RE
.PP

.SS "void _gdsl_bintree_set_right (\fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_t\fP R)"
.PP
Set right sub-tree of a low-level binary tree. 
.PP
Modify the right sub-tree of the low-level binary tree T to R.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T must be a non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to modify. 
.br
\fIR\fP The new T's right sub-tree. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_set_left()\fP 
.PP
\fB_gdsl_bintree_get_left()\fP 
.PP
\fB_gdsl_bintree_get_right()\fP 
.RE
.PP

.SS "\fB_gdsl_bintree_t\fP _gdsl_bintree_rotate_left (\fB_gdsl_bintree_t\fP * T)"
.PP
Left rotate a low-level binary tree. 
.PP
Do a left rotation of the low-level binary tree T.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T & r(T) must be non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to rotate. 
.RE
.PP
\fBReturns:\fP
.RS 4
the modified T left-rotated. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_rotate_right()\fP 
.PP
\fB_gdsl_bintree_rotate_left_right()\fP 
.PP
\fB_gdsl_bintree_rotate_right_left()\fP 
.RE
.PP

.SS "\fB_gdsl_bintree_t\fP _gdsl_bintree_rotate_right (\fB_gdsl_bintree_t\fP * T)"
.PP
Right rotate a low-level binary tree. 
.PP
Do a right rotation of the low-level binary tree T.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T & l(T) must be non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to rotate. 
.RE
.PP
\fBReturns:\fP
.RS 4
the modified T right-rotated. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_rotate_left()\fP 
.PP
\fB_gdsl_bintree_rotate_left_right()\fP 
.PP
\fB_gdsl_bintree_rotate_right_left()\fP 
.RE
.PP

.SS "\fB_gdsl_bintree_t\fP _gdsl_bintree_rotate_left_right (\fB_gdsl_bintree_t\fP * T)"
.PP
Left-right rotate a low-level binary tree. 
.PP
Do a double left-right rotation of the low-level binary tree T.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T & l(T) & r(l(T)) must be non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to rotate. 
.RE
.PP
\fBReturns:\fP
.RS 4
the modified T left-right-rotated. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_rotate_left()\fP 
.PP
\fB_gdsl_bintree_rotate_right()\fP 
.PP
\fB_gdsl_bintree_rotate_right_left()\fP 
.RE
.PP

.SS "\fB_gdsl_bintree_t\fP _gdsl_bintree_rotate_right_left (\fB_gdsl_bintree_t\fP * T)"
.PP
Right-left rotate a low-level binary tree. 
.PP
Do a double right-left rotation of the low-level binary tree T.
.PP
\fBNote:\fP
.RS 4
Complexity: O( 1 ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
T & r(T) & l(r(T)) must be non-empty _gdsl_bintree_t. 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to rotate. 
.RE
.PP
\fBReturns:\fP
.RS 4
the modified T right-left-rotated. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_rotate_left()\fP 
.PP
\fB_gdsl_bintree_rotate_right()\fP 
.PP
\fB_gdsl_bintree_rotate_left_right()\fP 
.RE
.PP

.SS "\fB_gdsl_bintree_t\fP _gdsl_bintree_map_prefix (const \fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_map_func_t\fP MAP_F, void * USER_DATA)"
.PP
Parse a low-level binary tree in prefixed order. 
.PP
Parse all nodes of the low-level binary tree T in prefixed order. The MAP_F function is called on each node with the USER_DATA argument. If MAP_F returns GDSL_MAP_STOP, then \fB_gdsl_bintree_map_prefix()\fP stops and returns its last examinated node.
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
MAP_F != NULL 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to map. 
.br
\fIMAP_F\fP The map function. 
.br
\fIUSER_DATA\fP User's datas. 
.RE
.PP
\fBReturns:\fP
.RS 4
the first node for which MAP_F returns GDSL_MAP_STOP. 
.PP
NULL when the parsing is done. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_map_infix()\fP 
.PP
\fB_gdsl_bintree_map_postfix()\fP 
.RE
.PP

.SS "\fB_gdsl_bintree_t\fP _gdsl_bintree_map_infix (const \fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_map_func_t\fP MAP_F, void * USER_DATA)"
.PP
Parse a low-level binary tree in infixed order. 
.PP
Parse all nodes of the low-level binary tree T in infixed order. The MAP_F function is called on each node with the USER_DATA argument. If MAP_F returns GDSL_MAP_STOP, then \fB_gdsl_bintree_map_infix()\fP stops and returns its last examinated node.
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
MAP_F != NULL 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to map. 
.br
\fIMAP_F\fP The map function. 
.br
\fIUSER_DATA\fP User's datas. 
.RE
.PP
\fBReturns:\fP
.RS 4
the first node for which MAP_F returns GDSL_MAP_STOP. 
.PP
NULL when the parsing is done. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_map_prefix()\fP 
.PP
\fB_gdsl_bintree_map_postfix()\fP 
.RE
.PP

.SS "\fB_gdsl_bintree_t\fP _gdsl_bintree_map_postfix (const \fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_map_func_t\fP MAP_F, void * USER_DATA)"
.PP
Parse a low-level binary tree in postfixed order. 
.PP
Parse all nodes of the low-level binary tree T in postfixed order. The MAP_F function is called on each node with the USER_DATA argument. If MAP_F returns GDSL_MAP_STOP, then \fB_gdsl_bintree_map_postfix()\fP stops and returns its last examinated node.
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
MAP_F != NULL 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to map. 
.br
\fIMAP_F\fP The map function. 
.br
\fIUSER_DATA\fP User's datas. 
.RE
.PP
\fBReturns:\fP
.RS 4
the first node for which MAP_F returns GDSL_MAP_STOP. 
.PP
NULL when the parsing is done. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_map_prefix()\fP 
.PP
\fB_gdsl_bintree_map_infix()\fP 
.RE
.PP

.SS "void _gdsl_bintree_write (const \fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_write_func_t\fP WRITE_F, FILE * OUTPUT_FILE, void * USER_DATA)"
.PP
Write the content of all nodes of a low-level binary tree to a file. 
.PP
Write the nodes contents of the low-level binary tree T to OUTPUT_FILE, using WRITE_F function. Additionnal USER_DATA argument could be passed to WRITE_F.
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
WRITE_F != NULL & OUTPUT_FILE != NULL 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to write. 
.br
\fIWRITE_F\fP The write function. 
.br
\fIOUTPUT_FILE\fP The file where to write T's nodes. 
.br
\fIUSER_DATA\fP User's datas passed to WRITE_F. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_write_xml()\fP 
.PP
\fB_gdsl_bintree_dump()\fP 
.RE
.PP

.SS "void _gdsl_bintree_write_xml (const \fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_write_func_t\fP WRITE_F, FILE * OUTPUT_FILE, void * USER_DATA)"
.PP
Write the content of a low-level binary tree to a file into XML. 
.PP
Write the nodes contents of the low-level binary tree T to OUTPUT_FILE, into XML language. If WRITE_F != NULL, then uses WRITE_F function to write T's nodes content to OUTPUT_FILE. Additionnal USER_DATA argument could be passed to WRITE_F.
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
OUTPUT_FILE != NULL 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to write. 
.br
\fIWRITE_F\fP The write function. 
.br
\fIOUTPUT_FILE\fP The file where to write T's nodes. 
.br
\fIUSER_DATA\fP User's datas passed to WRITE_F. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_write()\fP 
.PP
\fB_gdsl_bintree_dump()\fP 
.RE
.PP

.SS "void _gdsl_bintree_dump (const \fB_gdsl_bintree_t\fP T, const \fB_gdsl_bintree_write_func_t\fP WRITE_F, FILE * OUTPUT_FILE, void * USER_DATA)"
.PP
Dump the internal structure of a low-level binary tree to a file. 
.PP
Dump the structure of the low-level binary tree T to OUTPUT_FILE. If WRITE_F != NULL, then use WRITE_F function to write T's nodes contents to OUTPUT_FILE. Additionnal USER_DATA argument could be passed to WRITE_F.
.PP
\fBNote:\fP
.RS 4
Complexity: O( |T| ) 
.RE
.PP
\fBPrecondition:\fP
.RS 4
OUTPUT_FILE != NULL 
.RE
.PP
\fBParameters:\fP
.RS 4
\fIT\fP The low-level binary tree to dump. 
.br
\fIWRITE_F\fP The write function. 
.br
\fIOUTPUT_FILE\fP The file where to write T's nodes. 
.br
\fIUSER_DATA\fP User's datas passed to WRITE_F. 
.RE
.PP
\fBSee also:\fP
.RS 4
\fB_gdsl_bintree_write()\fP 
.PP
\fB_gdsl_bintree_write_xml()\fP 
.RE
.PP