1 /*****************************************************************************\
3 * Name : test_symbol_tree *
4 * Author : Chris Koeritz *
8 * Creates a symbol_tree and performs some operations on it to assure *
9 * basic functionality. *
11 *******************************************************************************
12 * Copyright (c) 1992-$now By Author. This program is free software; you can *
13 * redistribute it and/or modify it under the terms of the GNU General Public *
14 * License as published by the Free Software Foundation; either version 2 of *
15 * the License or (at your option) any later version. This is online at: *
16 * http://www.fsf.org/copyleft/gpl.html *
17 * Please send any updates to: fred@gruntose.com *
18 \*****************************************************************************/
20 #include <application/hoople_main.h>
21 #include <basis/astring.h>
22 #include <basis/functions.h>
23 #include <basis/guards.h>
24 #include <loggers/program_wide_logger.h>
25 #include <mathematics/chaos.h>
26 #include <nodes/symbol_tree.h>
27 #include <structures/static_memory_gremlin.h>
28 #include <textual/string_manipulation.h>
29 #include <unit_test/unit_base.h>
31 using namespace application;
32 using namespace basis;
33 using namespace filesystem;
34 using namespace loggers;
35 using namespace mathematics;
36 using namespace nodes;
37 using namespace structures;
38 using namespace textual;
39 using namespace timely;
40 using namespace unit_test;
42 #define LOG(to_print) EMERGENCY_LOG(program_wide_logger().get(), astring(to_print))
44 //#define DEBUG_TEST_SYMBOL_TREE
46 // how many nodes we add to the tree.
47 const int MAX_NODES_TESTED = 40000;
49 class test_symbol_tree : public unit_base, public application_shell
52 test_symbol_tree() : unit_base() {}
53 DEFINE_CLASS_NAME("test_symbol_tree");
57 int test_symbol_tree::execute()
62 // creates a crazy tree with only one branch per node, but hugely deep.
63 symbol_tree *t = new symbol_tree("blork");
64 symbol_tree *curr = t;
65 for (int i = 0; i < MAX_NODES_TESTED; i++) {
66 // if the current node has any branches, we'll jump on one as the next
68 if (curr->branches()) {
69 // move to a random branch.
70 int which = randomizer().inclusive(0, curr->branches() - 1);
71 curr = (symbol_tree *)curr->branch(which);
73 astring rando = string_manipulation::make_random_name(1, 10);
74 curr->add(new symbol_tree(rando));
76 #ifdef DEBUG_TEST_SYMBOL_TREE
77 LOG("about to whack dynamic tree...");
80 ASSERT_EQUAL(t, NULL_POINTER, "ensure pointer cleaned up");
81 #ifdef DEBUG_TEST_SYMBOL_TREE
82 LOG("dynamic tree whacked.");
85 #ifdef DEBUG_TEST_SYMBOL_TREE
86 LOG("crashed during tree stuffing.");
91 ASSERT_TRUE(true, "testing succeeded without cleanup crashes");
95 //hmmm: need more tests, like where we create a more balanced tree structure...
96 // perform known operations and validate shape of tree.
98 return final_report();
103 HOOPLE_MAIN(test_symbol_tree, )