/** * Remove the specified element from the tree outright. */ public void remove(Element<T0> element) { SimpleNode < T0> node = ( SimpleNode < T0> )element; assert(root != null); // delete the node by adding to the zero queue fixCountsThruRoot(node, -1 ); zeroQueue.add(node); drainZeroQueue(); assert(valid()); }
/** * Remove the specified element from the tree outright. */ public void remove(Element<T0> element) { SimpleNode < T0> node = ( SimpleNode < T0> )element; assert(root != null); // delete the node by adding to the zero queue fixCountsThruRoot(node, -1 ); zeroQueue.add(node); drainZeroQueue(); assert(valid()); }
/** * Remove the specified element from the tree outright. */ public void remove(Element<T0> element) { SimpleNode < T0> node = ( SimpleNode < T0> )element; assert(root != null); // delete the node by adding to the zero queue fixCountsThruRoot(node, -1 ); zeroQueue.add(node); drainZeroQueue(); assert(valid()); }
fixCountsThruRoot(node, -toRemove); if( true ) { zeroQueue.add(node);
fixCountsThruRoot(node, -toRemove); if( true ) { zeroQueue.add(node);
fixCountsThruRoot(node, -toRemove); if( true ) { zeroQueue.add(node);
fixCountsThruRoot(replacement, -1 ); replaceChild(replacement, replacement.left); replacement.refreshCounts(!zeroQueue.contains(replacement)); replaceChild(toReplace, replacement); fixCountsThruRoot(replacement.parent, 1 );
fixCountsThruRoot(replacement, -1 ); replaceChild(replacement, replacement.left); replacement.refreshCounts(!zeroQueue.contains(replacement)); replaceChild(toReplace, replacement); fixCountsThruRoot(replacement.parent, 1 );
fixCountsThruRoot(replacement, -1 ); replaceChild(replacement, replacement.left); replacement.refreshCounts(!zeroQueue.contains(replacement)); replaceChild(toReplace, replacement); fixCountsThruRoot(replacement.parent, 1 );
SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.left = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted; int parentRightHalfSize = parentRightStartIndex - index; fixCountsThruRoot(parent, -parentRightHalfSize); SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.right = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted;
SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.left = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted; int parentRightHalfSize = parentRightStartIndex - index; fixCountsThruRoot(parent, -parentRightHalfSize); SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.right = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted;
SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.left = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted; int parentRightHalfSize = parentRightStartIndex - index; fixCountsThruRoot(parent, -parentRightHalfSize); SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.right = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted;
SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.left = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted; SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.right = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted;
SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.left = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted; SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.right = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted;
SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.left = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted; SimpleNode < T0> inserted = new SimpleNode < T0> ( size, value, parent); parent.right = inserted; fixCountsThruRoot(parent, size); fixHeightPostChange(parent, false); return inserted;