/* A splay-tree datatype.
|
/* A splay-tree datatype.
|
Copyright 1998, 1999, 2000, 2002, 2005, 2007, 2009
|
Copyright 1998, 1999, 2000, 2002, 2005, 2007, 2009
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
Contributed by Mark Mitchell (mark@markmitchell.com).
|
Contributed by Mark Mitchell (mark@markmitchell.com).
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it
|
GCC is free software; you can redistribute it and/or modify it
|
under the terms of the GNU General Public License as published by
|
under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 2, or (at your option)
|
the Free Software Foundation; either version 2, or (at your option)
|
any later version.
|
any later version.
|
|
|
GCC is distributed in the hope that it will be useful, but
|
GCC is distributed in the hope that it will be useful, but
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
General Public License for more details.
|
General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING. If not, write to
|
along with GCC; see the file COPYING. If not, write to
|
the Free Software Foundation, 51 Franklin Street - Fifth Floor,
|
the Free Software Foundation, 51 Franklin Street - Fifth Floor,
|
Boston, MA 02110-1301, USA. */
|
Boston, MA 02110-1301, USA. */
|
|
|
/* For an easily readable description of splay-trees, see:
|
/* For an easily readable description of splay-trees, see:
|
|
|
Lewis, Harry R. and Denenberg, Larry. Data Structures and Their
|
Lewis, Harry R. and Denenberg, Larry. Data Structures and Their
|
Algorithms. Harper-Collins, Inc. 1991.
|
Algorithms. Harper-Collins, Inc. 1991.
|
|
|
The major feature of splay trees is that all basic tree operations
|
The major feature of splay trees is that all basic tree operations
|
are amortized O(log n) time for a tree with n nodes. */
|
are amortized O(log n) time for a tree with n nodes. */
|
|
|
#ifndef _SPLAY_TREE_H
|
#ifndef _SPLAY_TREE_H
|
#define _SPLAY_TREE_H
|
#define _SPLAY_TREE_H
|
|
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
extern "C" {
|
extern "C" {
|
#endif /* __cplusplus */
|
#endif /* __cplusplus */
|
|
|
#include "ansidecl.h"
|
#include "ansidecl.h"
|
|
|
#ifndef _WIN64
|
#ifndef _WIN64
|
typedef unsigned long int libi_uhostptr_t;
|
typedef unsigned long int libi_uhostptr_t;
|
typedef long int libi_shostptr_t;
|
typedef long int libi_shostptr_t;
|
#else
|
#else
|
typedef unsigned long long libi_uhostptr_t;
|
typedef unsigned long long libi_uhostptr_t;
|
typedef long long libi_shostptr_t;
|
typedef long long libi_shostptr_t;
|
#endif
|
#endif
|
|
|
#ifndef GTY
|
#ifndef GTY
|
#define GTY(X)
|
#define GTY(X)
|
#endif
|
#endif
|
|
|
/* Use typedefs for the key and data types to facilitate changing
|
/* Use typedefs for the key and data types to facilitate changing
|
these types, if necessary. These types should be sufficiently wide
|
these types, if necessary. These types should be sufficiently wide
|
that any pointer or scalar can be cast to these types, and then
|
that any pointer or scalar can be cast to these types, and then
|
cast back, without loss of precision. */
|
cast back, without loss of precision. */
|
typedef libi_uhostptr_t splay_tree_key;
|
typedef libi_uhostptr_t splay_tree_key;
|
typedef libi_uhostptr_t splay_tree_value;
|
typedef libi_uhostptr_t splay_tree_value;
|
|
|
/* Forward declaration for a node in the tree. */
|
/* Forward declaration for a node in the tree. */
|
typedef struct splay_tree_node_s *splay_tree_node;
|
typedef struct splay_tree_node_s *splay_tree_node;
|
|
|
/* The type of a function which compares two splay-tree keys. The
|
/* The type of a function which compares two splay-tree keys. The
|
function should return values as for qsort. */
|
function should return values as for qsort. */
|
typedef int (*splay_tree_compare_fn) (splay_tree_key, splay_tree_key);
|
typedef int (*splay_tree_compare_fn) (splay_tree_key, splay_tree_key);
|
|
|
/* The type of a function used to deallocate any resources associated
|
/* The type of a function used to deallocate any resources associated
|
with the key. */
|
with the key. */
|
typedef void (*splay_tree_delete_key_fn) (splay_tree_key);
|
typedef void (*splay_tree_delete_key_fn) (splay_tree_key);
|
|
|
/* The type of a function used to deallocate any resources associated
|
/* The type of a function used to deallocate any resources associated
|
with the value. */
|
with the value. */
|
typedef void (*splay_tree_delete_value_fn) (splay_tree_value);
|
typedef void (*splay_tree_delete_value_fn) (splay_tree_value);
|
|
|
/* The type of a function used to iterate over the tree. */
|
/* The type of a function used to iterate over the tree. */
|
typedef int (*splay_tree_foreach_fn) (splay_tree_node, void*);
|
typedef int (*splay_tree_foreach_fn) (splay_tree_node, void*);
|
|
|
/* The type of a function used to allocate memory for tree root and
|
/* The type of a function used to allocate memory for tree root and
|
node structures. The first argument is the number of bytes needed;
|
node structures. The first argument is the number of bytes needed;
|
the second is a data pointer the splay tree functions pass through
|
the second is a data pointer the splay tree functions pass through
|
to the allocator. This function must never return zero. */
|
to the allocator. This function must never return zero. */
|
typedef void *(*splay_tree_allocate_fn) (int, void *);
|
typedef void *(*splay_tree_allocate_fn) (int, void *);
|
|
|
/* The type of a function used to free memory allocated using the
|
/* The type of a function used to free memory allocated using the
|
corresponding splay_tree_allocate_fn. The first argument is the
|
corresponding splay_tree_allocate_fn. The first argument is the
|
memory to be freed; the latter is a data pointer the splay tree
|
memory to be freed; the latter is a data pointer the splay tree
|
functions pass through to the freer. */
|
functions pass through to the freer. */
|
typedef void (*splay_tree_deallocate_fn) (void *, void *);
|
typedef void (*splay_tree_deallocate_fn) (void *, void *);
|
|
|
/* The nodes in the splay tree. */
|
/* The nodes in the splay tree. */
|
struct GTY(()) splay_tree_node_s {
|
struct GTY(()) splay_tree_node_s {
|
/* The key. */
|
/* The key. */
|
splay_tree_key GTY ((use_param1)) key;
|
splay_tree_key GTY ((use_param1)) key;
|
|
|
/* The value. */
|
/* The value. */
|
splay_tree_value GTY ((use_param2)) value;
|
splay_tree_value GTY ((use_param2)) value;
|
|
|
/* The left and right children, respectively. */
|
/* The left and right children, respectively. */
|
splay_tree_node GTY ((use_params)) left;
|
splay_tree_node GTY ((use_params)) left;
|
splay_tree_node GTY ((use_params)) right;
|
splay_tree_node GTY ((use_params)) right;
|
};
|
};
|
|
|
/* The splay tree itself. */
|
/* The splay tree itself. */
|
struct GTY(()) splay_tree_s {
|
struct GTY(()) splay_tree_s {
|
/* The root of the tree. */
|
/* The root of the tree. */
|
splay_tree_node GTY ((use_params)) root;
|
splay_tree_node GTY ((use_params)) root;
|
|
|
/* The comparision function. */
|
/* The comparision function. */
|
splay_tree_compare_fn comp;
|
splay_tree_compare_fn comp;
|
|
|
/* The deallocate-key function. NULL if no cleanup is necessary. */
|
/* The deallocate-key function. NULL if no cleanup is necessary. */
|
splay_tree_delete_key_fn delete_key;
|
splay_tree_delete_key_fn delete_key;
|
|
|
/* The deallocate-value function. NULL if no cleanup is necessary. */
|
/* The deallocate-value function. NULL if no cleanup is necessary. */
|
splay_tree_delete_value_fn delete_value;
|
splay_tree_delete_value_fn delete_value;
|
|
|
/* Allocate/free functions, and a data pointer to pass to them. */
|
/* Allocate/free functions, and a data pointer to pass to them. */
|
splay_tree_allocate_fn allocate;
|
splay_tree_allocate_fn allocate;
|
splay_tree_deallocate_fn deallocate;
|
splay_tree_deallocate_fn deallocate;
|
void * GTY((skip)) allocate_data;
|
void * GTY((skip)) allocate_data;
|
};
|
};
|
|
|
typedef struct splay_tree_s *splay_tree;
|
typedef struct splay_tree_s *splay_tree;
|
|
|
extern splay_tree splay_tree_new (splay_tree_compare_fn,
|
extern splay_tree splay_tree_new (splay_tree_compare_fn,
|
splay_tree_delete_key_fn,
|
splay_tree_delete_key_fn,
|
splay_tree_delete_value_fn);
|
splay_tree_delete_value_fn);
|
extern splay_tree splay_tree_new_with_allocator (splay_tree_compare_fn,
|
extern splay_tree splay_tree_new_with_allocator (splay_tree_compare_fn,
|
splay_tree_delete_key_fn,
|
splay_tree_delete_key_fn,
|
splay_tree_delete_value_fn,
|
splay_tree_delete_value_fn,
|
splay_tree_allocate_fn,
|
splay_tree_allocate_fn,
|
splay_tree_deallocate_fn,
|
splay_tree_deallocate_fn,
|
void *);
|
void *);
|
extern void splay_tree_delete (splay_tree);
|
extern void splay_tree_delete (splay_tree);
|
extern splay_tree_node splay_tree_insert (splay_tree,
|
extern splay_tree_node splay_tree_insert (splay_tree,
|
splay_tree_key,
|
splay_tree_key,
|
splay_tree_value);
|
splay_tree_value);
|
extern void splay_tree_remove (splay_tree, splay_tree_key);
|
extern void splay_tree_remove (splay_tree, splay_tree_key);
|
extern splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);
|
extern splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);
|
extern splay_tree_node splay_tree_predecessor (splay_tree, splay_tree_key);
|
extern splay_tree_node splay_tree_predecessor (splay_tree, splay_tree_key);
|
extern splay_tree_node splay_tree_successor (splay_tree, splay_tree_key);
|
extern splay_tree_node splay_tree_successor (splay_tree, splay_tree_key);
|
extern splay_tree_node splay_tree_max (splay_tree);
|
extern splay_tree_node splay_tree_max (splay_tree);
|
extern splay_tree_node splay_tree_min (splay_tree);
|
extern splay_tree_node splay_tree_min (splay_tree);
|
extern int splay_tree_foreach (splay_tree, splay_tree_foreach_fn, void*);
|
extern int splay_tree_foreach (splay_tree, splay_tree_foreach_fn, void*);
|
extern int splay_tree_compare_ints (splay_tree_key, splay_tree_key);
|
extern int splay_tree_compare_ints (splay_tree_key, splay_tree_key);
|
extern int splay_tree_compare_pointers (splay_tree_key, splay_tree_key);
|
extern int splay_tree_compare_pointers (splay_tree_key, splay_tree_key);
|
|
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
}
|
}
|
#endif /* __cplusplus */
|
#endif /* __cplusplus */
|
|
|
#endif /* _SPLAY_TREE_H */
|
#endif /* _SPLAY_TREE_H */
|
|
|
