Mirror of :pserver:cvs@cvs.fefe.de:/cvs libowfat https://www.fefe.de/libowfat/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 

19 lines
501 B

.TH critbit0_clear 3
.SH NAME
critbit0_clear \- free all memory associated with a critbit tree
.SH SYNTAX
.B #include <libowfat/critbit.h>
critbit0_tree cb = { 0 };
void \fBcritbit0_clear\fP(critbit0_tree* \fIcb\fR);
.SH DESCRIPTION
critbit0_clear deletes all keys in \fIcb\fR and frees all memory
associated with it.
.SH "NOTE"
This function uses recursion to traverse the tree. It may require
nontrivial amounts of available stack space.
.SH "RETURN VALUE"
none.
.SH "SEE ALSO"
critbit0_delete(3)