| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2005 Apple Computer, Inc. All rights reserved. | 2 * Copyright (C) 2005 Apple Computer, Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| 11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
| 12 * | 12 * |
| 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
| 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
| 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 24 */ | 24 */ |
| 25 | 25 |
| 26 #include "config.h" | 26 #include "config.h" |
| 27 #include "core/editing/BreakBlockquoteCommand.h" | 27 #include "core/editing/commands/BreakBlockquoteCommand.h" |
| 28 | 28 |
| 29 #include "core/HTMLNames.h" | 29 #include "core/HTMLNames.h" |
| 30 #include "core/dom/NodeTraversal.h" | 30 #include "core/dom/NodeTraversal.h" |
| 31 #include "core/dom/Text.h" | 31 #include "core/dom/Text.h" |
| 32 #include "core/editing/EditingUtilities.h" | 32 #include "core/editing/EditingUtilities.h" |
| 33 #include "core/editing/VisiblePosition.h" | 33 #include "core/editing/VisiblePosition.h" |
| 34 #include "core/html/HTMLBRElement.h" | 34 #include "core/html/HTMLBRElement.h" |
| 35 #include "core/html/HTMLElement.h" | 35 #include "core/html/HTMLElement.h" |
| 36 #include "core/html/HTMLQuoteElement.h" | 36 #include "core/html/HTMLQuoteElement.h" |
| 37 #include "core/layout/LayoutListItem.h" | 37 #include "core/layout/LayoutListItem.h" |
| (...skipping 155 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 193 moveRemainingSiblingsToNewParent(startNode, 0, clonedAncestor); | 193 moveRemainingSiblingsToNewParent(startNode, 0, clonedAncestor); |
| 194 | 194 |
| 195 if (!ancestors.isEmpty()) { | 195 if (!ancestors.isEmpty()) { |
| 196 // Split the tree up the ancestor chain until the topBlockquote | 196 // Split the tree up the ancestor chain until the topBlockquote |
| 197 // Throughout this loop, clonedParent is the clone of ancestor's parent. | 197 // Throughout this loop, clonedParent is the clone of ancestor's parent. |
| 198 // This is so we can clone ancestor's siblings and place the clones | 198 // This is so we can clone ancestor's siblings and place the clones |
| 199 // into the clone corresponding to the ancestor's parent. | 199 // into the clone corresponding to the ancestor's parent. |
| 200 RefPtrWillBeRawPtr<Element> ancestor = nullptr; | 200 RefPtrWillBeRawPtr<Element> ancestor = nullptr; |
| 201 RefPtrWillBeRawPtr<Element> clonedParent = nullptr; | 201 RefPtrWillBeRawPtr<Element> clonedParent = nullptr; |
| 202 for (ancestor = ancestors.first(), clonedParent = clonedAncestor->parent
Element(); | 202 for (ancestor = ancestors.first(), clonedParent = clonedAncestor->parent
Element(); |
| 203 ancestor && ancestor != topBlockquote; | 203 ancestor && ancestor != topBlockquote; |
| 204 ancestor = ancestor->parentElement(), clonedParent = clonedParent->
parentElement()) | 204 ancestor = ancestor->parentElement(), clonedParent = clonedParent->p
arentElement()) |
| 205 moveRemainingSiblingsToNewParent(ancestor->nextSibling(), 0, clonedP
arent); | 205 moveRemainingSiblingsToNewParent(ancestor->nextSibling(), 0, clonedP
arent); |
| 206 | 206 |
| 207 // If the startNode's original parent is now empty, remove it | 207 // If the startNode's original parent is now empty, remove it |
| 208 Element* originalParent = ancestors.first().get(); | 208 Element* originalParent = ancestors.first().get(); |
| 209 if (!originalParent->hasChildren()) | 209 if (!originalParent->hasChildren()) |
| 210 removeNode(originalParent); | 210 removeNode(originalParent); |
| 211 } | 211 } |
| 212 | 212 |
| 213 // Make sure the cloned block quote renders. | 213 // Make sure the cloned block quote renders. |
| 214 addBlockPlaceholderIfNeeded(clonedBlockquote.get()); | 214 addBlockPlaceholderIfNeeded(clonedBlockquote.get()); |
| 215 | 215 |
| 216 // Put the selection right before the break. | 216 // Put the selection right before the break. |
| 217 setEndingSelection(VisibleSelection(positionBeforeNode(breakElement.get()),
DOWNSTREAM, endingSelection().isDirectional())); | 217 setEndingSelection(VisibleSelection(positionBeforeNode(breakElement.get()),
DOWNSTREAM, endingSelection().isDirectional())); |
| 218 rebalanceWhitespace(); | 218 rebalanceWhitespace(); |
| 219 } | 219 } |
| 220 | 220 |
| 221 } // namespace blink | 221 } // namespace blink |
| OLD | NEW |