}
//=====================================================================
-
//=====================================================================
int SQLiteTreeHandler::AddBranch( const AttributeMapType& attr )
{
tree::Node* parent = DBGetParent(attr);
DBGraftToParent(parent,attr);
return (parent->GetLevel()+1);
+
}
//=====================================================================
<< i->GetGroup() << ","
<< i->GetElement() << ","
<< i->GetFlags() << ");";
-
UPDATEDB(insert.str());
}
if (node->GetChildrenLoaded())
{
// Iterate the children
- tree::Node::ChildrenListType::iterator i;
+
+ /*tree::Node::ChildrenListType::iterator i;
for (i = node->GetChildrenList().begin();
i!= node->GetChildrenList().end();
++i)
{
nbloaded += DBLoadChildren(*i,numberoflevels-1);
- }
+ }*/
return nbloaded;
+
}
/// If children not loaded : do it and recurse
while (!q.eof())
{
+ // std::cout<<"Name in q: "<<q.fieldName(3)<<" Value: "<<q.getStringField(3)<<std::endl;
nbloaded++;
Node* n = new Node(node);
for (int fld = 0; fld < q.numFields(); fld++)
if ( numberoflevels != 1 )
{
// msw[2].Pause();
- nbloaded += DBLoadChildren(n, numberoflevels-1);
+ // nbloaded += DBLoadChildren(n, numberoflevels-1);
// msw[2].Resume();
}
// next entry in db
}
}
- //=====================================================================
-
//=====================================================================
unsigned int SQLiteTreeHandler::GetNumberOfChildren(tree::Node* n)
{