+++ /dev/null
-/* toolbox/tree.h - binary tree management
-
- Copyright (C) 1996-2005, 2006 R. Grafl, A. Krall, C. Kruegel,
- C. Oates, R. Obermaisser, M. Platter, M. Probst, S. Ring,
- E. Steiner, C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich,
- J. Wenninger, Institut f. Computersprachen - TU Wien
-
- This file is part of CACAO.
-
- 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., 51 Franklin Street, Fifth Floor, Boston, MA
- 02110-1301, USA.
-
- Contact: cacao@cacaojvm.org
-
- Authors: Reinhard Grafl
-
-
-*/
-
-
-#include <stdio.h>
-#include <assert.h>
-
-#include "mm/memory.h"
-#include "toolbox/tree.h"
-
-
-tree *tree_new(treeelementcomperator comperator)
-{
- tree *t = NEW(tree);
-
- t->usedump = 0;
- t->comperator = comperator;
- t->top = NULL;
- t->active = NULL;
-
- return t;
-}
-
-
-tree *tree_dnew(treeelementcomperator comperator)
-{
- tree *t = DNEW(tree);
-
- t->usedump = 1;
- t->comperator = comperator;
- t->top = NULL;
- t->active = NULL;
-
- return t;
-}
-
-
-static void tree_nodefree(treenode *tn)
-{
- if (!tn)
- return;
-
- tree_nodefree(tn->left);
- tree_nodefree(tn->right);
- FREE(tn, treenode);
-}
-
-
-void tree_free(tree *t)
-{
- assert(!t->usedump);
-
- tree_nodefree(t->top);
- FREE(t, tree);
-}
-
-
-static treenode *tree_nodeadd(tree *t, treenode *par, treenode *n,
- void *element, void *key)
-{
- if (!n) {
- if (t->usedump) {
- n = DNEW(treenode);
-
- } else {
- n = NEW(treenode);
- }
-
- n->left = NULL;
- n->right = NULL;
- n->parent = par;
- n->element = element;
-
- } else {
- if (t->comperator(key, n->element) < 0) {
- n->left = tree_nodeadd(t, n, n->left, element, key);
-
- } else {
- n->right = tree_nodeadd(t, n, n->right, element, key);
- }
- }
-
- return n;
-}
-
-
-void tree_add(tree *t, void *element, void *key)
-{
- t->top = tree_nodeadd(t, NULL, t->top, element, key);
- t->active = t->top;
-}
-
-
-static treenode *tree_nodefind(tree *t, treenode *n, void *key)
-{
- int way;
-
- if (!n)
- return NULL;
-
- way = t->comperator(key, n->element);
- if (way == 0)
- return n;
-
- if (way < 0) {
- return tree_nodefind(t, n->left, key);
-
- } else {
- return tree_nodefind (t, n -> right, key);
- }
-}
-
-
-void *tree_find(tree *t, void *key)
-{
- treenode *tn = tree_nodefind(t, t->top, key);
-
- if (!tn)
- return NULL;
-
- t->active = tn;
-
- return tn->element;
-}
-
-
-
-void *tree_this(tree *t)
-{
- if (!t->active)
- return NULL;
-
- return t->active->element;
-}
-
-
-static treenode *leftmostnode(treenode *t)
-{
- while (t->left) {
- t = t->left;
- }
-
- return t;
-}
-
-
-void *tree_first(tree *t)
-{
- treenode *a = t->top;
-
- if (!a)
- return NULL;
-
- a = leftmostnode(a);
- t->active = a;
-
- return a->element;
-}
-
-
-void *tree_next (tree *t)
-{
- treenode *a = t->active;
- treenode *comefrom = NULL;
-
- while (a) {
- if (!a)
- return NULL;
-
- if (a->left && (a->left == comefrom)) {
- t -> active = a;
- return a->element;
- }
-
- if (a->right && (a->right != comefrom)) {
- a = leftmostnode(a->right);
- t -> active = a;
- return a->element;
- }
-
- comefrom = a;
- a = a->parent;
- }
-
- t->active = NULL;
-
- return NULL;
-}
-
-
-/*
- * These are local overrides for various environment variables in Emacs.
- * Please do not remove this and leave it at the end of the file, where
- * Emacs will automagically detect them.
- * ---------------------------------------------------------------------
- * Local variables:
- * mode: c
- * indent-tabs-mode: t
- * c-basic-offset: 4
- * tab-width: 4
- * End:
- */
+++ /dev/null
-/* toolbox/tree.h - binary tree management
-
- Copyright (C) 1996-2005, 2006 R. Grafl, A. Krall, C. Kruegel,
- C. Oates, R. Obermaisser, M. Platter, M. Probst, S. Ring,
- E. Steiner, C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich,
- J. Wenninger, Institut f. Computersprachen - TU Wien
-
- This file is part of CACAO.
-
- 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., 51 Franklin Street, Fifth Floor, Boston, MA
- 02110-1301, USA.
-
- Contact: cacao@cacaojvm.org
-
- Authors: Reinhard Grafl
-
-
-*/
-
-
-#ifndef _TREE_H
-#define _TREE_H
-
-typedef int (*treeelementcomperator) (void *key, void * element);
-
-
-typedef struct treenode {
- struct treenode *left,*right;
- struct treenode *parent;
-
- void *element;
-} treenode;
-
-typedef struct {
- int usedump;
- treeelementcomperator comperator;
-
- treenode *top;
- treenode *active;
-} tree;
-
-
-/* function prototypes */
-
-tree *tree_new(treeelementcomperator comperator);
-tree *tree_dnew(treeelementcomperator comperator);
-void tree_free(tree *t);
-
-void tree_add(tree *t, void *element, void *key);
-void *tree_find(tree *t, void *key);
-
-void *tree_this(tree *t);
-void *tree_first(tree *t);
-void *tree_next(tree *t);
-
-#endif /* _TREE_H */
-
-
-/*
- * These are local overrides for various environment variables in Emacs.
- * Please do not remove this and leave it at the end of the file, where
- * Emacs will automagically detect them.
- * ---------------------------------------------------------------------
- * Local variables:
- * mode: c
- * indent-tabs-mode: t
- * c-basic-offset: 4
- * tab-width: 4
- * End:
- */