| 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 Peter Kelly (pmk@post.com) | 4 * (C) 2001 Peter Kelly (pmk@post.com) |
| 5 * (C) 2001 Dirk Mueller (mueller@kde.org) | 5 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 6 * Copyright (C) 2003-2011, 2013, 2014 Apple Inc. All rights reserved. | 6 * Copyright (C) 2003-2011, 2013, 2014 Apple Inc. All rights 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 512 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 523 | 523 |
| 524 inline UniqueElementData& Element::ensureUniqueElementData() | 524 inline UniqueElementData& Element::ensureUniqueElementData() |
| 525 { | 525 { |
| 526 if (!elementData() || !elementData()->isUnique()) | 526 if (!elementData() || !elementData()->isUnique()) |
| 527 createUniqueElementData(); | 527 createUniqueElementData(); |
| 528 return toUniqueElementData(*m_elementData); | 528 return toUniqueElementData(*m_elementData); |
| 529 } | 529 } |
| 530 | 530 |
| 531 inline Node::InsertionNotificationRequest Node::insertedInto(ContainerNode* inse
rtionPoint) | 531 inline Node::InsertionNotificationRequest Node::insertedInto(ContainerNode* inse
rtionPoint) |
| 532 { | 532 { |
| 533 ASSERT(!childNeedsStyleInvalidation()); | |
| 534 ASSERT(!needsStyleInvalidation()); | |
| 535 ASSERT(insertionPoint->inDocument() || isContainerNode()); | 533 ASSERT(insertionPoint->inDocument() || isContainerNode()); |
| 536 if (insertionPoint->inDocument()) | 534 if (insertionPoint->inDocument()) |
| 537 setFlag(InDocumentFlag); | 535 setFlag(InDocumentFlag); |
| 538 if (parentOrShadowHostNode()->isInShadowTree()) | 536 if (parentOrShadowHostNode()->isInShadowTree()) |
| 539 setFlag(IsInShadowTreeFlag); | 537 setFlag(IsInShadowTreeFlag); |
| 540 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio
nRecalc()) | 538 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio
nRecalc()) |
| 541 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); | 539 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); |
| 542 return InsertionDone; | 540 return InsertionDone; |
| 543 } | 541 } |
| 544 | 542 |
| (...skipping 44 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 589 static PassRefPtr<T> create(const QualifiedName&, Document&) | 587 static PassRefPtr<T> create(const QualifiedName&, Document&) |
| 590 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ | 588 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ |
| 591 PassRefPtr<T> T::create(const QualifiedName& tagName, Document& document) \ | 589 PassRefPtr<T> T::create(const QualifiedName& tagName, Document& document) \ |
| 592 { \ | 590 { \ |
| 593 return adoptRef(new T(tagName, document)); \ | 591 return adoptRef(new T(tagName, document)); \ |
| 594 } | 592 } |
| 595 | 593 |
| 596 } // namespace | 594 } // namespace |
| 597 | 595 |
| 598 #endif // Element_h | 596 #endif // Element_h |
| OLD | NEW |