projects
/
feisty_meow.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
fix for password file missing
[feisty_meow.git]
/
nucleus
/
library
/
tests_nodes
/
test_symbol_tree.cpp
diff --git
a/nucleus/library/tests_nodes/test_symbol_tree.cpp
b/nucleus/library/tests_nodes/test_symbol_tree.cpp
index ef9917c45d44e34cc1d0feb5e0cf4964a348c9c8..bc938d1d80eefbea49a430a403bd700fb878ca57 100644
(file)
--- 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
#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:
{
public:
- test_symbol_tree() {}
+ test_symbol_tree()
: unit_base()
{}
DEFINE_CLASS_NAME("test_symbol_tree");
int execute();
};
int test_symbol_tree::execute()
{
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 {
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;
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()) {
// 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.");
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();
//perform known operations and validate shape of tree.
return final_report();