Look at this debugging output about TreeViews

[Franky]

I normally don't ask for help debugging but I've been looking at this for 4
days and am beginning to believe it may be caused by something I just don't
know about.

Below is a printout from a treeview debugging session.
I caused the same routine to be called twice
The routine, given a string like
"C:\Documents and Settings\Hal\My Documents
expands a TreeView to show that path.
Works great the first time
but as you can see below, the second time all the BeforeExpand event calls
are delayed and then run in the reverse order. Like they were placed on a
stack.


Anyone have any suggestions?


Search Topmost Collection 'FOUND C
Entered BeforeExpand C: 'EXPAND C
1SEARCH IN C: 'FOUND DOCUMENT AND SETTINGS
Entered BeforeExpand C:\Documents and Settings 'EXPAND IT
2SEARCH IN C:\Documents and Settings 'FOUND HAL
Entered BeforeExpand C:\Documents and Settings\Hal '...MORE OF THE SAME
3SEARCH IN C:\Documents and Settings\Hal
Entered BeforeExpand C:\Documents and Settings\Hal\My Documents
4DONE C:\Documents and Settings\Hal\My Documents 'STOP SEARING
4SEARCH EXITED 'EXIT RESURSIVE ROUTINES
3SEARCH EXITED
2SEARCH EXITED
1SEARCH EXITED
Search Topmost Collection 'DO IT A SECOND TIME
5SEARCH IN C: 'NOTE IT FINDS THEM THE SAME WAY
6SEARCH IN C:\Documents and Settings 'BUT THE EXPAND EVENTS ARE DELAYED
7SEARCH IN C:\Documents and Settings\Hal 'AND THE ORDER IS REVERSED
8DONE C:\Documents and Settings\Hal\My Documents
8SEARCH EXITED
7SEARCH EXITED
6SEARCH EXITED
5SEARCH EXITED
Entered BeforeExpand C:\Documents and Settings\Hal\My Documents
Entered BeforeExpand C:\Documents and Settings\Hal
Entered BeforeExpand C:\Documents and Settings
Entered BeforeExpand C:

 

[Robinson]

It seems to me, that you should post some code, otherwise we have no idea
whats going on here.

 

[Franky]

It would be too much to expect someone to wade through.

I'm hoping that someone who has any idea at all of why the BeforeExpand
events would be delayed.

The important things are a routine searches and fines the next node and then
expands it, then searches...


Thanks for the interest

 

[Franky]

I've been looking at the code and I think I could put together a small
solution as a test case.

How could I deliver it.

Should I attach a zip file to my post to the NG or sent it e-mail to anyone
that is willing help?


Thanks