OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2004, 2005, 2006, 2007 Nikolas Zimmermann <zimmermann@kde.org> |
3 * Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org> |
4 * Copyright (C) 2006 Samuel Weinig <sam.weinig@gmail.com> | 4 * Copyright (C) 2006 Samuel Weinig <sam.weinig@gmail.com> |
5 * Copyright (C) Research In Motion Limited 2010. All rights reserved. | 5 * Copyright (C) Research In Motion Limited 2010. 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 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
50 SVGAnimatedLength* x() const { return m_x.get(); } | 50 SVGAnimatedLength* x() const { return m_x.get(); } |
51 SVGAnimatedLength* y() const { return m_y.get(); } | 51 SVGAnimatedLength* y() const { return m_y.get(); } |
52 SVGAnimatedLength* width() const { return m_width.get(); } | 52 SVGAnimatedLength* width() const { return m_width.get(); } |
53 SVGAnimatedLength* height() const { return m_height.get(); } | 53 SVGAnimatedLength* height() const { return m_height.get(); } |
54 SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>* filterUnits() { return m_
filterUnits.get(); } | 54 SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>* filterUnits() { return m_
filterUnits.get(); } |
55 SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>* primitiveUnits() { return
m_primitiveUnits.get(); } | 55 SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>* primitiveUnits() { return
m_primitiveUnits.get(); } |
56 | 56 |
57 private: | 57 private: |
58 explicit SVGFilterElement(Document&); | 58 explicit SVGFilterElement(Document&); |
59 | 59 |
60 virtual bool needsPendingResourceHandling() const override { return false; } | 60 bool needsPendingResourceHandling() const override { return false; } |
61 | 61 |
62 virtual void svgAttributeChanged(const QualifiedName&) override; | 62 void svgAttributeChanged(const QualifiedName&) override; |
63 virtual void childrenChanged(const ChildrenChange&) override; | 63 void childrenChanged(const ChildrenChange&) override; |
64 | 64 |
65 virtual LayoutObject* createLayoutObject(const ComputedStyle&) override; | 65 LayoutObject* createLayoutObject(const ComputedStyle&) override; |
66 | 66 |
67 virtual bool selfHasRelativeLengths() const override; | 67 bool selfHasRelativeLengths() const override; |
68 | 68 |
69 RefPtrWillBeMember<SVGAnimatedLength> m_x; | 69 RefPtrWillBeMember<SVGAnimatedLength> m_x; |
70 RefPtrWillBeMember<SVGAnimatedLength> m_y; | 70 RefPtrWillBeMember<SVGAnimatedLength> m_y; |
71 RefPtrWillBeMember<SVGAnimatedLength> m_width; | 71 RefPtrWillBeMember<SVGAnimatedLength> m_width; |
72 RefPtrWillBeMember<SVGAnimatedLength> m_height; | 72 RefPtrWillBeMember<SVGAnimatedLength> m_height; |
73 RefPtrWillBeMember<SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>> m_filt
erUnits; | 73 RefPtrWillBeMember<SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>> m_filt
erUnits; |
74 RefPtrWillBeMember<SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>> m_prim
itiveUnits; | 74 RefPtrWillBeMember<SVGAnimatedEnumeration<SVGUnitTypes::SVGUnitType>> m_prim
itiveUnits; |
75 | 75 |
76 WillBeHeapHashSet<RefPtrWillBeMember<Node>> m_clientsToAdd; | 76 WillBeHeapHashSet<RefPtrWillBeMember<Node>> m_clientsToAdd; |
77 }; | 77 }; |
78 | 78 |
79 } // namespace blink | 79 } // namespace blink |
80 | 80 |
81 #endif // SVGFilterElement_h | 81 #endif // SVGFilterElement_h |
OLD | NEW |