The R Project SVN R-packages

/* libavl - manipulates AVL trees.
   Copyright (C) 1998-9, 2000 Free Software Foundation, Inc.
   Written by Ben Pfaff <blp@gnu.org>.
   Modified for R foreign library by Saikat DebRoy <saikat@stat.wisc.edu>.

   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, a copy is available at
   http://www.r-project.org/Licenses/
*/

/* This is file avl.h in libavl, version 1.1.0. */

#if !avl_h
#define avl_h 1

/* This stack size allows for AVL trees for between 5,704,880 and
   4,294,967,295 nodes, depending on order of insertion.  If you
   increase this it will require recoding some functions that assume
   one long is big enough for a bitmap. */
#ifndef AVL_MAX_HEIGHT
#define AVL_MAX_HEIGHT  32
#endif

/* Structure for a node in an AVL tree. */
typedef struct avl_node
  {
    void *data;         /* Pointer to data. */
    struct avl_node *link[2];   /* Subtrees. */
    signed char bal;        /* Balance factor. */
    char cache;         /* Used during insertion. */
    signed char pad[2];     /* Unused.  Reserved for threaded trees. */
  }
avl_node;

/* Used for traversing an AVL tree. */
typedef struct avl_traverser
  {
    int init;           /* Initialized? */
    int nstack;         /* Top of stack. */
    const avl_node *p;      /* Used for traversal. */
    const avl_node *stack[AVL_MAX_HEIGHT];/* Descended trees. */
  }
avl_traverser;

#define avl_traverser_init(TRAVERSER) (TRAVERSER).init = 0

/* Function types. */
#if !AVL_FUNC_TYPES
#define AVL_FUNC_TYPES 1
typedef int (*avl_comparison_func) (const void *a, const void *b, void *param);
typedef void (*avl_node_func) (void *data, void *param);
typedef void *(*avl_copy_func) (void *data, void *param);
#endif

/* Structure which holds information about an AVL tree. */
typedef struct avl_tree
  {
#if PSPP
    struct pool *pool;      /* Pool to store nodes. */
#endif
    avl_node root;      /* Tree root node. */
    avl_comparison_func cmp;    /* Used to compare keys. */
    int count;          /* Number of nodes in the tree. */
    void *param;        /* Arbitary user data. */
  }
avl_tree;

#if PSPP
#define MAYBE_POOL struct pool *pool,
#else
#define MAYBE_POOL /* nothing */
#endif

/* General functions. */
avl_tree *R_avl_create (MAYBE_POOL avl_comparison_func, void *param);
void R_avl_destroy (avl_tree *, avl_node_func);
void R_avl_free (avl_tree *);
int R_avl_count (const avl_tree *);
#ifdef UNUSED
avl_tree *R_avl_copy (MAYBE_POOL const avl_tree *, avl_copy_func);

/* Walk the tree. */
void R_avl_walk (const avl_tree *, avl_node_func, void *param);
void *R_avl_traverse (const avl_tree *, avl_traverser *);
#endif

/* Search for a given item. */
/* static void **R_avl_probe (avl_tree *, void *);
void *R_avl_delete (avl_tree *, const void *); */

void *R_avl_find (const avl_tree *, const void *);
void *R_avl_insert (avl_tree *tree, void *item);
void *R_avl_replace (avl_tree *tree, void *item);

#endif /* avl_h */