X-Git-Url: https://feistymeow.org/gitweb/?a=blobdiff_plain;f=nucleus%2Flibrary%2Ftests_nodes%2Ftest_symbol_tree.cpp;h=bc938d1d80eefbea49a430a403bd700fb878ca57;hb=e1127a793a9bfe64df1b3a5209c86bb66505fe28;hp=ef9917c45d44e34cc1d0feb5e0cf4964a348c9c8;hpb=457b128b77b5b4a0b7dd3094de543de2ce1477ad;p=feisty_meow.git

diff --git a/nucleus/library/tests_nodes/test_symbol_tree.cpp b/nucleus/library/tests_nodes/test_symbol_tree.cpp
index ef9917c4..bc938d1d 100644
--- a/nucleus/library/tests_nodes/test_symbol_tree.cpp
+++ b/nucleus/library/tests_nodes/test_symbol_tree.cpp
@@ -46,22 +46,27 @@ using namespace unit_test;
 
 #define DEBUG_SYMBOL_TREE
 
-class test_symbol_tree : public virtual unit_base, virtual public application_shell
+// how many nodes we add to the tree.
+const int MAX_NODES_TESTED = 40000;
+
+class test_symbol_tree : public unit_base, public application_shell
 {
 public:
-  test_symbol_tree() {}
+  test_symbol_tree() : unit_base() {}
   DEFINE_CLASS_NAME("test_symbol_tree");
   int execute();
 };
 
 int test_symbol_tree::execute()
 {
+  FUNCDEF("execute");
   LOG("please check memory usage and record it, then hit a key to start testing.");
 
   try {
+    // creates a crazy tree with only one branch per node, but 40,000 deep.
     symbol_tree t("blork");
     symbol_tree *curr = &t;
-    for (int i = 0; i < 40000; i++) {
+    for (int i = 0; i < MAX_NODES_TESTED; i++) {
       // if the current node has any branches, we'll jump on one as the next
       // place.
       if (curr->branches()) {
@@ -81,7 +86,7 @@ int test_symbol_tree::execute()
   LOG("check memory usage after the run.  then hit a key to end "
       "the program.");
 
-//create a tree structure...
+//create a more balanced tree structure...
 //perform known operations and validate shape of tree.
 
   return final_report();