diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-19 11:39:40 -0600 |
|---|---|---|
| committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-19 11:39:40 -0600 |
| commit | 1fc61c6e1d0a2b34f7b1d0de181bb4e6f954a8c2 (patch) | |
| tree | fdf34e0c9a4211231bb084fb40d30d2dff677dea /microbe/traverser.cpp | |
| parent | abb8cd68f820cfe0c96965136890a6bdd1093db5 (diff) | |
| download | ktechlab-1fc61c6e1d0a2b34f7b1d0de181bb4e6f954a8c2.tar.gz ktechlab-1fc61c6e1d0a2b34f7b1d0de181bb4e6f954a8c2.zip | |
Remove additional unneeded tq method conversions
Diffstat (limited to 'microbe/traverser.cpp')
| -rw-r--r-- | microbe/traverser.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/microbe/traverser.cpp b/microbe/traverser.cpp index eb6a924..e066381 100644 --- a/microbe/traverser.cpp +++ b/microbe/traverser.cpp @@ -34,8 +34,8 @@ Traverser::~Traverser() BTreeNode * Traverser::start() { /* To find the start we will iterate, or possibly recurse - down the tree, each time turning down the node that has tqchildren, - if they both have no tqchildren we have reached the end and it shouldn't + down the tree, each time turning down the node that has children, + if they both have no children we have reached the end and it shouldn't really matter which we pick (check this algorithm) */ BTreeNode *n = m_root; |