| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006, 2008 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2004, 2005, 2006, 2008 Nikolas Zimmermann <zimmermann@kde.org> |
| 3 * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org> |
| 4 * | 4 * |
| 5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
| 7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
| 8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
| 9 * | 9 * |
| 10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
| (...skipping 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 110 m_clients.remove(element); | 110 m_clients.remove(element); |
| 111 } | 111 } |
| 112 | 112 |
| 113 void SVGCursorElement::svgAttributeChanged(const QualifiedName& attrName) | 113 void SVGCursorElement::svgAttributeChanged(const QualifiedName& attrName) |
| 114 { | 114 { |
| 115 if (!isSupportedAttribute(attrName)) { | 115 if (!isSupportedAttribute(attrName)) { |
| 116 SVGElement::svgAttributeChanged(attrName); | 116 SVGElement::svgAttributeChanged(attrName); |
| 117 return; | 117 return; |
| 118 } | 118 } |
| 119 | 119 |
| 120 SVGElementInstance::InvalidationGuard invalidationGuard(this); | 120 SVGElement::InvalidationGuard invalidationGuard(this); |
| 121 | 121 |
| 122 // Any change of a cursor specific attribute triggers this recalc. | 122 // Any change of a cursor specific attribute triggers this recalc. |
| 123 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >::const_iterator it =
m_clients.begin(); | 123 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >::const_iterator it =
m_clients.begin(); |
| 124 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >::const_iterator end =
m_clients.end(); | 124 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >::const_iterator end =
m_clients.end(); |
| 125 | 125 |
| 126 for (; it != end; ++it) | 126 for (; it != end; ++it) |
| 127 (*it)->setNeedsStyleRecalc(SubtreeStyleChange); | 127 (*it)->setNeedsStyleRecalc(SubtreeStyleChange); |
| 128 } | 128 } |
| 129 | 129 |
| 130 void SVGCursorElement::trace(Visitor* visitor) | 130 void SVGCursorElement::trace(Visitor* visitor) |
| 131 { | 131 { |
| 132 visitor->trace(m_clients); | 132 visitor->trace(m_clients); |
| 133 SVGElement::trace(visitor); | 133 SVGElement::trace(visitor); |
| 134 } | 134 } |
| 135 | 135 |
| 136 } | 136 } |
| OLD | NEW |