removed test case directory

tests now maintained outside of code repository

1 files changed, 0 insertions, 79 deletions

diff --git a/test/rlparse.d/avlimel.h b/test/rlparse.d/avlimel.h
deleted file mode 100644
index bceddcd4..00000000
--- a/test/rlparse.d/avlimel.h
+++ /dev/null
@@ -1,79 +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_AVLIMEL_H
-#define _AAPL_AVLIMEL_H
-
-#include "compare.h"
-#include "dlistmel.h"
-
-/**
- * \addtogroup avlitree 
- * @{
- */
-
-/**
- * \class AvliMel
- * \brief Linked AVL tree for element appearing in multiple trees.
- *
- * AvliMel 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 AvliMelKey structure is
- * available.
- *
- * AvliMel 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_avlimel.cpp
- */
-
-/*@}*/
-
-#define BASE_EL(name) BaseEl::name
-#define BASEKEY(name) name
-#define BASELIST DListMel< Element, BaseEl >
-#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 AvliMel
-#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_AVLIMEL_H */