I'm using a FastObjectListView to show the results of a search which may return a large number of results. Now I'd like to allow results from this list to be expanded in to a tree. Am I going to have any performance problems using a TreeListView over a FastObjectListView?
I know TreeListView inherits from VirtualObjectListView, so it is a virtual list. Say i set the Roots property of a TreeListView to 50,000 objects. Will the tree view try to display every root, or will it keep track of what range the user is currently viewing and only display those?
What about the sub nodes? From what I understand the TreeListView does not know anything about the sub nodes of the tree until the user actually attempts to expand a root node. Is this correct? What if I had a TreeListView with 50,000 roots, each with a number of sub-nodes, and I called ExpandAll()? Would this try to read the subnodes from all 50,000 roots or only those roots which are visible? After an entire tree is expanded how does TreeListView track all the sub nodes as the user scrolls? In other words does the TreeListView track the sub-nodes virtually?