Community
Participate
Working Groups
Can the TreeViewer update mechanism be made any more efficient? I tested a typical scenario of opening a viewer, and for a single element, it made four calls to hasChildren and one call to getChildren. In the case of a repository explorer, this means at least five server round trips! It's difficult for the element to be caching here, because server information can change any time without notification. How would the update algorithm behave if those four calls to hasChildren returned different answers? NOTES:
Pls investigate in latest JFace.
*** Bug 2750 has been marked as a duplicate of this bug. ***
*** This bug has been marked as a duplicate of 2266 ***