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.
 
 
 
 

18 lines
493 B

  1. .TH critbit0_contains 3
  2. .SH NAME
  3. critbit0_contains \- check whether a string is in the critbit tree
  4. .SH SYNTAX
  5. .B #include <critbit.h>
  6. critbit0_tree cb = { 0 };
  7. int \fBcritbit0_contains\fP(critbit0_tree* \fIcb\fR,const char* \fIstr\fR);
  8. .SH DESCRIPTION
  9. critbit0_contains looks up the given string in the critbit0 tree.
  10. If \fIstr\fR is in \fIcb\fR, critbit0_contains returns 1. Otherwise it
  11. returns 0.
  12. .SH "RETURN VALUE"
  13. 1 if the key was found, 0 otherwise.
  14. .SH "SEE ALSO"
  15. critbit0_insert(3)