]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blame - include/splay-tree.h
2002-02-21 Elena Zannoni <ezannoni@redhat.com>
[thirdparty/binutils-gdb.git] / include / splay-tree.h
CommitLineData
252b5132 1/* A splay-tree datatype.
4f1d9bd8 2 Copyright 1998, 1999, 2000 Free Software Foundation, Inc.
252b5132
RH
3 Contributed by Mark Mitchell (mark@markmitchell.com).
4
da4d4077 5This file is part of GCC.
252b5132 6
da4d4077 7GCC is free software; you can redistribute it and/or modify it
252b5132
RH
8under the terms of the GNU General Public License as published by
9the Free Software Foundation; either version 2, or (at your option)
10any later version.
11
da4d4077 12GCC is distributed in the hope that it will be useful, but
252b5132
RH
13WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15General Public License for more details.
16
17You should have received a copy of the GNU General Public License
da4d4077 18along with GCC; see the file COPYING. If not, write to
252b5132
RH
19the Free Software Foundation, 59 Temple Place - Suite 330,
20Boston, MA 02111-1307, USA. */
21
22/* For an easily readable description of splay-trees, see:
23
24 Lewis, Harry R. and Denenberg, Larry. Data Structures and Their
25 Algorithms. Harper-Collins, Inc. 1991.
26
27 The major feature of splay trees is that all basic tree operations
28 are amortized O(log n) time for a tree with n nodes. */
29
30#ifndef _SPLAY_TREE_H
31#define _SPLAY_TREE_H
32
33#ifdef __cplusplus
34extern "C" {
35#endif /* __cplusplus */
36
37#include <ansidecl.h>
38
39/* Use typedefs for the key and data types to facilitate changing
40 these types, if necessary. These types should be sufficiently wide
41 that any pointer or scalar can be cast to these types, and then
42 cast back, without loss of precision. */
43typedef unsigned long int splay_tree_key;
44typedef unsigned long int splay_tree_value;
45
46/* Forward declaration for a node in the tree. */
cc89ffe6 47typedef struct splay_tree_node_s *splay_tree_node;
252b5132
RH
48
49/* The type of a function which compares two splay-tree keys. The
50 function should return values as for qsort. */
51typedef int (*splay_tree_compare_fn) PARAMS((splay_tree_key, splay_tree_key));
52
53/* The type of a function used to deallocate any resources associated
54 with the key. */
55typedef void (*splay_tree_delete_key_fn) PARAMS((splay_tree_key));
56
57/* The type of a function used to deallocate any resources associated
58 with the value. */
59typedef void (*splay_tree_delete_value_fn) PARAMS((splay_tree_value));
60
61/* The type of a function used to iterate over the tree. */
62typedef int (*splay_tree_foreach_fn) PARAMS((splay_tree_node, void*));
63
64/* The nodes in the splay tree. */
cc89ffe6 65struct splay_tree_node_s
252b5132
RH
66{
67 /* The key. */
68 splay_tree_key key;
69
70 /* The value. */
71 splay_tree_value value;
72
73 /* The left and right children, respectively. */
74 splay_tree_node left;
75 splay_tree_node right;
76};
77
78/* The splay tree itself. */
cc89ffe6 79typedef struct splay_tree_s
252b5132
RH
80{
81 /* The root of the tree. */
82 splay_tree_node root;
83
84 /* The comparision function. */
85 splay_tree_compare_fn comp;
86
87 /* The deallocate-key function. NULL if no cleanup is necessary. */
88 splay_tree_delete_key_fn delete_key;
89
90 /* The deallocate-value function. NULL if no cleanup is necessary. */
91 splay_tree_delete_value_fn delete_value;
92} *splay_tree;
93
94extern splay_tree splay_tree_new PARAMS((splay_tree_compare_fn,
95 splay_tree_delete_key_fn,
96 splay_tree_delete_value_fn));
97extern void splay_tree_delete PARAMS((splay_tree));
cc89ffe6
ILT
98extern splay_tree_node splay_tree_insert
99 PARAMS((splay_tree,
252b5132
RH
100 splay_tree_key,
101 splay_tree_value));
2664c1f9
RH
102extern void splay_tree_remove PARAMS((splay_tree,
103 splay_tree_key));
252b5132
RH
104extern splay_tree_node splay_tree_lookup
105 PARAMS((splay_tree,
106 splay_tree_key));
74bcd529
DD
107extern splay_tree_node splay_tree_predecessor
108 PARAMS((splay_tree,
109 splay_tree_key));
110extern splay_tree_node splay_tree_successor
111 PARAMS((splay_tree,
112 splay_tree_key));
e00bc6a7
DD
113extern splay_tree_node splay_tree_max
114 PARAMS((splay_tree));
115extern splay_tree_node splay_tree_min
116 PARAMS((splay_tree));
252b5132
RH
117extern int splay_tree_foreach PARAMS((splay_tree,
118 splay_tree_foreach_fn,
119 void*));
120extern int splay_tree_compare_ints PARAMS((splay_tree_key,
121 splay_tree_key));
122extern int splay_tree_compare_pointers PARAMS((splay_tree_key,
123 splay_tree_key));
124
125#ifdef __cplusplus
126}
127#endif /* __cplusplus */
128
129#endif /* _SPLAY_TREE_H */