2 * Copyright 2002 Adrian Thurston <thurston@cs.queensu.ca>
5 /* This file is part of Aapl.
7 * Aapl is free software; you can redistribute it and/or modify it under the
8 * terms of the GNU Lesser General Public License as published by the Free
9 * Software Foundation; either version 2.1 of the License, or (at your option)
12 * Aapl is distributed in the hope that it will be useful, but WITHOUT ANY
13 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
14 * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
17 * You should have received a copy of the GNU Lesser General Public License
18 * along with Aapl; if not, write to the Free Software Foundation, Inc., 59
19 * Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 #ifndef _AAPL_AVLIBASIC_H
23 #define _AAPL_AVLIBASIC_H
28 * \addtogroup avlitree
34 * \brief Linked AVL Tree in which the entire element structure is the key.
36 * AvliBasic is a linked AVL tree that does not distinguish between the
37 * element that it contains and the key. The entire element structure is the
38 * key that is used to compare the relative ordering of elements. This is
39 * similar to the BstSet structure.
41 * AvliBasic does not assume ownership of elements in the tree. Items must be
42 * explicitly de-allocated.
47 #define BASE_EL(name) name
48 #define BASEKEY(name) name
49 #define AVLMEL_CLASSDEF class Element, class Compare
50 #define AVLMEL_TEMPDEF class Element, class Compare
51 #define AVLMEL_TEMPUSE Element, Compare
52 #define AvlTree AvliBasic
56 #include "avlcommon.h"
60 #undef AVLMEL_CLASSDEF
67 #endif /* _AAPL_AVLIBASIC_H */