#include <vdktreeview.h>
|
||||||||||||
|
Constructor
|
|
|
return node presently visited |
|
|
Returns true if presently visited node has a child. TIP: Since iterator incremental operator skips on next sibling node, you can use this to visit all tree nodes on depth-first strategy using recursion. See example below taken from /testvdk/treeviewcompo.cc: void
TreeViewComponent::recurse(GtkTreeIter* iter)
{
VDKTreeViewModel* model = tree->Model;
VDKTreeViewModelIterator ti(model,iter);
for(;ti;ti++)
{
PrintRow(ti.current()); // uses presently pointed node
if(ti.HasChild())
recurse (ti.current());
}
}
bool
TreeViewComponent::OnTrasverseClicked (VDKObject* sender)
{
recurse(NULL);
return true;
}
|
|
|
Returns true if presently visited node is valid |
|
|
Incremental operator (infix), visit next sibling node |
|
|
Incremental operator (postfix), visit next sibling node |
1.2.15