int TreeWalk(Node* curnode, int depth)
{
if (curnode)
{
int left = TreeWalk(curnode->child[LEFT], depth+1);
int right = TreeWalk(curnode->child[RIGHT], depth+1);
depth = max(left, right);
if (curnode->red)
{
/*if (isRed(curnode->child[LEFT]) || isRed(curnode->child[RIGHT]))
{
printf("red/black tree violation %p\n", curnode->content);
exit(-99);
}*/;
}
}
return depth;
}
int TreeMaxDepth(Tree *aTree)
{
int rc = TreeWalk(aTree->index[0].root, 0);
/*if (aTree->root->red)
{
printf("root node should not be red %p\n", aTree->root->content);
exit(-99);
}*/
return rc;
}
void TreeWalk(element* pItem)
{
static size_t indentLevel = 0;
std::cout << "\n " << std::string(2 * indentLevel, ' ') << pItem->show();
auto iter = pItem->_children.begin();
++indentLevel;
while (iter != pItem->_children.end())
{
TreeWalk(*iter);
++iter;
}
--indentLevel;
}
int main()
{
std::cout << "\n Testing Scope Stack" << "\n =====================\n";
std::cout << "\n pushing items onto ScopeStack instance after adding startLineCount" << "\n --------------------------------------------------------------------";
ScopeStack<element*> testStack;
element* pItem = new element;
pItem->type = "function";
pItem->name = "fun1";
pItem->startLineCount = 33;
testStack.push(pItem);
pItem = new element;
pItem->type = "if";
pItem->name = "";
pItem->startLineCount = 38;
(testStack.top()->_children).push_back(pItem);
testStack.push(pItem);
pItem = new element;
pItem->type = "for";
pItem->name = "";
pItem->startLineCount = 40;
(testStack.top()->_children).push_back(pItem);
testStack.push(pItem);
showStack<element>(testStack, false);
std::cout << std::endl;
std::cout << "\n Popping two items off ScopeStack after adding endLineCount" << "\n ------------------------------------------------------------";
testStack.top()->endLineCount = 50;
std::cout << "\n " << testStack.pop()->show();
testStack.top()->endLineCount = 55;
std::cout << "\n " << testStack.pop()->show();
std::cout << "\n\n Pushing another item onto ScopeStack after adding startLineElement" << "\n --------------------------------------------------------------------";
pItem = new element;
pItem->type = "while";
pItem->name = "";
pItem->startLineCount = 60;
(testStack.top()->_children).push_back(pItem);
testStack.push(pItem);
std::cout << "\n Stack now contains:" << "\n ---------------------";
showStack<element>(testStack, false);
std::cout << "\n\n Popping last elements off stack after adding endLineCount";
std::cout << "\n -----------------------------------------------------------";
testStack.top()->endLineCount = 70;
element* pTop = testStack.pop();
std::cout << "\n " << pTop->show();
testStack.top()->endLineCount = 75;
pTop = testStack.pop();
std::cout << "\n " << pTop->show();
std::cout << "\n\n Walking simulated AST tree:" << "\n -----------------------------";
TreeWalk(pTop);
std::cout << "\n\n";
}