| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2005, 2006, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2005, 2006, 2008 Apple Inc. All rights reserved. |
| 3 * Copyright (C) 2009, 2010, 2011 Google Inc. All rights reserved. | 3 * Copyright (C) 2009, 2010, 2011 Google Inc. All rights reserved. |
| 4 * | 4 * |
| 5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
| 6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
| 7 * are met: | 7 * are met: |
| 8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. 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 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 323 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 334 } | 334 } |
| 335 | 335 |
| 336 removeNode(holder); | 336 removeNode(holder); |
| 337 } | 337 } |
| 338 | 338 |
| 339 void ReplacementFragment::removeUnrenderedNodes(ContainerNode* holder) { | 339 void ReplacementFragment::removeUnrenderedNodes(ContainerNode* holder) { |
| 340 HeapVector<Member<Node>> unrendered; | 340 HeapVector<Member<Node>> unrendered; |
| 341 | 341 |
| 342 for (Node& node : NodeTraversal::descendantsOf(*holder)) { | 342 for (Node& node : NodeTraversal::descendantsOf(*holder)) { |
| 343 if (!isNodeRendered(node) && !isTableStructureNode(&node)) | 343 if (!isNodeRendered(node) && !isTableStructureNode(&node)) |
| 344 unrendered.append(&node); | 344 unrendered.push_back(&node); |
| 345 } | 345 } |
| 346 | 346 |
| 347 for (auto& node : unrendered) | 347 for (auto& node : unrendered) |
| 348 removeNode(node); | 348 removeNode(node); |
| 349 } | 349 } |
| 350 | 350 |
| 351 void ReplacementFragment::removeInterchangeNodes(ContainerNode* container) { | 351 void ReplacementFragment::removeInterchangeNodes(ContainerNode* container) { |
| 352 m_hasInterchangeNewlineAtStart = false; | 352 m_hasInterchangeNewlineAtStart = false; |
| 353 m_hasInterchangeNewlineAtEnd = false; | 353 m_hasInterchangeNewlineAtEnd = false; |
| 354 | 354 |
| (...skipping 1775 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2130 visitor->trace(m_startOfInsertedContent); | 2130 visitor->trace(m_startOfInsertedContent); |
| 2131 visitor->trace(m_endOfInsertedContent); | 2131 visitor->trace(m_endOfInsertedContent); |
| 2132 visitor->trace(m_insertionStyle); | 2132 visitor->trace(m_insertionStyle); |
| 2133 visitor->trace(m_documentFragment); | 2133 visitor->trace(m_documentFragment); |
| 2134 visitor->trace(m_startOfInsertedRange); | 2134 visitor->trace(m_startOfInsertedRange); |
| 2135 visitor->trace(m_endOfInsertedRange); | 2135 visitor->trace(m_endOfInsertedRange); |
| 2136 CompositeEditCommand::trace(visitor); | 2136 CompositeEditCommand::trace(visitor); |
| 2137 } | 2137 } |
| 2138 | 2138 |
| 2139 } // namespace blink | 2139 } // namespace blink |
| OLD | NEW |