Hi Mahadev!
Yeah kinda, what I was looking for was some kind of explanation of why this
is, since they are stored in a list
and it seems like new children would just be appended to the list. So I
guess my question should have been
more along the lines of something like:
What is it internally that c
Internally children of a node are not guranteed to be stored as sorted via
their names. The counter that you mention is just a version number on the
parent that is used during creation of children of a node that are created
with a Sequential flag. It has nothing to do with how the children of a
no
Hi Mahadev!
Thanks for the quick reply. Yeah, I saw that in the source, but was just
curious why that is, since it is a part of an internal
counter structure, right?
Regards Erik
Hi Erik,
The children that you get in return are not guaranteed to be in sorted
order and that's why they need to be sorted each time at the client side.
Hope that helps.
thanks
mahadev
On 7/13/09 4:27 PM, "Erik Holstad" wrote:
> Hey!
> I have been playing around with the queue and barrier e
Hey!
I have been playing around with the queue and barrier example found on the
home page and have some questions about the code.
First of all I had trouble getting the queue example to work since the code
turns the sequence number into an int and then try to get information
from it, missing out th