test_avl.c

来自「开放源码的编译器open watcom 1.6.0版的源代码」· C语言 代码 · 共 599 行 · 第 1/2 页

C
599 行
字号
12
//
// Copyright (C) 1991 Texas Instruments Incorporated.
//
// Permission is granted to any individual or institution to use, copy, modify,
// and distribute this software, provided that this complete copyright and
// permission notice is maintained, intact, in all copies and supporting
// documentation.
//
// Texas Instruments Incorporated provides this software "as is" without
// express or implied warranty.
//
// Updated: JAM 08/19/92 -- modernized template syntax, remove macro hacks

#include <cool/String.h>
#include <cool/AVL_Tree.h>
#include <cool/test.h>

#include <cool/Binary_Node.C>
#include <cool/Binary_Tree.C>
#include <cool/AVL_Tree.C>

void test_int_remove (CoolAVL_Tree<int>&);

void test_int_insert () {  
  CoolAVL_Tree<int> b0;
  CoolBinary_Node<int>* n0;

  TEST ("b0.put(8)", b0.put(8), TRUE);
  TEST ("b0.count() 1", b0.count(), 1);
  TEST ("b0.tree_depth() 0", b0.tree_depth(), 0);

  TEST ("b0.put(4)", b0.put(4), TRUE);
  TEST ("b0.count()", b0.count(), 2);
  TEST ("b0.tree_depth()", b0.tree_depth(), 1);

  TEST ("b0.put(10)", b0.put(10), TRUE);
  TEST ("b0.count()", b0.count(), 3);
  TEST ("b0.tree_depth()", b0.tree_depth(), 1);

  TEST ("b0.put(2)", b0.put(2), TRUE);
  TEST ("b0.count()", b0.count(), 4);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);

  TEST ("b0.put(6)", b0.put(6), TRUE);
  TEST ("b0.count()", b0.count(), 5);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);

  TEST ("b0.put(5)", b0.put(5), TRUE);
  TEST ("b0.count()", b0.count(), 6);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.get_root()->get()",b0.get_root()->get(), 6);
  TEST ("b0.find(4)", b0.find(4), TRUE);
  TEST ("(b0.node() == b0.get_root()->get_ltree())",
         (b0.node() == b0.get_root()->get_ltree()), TRUE);
  TEST ("b0.find(8)", b0.find(8), TRUE);
  TEST ("(b0.node() == b0.get_root()->get_rtree())",
         (b0.node() == b0.get_root()->get_rtree()), TRUE);
  TEST ("b0.find(5)",b0.find(5),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(4),b0.node()->get_rtree()))",
         (n0 == (b0.find(4),b0.node()->get_rtree())), TRUE);

  TEST ("b0.put(9)", b0.put(9), TRUE);
  TEST ("b0.count()", b0.count(), 7);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.find(9)", b0.find(9), TRUE);
  TEST ("(b0.node() == b0.get_root()->get_rtree())",
         (b0.node() == b0.get_root()->get_rtree()), TRUE);
  TEST ("(b0.find(8),b0.node()->is_leaf())",
         (b0.find(8),b0.node()->is_leaf()),TRUE);
  TEST ("(b0.find(10),b0.node()->is_leaf())",
         (b0.find(10),b0.node()->is_leaf()),TRUE);

  TEST ("b0.put(1)", b0.put(1), TRUE);
  TEST ("b0.count()", b0.count(), 8);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);

  TEST ("b0.put(0)", b0.put(0), TRUE);
  TEST ("b0.count()", b0.count(), 9);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.find(1)",b0.find(1),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(4),b0.node()->get_ltree()))",
        (n0 == (b0.find(4),b0.node()->get_ltree())), TRUE);
  TEST ("(b0.find(0),b0.node()->is_leaf())",
         (b0.find(0),b0.node()->is_leaf()),TRUE);
  TEST ("(b0.find(2),b0.node()->is_leaf())",
         (b0.find(2),b0.node()->is_leaf()),TRUE);
  

  TEST ("b0.put(11)", b0.put(11), TRUE);
  TEST ("b0.count()", b0.count(), 10);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);

  TEST ("b0.put(12)", b0.put(12), TRUE);
  TEST ("b0.count()", b0.count(), 11);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.find(11)",b0.find(11),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(9),b0.node()->get_rtree()))",
         (n0 == (b0.find(9),b0.node()->get_rtree())), TRUE);
  TEST ("(b0.find(8),b0.node()->is_leaf())",
         (b0.find(8),b0.node()->is_leaf()),TRUE);
  TEST ("(b0.find(10),b0.node()->is_leaf())",
         (b0.find(10),b0.node()->is_leaf()),TRUE);
  test_int_remove(b0);
}

