File: avl.h

package info (click to toggle)
chpp 0.3.4-1
  • links: PTS
  • area: main
  • in suites: potato
  • size: 3,228 kB
  • ctags: 5,154
  • sloc: ansic: 30,186; cpp: 575; sh: 500; makefile: 314; yacc: 265; asm: 261; lex: 64
file content (68 lines) | stat: -rw-r--r-- 1,984 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/* -*- c -*- */

/*
 * avl.h
 *
 * chpp
 *
 * Copyright (C) 1994-1998 Mark Probst
 *
 * 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, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

#ifndef __AVL_H__
#define __AVL_H__

typedef struct _avlNode
{
  void *key;
  int balance;
  unsigned int rank;
  struct _avlNode *up;
  struct _avlNode *left;
  struct _avlNode *right;
} avlNode;

typedef struct
{
  avlNode *head;
  unsigned int numElements;
  int isSorted;
  int (*compare) (void*, void*);
} avlTree;

#define AVL_LINK(a,N)            (((a) == -1) ? (N)->left : (N)->right)
#define AVL_LINK_SET(s,P,V)      ((((s) == -1) ? (P)->left : (P)->right) = (V))

int avlCompare (avlTree*, void*, unsigned int, avlNode*);
int avlBalance (avlNode*, int, avlNode**);
avlTree* avlNew (void);
avlTree* avlNewSorted (int (*) (void*, void*));
void avlInsert (avlTree*, void*, unsigned int);
void avlPut (avlTree*, void*);
avlNode* avlFirst (avlTree*, unsigned int);
avlNode* avlSearch (avlTree*, void*);
unsigned int avlGetPos (avlTree*, void*);
avlNode* avlNext (avlNode*);
avlNode* avlPrevious (avlNode*);
void avlDeleteNode (avlTree*, avlNode*, int);
void* avlDelete (avlTree*, unsigned int);
void* avlKey (avlNode*);
void* avlGet (avlTree*, unsigned int);
unsigned int avlNumElements (avlTree*);
int avlIsEmpty (avlTree*);
int avlBalanced (avlNode*, unsigned int*, unsigned int*);

#endif