BIND 10 trac2750, updated. d15a492eb3479310af51cb1a9dde60faa1d57249 [2750] Update comment

[BIND 10 source code commits]

The branch, trac2750 has been updated
       via  d15a492eb3479310af51cb1a9dde60faa1d57249 (commit)
      from  313c564232efbcfc2cc8d34593ce9494ba96d629 (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 d15a492eb3479310af51cb1a9dde60faa1d57249
Author: Mukund Sivaraman <muks at isc.org>
Date:   Mon Sep 2 15:56:52 2013 +0530

    [2750] Update comment

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

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

-----------------------------------------------------------------------
diff --git a/src/lib/datasrc/memory/domaintree.h b/src/lib/datasrc/memory/domaintree.h
index 875ab26..c91fecd 100644
--- a/src/lib/datasrc/memory/domaintree.h
+++ b/src/lib/datasrc/memory/domaintree.h
@@ -2675,7 +2675,8 @@ DomainTree<T>::removeRebalance
      DomainTreeNode<T>* child,  DomainTreeNode<T>* parent)
 {
     // Case 1. Repeat until we reach the root node of this subtree in
-    // the forest.
+    // the forest. Note that child can be NULL here, so we can only test
+    // the parent pointer and see if it has escaped to the upper tree.
     while (&(parent->down_) != root_ptr) {
         // A sibling node is defined as the parent's other child. It
         // exists at the same level as child. Note that child can be