diff options
author | Adrian Thurston <thurston@colm.net> | 2018-05-23 10:15:10 +0200 |
---|---|---|
committer | Adrian Thurston <thurston@colm.net> | 2018-05-23 10:15:10 +0200 |
commit | 75ea06cbf7c922c0bdbc717c2bb7882f06e7ac68 (patch) | |
tree | 2918ff41fa378b9ab06d67477824e5ec1e7e0668 /test/rlparse.d/avlmel.h | |
parent | b5e6ba2c784d818c53c2a64af64a466865174c81 (diff) | |
download | colm-75ea06cbf7c922c0bdbc717c2bb7882f06e7ac68.tar.gz |
removed test case directory
tests now maintained outside of code repository
Diffstat (limited to 'test/rlparse.d/avlmel.h')
-rw-r--r-- | test/rlparse.d/avlmel.h | 74 |
1 files changed, 0 insertions, 74 deletions
diff --git a/test/rlparse.d/avlmel.h b/test/rlparse.d/avlmel.h deleted file mode 100644 index 6d0deb7d..00000000 --- a/test/rlparse.d/avlmel.h +++ /dev/null @@ -1,74 +0,0 @@ -/* - * 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_AVLMEL_H -#define _AAPL_AVLMEL_H - -#include "compare.h" - -/** - * \addtogroup avltree - * @{ - */ - -/** - * \class AvlMel - * \brief AVL tree for elements appearing in multiple trees. - * - * AvlMel allows for an element to simultaneously be in multiple trees without - * the trees interferring with one another. For each tree that the element is - * to appear in, there must be a distinct set of AVL Tree management data that - * can be unambiguously referenced with some base class name. This name - * is passed to the tree as a template parameter and is used in the tree - * algorithms. - * - * The element must use the same key type and value in each tree that it - * appears in. If distinct keys are required, the AvlMelKey structure is - * available. - * - * AvlMel 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_avlmel.cpp - */ - -/*@}*/ - -#define BASE_EL(name) BaseEl::name -#define BASEKEY(name) name -#define AVLMEL_CLASSDEF class Element, class Key, \ - class BaseEl, class Compare = CmpOrd<Key> -#define AVLMEL_TEMPDEF class Element, class Key, \ - class BaseEl, class Compare -#define AVLMEL_TEMPUSE Element, Key, BaseEl, Compare -#define AvlTree AvlMel - -#include "avlcommon.h" - -#undef BASE_EL -#undef BASEKEY -#undef AVLMEL_CLASSDEF -#undef AVLMEL_TEMPDEF -#undef AVLMEL_TEMPUSE -#undef AvlTree - -#endif /* _AAPL_AVLMEL_H */ |