snapshot of project "lynx", label v2-8-2dev_20

1 files changed, 7 insertions, 16 deletions

diff --git a/WWW/Library/Implementation/HTBTree.h b/WWW/Library/Implementation/HTBTree.h
index 6facd048..7cf5ea84 100644
--- a/WWW/Library/Implementation/HTBTree.h
+++ b/WWW/Library/Implementation/HTBTree.h
@@ -1,28 +1,19 @@
 /*                  /Net/dxcern/userd/timbl/hypertext/WWW/Library/Implementation/HTBTree.html
                          BALANCED BINARY TREE FOR SORTING THINGS
-                                             
+
    Tree creation, traversal and freeing.  User-supplied comparison routine.
-   
+
    Author: Arthur Secret, CERN. Public domain.  Please mail bugs and changes to
    www-request@info.cern.ch
-   
+
    part of libWWW
-   
+
  */
 #ifndef HTBTREE_H
 #define HTBTREE_H 1
 
 #include <HTUtils.h>
 
-#ifdef SHORT_NAMES
-#define HTBTree_new             HTBTNew
-#define HTBTree_free            HTBTFree
-#define HTBTreeAndObject_free   HTBTAOFr
-#define HTBTree_add             HTBTAdd
-#define HTBTree_next            HTBTNext
-/* #define      HTBTree_object          HTBTObje already a macro */
-#endif
-
 
 /*
 
@@ -95,12 +86,12 @@ Find user object for element
 Find next element in depth-first order
 
   ON ENTRY,
-  
+
   ele                    if NULL, start with leftmost element. if != 0 give next object to
                          the right.
-                         
+
   returns                Pointer to element ot NULL if none left.
-                         
+
  */
 extern HTBTElement * HTBTree_next PARAMS((HTBTree* tree, HTBTElement * ele));