1 /* toolbox/tree.h - binary tree management
3 Copyright (C) 1996-2005 R. Grafl, A. Krall, C. Kruegel, C. Oates,
4 R. Obermaisser, M. Platter, M. Probst, S. Ring, E. Steiner,
5 C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich, J. Wenninger,
6 Institut f. Computersprachen - TU Wien
8 This file is part of CACAO.
10 This program is free software; you can redistribute it and/or
11 modify it under the terms of the GNU General Public License as
12 published by the Free Software Foundation; either version 2, or (at
13 your option) any later version.
15 This program is distributed in the hope that it will be useful, but
16 WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
25 Contact: cacao@complang.tuwien.ac.at
27 Authors: Reinhard Grafl
29 $Id: tree.c 1735 2004-12-07 14:33:27Z twisti $
37 #include "mm/memory.h"
38 #include "toolbox/tree.h"
41 tree *tree_new(treeelementcomperator comperator)
46 t->comperator = comperator;
54 tree *tree_dnew(treeelementcomperator comperator)
59 t->comperator = comperator;
67 static void tree_nodefree(treenode *tn)
72 tree_nodefree(tn->left);
73 tree_nodefree(tn->right);
78 void tree_free(tree *t)
82 tree_nodefree(t->top);
87 static treenode *tree_nodeadd(tree *t, treenode *par, treenode *n,
88 void *element, void *key)
101 n->element = element;
104 if (t->comperator(key, n->element) < 0) {
105 n->left = tree_nodeadd(t, n, n->left, element, key);
108 n->right = tree_nodeadd(t, n, n->right, element, key);
116 void tree_add(tree *t, void *element, void *key)
118 t->top = tree_nodeadd(t, NULL, t->top, element, key);
123 static treenode *tree_nodefind(tree *t, treenode *n, void *key)
130 way = t->comperator(key, n->element);
135 return tree_nodefind(t, n->left, key);
138 return tree_nodefind (t, n -> right, key);
143 void *tree_find(tree *t, void *key)
145 treenode *tn = tree_nodefind(t, t->top, key);
157 void *tree_this(tree *t)
162 return t->active->element;
166 static treenode *leftmostnode(treenode *t)
176 void *tree_first(tree *t)
178 treenode *a = t->top;
190 void *tree_next (tree *t)
192 treenode *a = t->active;
193 treenode *comefrom = NULL;
199 if (a->left && (a->left == comefrom)) {
204 if (a->right && (a->right != comefrom)) {
205 a = leftmostnode(a->right);
221 * These are local overrides for various environment variables in Emacs.
222 * Please do not remove this and leave it at the end of the file, where
223 * Emacs will automagically detect them.
224 * ---------------------------------------------------------------------
227 * indent-tabs-mode: t