BIND 10 trac2089, updated. d0ab37d167a79656c569772accaf4d8b50abec1f [2089] remove unnecessary << operators in unit test

[BIND 10 source code commits]

The branch, trac2089 has been updated
       via  d0ab37d167a79656c569772accaf4d8b50abec1f (commit)
      from  55dfd7fb67f82dcecaecc17d43eb359b3ba069c2 (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 d0ab37d167a79656c569772accaf4d8b50abec1f
Author: Jelte Jansen <jelte at isc.org>
Date:   Thu Jul 19 11:56:54 2012 +0200

    [2089] remove unnecessary << operators in unit test

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

Summary of changes:
 src/lib/datasrc/tests/rbtree_unittest.cc |   82 +++++++++++++++---------------
 1 file changed, 41 insertions(+), 41 deletions(-)

-----------------------------------------------------------------------
diff --git a/src/lib/datasrc/tests/rbtree_unittest.cc b/src/lib/datasrc/tests/rbtree_unittest.cc
index b6d9985..8fc5a17 100644
--- a/src/lib/datasrc/tests/rbtree_unittest.cc
+++ b/src/lib/datasrc/tests/rbtree_unittest.cc
@@ -679,47 +679,47 @@ TEST_F(RBTreeTest, dumpTree) {
     std::ostringstream str;
     std::ostringstream str2;
     rbtree.dumpTree(str);
-    str2 << "tree has 14 node(s)\n" <<
-            "b. (black) [subtreeroot]\n" <<
-            "     a. (black)\n" <<
-            "          NULL\n" <<
-            "          NULL\n" <<
-            "     d.e.f. (black) [invisible]\n" <<
-            "          begin down from d.e.f.\n" <<
-            "          w.y. (black) [invisible] [subtreeroot]\n" <<
-            "               begin down from w.y.\n" <<
-            "               p. (black) [subtreeroot]\n" <<
-            "                    o. (red)\n" <<
-            "                         NULL\n" <<
-            "                         NULL\n" <<
-            "                    q. (red)\n" <<
-            "                         NULL\n" <<
-            "                         NULL\n" <<
-            "               end down from w.y.\n" <<
-            "               x. (red)\n" <<
-            "                    NULL\n" <<
-            "                    NULL\n" <<
-            "               z. (red)\n" <<
-            "                    begin down from z.\n" <<
-            "                    j. (black) [subtreeroot]\n" <<
-            "                         NULL\n" <<
-            "                         NULL\n" <<
-            "                    end down from z.\n" <<
-            "                    NULL\n" <<
-            "                    NULL\n" <<
-            "          end down from d.e.f.\n" <<
-            "          c. (red)\n" <<
-            "               NULL\n" <<
-            "               NULL\n" <<
-            "          g.h. (red)\n" <<
-            "               begin down from g.h.\n" <<
-            "               i. (black) [subtreeroot]\n" <<
-            "                    NULL\n" <<
-            "                    k. (red)\n" <<
-            "                         NULL\n" <<
-            "                         NULL\n" <<
-            "               end down from g.h.\n" <<
-            "               NULL\n" <<
+    str2 << "tree has 14 node(s)\n"
+            "b. (black) [subtreeroot]\n"
+            "     a. (black)\n"
+            "          NULL\n"
+            "          NULL\n"
+            "     d.e.f. (black) [invisible]\n"
+            "          begin down from d.e.f.\n"
+            "          w.y. (black) [invisible] [subtreeroot]\n"
+            "               begin down from w.y.\n"
+            "               p. (black) [subtreeroot]\n"
+            "                    o. (red)\n"
+            "                         NULL\n"
+            "                         NULL\n"
+            "                    q. (red)\n"
+            "                         NULL\n"
+            "                         NULL\n"
+            "               end down from w.y.\n"
+            "               x. (red)\n"
+            "                    NULL\n"
+            "                    NULL\n"
+            "               z. (red)\n"
+            "                    begin down from z.\n"
+            "                    j. (black) [subtreeroot]\n"
+            "                         NULL\n"
+            "                         NULL\n"
+            "                    end down from z.\n"
+            "                    NULL\n"
+            "                    NULL\n"
+            "          end down from d.e.f.\n"
+            "          c. (red)\n"
+            "               NULL\n"
+            "               NULL\n"
+            "          g.h. (red)\n"
+            "               begin down from g.h.\n"
+            "               i. (black) [subtreeroot]\n"
+            "                    NULL\n"
+            "                    k. (red)\n"
+            "                         NULL\n"
+            "                         NULL\n"
+            "               end down from g.h.\n"
+            "               NULL\n"
             "               NULL\n";
     EXPECT_EQ(str2.str(), str.str());
 }