psblas3/base/internals/avltree.h

/*
 *             Parallel Sparse BLAS  version 2.2
 *   (C) Copyright 2006/2007/2008 
 *                      Salvatore Filippone    University of Rome Tor Vergata
 *                      Alfredo Buttari        University of Rome Tor Vergata
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *   1. Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *   2. Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions, and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *   3. The name of the PSBLAS group or the names of its contributors may
 *      not be used to endorse or promote products derived from this
 *      software without specific written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS
 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 *
 */
/*   Type definitions for balanced AVL tree search and insertion */
/*   See avltree.c for a full definition of the subroutines      */
/*                                                               */

typedef struct avlnode *AVLNodePtr;
typedef struct avlnode {
  AVLNodePtr llink,rlink;
  int bal;
  void *key;
} AVLNode; 

typedef struct avltvect *AVLTVectPtr;

typedef struct avltree *AVLTreePtr;
typedef struct avltree {
  AVLTVectPtr first, current;
  AVLNodePtr root;
  int nnodes;
#ifdef PROFILE
  int nsteps;
#endif
} AVLTree;


AVLNodePtr AVLTreeSearch(AVLTreePtr, void *, int (*)(void *, void *));
AVLNodePtr GetAVLNode(AVLTreePtr);
int  AVLTreeInit(AVLTreePtr);
int  AVLTreeReInit(AVLTreePtr);
AVLTreePtr GetAVLTree();
int  AVLTreeInsert(AVLTreePtr, void *, int (*)(void *, void *),
                   void (*)(void *, void *, void *), void *);
AVLNodePtr AVLTreeUserInsert(AVLTreePtr, void *, int (*)(void *, void *));
void AVLTreeInorderTraverse(AVLTreePtr, void (*)(void *, void *), void *);
void AVLTreePreorderTraverse(AVLTreePtr, void (*)(void *, void *), void *);
void AVLTreeFree(AVLTreePtr, void (*)(void *));
int HowManyItems(AVLTreePtr);
int AVLTreeInorderTraverseWithDelims(AVLTreePtr,void*, void*, int (*)(void*,void*),
                                     void (*)(void *, void *), void *);