From 4f5791ebd03eaec1c7da0865a383175b05102712 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sun, 5 May 2024 19:47:29 +0200 Subject: Adding upstream version 2:4.17.12+dfsg. Signed-off-by: Daniel Baumann --- source3/include/adt_tree.h | 46 ++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 source3/include/adt_tree.h (limited to 'source3/include/adt_tree.h') diff --git a/source3/include/adt_tree.h b/source3/include/adt_tree.h new file mode 100644 index 0000000..7e43fa6 --- /dev/null +++ b/source3/include/adt_tree.h @@ -0,0 +1,46 @@ +/* + * Unix SMB/CIFS implementation. + * Generic Abstract Data Types + * Copyright (C) Gerald Carter 2002-2005. + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, see . + */ + +#ifndef ADT_TREE_H +#define ADT_TREE_H + +struct sorted_tree; + +/* + * API + */ + +/* create a new tree, talloc_free() to throw it away */ + +struct sorted_tree *pathtree_init(void *data_p); + +/* add a new path component */ + +bool pathtree_add(struct sorted_tree *tree, const char *path, void *data_p ); + +/* search path */ + +void *pathtree_find(struct sorted_tree *tree, char *key ); + +/* debug (print) functions */ + +void pathtree_print_keys(struct sorted_tree *tree, int debug ); + + +#endif -- cgit v1.2.3