| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2009 Google Inc. All rights reserved. | 2 * Copyright (c) 2009 Google 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 are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 49 } | 49 } |
| 50 | 50 |
| 51 static void swapInNodePreservingAttributesAndChildren(const Handle<HTMLElement>&
newNode, const Handle<HTMLElement>& nodeToReplace) | 51 static void swapInNodePreservingAttributesAndChildren(const Handle<HTMLElement>&
newNode, const Handle<HTMLElement>& nodeToReplace) |
| 52 { | 52 { |
| 53 ASSERT(nodeToReplace->inDocument()); | 53 ASSERT(nodeToReplace->inDocument()); |
| 54 Handle<ContainerNode> parentNode = nodeToReplace->parentNode(); | 54 Handle<ContainerNode> parentNode = nodeToReplace->parentNode(); |
| 55 parentNode->insertBefore(newNode, nodeToReplace, ASSERT_NO_EXCEPTION); | 55 parentNode->insertBefore(newNode, nodeToReplace, ASSERT_NO_EXCEPTION); |
| 56 | 56 |
| 57 NodeVector children; | 57 NodeVector children; |
| 58 getChildNodes(nodeToReplace.raw(), children); | 58 getChildNodes(nodeToReplace.raw(), children); |
| 59 for (size_t i = 0; i < children.size(); ++i) | 59 for (size_t i = 0; i < children->size(); ++i) |
| 60 newNode->appendChild(children[i], ASSERT_NO_EXCEPTION); | 60 newNode->appendChild(children[i], ASSERT_NO_EXCEPTION); |
| 61 | 61 |
| 62 // FIXME: Fix this to send the proper MutationRecords when MutationObservers
are present. | 62 // FIXME: Fix this to send the proper MutationRecords when MutationObservers
are present. |
| 63 newNode->cloneDataFromElement(*nodeToReplace.raw()); | 63 newNode->cloneDataFromElement(*nodeToReplace.raw()); |
| 64 | 64 |
| 65 parentNode->removeChild(nodeToReplace, ASSERT_NO_EXCEPTION); | 65 parentNode->removeChild(nodeToReplace, ASSERT_NO_EXCEPTION); |
| 66 } | 66 } |
| 67 | 67 |
| 68 void ReplaceNodeWithSpanCommand::doApply() | 68 void ReplaceNodeWithSpanCommand::doApply() |
| 69 { | 69 { |
| (...skipping 13 matching lines...) Expand all Loading... |
| 83 | 83 |
| 84 #ifndef NDEBUG | 84 #ifndef NDEBUG |
| 85 void ReplaceNodeWithSpanCommand::getNodesInCommand(HashSet<Node*>& nodes) | 85 void ReplaceNodeWithSpanCommand::getNodesInCommand(HashSet<Node*>& nodes) |
| 86 { | 86 { |
| 87 addNodeAndDescendants(m_elementToReplace.raw(), nodes); | 87 addNodeAndDescendants(m_elementToReplace.raw(), nodes); |
| 88 addNodeAndDescendants(m_spanElement.raw(), nodes); | 88 addNodeAndDescendants(m_spanElement.raw(), nodes); |
| 89 } | 89 } |
| 90 #endif | 90 #endif |
| 91 | 91 |
| 92 } // namespace WebCore | 92 } // namespace WebCore |
| OLD | NEW |