OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2013 Apple Inc. All rights | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2013 Apple Inc. All rights |
6 * reserved. | 6 * reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 329 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
340 setFirstChild(&child); | 340 setFirstChild(&child); |
341 } | 341 } |
342 setLastChild(&child); | 342 setLastChild(&child); |
343 } | 343 } |
344 | 344 |
345 bool ContainerNode::checkParserAcceptChild(const Node& newChild) const { | 345 bool ContainerNode::checkParserAcceptChild(const Node& newChild) const { |
346 if (!isDocumentNode()) | 346 if (!isDocumentNode()) |
347 return true; | 347 return true; |
348 // TODO(esprehn): Are there other conditions where the parser can create | 348 // TODO(esprehn): Are there other conditions where the parser can create |
349 // invalid trees? | 349 // invalid trees? |
350 return toDocument(*this).canAcceptChild(newChild, nullptr, IGNORE_EXCEPTION); | 350 return toDocument(*this).canAcceptChild(newChild, nullptr, |
| 351 IGNORE_EXCEPTION_FOR_TESTING); |
351 } | 352 } |
352 | 353 |
353 void ContainerNode::parserInsertBefore(Node* newChild, Node& nextChild) { | 354 void ContainerNode::parserInsertBefore(Node* newChild, Node& nextChild) { |
354 DCHECK(newChild); | 355 DCHECK(newChild); |
355 DCHECK_EQ(nextChild.parentNode(), this); | 356 DCHECK_EQ(nextChild.parentNode(), this); |
356 DCHECK(!newChild->isDocumentFragment()); | 357 DCHECK(!newChild->isDocumentFragment()); |
357 DCHECK(!isHTMLTemplateElement(this)); | 358 DCHECK(!isHTMLTemplateElement(this)); |
358 | 359 |
359 if (nextChild.previousSibling() == newChild || | 360 if (nextChild.previousSibling() == newChild || |
360 &nextChild == newChild) // nothing to do | 361 &nextChild == newChild) // nothing to do |
(...skipping 1108 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1469 return true; | 1470 return true; |
1470 | 1471 |
1471 if (node->isElementNode() && toElement(node)->shadow()) | 1472 if (node->isElementNode() && toElement(node)->shadow()) |
1472 return true; | 1473 return true; |
1473 | 1474 |
1474 return false; | 1475 return false; |
1475 } | 1476 } |
1476 #endif | 1477 #endif |
1477 | 1478 |
1478 } // namespace blink | 1479 } // namespace blink |
OLD | NEW |