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
69
70
71
72
73
74
75
76
77
78
|
/*
* Copyright 2002 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Aapl.
*
* Aapl is free software; you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License as published by the Free
* Software Foundation; either version 2.1 of the License, or (at your option)
* any later version.
*
* Aapl 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 Lesser General Public License for
* more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Aapl; if not, write to the Free Software Foundation, Inc., 59
* Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _AAPL_AVLITREE_H
#define _AAPL_AVLITREE_H
#include "compare.h"
#include "dlistmel.h"
/**
* \addtogroup avlitree
* @{
*/
/**
* \class AvliTree
* \brief Linked AVL tree.
*
* AvliTree is the standard linked by-structure AVL tree. To use this
* structure the user must define an element type and give it the necessary
* properties. At the very least it must have a getKey() function that will be
* used to compare the relative ordering of elements and tree management data
* necessary for the AVL algorithm. An element type can acquire the management
* data by inheriting the AvliTreeEl class.
*
* AvliTree does not presume to manage the allocation of elements in the tree.
* The destructor will not delete the items in the tree, instead the elements
* must be explicitly de-allocated by the user if necessary and when it is
* safe to do so. The empty() routine will traverse the tree and delete all
* items.
*
* Since the tree does not manage the elements, it can contain elements that
* are allocated statically or that are part of another data structure.
*
* \include ex_avlitree.cpp
*/
/*@}*/
#define BASE_EL(name) name
#define BASEKEY(name) name
#define BASELIST DListMel< Element, AvliTreeEl<Element> >
#define AVLMEL_CLASSDEF class Element, class Key, class Compare = CmpOrd<Key>
#define AVLMEL_TEMPDEF class Element, class Key, class Compare
#define AVLMEL_TEMPUSE Element, Key, Compare
#define AvlTree AvliTree
#define WALKABLE
#include "avlcommon.h"
#undef BASE_EL
#undef BASEKEY
#undef BASELIST
#undef AVLMEL_CLASSDEF
#undef AVLMEL_TEMPDEF
#undef AVLMEL_TEMPUSE
#undef AvlTree
#undef WALKABLE
#endif /* _AAPL_AVLITREE_H */
|
