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) 2004, 2005, 2006, 2007, 2009, 2010, 2012 Apple Inc. All rights
reserved. | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2012 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 153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
164 bool Attr::childTypeAllowed(NodeType type) const | 164 bool Attr::childTypeAllowed(NodeType type) const |
165 { | 165 { |
166 return TEXT_NODE == type; | 166 return TEXT_NODE == type; |
167 } | 167 } |
168 | 168 |
169 void Attr::childrenChanged(const ChildrenChange&) | 169 void Attr::childrenChanged(const ChildrenChange&) |
170 { | 170 { |
171 if (m_ignoreChildrenChanged > 0) | 171 if (m_ignoreChildrenChanged > 0) |
172 return; | 172 return; |
173 | 173 |
174 UseCounter::count(document(), UseCounter::AttrChildChange); | 174 UseCounter::countDeprecation(document(), UseCounter::AttrChildChange); |
175 | 175 |
176 QualifiedName name = qualifiedName(); | 176 QualifiedName name = qualifiedName(); |
177 invalidateNodeListCachesInAncestors(&name, m_element); | 177 invalidateNodeListCachesInAncestors(&name, m_element); |
178 | 178 |
179 StringBuilder valueBuilder; | 179 StringBuilder valueBuilder; |
180 for (Node *n = firstChild(); n; n = n->nextSibling()) { | 180 for (Node *n = firstChild(); n; n = n->nextSibling()) { |
181 if (n->isTextNode()) | 181 if (n->isTextNode()) |
182 valueBuilder.append(toText(n)->data()); | 182 valueBuilder.append(toText(n)->data()); |
183 } | 183 } |
184 | 184 |
(...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
223 m_standaloneValueOrAttachedLocalName = attachedLocalName; | 223 m_standaloneValueOrAttachedLocalName = attachedLocalName; |
224 } | 224 } |
225 | 225 |
226 DEFINE_TRACE(Attr) | 226 DEFINE_TRACE(Attr) |
227 { | 227 { |
228 visitor->trace(m_element); | 228 visitor->trace(m_element); |
229 ContainerNode::trace(visitor); | 229 ContainerNode::trace(visitor); |
230 } | 230 } |
231 | 231 |
232 } | 232 } |
OLD | NEW |