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
|
/*
* 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_AVLIMELKEY_H
#define _AAPL_AVLIMELKEY_H
#include "compare.h"
#include "dlistmel.h"
/**
* \addtogroup avlitree
* @{
*/
/**
* \class AvliMelKey
* \brief Linked AVL tree for element appearing in multiple trees with different keys.
*
* AvliMelKey is similar to AvliMel, except that an additional template
* parameter, BaseKey, is provided for resolving ambiguous references to
* getKey(). This means that if an element is stored in multiple trees, each
* tree can use a different key for ordering the elements in it. Using
* AvliMelKey an array of data structures can be indexed with an O(log(n))
* search on two or more of the values contained within it and without
* allocating any additional data.
*
* AvliMelKey does not assume ownership of elements in the tree. The destructor
* will not delete the elements. If the user wishes to explicitly deallocate
* all the items in the tree the empty() routine is available.
*
* \include ex_avlimelkey.cpp
*/
/*@}*/
#define BASE_EL(name) BaseEl::name
#define BASEKEY(name) BaseKey::name
#define BASELIST DListMel< Element, BaseEl >
#define AVLMEL_CLASSDEF class Element, class Key, class BaseEl, \
class BaseKey, class Compare = CmpOrd<Key>
#define AVLMEL_TEMPDEF class Element, class Key, class BaseEl, \
class BaseKey, class Compare
#define AVLMEL_TEMPUSE Element, Key, BaseEl, BaseKey, Compare
#define AvlTree AvliMelKey
#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_AVLIMELKEY_H */
|
