]> git.ipfire.org Git - thirdparty/kea.git/commitdiff
[2089] remove unnecessary << operators in unit test
authorJelte Jansen <jelte@isc.org>
Thu, 19 Jul 2012 09:56:54 +0000 (11:56 +0200)
committerJelte Jansen <jelte@isc.org>
Thu, 19 Jul 2012 09:56:54 +0000 (11:56 +0200)
src/lib/datasrc/tests/rbtree_unittest.cc

index b6d9985d959b943433c1d882049916ab0a1210d5..8fc5a170d9fe3c41a8d9d47da3bbae70baa95985 100644 (file)
@@ -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());
 }