source3/include/adt_tree.h

   1 /*
   2  *  Unix SMB/CIFS implementation.
   3  *  Generic Abstract Data Types
   4  *  Copyright (C) Gerald Carter                     2002-2005.
   5  *
   6  *  This program is free software; you can redistribute it and/or modify
   7  *  it under the terms of the GNU General Public License as published by
   8  *  the Free Software Foundation; either version 3 of the License, or
   9  *  (at your option) any later version.
  10  *
  11  *  This program is distributed in the hope that it will be useful,
  12  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  *  GNU General Public License for more details.
  15  *
  16  *  You should have received a copy of the GNU General Public License
  17  *  along with this program; if not, see <http://www.gnu.org/licenses/>.
  18  */
  19
  20 #ifndef ADT_TREE_H
  21 #define ADT_TREE_H
  22
  23 struct sorted_tree;
  24
  25 /*
  26  * API
  27  */
  28
  29 /* create a new tree, talloc_free() to throw it away */
  30
  31 struct sorted_tree *pathtree_init(void *data_p);
  32
  33 /* add a new path component */
  34
  35 bool pathtree_add(struct sorted_tree *tree, const char *path, void *data_p );
  36
  37 /* search path */
  38
  39 void *pathtree_find(struct sorted_tree *tree, char *key );
  40
  41 /* debug (print) functions */
  42
  43 void pathtree_print_keys(struct sorted_tree *tree, int debug );
  44
  45
  46 #endif