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, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2013 Appl e Inc. All rights reserved. | 6 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2013 Appl e 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 798 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
809 return isElementNode() && toElement(this)->hasID(); | 809 return isElementNode() && toElement(this)->hasID(); |
810 } | 810 } |
811 | 811 |
812 inline bool Node::hasClass() const | 812 inline bool Node::hasClass() const |
813 { | 813 { |
814 return isElementNode() && toElement(this)->hasClass(); | 814 return isElementNode() && toElement(this)->hasClass(); |
815 } | 815 } |
816 | 816 |
817 inline Node::InsertionNotificationRequest Node::insertedInto(ContainerNode* inse rtionPoint) | 817 inline Node::InsertionNotificationRequest Node::insertedInto(ContainerNode* inse rtionPoint) |
818 { | 818 { |
819 ASSERT(!childNeedsStyleInvalidation() && !needsStyleInvalidation()); | |
esprehn
2014/05/08 05:19:06
ditto
chrishtr
2014/05/08 05:29:18
Done.
| |
819 ASSERT(insertionPoint->inDocument() || isContainerNode()); | 820 ASSERT(insertionPoint->inDocument() || isContainerNode()); |
820 if (insertionPoint->inDocument()) | 821 if (insertionPoint->inDocument()) |
821 setFlag(InDocumentFlag); | 822 setFlag(InDocumentFlag); |
822 if (parentOrShadowHostNode()->isInShadowTree()) | 823 if (parentOrShadowHostNode()->isInShadowTree()) |
823 setFlag(IsInShadowTreeFlag); | 824 setFlag(IsInShadowTreeFlag); |
824 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio nRecalc()) | 825 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio nRecalc()) |
825 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); | 826 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); |
826 return InsertionDone; | 827 return InsertionDone; |
827 } | 828 } |
828 | 829 |
(...skipping 47 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
876 template <> inline bool isElementOfType<const thisType>(const Element& eleme nt) { return element.predicate; } \ | 877 template <> inline bool isElementOfType<const thisType>(const Element& eleme nt) { return element.predicate; } \ |
877 DEFINE_NODE_TYPE_CASTS(thisType, predicate) | 878 DEFINE_NODE_TYPE_CASTS(thisType, predicate) |
878 | 879 |
879 #define DEFINE_ELEMENT_TYPE_CASTS_WITH_FUNCTION(thisType) \ | 880 #define DEFINE_ELEMENT_TYPE_CASTS_WITH_FUNCTION(thisType) \ |
880 template <> inline bool isElementOfType<const thisType>(const Element& eleme nt) { return is##thisType(element); } \ | 881 template <> inline bool isElementOfType<const thisType>(const Element& eleme nt) { return is##thisType(element); } \ |
881 DEFINE_NODE_TYPE_CASTS_WITH_FUNCTION(thisType) | 882 DEFINE_NODE_TYPE_CASTS_WITH_FUNCTION(thisType) |
882 | 883 |
883 } // namespace | 884 } // namespace |
884 | 885 |
885 #endif | 886 #endif |
OLD | NEW |