diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-15 15:32:48 -0600 |
|---|---|---|
| committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-15 15:32:48 -0600 |
| commit | bab171b2a7d7f36e2d5dd510df80fc8cb4a6b06f (patch) | |
| tree | ebcbd8371d791d7419485d11deec88587c36aa7e /microbe/traverser.cpp | |
| parent | 393fa51a38771670ecb265a99ab592e03f4ecc5c (diff) | |
| download | ktechlab-bab171b2a7d7f36e2d5dd510df80fc8cb4a6b06f.tar.gz ktechlab-bab171b2a7d7f36e2d5dd510df80fc8cb4a6b06f.zip | |
Rename a number of old tq methods that are no longer tq specific
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; |