mirror of
https://github.com/alliedmodders/amxmodx.git
synced 2024-12-29 16:25:35 +03:00
85 lines
2.7 KiB
C
85 lines
2.7 KiB
C
|
/* Copyright (C) 2000 MySQL AB
|
||
|
|
|
||
|
|
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
|
||
|
|
|
||
|
|
#ifndef _tree_h
|
||
|
|
#define _tree_h
|
||
|
|
#ifdef __cplusplus
|
||
|
|
extern "C" {
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#define MAX_TREE_HIGHT 40 /* = max 1048576 leafs in tree */
|
||
|
|
#define ELEMENT_KEY(tree,element)\
|
||
|
|
(tree->offset_to_key ? (void*)((byte*) element+tree->offset_to_key) :\
|
||
|
|
*((void**) (element+1)))
|
||
|
|
|
||
|
|
#define tree_set_pointer(element,ptr) *((byte **) (element+1))=((byte*) (ptr))
|
||
|
|
|
||
|
|
typedef enum { left_root_right, right_root_left } TREE_WALK;
|
||
|
|
typedef uint32 element_count;
|
||
|
|
typedef int (*tree_walk_action)(void *,element_count,void *);
|
||
|
|
|
||
|
|
typedef enum { free_init, free_free, free_end } TREE_FREE;
|
||
|
|
typedef void (*tree_element_free)(void*, TREE_FREE, void *);
|
||
|
|
|
||
|
|
#ifdef MSDOS
|
||
|
|
typedef struct st_tree_element {
|
||
|
|
struct st_tree_element *left,*right;
|
||
|
|
unsigned long count;
|
||
|
|
uchar colour; /* black is marked as 1 */
|
||
|
|
} TREE_ELEMENT;
|
||
|
|
#else
|
||
|
|
typedef struct st_tree_element {
|
||
|
|
struct st_tree_element *left,*right;
|
||
|
|
uint32 count:31,
|
||
|
|
colour:1; /* black is marked as 1 */
|
||
|
|
} TREE_ELEMENT;
|
||
|
|
#endif /* MSDOS */
|
||
|
|
|
||
|
|
typedef struct st_tree {
|
||
|
|
TREE_ELEMENT *root,null_element;
|
||
|
|
TREE_ELEMENT **parents[MAX_TREE_HIGHT];
|
||
|
|
uint offset_to_key,elements_in_tree,size_of_element,memory_limit,allocated;
|
||
|
|
qsort_cmp2 compare;
|
||
|
|
void* custom_arg;
|
||
|
|
MEM_ROOT mem_root;
|
||
|
|
my_bool with_delete;
|
||
|
|
tree_element_free free;
|
||
|
|
} TREE;
|
||
|
|
|
||
|
|
/* Functions on whole tree */
|
||
|
|
void init_tree(TREE *tree, uint default_alloc_size, uint memory_limit,
|
||
|
|
int size, qsort_cmp2 compare, my_bool with_delete,
|
||
|
|
tree_element_free free_element, void *custom_arg);
|
||
|
|
void delete_tree(TREE*);
|
||
|
|
void reset_tree(TREE*);
|
||
|
|
/* similar to delete tree, except we do not my_free() blocks in mem_root
|
||
|
|
*/
|
||
|
|
#define is_tree_inited(tree) ((tree)->root != 0)
|
||
|
|
|
||
|
|
/* Functions on leafs */
|
||
|
|
TREE_ELEMENT *tree_insert(TREE *tree,void *key,uint key_size);
|
||
|
|
void *tree_search(TREE *tree,void *key);
|
||
|
|
int tree_walk(TREE *tree,tree_walk_action action,
|
||
|
|
void *argument, TREE_WALK visit);
|
||
|
|
int tree_delete(TREE *tree,void *key);
|
||
|
|
|
||
|
|
#define TREE_ELEMENT_EXTRA_SIZE (sizeof(TREE_ELEMENT) + sizeof(void*))
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
#endif
|