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_AVLSET_H
23 #define _AAPL_AVLSET_H
34 * \brief Key-only oriented tree.
36 * AvlSet stores only keys in elements that are managed by the tree. AvlSet
37 * requires that a Key type and a class containing a compare() routine
38 * for Key be given. Items are inserted with just a key value.
40 * AvlSet assumes all elements in the tree are allocated on the heap and are
41 * to be managed by the tree. This means that the class destructor will delete
42 * the contents of the tree. A deep copy will cause existing elements to be
45 * \include ex_avlset.cpp
51 #define BASE_EL(name) name
52 #define BASEKEY(name) name
53 #define AVLMEL_CLASSDEF class Key, class Compare = CmpOrd<Key>
54 #define AVLMEL_TEMPDEF class Key, class Compare
55 #define AVLMEL_TEMPUSE Key, Compare
56 #define AvlTree AvlSet
57 #define Element AvlSetEl<Key>
59 #include "avlcommon.h"
64 #undef AVLMEL_CLASSDEF
70 #endif /* _AAPL_AVLSET_H */