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 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006 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 20 matching lines...) Expand all Loading... |
31 namespace blink { | 31 namespace blink { |
32 | 32 |
33 class SVGCursorElement final : public SVGElement, | 33 class SVGCursorElement final : public SVGElement, |
34 public SVGTests, | 34 public SVGTests, |
35 public SVGURIReference { | 35 public SVGURIReference { |
36 DEFINE_WRAPPERTYPEINFO(); | 36 DEFINE_WRAPPERTYPEINFO(); |
37 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(SVGCursorElement); | 37 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(SVGCursorElement); |
38 public: | 38 public: |
39 DECLARE_NODE_FACTORY(SVGCursorElement); | 39 DECLARE_NODE_FACTORY(SVGCursorElement); |
40 | 40 |
41 virtual ~SVGCursorElement(); | 41 ~SVGCursorElement() override; |
42 | 42 |
43 void addClient(SVGElement*); | 43 void addClient(SVGElement*); |
44 #if !ENABLE(OILPAN) | 44 #if !ENABLE(OILPAN) |
45 void removeClient(SVGElement*); | 45 void removeClient(SVGElement*); |
46 #endif | 46 #endif |
47 void removeReferencedElement(SVGElement*); | 47 void removeReferencedElement(SVGElement*); |
48 | 48 |
49 SVGAnimatedLength* x() const { return m_x.get(); } | 49 SVGAnimatedLength* x() const { return m_x.get(); } |
50 SVGAnimatedLength* y() const { return m_y.get(); } | 50 SVGAnimatedLength* y() const { return m_y.get(); } |
51 | 51 |
52 DECLARE_VIRTUAL_TRACE(); | 52 DECLARE_VIRTUAL_TRACE(); |
53 | 53 |
54 private: | 54 private: |
55 explicit SVGCursorElement(Document&); | 55 explicit SVGCursorElement(Document&); |
56 | 56 |
57 virtual bool isValid() const override { return SVGTests::isValid(document())
; } | 57 bool isValid() const override { return SVGTests::isValid(document()); } |
58 | 58 |
59 virtual void svgAttributeChanged(const QualifiedName&) override; | 59 void svgAttributeChanged(const QualifiedName&) override; |
60 | 60 |
61 virtual bool layoutObjectIsNeeded(const ComputedStyle&) override { return fa
lse; } | 61 bool layoutObjectIsNeeded(const ComputedStyle&) override { return false; } |
62 | 62 |
63 RefPtrWillBeMember<SVGAnimatedLength> m_x; | 63 RefPtrWillBeMember<SVGAnimatedLength> m_x; |
64 RefPtrWillBeMember<SVGAnimatedLength> m_y; | 64 RefPtrWillBeMember<SVGAnimatedLength> m_y; |
65 | 65 |
66 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement>> m_clients; | 66 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement>> m_clients; |
67 }; | 67 }; |
68 | 68 |
69 } // namespace blink | 69 } // namespace blink |
70 | 70 |
71 #endif // SVGCursorElement_h | 71 #endif // SVGCursorElement_h |
OLD | NEW |