blob: 780ef07a9be4c15e6a776aca5c12a47228374e22 (
plain) (
blame)
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
|
/*
* Copyright 2002 Adrian Thurston <thurston@cs.queensu.ca>
*/
/* 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_AVLBASIC_H
#define _AAPL_AVLBASIC_H
#include "compare.h"
/**
* \addtogroup avltree
* @{
*/
/**
* \class AvlBasic
* \brief AVL Tree in which the entire element structure is the key.
*
* AvlBasic is an AVL tree that does not distinguish between the element that
* it contains and the key. The entire element structure is the key that is
* used to compare the relative ordering of elements. This is similar to the
* BstSet structure.
*
* AvlBasic does not assume ownership of elements in the tree. Items must be
* explicitly de-allocated.
*/
/*@}*/
#define BASE_EL(name) name
#define BASEKEY(name) name
#define AVLMEL_CLASSDEF class Element, class Compare
#define AVLMEL_TEMPDEF class Element, class Compare
#define AVLMEL_TEMPUSE Element, Compare
#define AvlTree AvlBasic
#define AVL_BASIC
#include "avlcommon.h"
#undef BASE_EL
#undef BASEKEY
#undef AVLMEL_CLASSDEF
#undef AVLMEL_TEMPDEF
#undef AVLMEL_TEMPUSE
#undef AvlTree
#undef AVL_BASIC
#endif /* _AAPL_AVLBASIC_H */
|
