LIBOBJS = $(call objify, $(LIBSRCS))
DEPOBJS += $(LIBOBJS)
-LIBSRCS += bstree.c
+LIBSRCS += bst.c
TREES =
LIBSRCS += $(foreach t,$(TREES), $($t_LIBSRCS))
COMMON_TESTS = test-simple
TREES += avl
-avl_LIBSRCS = avltree.c
+avl_LIBSRCS = avl.c
avl_DEFINES = -DTREE=AVL
avl_TESTS = avltest avlregress
TREES += rb
-rb_LIBSRCS = rbtree.c
+rb_LIBSRCS = rb.c
rb_DEFINES = -DTREE=RB
rb_TESTS = rbtest rbregress
#include <stdio.h>
#include "internal.h"
-#include "avltree.h"
+#include "avl.h"
/* Combinatorial logic for balance-annotation adjustments. */
#define REBAL_EEL(bal) ((bal) >> 1)
-#ifndef XYLA_AVLTREE_H
-#define XYLA_AVLTREE_H
+#ifndef AVL_H
+#define AVL_H
#include <limits.h>
-#include "bstree.h"
+#include "bst.h"
struct avlnode {
struct bstnode _bst;
#include <assert.h>
-#include "bstree.h"
+#include "bst.h"
/* --- @bstree_chkorder@ --- *
*
-#ifndef XYLA_BSTREE_H
-#define XYLA_BSTREE_H
+#ifndef BST_H
+#define BST_H
#include <stdio.h>
#include <stdio.h>
#include "internal.h"
-#include "rbtree.h"
+#include "rb.h"
/* --- @check_recurse@ --- *
*
-#ifndef XYLA_RBTREE_H
-#define XYLA_RBTREE_H
+#ifndef RB_H
+#define RB_H
#include <limits.h>
-#include "bstree.h"
+#include "bst.h"
struct rbnode {
struct bstnode _bst;
#define TREAP 4
#if TREE == AVL
-# include "avltree.h"
+# include "avl.h"
# define NODE avlnode
# define PATH avlpath
# define ITER avliter
# define TREE_UNISECT avltree_unisect
# define TREE_DIFFSECT avltree_diffsect
#elif TREE == RB
-# include "rbtree.h"
+# include "rb.h"
# define NODE rbnode
# define PATH rbpath
# define ITER rbiter
# define TREE_UNISECT rbtree_unisect
# define TREE_DIFFSECT rbtree_diffsect
#elif TREE == SPLAY
-# include "splaytree.h"
+# include "splay.h"
#elif TREE == TREAP
# include "treap.h"
#else