BIND 10 trac2150_2, updated. 5b8f36f524d99d1e97d0c562153ef6102c10bb93 [2150] Add a diagram of the DomainTree after the node has been added

[BIND 10 source code commits]

The branch, trac2150_2 has been updated
       via  5b8f36f524d99d1e97d0c562153ef6102c10bb93 (commit)
      from  dc8237b41256dcdb50220a9937aa6426f96b981a (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 5b8f36f524d99d1e97d0c562153ef6102c10bb93
Author: Mukund Sivaraman <muks at isc.org>
Date:   Mon Sep 17 10:53:48 2012 +0530

    [2150] Add a diagram of the DomainTree after the node has been added

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

Summary of changes:
 .../datasrc/memory/tests/domaintree_unittest.cc    |   20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)

-----------------------------------------------------------------------
diff --git a/src/lib/datasrc/memory/tests/domaintree_unittest.cc b/src/lib/datasrc/memory/tests/domaintree_unittest.cc
index 69ead43..ef90050 100644
--- a/src/lib/datasrc/memory/tests/domaintree_unittest.cc
+++ b/src/lib/datasrc/memory/tests/domaintree_unittest.cc
@@ -530,6 +530,26 @@ TEST_F(DomainTreeTest, findInSubTreeSameLabelSequence) {
     // First insert a "c.g.h." node.
     dtree_expose_empty_node.insert(mem_sgmt_, n1, &dtnode);
 
+    /* Now, the tree looks like:
+     *
+     *             .
+     *             |
+     *             b
+     *           /   \
+     *          a    d.e.f
+     *              /  |  \____
+     *             c   |       \
+     *                 |        g.h
+     *                 |         |
+     *                w.y        i
+     *              /  |  \     / \
+     *             x   |   z   c   k
+     *                 |   |
+     *                 p   j
+     *               /   \
+     *              o     q
+     */
+
     // Make a non-absolute label sequence. We will search for this same
     // sequence in two places in the tree.
     LabelSequence ls1(n1);