.TH "rbptree.h" 3 "Sat Oct 12 2013" "Version 4.0.0a" "Coin" \" -*- nroff -*-
.ad l
.nh
.SH NAME
rbptree.h \- 
.SH SYNOPSIS
.br
.PP
\fC#include <Inventor/C/basic\&.h>\fP
.br
\fC#include <stdarg\&.h>\fP
.br

.SS "Typedefs"

.in +1c
.ti -1c
.RI "typedef struct cc_rbptree_node \fBcc_rbptree_node\fP"
.br
.ti -1c
.RI "typedef struct cc_rbptree \fBcc_rbptree\fP"
.br
.ti -1c
.RI "typedef void \fBcc_rbptree_traversecb\fP (void *p, void *data, void *closure)"
.br
.in -1c
.SS "Functions"

.in +1c
.ti -1c
.RI "void \fBcc_rbptree_init\fP (cc_rbptree *t)"
.br
.ti -1c
.RI "void \fBcc_rbptree_clean\fP (cc_rbptree *t)"
.br
.ti -1c
.RI "void \fBcc_rbptree_insert\fP (cc_rbptree *t, void *p, void *data)"
.br
.ti -1c
.RI "SbBool \fBcc_rbptree_remove\fP (cc_rbptree *t, void *p)"
.br
.ti -1c
.RI "uint32_t \fBcc_rbptree_size\fP (const cc_rbptree *t)"
.br
.ti -1c
.RI "void \fBcc_rbptree_traverse\fP (const cc_rbptree *t, cc_rbptree_traversecb *func, void *closure)"
.br
.ti -1c
.RI "void \fBcc_rbptree_debug\fP (const cc_rbptree *t)"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SH "Function Documentation"
.PP 
.SS "void cc_rbptree_init (cc_rbptree *t)"
Initialize \fIt\fP\&. This is needed before making any operations on the tree\&. 
.SS "void cc_rbptree_clean (cc_rbptree *t)"
Delete all nodes in \&. After this call, the tree will be reinitialized to an empty tree\&. 
.SS "void cc_rbptree_insert (cc_rbptree *t, void *p, void *data)"
Insert a new value \fIp\fP into \fIt\fP\&. 
.SS "SbBool cc_rbptree_remove (cc_rbptree *t, void *p)"
Remove the (first) node with value \fIp\fP\&. Returns \fITRUE\fP if \fIp\fP is found and removed, \fIFALSE\fP otherwise\&. 
.SS "uint32_t cc_rbptree_size (const cc_rbptree *t)"
Returns the total numbers of items in the tree 
.SS "void cc_rbptree_debug (const cc_rbptree *t)"
for debugging only\&. Prints the tree to stdout\&. 
.SH "Author"
.PP 
Generated automatically by Doxygen for Coin from the source code\&.