summaryrefslogtreecommitdiff
path: root/source3/include/adt_tree.h
diff options
context:
space:
mode:
authorGerald Carter <jerry@samba.org>2002-07-18 23:00:24 +0000
committerGerald Carter <jerry@samba.org>2002-07-18 23:00:24 +0000
commit06ae9ac5d98a752d8ca17686a4a3b1786fbe520d (patch)
tree09607de65ac2f72d4d987b0bce496cd8ff7f733b /source3/include/adt_tree.h
parent2afc1ca42c6a945fa1385328cd1c69065829d233 (diff)
downloadsamba-06ae9ac5d98a752d8ca17686a4a3b1786fbe520d.tar.gz
samba-06ae9ac5d98a752d8ca17686a4a3b1786fbe520d.tar.bz2
samba-06ae9ac5d98a752d8ca17686a4a3b1786fbe520d.zip
virtual registry framework with initial printing hooks.
(This used to be commit a43d9788fa8823d678ee72470421b980165ec2b0)
Diffstat (limited to 'source3/include/adt_tree.h')
-rw-r--r--source3/include/adt_tree.h38
1 files changed, 38 insertions, 0 deletions
diff --git a/source3/include/adt_tree.h b/source3/include/adt_tree.h
new file mode 100644
index 0000000000..b1bf7ad85d
--- /dev/null
+++ b/source3/include/adt_tree.h
@@ -0,0 +1,38 @@
+/*
+ * Unix SMB/CIFS implementation.
+ * Generic Abstract Data Types
+ * Copyright (C) Gerald Carter 2002.
+ *
+ * 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 2 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, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ */
+
+#ifndef ADT_TREE_H
+#define ADT_TREE_H
+
+typedef struct _tree_node {
+ struct _tree_node *parent;
+ struct _tree_node **children;
+ int num_children;
+ char *key;
+ void *data_p;
+} TREE_NODE;
+
+typedef struct _tree_root {
+ TREE_NODE *root;
+ int (*compare)(void* x, void *y);
+ void (*free)(void *p);
+} SORTED_TREE;
+
+#endif