void test_int_remove (CoolAVL_Tree<int>& b0) {
  CoolBinary_Node<int>* n0;

  TEST ("b0.remove(12)", b0.remove(12), TRUE);
  TEST ("b0.count()", b0.count(), 10);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);

  TEST ("b0.remove(8)", b0.remove(8), TRUE);
  TEST ("b0.count()", b0.count(), 9);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.find(10)",b0.find(10),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.get_root()->get_rtree()))",
         (n0 == (b0.get_root()->get_rtree())), TRUE);
  TEST ("(b0.find(9),b0.node()->is_leaf())",
         (b0.find(9),b0.node()->is_leaf()),TRUE);
  TEST ("(b0.find(11),b0.node()->is_leaf())",
         (b0.find(11),b0.node()->is_leaf()),TRUE);

  TEST ("b0.remove(1)", b0.remove(1), TRUE);
  TEST ("b0.count()", b0.count(), 8);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.find(0)",b0.find(0),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(4),b0.node()->get_ltree()))",
         (n0 == (b0.find(4),b0.node()->get_ltree())), TRUE);
  TEST ("b0.find(2)",b0.find(2),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(0),b0.node()->get_rtree()))",
         (n0 == (b0.find(0),b0.node()->get_rtree())), TRUE);


  TEST ("b0.remove(5)", b0.remove(5), TRUE);
  TEST ("b0.count()", b0.count(), 7);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.find(2)",b0.find(2),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(6),b0.node()->get_ltree()))",
         (n0 == (b0.find(6),b0.node()->get_ltree())), TRUE);
  TEST ("b0.find(4)",b0.find(4),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(2),b0.node()->get_rtree()))",
         (n0 == (b0.find(2),b0.node()->get_rtree())), TRUE);

  TEST ("b0.remove(9)", b0.remove(9), TRUE);
  TEST ("b0.count()", b0.count(), 6);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);

  TEST ("b0.remove(6)", b0.remove(6), TRUE);
  TEST ("b0.count()", b0.count(), 5);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.get_root()->get()",b0.get_root()->get(), 4);
  TEST ("b0.find(2)",b0.find(2),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(4),b0.node()->get_ltree()))",
         (n0 == (b0.find(4),b0.node()->get_ltree())), TRUE);
  TEST ("b0.find(10)",b0.find(10),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(4),b0.node()->get_rtree()))",
         (n0 == (b0.find(4),b0.node()->get_rtree())), TRUE);

  TEST ("b0.remove(4)", b0.remove(4), TRUE);
  TEST ("b0.count()", b0.count(), 4);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.get_root()->get()",b0.get_root()->get(), 2);
  TEST ("b0.find(0)",b0.find(0),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(2),b0.node()->get_ltree()))",
         (n0 == (b0.find(2),b0.node()->get_ltree())), TRUE);

  TEST ("b0.remove(11)", b0.remove(11), TRUE);
  TEST ("b0.count()", b0.count(), 3);
  TEST ("b0.tree_depth()", b0.tree_depth(), 1);

  TEST ("b0.remove(2)", b0.remove(2), TRUE);
  TEST ("b0.count()", b0.count(), 2);
  TEST ("b0.tree_depth()", b0.tree_depth(), 1);
  TEST ("b0.get_root()->get()",b0.get_root()->get(), 0);
  TEST ("b0.find(10)",b0.find(10),TRUE);
  n0 = b0.node();
  TEST ("(n0 == (b0.find(0),b0.node()->get_rtree()))",
         (n0 == (b0.find(0),b0.node()->get_rtree())), TRUE);

  TEST ("b0.remove(0)", b0.remove(0), TRUE);
  TEST ("b0.count() 1", b0.count(), 1);
  TEST ("b0.tree_depth() 0", b0.tree_depth(), 0);
  TEST ("b0.get_root()->get()",b0.get_root()->get(), 10);

  TEST ("b0.remove(10)", b0.remove(10), TRUE);
  TEST ("b0.count() 1", b0.count(), 0);
  TEST ("b0.tree_depth() 0", b0.tree_depth(), 0);
}

