void CBDB_FileScanner::ResolveFields(CBDB_Query& query)
{
CBDB_Query::TQueryClause& qtree = query.GetQueryClause();
CQueryTreeFieldResolveFunc resolve_func(m_File);
TreeDepthFirstTraverse(qtree, resolve_func);
}
bool CBDB_FileScanner::Evaluate(CBDB_Query& query)
{
ResolveFields(query);
CBDB_Query::TQueryClause& qtree = query.GetQueryClause();
CQueryExecEnv query_env(m_File);
CScannerEvaluateFunc scanner_eval(query_env);
TreeDepthFirstTraverse(qtree, scanner_eval);
const CBDB_QueryNode& qnode = qtree.GetValue();
const string& v_alt = qnode.GetAltValue();
if (v_alt.empty()) {
const string& v = qnode.GetValue();
if (v == "0")
return false;
return true;
} else {
if (v_alt == "0")
return false;
}
return true;
}
void BDB_PrintQueryTree(CNcbiOstream& os, const CBDB_Query& query)
{
// Here I use a const cast hack because TreeDepthFirstTraverse
// uses a non-cost iterators and semantics in the algorithm.
// When a const version of TreeDepthFirstTraverse is ready
// we can get rid of this...
const CBDB_Query::TQueryClause& qtree = query.GetQueryClause();
CBDB_Query::TQueryClause& qtree_nc =
const_cast<CBDB_Query::TQueryClause&>(qtree);
CQueryTreePrintFunc func(os);
TreeDepthFirstTraverse(qtree_nc, func);
}
void CBDB_Query::ResetQueryClause()
{
TreeDepthFirstTraverse(*m_QueryClause, s_ResetQueryNode);
}
static void s_TEST_Tree()
{
typedef CTreeNode<int> TTree;
TTree* tr = new TTree(0);
TTree* tr10 = tr->AddNode(10);
tr->AddNode(11);
tr10->AddNode(20);
tr10->AddNode(21);
TTree* sr = new TTree(0);
sr->AddNode(10);
sr->AddNode(11);
delete sr;
sr = 0;
TTree* ur = new TTree(0);
ur->AddNode(10);
ur->AddNode(11);
ur->AddNode(20);
ur->AddNode(21);
delete ur;
ur = 0;
// TreePrint(cout, *tr, (IntConvType) NStr::IntToString);
// TreeReRoot(*tr10);
// TreePrint(cout, *tr10, (IntConvType) NStr::IntToString);
cout << "Testing Breadth First Traversal" << endl;
TreeBreadthFirstTraverse(*tr, TestFunctor2);
cout << endl;
cout << "Testing Depth First Traversal" << endl;
TreeDepthFirstTraverse(*tr, TestFunctor1);
cout << endl;
{{
unsigned int cnt;
TTree::TNodeList_CI it = tr->SubNodeBegin();
TTree::TNodeList_CI it_end = tr->SubNodeEnd();
for (cnt = 0; it != it_end; ++it, ++cnt) {
const TTree* t = *it;
int v = t->GetValue();
assert(v == 10 || v == 11);
}
assert(cnt == 2);
}}
{{
TTree* tr2 = new TTree(*tr);
unsigned int cnt;
TTree::TNodeList_CI it = tr2->SubNodeBegin();
TTree::TNodeList_CI it_end = tr2->SubNodeEnd();
for (cnt = 0; it != it_end; ++it, ++cnt) {
const TTree* t = *it;
int v = t->GetValue();
assert(v == 10 || v == 11);
}
assert(cnt == 2);
delete tr2;
}}
{{
TTree::TNodeList_I it = tr->SubNodeBegin();
TTree::TNodeList_I it_end = tr->SubNodeEnd();
for (; it != it_end; ++it) {
TTree* t = *it;
int v = t->GetValue();
if (v == 10)
{
tr->RemoveNode(t);
break;
}
}
}}
TreeDepthFirstTraverse(*tr, TestFunctor1);
cout << endl;
{{
unsigned int cnt;
TTree::TNodeList_CI it = tr->SubNodeBegin();
TTree::TNodeList_CI it_end = tr->SubNodeEnd();
for (cnt = 0; it != it_end; ++it, ++cnt) {
const TTree* t = *it;
int v = t->GetValue();
assert(v == 11);
}
assert(cnt == 1);
}}
delete tr;
TTree* str = tr = new TTree(0);
//
// 0 - 2
// - 4
// - 3
// - 5
// - 6
//
TTree* tr4 = tr->AddNode(2)->AddNode(4);
tr = tr->AddNode(3);
TTree* tr5 = tr->AddNode(5);
TTree* tr6 = tr->AddNode(6);
cout << "Test Tree: " << endl;
TreeDepthFirstTraverse(*str, TestFunctor1);
cout << endl;
delete str;
str = tr5 = tr4 = tr6; // just to eliminate "unused var" warning
}
static void s_TEST_Tree()
{
typedef CTreeNode<int> TTree;
TTree* tr = new TTree(0);
TTree* tr10 = tr->AddNode(10);
tr->AddNode(11);
tr10->AddNode(20);
tr10->AddNode(21);
TTree* sr = new TTree(0);
sr->AddNode(10);
sr->AddNode(11);
TTree* ur = new TTree(0);
ur->AddNode(10);
ur->AddNode(11);
ur->AddNode(20);
ur->AddNode(21);
// TreePrint(cout, *tr, (IntConvType) NStr::IntToString);
// TreeReRoot(*tr10);
// TreePrint(cout, *tr10, (IntConvType) NStr::IntToString);
cout << "Testing Breadth First Traversal" << endl;
TreeBreadthFirstTraverse(*tr, TestFunctor2);
cout << endl;
cout << "Testing Depth First Traversal" << endl;
TreeDepthFirstTraverse(*tr, TestFunctor1);
cout << endl;
cout << "Testing Tree Comparison" << endl;
cout << "tr and tr10 are ";
if(!TreeCompare(*tr, *tr10, TestFunctor3)) cout << "not ";
cout << "the same." << endl;
cout << "tr and tr are ";
if(!TreeCompare(*tr, *tr, TestFunctor3)) cout << "not ";
cout << "the same." << endl;
cout << "tr and sr are ";
if(!TreeCompare(*tr, *sr, TestFunctor3)) cout << "not ";
cout << "the same." << endl;
cout << "tr and ur are ";
if(!TreeCompare(*tr, *ur, TestFunctor3)) cout << "not ";
cout << "the same." << endl;
cout << "sr and ur are ";
if(!TreeCompare(*sr, *ur, TestFunctor3)) cout << "not ";
cout << "the same." << endl;
cout << endl;
{{
unsigned int cnt;
TTree::TNodeList_CI it = tr->SubNodeBegin();
TTree::TNodeList_CI it_end = tr->SubNodeEnd();
for (cnt = 0; it != it_end; ++it, ++cnt) {
const TTree* t = *it;
int v = t->GetValue();
assert(v == 10 || v == 11);
}
assert(cnt == 2);
}}
{{
TTree* tr2 = new TTree(*tr);
unsigned int cnt;
TTree::TNodeList_CI it = tr2->SubNodeBegin();
TTree::TNodeList_CI it_end = tr2->SubNodeEnd();
for (cnt = 0; it != it_end; ++it, ++cnt) {
const TTree* t = *it;
int v = t->GetValue();
assert(v == 10 || v == 11);
}
assert(cnt == 2);
delete tr2;
}}
{{
TTree::TNodeList_I it = tr->SubNodeBegin();
TTree::TNodeList_I it_end = tr->SubNodeEnd();
for (; it != it_end; ++it) {
TTree* t = *it;
int v = t->GetValue();
if (v == 10)
{
tr->RemoveNode(t);
break;
}
}
}}
TreeDepthFirstTraverse(*tr, TestFunctor1);
cout << endl;
{{
unsigned int cnt;
TTree::TNodeList_CI it = tr->SubNodeBegin();
TTree::TNodeList_CI it_end = tr->SubNodeEnd();
for (cnt = 0; it != it_end; ++it, ++cnt) {
const TTree* t = *it;
int v = t->GetValue();
assert(v == 11);
}
assert(cnt == 1);
}}
delete tr;
TTree* str = tr = new TTree(0);
//
// 0 - 2
// - 4
// - 3
// - 5
// - 6
//
TTree* tr4 = tr->AddNode(2)->AddNode(4);
tr = tr->AddNode(3);
TTree* tr5 = tr->AddNode(5);
TTree* tr6 = tr->AddNode(6);
cout << "Test Tree: " << endl;
TreeDepthFirstTraverse(*str, TestFunctor1);
cout << endl;
vector<const TTree*> trace_vec;
TreeTraceToRoot(*tr6, trace_vec);
assert(trace_vec.size() == 3);
{{
cout << "Trace to root: ";
ITERATE(vector<const TTree*>, it, trace_vec) {
cout << (*it)->GetValue() << "; ";
}
cout << endl;
}}
const TTree* parent_node = TreeFindCommonParent(*tr4, *tr6);
assert(tr4->IsParent(*parent_node));
assert(tr6->IsParent(*parent_node));
assert(!tr4->IsParent(*tr6));
assert(parent_node);
cout << "parent: " << parent_node->GetValue() << endl;
assert(parent_node->GetValue() == 0);
parent_node = TreeFindCommonParent(*tr5, *tr6);
assert(parent_node);
assert(parent_node->GetValue() == 3);
TreePrint(cout, *str, s_IntToStr);
cout << endl;
TreeReRoot(*tr5);
TreePrint(cout, *tr5, s_IntToStr);
tr5->MoveSubnodes(str);
TreePrint(cout, *tr5, s_IntToStr);
delete tr5;
delete ur;
delete sr;
}
