From 881afbda5a8bac26f6f3de6e84afaf14195ee9fa Mon Sep 17 00:00:00 2001 From: Daniel Berlin Date: Mon, 16 Apr 2001 14:10:14 +0000 Subject: [PATCH] 2001-04-15 Daniel Berlin * ternary.c: New file - Ternary search tree implementation. 2001-04-15 Daniel Berlin * ternary.h: New file - Ternary search tree header. --- include/ChangeLog | 4 ++++ include/ternary.h | 50 +++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 54 insertions(+) create mode 100644 include/ternary.h diff --git a/include/ChangeLog b/include/ChangeLog index a6eb4d911..40726172c 100644 --- a/include/ChangeLog +++ b/include/ChangeLog @@ -1,3 +1,7 @@ +2001-04-15 Daniel Berlin + + * ternary.h: New file - Ternary search tree header. + 2001-04-13 Jakub Jelinek * bfdlink.h (bfd_link_discard): Add discard_sec_merge. diff --git a/include/ternary.h b/include/ternary.h new file mode 100644 index 000000000..2e0c82850 --- /dev/null +++ b/include/ternary.h @@ -0,0 +1,50 @@ +/* ternary.h - Ternary Search Trees + Copyright 2001 Free Software Foundation, Inc. + + Contributed by Daniel Berlin (dan@cgsoftware.com) + + + 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, 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, + USA. */ +#ifndef TERNARY_H_ +#define TERNARY_H_ +/* Ternary search trees */ + +typedef struct ternary_node_def *ternary_tree; + +typedef struct ternary_node_def +{ + char splitchar; + ternary_tree lokid; + ternary_tree eqkid; + ternary_tree hikid; +} +ternary_node; + +/* Insert string S into tree P, associating it with DATA. + Return the data in the tree associated with the string if it's + already there, and replace is 0. + Otherwise, replaces if it it exists, inserts if it doesn't, and + returns the data you passed in. */ +void *ternary_insert (ternary_tree *p, char *s, void *data, int replace); + +/* Delete the ternary search tree rooted at P. + Does NOT delete the data you associated with the strings. */ +void ternary_cleanup (ternary_tree p); + +/* Search the ternary tree for string S, returning the data associated + with it if found. */ +void *ternary_search (ternary_tree p, char *s); +#endif