void test_int_convert () {
  CoolBinary_Tree<int> bt0;
  bt0.put(1),bt0.put(2),bt0.put(3),bt0.put(4),bt0.put(5),bt0.put(6),bt0.put(7);
  TEST ("bt0.count()",bt0.count(),7);
  TEST ("bt0.tree_depth()",bt0.tree_depth(),6);
  CoolAVL_Tree<int> avl0(bt0);
  TEST ("avl0.count()", avl0.count(), 7);
  TEST ("avl0.tree_depth()", avl0.tree_depth(), 2);
  TEST ("avl0.put(9),avl0.put(8)", (avl0.put(9), avl0.put(8)), TRUE);
  TEST ("avl0.tree_depth()", avl0.tree_depth(), 3);
  TEST ("avl0=bt0,avl.count()", (avl0=bt0, avl0.count()), 7);
  TEST ("avl0.tree_depth()", avl0.tree_depth(), 2);
  TEST ("avl0.put(9),avl0.put(8)", (avl0.put(9), avl0.put(8)), TRUE);
  TEST ("avl0.tree_depth()", avl0.tree_depth(), 3);
  TEST ("avl0.clear(),bo.count()", (avl0.clear(), avl0.count()), 0);
}

void test_int () {
  CoolAVL_Tree<int> b0;
  TEST ("CoolAVL_Tree<int> b0", b0.count(), 0);
  TEST ("b0.put(1)", b0.put(1), TRUE);
  TEST ("b0.count()", b0.count(), 1);
  TEST ("b0.find(1)", b0.find(1), TRUE);
  TEST ("b0.value()", b0.value(), 1);
  TEST ("b0.remove()", b0.remove(), TRUE);
  TEST ("b0.count()", b0.count(), 0); 
  TEST ("b0.put(4)", b0.put(4), TRUE);
  TEST ("b0.count()", b0.count(), 1);
  TEST ("b0.tree_depth()", b0.tree_depth(), 0);
  TEST ("b0.put(8)", b0.put(8), TRUE);
  TEST ("b0.count()", b0.count(), 2);
  TEST ("b0.tree_depth()", b0.tree_depth(), 1);
  TEST ("b0.put(3)", b0.put(3), TRUE);
  TEST ("b0.count()", b0.count(), 3);
  TEST ("b0.tree_depth()", b0.tree_depth(), 1);
  TEST ("b0.put(1)", b0.put(1), TRUE);
  TEST ("b0.count()", b0.count(), 4);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.put(2)", b0.put(2), TRUE);
  TEST ("b0.count()", b0.count(), 5);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.put(6)", b0.put(6), TRUE);
  TEST ("b0.count()", b0.count(), 6);
  TEST ("b0.find(2)", b0.find(2), TRUE);
  TEST ("b0.value()", b0.value(), 2);
  TEST ("b0.reset()", (b0.reset(), 1), 1);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 1);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 2);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 3);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 4);
  TEST ("b0.prev()", b0.prev(), TRUE);
  TEST ("b0.value()", b0.value(), 3);
  TEST ("b0.prev()", b0.prev(), TRUE);
  TEST ("b0.value()", b0.value(), 2);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 3);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 4);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 6);
  TEST ("b0.next()", b0.next(), TRUE);
  TEST ("b0.value()", b0.value(), 8);
  TEST ("b0.count()", b0.count(), 6);
  TEST ("b0.find(99)", b0.find(99), FALSE);
  CoolAVL_Tree<int> b1(b0);
  TEST ("CoolAVL_Tree<int> b1(b0)", b1.count(), 6);
  TEST ("b1.remove(3)", b1.remove(3), TRUE);
  TEST ("b1.count()", b1.count(), 5);
  TEST ("b1.find(3)", b1.find(3), FALSE);
  TEST ("b0.remove(3)", b0.remove(3), TRUE);
  TEST ("b0.count()", b0.count(), 5);
  TEST ("b0.find(3)", b0.find(3), FALSE);
  TEST ("b0.put(-3)", b0.put(-3), TRUE);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.count()", b0.count(), 6);
  TEST ("b0.put(18)", b0.put(18), TRUE);
  TEST ("b0.tree_depth()", b0.tree_depth(), 2);
  TEST ("b0.count()", b0.count(), 7);
  TEST ("b0.put(13)", b0.put(13), TRUE);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.count()", b0.count(), 8);
  TEST ("b0.put(1)", b0.put(1), FALSE);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.count()", b0.count(), 8);
  TEST ("b0.put(5)", b0.put(5), TRUE);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.count()", b0.count(), 9);
  TEST ("b0.put(17)", b0.put(17), TRUE);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.count()", b0.count(), 10);
  TEST ("b0.put(3)", b0.put(3), TRUE);
  TEST ("b0.tree_depth()", b0.tree_depth(), 3);
  TEST ("b0.count()", b0.count(), 11);
  TEST ("b0.find(3)", b0.find(3), TRUE);
  TEST ("b0.find(8)", b0.find(8), TRUE);
12

test_avl.c - 源码说明

本页面展示了「开放源码的编译器open watcom 1.6.0版的源代码」中的 test_avl.c 源码文件，采用 C语言 编程语言编写，共 599 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与watcom相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?