Do you know where your children are?

[t3h j1mb0]

Why is getRightChild specifically for the OptAdaptive tree?
-Jimbo

[Mike Jordan]

dunno.. but if you just remove the +1 at the end, that's equivalent to
finding your left child right?

Because in the Vitter pseudocode of "Update" it only deals with getting
the right child of an internal node. That's why he left out
"getLeftChild," I believe.

Mike

[t3h j1mb0]

Post by Mike Jordan

dunno.. but if you just remove the +1 at the end, that's equivalent to
finding your left child right?

Because in the Vitter pseudocode of "Update" it only deals with getting
the right child of an internal node. That's why he left out
"getLeftChild," I believe.
Mike

Thanks, but that's not what I'm asking about. I understand how to find
the left child, but I am just wondering why it said that getRightChild
is specifically for the OptAdaptive tree and not the RevAdaptive. Can
anyone explain that one?
-Jimbo

[brian p kennedy]

Post by t3h j1mb0

Post by Mike Jordan

dunno.. but if you just remove the +1 at the end, that's equivalent to
finding your left child right?

Because in the Vitter pseudocode of "Update" it only deals with
getting the right child of an internal node. That's why he left out
"getLeftChild," I believe.
Mike

Thanks, but that's not what I'm asking about. I understand how to find
the left child, but I am just wondering why it said that getRightChild
is specifically for the OptAdaptive tree and not the RevAdaptive. Can
anyone explain that one?
-Jimbo

the vitter paper's special case #1 says you set the leafToIncrement to
the right child of q

[Jack]

dunno.. but if you just remove the +1 at the end, that's equivalent to
finding your left child right?

[Johnnie Walker]

So far, I've decided to scrap the "Adaptive-Schmaptive" approach...
Instead, I'm using the Jonathan-Swift-Children-Compression Algorithm.
The pseudo-code can be found here
(http://my.execpc.com/~berrestr/swimod.html).

I implemented my own helper methods called BBQSauce and BabyCompactor to
complement the main JonathanSwiftAdaptive class. Basically, I can
compress the children regardless of size to zero bites. Decoding is
simple...and fun! I just call the RandomMemberofOppositeSex method
along with BeerGoggles and away we go! In order to take care of corner
cases, I implemented an AbortFetus method that prevents too much
uncompression of children.

I'm also developing an IncestuousAdaptiveTree that's both literally and
figuratively a linked list. Next time mom comes down to the basement to
do the laundry, I'll tell her about this great idea and see what she thinks!

Post by t3h j1mb0
Why is getRightChild specifically for the OptAdaptive tree?
-Jimbo

[Jamie Hargrove]

User-Agent: OSXnews .10/b
Xref: number1.nntp.dca.giganews.com utexas.class.cs337:390

Ignore that imo, I use it in both I think, kinda crucial for determining
a path in the tree...

Post by t3h j1mb0
Why is getRightChild specifically for the OptAdaptive tree?
-Jimbo
.

[Nick Whelan]

I use it in both... not that both work.... maybe that's my problem...

lolz!

Post by Jamie Hargrove
Ignore that imo, I use it in both I think, kinda crucial for determining
a path in the tree...

Post by t3h j1mb0
Why is getRightChild specifically for the OptAdaptive tree?
-Jimbo
.