mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 1 | /* |
darin@apple.com | 48ac3c4 | 2008-06-14 08:46:51 +0000 | [diff] [blame] | 2 | * Copyright (C) 2005, 2008 Apple Inc. All rights reserved. |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions |
| 6 | * are met: |
| 7 | * 1. Redistributions of source code must retain the above copyright |
| 8 | * notice, this list of conditions and the following disclaimer. |
| 9 | * 2. Redistributions in binary form must reproduce the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer in the |
| 11 | * documentation and/or other materials provided with the distribution. |
| 12 | * |
| 13 | * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
| 14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
| 17 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 20 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 21 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 24 | */ |
| 25 | |
mjs | b64c50a | 2005-10-03 21:13:12 +0000 | [diff] [blame] | 26 | #include "config.h" |
darin | a68e043 | 2006-02-14 21:40:54 +0000 | [diff] [blame] | 27 | #include "MergeIdenticalElementsCommand.h" |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 28 | |
darin | 36d1136 | 2006-04-11 16:30:21 +0000 | [diff] [blame] | 29 | #include "Element.h" |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 30 | |
darin | b9481ed | 2006-03-20 02:57:59 +0000 | [diff] [blame] | 31 | namespace WebCore { |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 32 | |
darin@apple.com | 48ac3c4 | 2008-06-14 08:46:51 +0000 | [diff] [blame] | 33 | MergeIdenticalElementsCommand::MergeIdenticalElementsCommand(PassRefPtr<Element> first, PassRefPtr<Element> second) |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 34 | : SimpleEditCommand(first->document()) |
| 35 | , m_element1(first) |
| 36 | , m_element2(second) |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 37 | { |
| 38 | ASSERT(m_element1); |
| 39 | ASSERT(m_element2); |
| 40 | ASSERT(m_element1->nextSibling() == m_element2); |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 41 | } |
| 42 | |
| 43 | void MergeIdenticalElementsCommand::doApply() |
| 44 | { |
| 45 | if (m_element1->nextSibling() != m_element2) |
| 46 | return; |
| 47 | |
| 48 | m_atChild = m_element2->firstChild(); |
| 49 | |
darin | 8d1badc | 2006-03-06 16:50:13 +0000 | [diff] [blame] | 50 | ExceptionCode ec = 0; |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 51 | |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 52 | Vector<RefPtr<Node> > children; |
| 53 | for (Node* child = m_element1->firstChild(); child; child = child->nextSibling()) |
| 54 | children.append(child); |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 55 | |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 56 | size_t size = children.size(); |
| 57 | for (size_t i = 0; i < size; ++i) |
| 58 | m_element2->insertBefore(children[i].release(), m_atChild.get(), ec); |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 59 | |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 60 | m_element1->remove(ec); |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 61 | } |
| 62 | |
| 63 | void MergeIdenticalElementsCommand::doUnapply() |
| 64 | { |
| 65 | ASSERT(m_element1); |
| 66 | ASSERT(m_element2); |
| 67 | |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 68 | RefPtr<Node> atChild = m_atChild.release(); |
| 69 | |
| 70 | Node* parent = m_element2->parent(); |
| 71 | if (!parent) |
| 72 | return; |
| 73 | |
darin | 8d1badc | 2006-03-06 16:50:13 +0000 | [diff] [blame] | 74 | ExceptionCode ec = 0; |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 75 | |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 76 | parent->insertBefore(m_element1.get(), m_element2.get(), ec); |
| 77 | if (ec) |
| 78 | return; |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 79 | |
darin@apple.com | e95b53d | 2008-12-23 21:42:46 +0000 | [diff] [blame] | 80 | Vector<RefPtr<Node> > children; |
| 81 | for (Node* child = m_element2->firstChild(); child && child != atChild; child = child->nextSibling()) |
| 82 | children.append(child); |
| 83 | |
| 84 | size_t size = children.size(); |
| 85 | for (size_t i = 0; i < size; ++i) |
| 86 | m_element1->appendChild(children[i].release(), ec); |
mjs | 84e724c | 2005-05-24 07:21:47 +0000 | [diff] [blame] | 87 | } |
| 88 | |
darin | b9481ed | 2006-03-20 02:57:59 +0000 | [diff] [blame] | 89 | } // namespace WebCore |