BIND 10 trac2750, updated. 8a4c8c4fec6d869d9ecbbbab9c0374658cfd7a99 [2750] Add graphs for case 3

BIND 10 source code commits bind10-changes at lists.isc.org
Mon Sep 2 09:55:39 UTC 2013


The branch, trac2750 has been updated
       via  8a4c8c4fec6d869d9ecbbbab9c0374658cfd7a99 (commit)
      from  091b8584615ed5da2441c579bc37cf1e9681db80 (commit)

Those revisions listed above that are new to this repository have
not appeared on any other notification email; so we list those
revisions in full, below.

- Log -----------------------------------------------------------------
commit 8a4c8c4fec6d869d9ecbbbab9c0374658cfd7a99
Author: Mukund Sivaraman <muks at isc.org>
Date:   Mon Sep 2 15:25:09 2013 +0530

    [2750] Add graphs for case 3

-----------------------------------------------------------------------

Summary of changes:
 src/lib/datasrc/memory/domaintree.h |   23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)

-----------------------------------------------------------------------
diff --git a/src/lib/datasrc/memory/domaintree.h b/src/lib/datasrc/memory/domaintree.h
index de23276..faf4424 100644
--- a/src/lib/datasrc/memory/domaintree.h
+++ b/src/lib/datasrc/memory/domaintree.h
@@ -2756,6 +2756,29 @@ DomainTree<T>::removeRebalance
         // child=parent and go back to the beginning of the loop to
         // repeat the original rebalancing problem 1 node higher up the
         // tree (see NOTE #1 above).
+
+        /* (a):
+         *
+         *         G(?)                   G(?)
+         *         /  \                   /  \
+         *       P(R)        =>         P(B)      (Rebalancing is done)
+         *      /   \                  /   \
+         *   C(?)   S(B)            C(?)   S(R)
+         *   / \     /  \           / \     /  \
+         *        s1(B) s2(B)            s1(B) s2(B)
+         *
+         *
+         * (b):
+         *
+         *         G(?)                   G(?) <----------(new parent)
+         *         /   \                  /   \
+         *       P(B)        =>         P(B) <------------(new child)
+         *      /   \                  /   \
+         *   C(?)   S(B)            C(?)   S(R)
+         *   / \     /  \           / \     /  \
+         *        s1(B) s2(B)            s1(B) s2(B)
+         */
+
         if ((DomainTreeNode<T>::isBlack(sibling->getLeft()) &&
              DomainTreeNode<T>::isBlack(sibling->getRight())))
         {



More information about the bind10-changes mailing list