HTML Imports: No more BlockingDocumentCreation.

Source/wtf/TreeNodeTest.cpp

 /*
  * Copyright (C) 2012 Apple Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 150 matching lines @@
     Trio trio;
     trio.appendChildren();
 
     trio.root->removeChild(trio.firstChild.get());
     EXPECT_TRUE(trio.firstChild->orphan());
     EXPECT_EQ(trio.middleChild->previous(), nullNode.get());
     EXPECT_EQ(trio.root->firstChild(), trio.middleChild.get());
     EXPECT_EQ(trio.root->lastChild(), trio.lastChild.get());
 }
 
+TEST(WTF, TreeNodeTakeChildrenFrom)
+{
+    RefPtr<TestTree> newParent = TestTree::create();
+    Trio trio;
+    trio.appendChildren();
+
+    newParent->takeChildrenFrom(trio.root.get());
+
+    EXPECT_FALSE(trio.root->hasChildren());
+    EXPECT_TRUE(newParent->hasChildren());
+    EXPECT_EQ(trio.firstChild.get(), newParent->firstChild());
+    EXPECT_EQ(trio.middleChild.get(), newParent->firstChild()->next());
+    EXPECT_EQ(trio.lastChild.get(), newParent->lastChild());
+}
+
 class TrioWithGrandChild : public Trio {
 public:
     TrioWithGrandChild()
         : grandChild(TestTree::create())
     {
     }
 
     void appendChildren()
     {
         Trio::appendChildren();
@@ skipping 32 matching lines @@
 
     unsigned orderIndex = 0;
     for (TestTree* node = traverseFirstPostOrder(trio.root.get()); node; node = traverseNextPostOrder(node), orderIndex++)
         EXPECT_EQ(node, order[orderIndex]);
     EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*));
 
 }
 
 
 } // namespace