Hi, I am trying to add elements in tree. The problem i am facing is, i have to update the tree continously and add elments to it . For adding first few elements it is taking less time but as the tree grows the gets accumlated. Demo Vi is attached for reference. aNY HELP WILL BE GREATFUL. ( vi ATTACHED IS IN 2009 version )

First off, 1% discrepancy for time benchmarking on Windows is "no difference". But indeed, update of front panel is not the limiting factor here: It is the number of child-entries which are creating issues. So with zero children (as i had in my first test), defer updates does grant you a huge performance increase as this is the one and only overhead. In your case (100 children), defer updates is off relevance as the "Add Items" method is taking quite some time. I concur that the performance impact is huge, maybe too huge, for increasing number of children. But on the other hand, you have to understand that you are dealing with arrays of cluster... so it is indeed a big effort for the memory manager to allocate enough memory, copy things around and (internally) de-allocate memory. The more data is involved, the more overhead this will create. Therefore, it WILL get slower the more data you add. But granted, the extend is surprisingly high. But nothing you can change. At last comment: Why do you need a tree which changes a lot of times during execution while maintaining several 100ths of items in any combination of parent/child? Norbert

ni.com is currently undergoing scheduled maintenance.

Some services may be unavailable at this time. Please contact us for help or try again later.

LabVIEW

Adding elements in tree Efficiently

Solved!

Just to put my two cents in:

what if you keep all Child- Item data in memory and insert the childs when the user expands a certain parent Item. You could allow to expand 4 parent items at maximum. On my computer it took for the first four Items 36, 20, 34, 60 ms.

Greets, Dave

Message 11 of 11

(365 Views)

LabVIEW

Adding elements in tree Efficiently

Re: Adding elements in tree Efficiently