external/webkit r30707

1 files changed, 179 insertions, 0 deletions

diff --git a/WebCore/editing/BreakBlockquoteCommand.cpp b/WebCore/editing/BreakBlockquoteCommand.cpp
new file mode 100644
index 0000000..0c56766
--- /dev/null
+++ b/WebCore/editing/BreakBlockquoteCommand.cpp
@@ -0,0 +1,179 @@
+/*
+ * Copyright (C) 2005 Apple Computer, 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
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE COMPUTER, INC. OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+ * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
+ * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 
+ */
+
+#include "config.h"
+#include "BreakBlockquoteCommand.h"
+
+#include "Element.h"
+#include "HTMLNames.h"
+#include "Text.h"
+#include "VisiblePosition.h"
+#include "htmlediting.h"
+#include "RenderListItem.h"
+
+namespace WebCore {
+
+using namespace HTMLNames;
+
+BreakBlockquoteCommand::BreakBlockquoteCommand(Document *document)
+    : CompositeEditCommand(document)
+{
+}
+
+void BreakBlockquoteCommand::doApply()
+{
+    Selection selection = endingSelection();
+    if (selection.isNone())
+        return;
+    
+    // Delete the current selection.
+    Position pos = selection.start();
+    EAffinity affinity = selection.affinity();
+    if (selection.isRange()) {
+        deleteSelection(false, false);
+        pos = endingSelection().start().upstream();
+        affinity = endingSelection().affinity();
+    }
+    
+    // Find the top-most blockquote from the start.
+    Node *startNode = pos.node();
+    Node *topBlockquote = 0;
+    for (Node *node = startNode->parentNode(); node; node = node->parentNode()) {
+        if (isMailBlockquote(node))
+            topBlockquote = node;
+    }
+    if (!topBlockquote || !topBlockquote->parentNode())
+        return;
+    
+    // Insert a break after the top blockquote.
+    RefPtr<Element> breakNode = createBreakElement(document());
+    insertNodeAfter(breakNode.get(), topBlockquote);
+    
+    if (!isLastVisiblePositionInNode(VisiblePosition(pos, affinity), topBlockquote)) {
+        
+        Node *newStartNode = 0;
+        // Split at pos if in the middle of a text node.
+        if (startNode->isTextNode()) {
+            Text *textNode = static_cast<Text *>(startNode);
+            if ((unsigned)pos.offset() >= textNode->length()) {
+                newStartNode = startNode->traverseNextNode();
+                ASSERT(newStartNode);
+            } else if (pos.offset() > 0)
+                splitTextNode(textNode, pos.offset());
+        } else if (startNode->hasTagName(brTag)) {
+            newStartNode = startNode->traverseNextNode();
+            ASSERT(newStartNode);
+        } else if (pos.offset() > 0) {
+            newStartNode = startNode->traverseNextNode();
+            ASSERT(newStartNode);
+        }
+        
+        // If a new start node was determined, find a new top block quote.
+        if (newStartNode) {
+            startNode = newStartNode;
+            topBlockquote = 0;
+            for (Node *node = startNode->parentNode(); node; node = node->parentNode()) {
+                if (isMailBlockquote(node))
+                    topBlockquote = node;
+            }
+            if (!topBlockquote || !topBlockquote->parentNode()) {
+                setEndingSelection(Selection(VisiblePosition(Position(startNode, 0))));
+                return;
+            }
+        }
+        
+        // Build up list of ancestors in between the start node and the top blockquote.
+        Vector<Node*> ancestors;    
+        for (Node* node = startNode->parentNode(); node != topBlockquote; node = node->parentNode())
+            ancestors.append(node);
+        
+        // Insert a clone of the top blockquote after the break.
+        RefPtr<Node> clonedBlockquote = topBlockquote->cloneNode(false);
+        insertNodeAfter(clonedBlockquote.get(), breakNode.get());
+        
+        // Clone startNode's ancestors into the cloned blockquote.
+        // On exiting this loop, clonedAncestor is the lowest ancestor
+        // that was cloned (i.e. the clone of either ancestors.last()
+        // or clonedBlockquote if ancestors is empty).
+        RefPtr<Node> clonedAncestor = clonedBlockquote;
+        for (size_t i = ancestors.size(); i != 0; --i) {
+            RefPtr<Node> clonedChild = ancestors[i - 1]->cloneNode(false); // shallow clone
+            // Preserve list item numbering in cloned lists.
+            if (clonedChild->isElementNode() && clonedChild->hasTagName(olTag)) {
+                Node* listChildNode = i > 1 ? ancestors[i - 2] : startNode;
+                // The first child of the cloned list might not be a list item element, 
+                // find the first one so that we know where to start numbering.
+                while (listChildNode && !listChildNode->hasTagName(liTag))
+                    listChildNode = listChildNode->nextSibling();
+                if (listChildNode && listChildNode->renderer())
+                    setNodeAttribute(static_cast<Element*>(clonedChild.get()), startAttr, String::number(static_cast<RenderListItem*>(listChildNode->renderer())->value()));
+            }
+                
+            appendNode(clonedChild.get(), clonedAncestor.get());
+            clonedAncestor = clonedChild;
+        }
+        
+        // Move the startNode and its siblings.
+        Node *moveNode = startNode;
+        while (moveNode) {
+            Node *next = moveNode->nextSibling();
+            removeNode(moveNode);
+            appendNode(moveNode, clonedAncestor.get());
+            moveNode = next;
+        }
+
+        // Hold open startNode's original parent if we emptied it
+        if (!ancestors.isEmpty()) {
+            addBlockPlaceholderIfNeeded(ancestors.first());
+
+            // Split the tree up the ancestor chain until the topBlockquote
+            // Throughout this loop, clonedParent is the clone of ancestor's parent.
+            // This is so we can clone ancestor's siblings and place the clones
+            // into the clone corresponding to the ancestor's parent.
+            Node* ancestor;
+            Node* clonedParent;
+            for (ancestor = ancestors.first(), clonedParent = clonedAncestor->parentNode();
+                 ancestor && ancestor != topBlockquote;
+                 ancestor = ancestor->parentNode(), clonedParent = clonedParent->parentNode()) {
+                moveNode = ancestor->nextSibling();
+                while (moveNode) {
+                    Node *next = moveNode->nextSibling();
+                    removeNode(moveNode);
+                    appendNode(moveNode, clonedParent);
+                    moveNode = next;
+                }
+            }
+        }
+        
+        // Make sure the cloned block quote renders.
+        addBlockPlaceholderIfNeeded(clonedBlockquote.get());
+    }
+    
+    // Put the selection right before the break.
+    setEndingSelection(Selection(Position(breakNode.get(), 0), DOWNSTREAM));
+    rebalanceWhitespace();
+}
+
+} // namespace WebCore