You can implement a Chain.
On Wed, Nov 19, 2008 at 10:53 AM, Patrick Ratelband [EMAIL PROTECTED]wrote:
Whould you not wish to that, you can try something a little bit more
dirty, but it should get the job done.
Call the new search in the onSucces of the last one, this way, you are
sure you
Whould you not wish to that, you can try something a little bit more
dirty, but it should get the job done.
Call the new search in the onSucces of the last one, this way, you are
sure you have the last result. You can use a boolean value to see if
the result you have is the last node, if so,
Hi,
I've got an application that offers some search capabilities. When you
search something, you can click on a Button and this will lead you to
open a Tree in the location where the item you searched is.
I can make an asynchronous call to a service who gives me the child
names of a given node,
If I were you I'd handle the recursive tree traversal on the server
and return a (pruned?) subtree as a response, instead of node-at-a-
time. Not only does it simplify async callback management on the
client, it also uses the network a lot more efficiently.
Walden
On Nov 18, 11:26 am, [EMAIL
