| 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 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All r
ights reserved. | 4 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All r
ights reserved. |
| 5 * Copyright (C) 2014 Samsung Electronics. All rights reserved. | 5 * Copyright (C) 2014 Samsung Electronics. All rights reserved. |
| 6 * | 6 * |
| 7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
| 8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
| 9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
| 10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
| (...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 118 m_namedItemCache = cache; | 118 m_namedItemCache = cache; |
| 119 } | 119 } |
| 120 | 120 |
| 121 NamedItemCache& namedItemCache() const | 121 NamedItemCache& namedItemCache() const |
| 122 { | 122 { |
| 123 ASSERT(m_namedItemCache); | 123 ASSERT(m_namedItemCache); |
| 124 return *m_namedItemCache; | 124 return *m_namedItemCache; |
| 125 } | 125 } |
| 126 | 126 |
| 127 private: | 127 private: |
| 128 Element* traverseNextElement(Element& previous) const; | |
| 129 | |
| 130 void invalidateIdNameCacheMaps(Document* oldDocument = 0) const | 128 void invalidateIdNameCacheMaps(Document* oldDocument = 0) const |
| 131 { | 129 { |
| 132 if (!hasValidIdNameCache()) | 130 if (!hasValidIdNameCache()) |
| 133 return; | 131 return; |
| 134 | 132 |
| 135 // Make sure we decrement the NodeListWithIdNameCache count from | 133 // Make sure we decrement the NodeListWithIdNameCache count from |
| 136 // the old document instead of the new one in the case the collection | 134 // the old document instead of the new one in the case the collection |
| 137 // is moved to a new document. | 135 // is moved to a new document. |
| 138 unregisterIdNameCacheFromDocument(oldDocument ? *oldDocument : document(
)); | 136 unregisterIdNameCacheFromDocument(oldDocument ? *oldDocument : document(
)); |
| 139 | 137 |
| (...skipping 18 matching lines...) Expand all Loading... |
| 158 { | 156 { |
| 159 if (!attrName || shouldInvalidateTypeOnAttributeChange(invalidationType(), *
attrName)) | 157 if (!attrName || shouldInvalidateTypeOnAttributeChange(invalidationType(), *
attrName)) |
| 160 invalidateCache(); | 158 invalidateCache(); |
| 161 else if (*attrName == HTMLNames::idAttr || *attrName == HTMLNames::nameAttr) | 159 else if (*attrName == HTMLNames::idAttr || *attrName == HTMLNames::nameAttr) |
| 162 invalidateIdNameCacheMaps(); | 160 invalidateIdNameCacheMaps(); |
| 163 } | 161 } |
| 164 | 162 |
| 165 } // namespace | 163 } // namespace |
| 166 | 164 |
| 167 #endif | 165 #endif |
| OLD | NEW |