Persistance Is Futile

[Judd]

Around about you'll find another post from me about TreeViews (TreeView Nodes - Can they be externally instanciated?). I'm almost certain that the problem described therein cannot be solved. Hence I'm using
a different approach....I'm going to use an invisible treeview object as a node store and write functions to check for the existance of a node and to transfer whole nodes to my visible tree.

What I'm asking is, what is the quickest way to traverse a complete node...? Is next / previous quicker than looping through indexes? Would it be better to use 'for each child'?


Anyone out there got any TreeView experience?

Anyone heard of TreeView?



Dan

[Judd]

I think nobody in the world is using TreeView except me...

[Iain17]

I think we have all heard of TreeView, and i am indeed using one in my project. It is being used as a navigation bar, as i have 40 odd forms. So i have never had to traverse all of the nodes.

I don't really know the answer to your question, but rest assured I use TreeView also

Anyway, there are lots of AI theories on how to search a tree and the moral of the story is that it depends on the composition of the tree. Generally speaking, you recursively call a function which executes a "search my children" routine. Recursion, however, is a lost art practiced only be AI programmers

Also, I would think you could externally instanciate a node, but I never saw your first post. Email me more info.

[email protected]

[Sam Finch]

I use recursion all the time, It's not AI though.

See the AI discussions in the chit chat forum.

[macai]

Originally posted by Judd
What I'm asking is, what is the quickest way to traverse a complete node...? Is next / previous quicker than looping through indexes? Would it be better to use 'for each child'?

Can you post the code necesary to loop through all the child
nodes (like using for each or for i = 1 to nodes.children)??
please? ^_^