OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2006 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2006 Nikolas Zimmermann <zimmermann@kde.org> |
3 * | 3 * |
4 * This library is free software; you can redistribute it and/or | 4 * This library is free software; you can redistribute it and/or |
5 * modify it under the terms of the GNU Library General Public | 5 * modify it under the terms of the GNU Library General Public |
6 * License as published by the Free Software Foundation; either | 6 * License as published by the Free Software Foundation; either |
7 * version 2 of the License, or (at your option) any later version. | 7 * version 2 of the License, or (at your option) any later version. |
8 * | 8 * |
9 * This library is distributed in the hope that it will be useful, | 9 * This library is distributed in the hope that it will be useful, |
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
12 * Library General Public License for more details. | 12 * Library General Public License for more details. |
13 * | 13 * |
14 * You should have received a copy of the GNU Library General Public License | 14 * You should have received a copy of the GNU Library General Public License |
15 * along with this library; see the file COPYING.LIB. If not, write to | 15 * along with this library; see the file COPYING.LIB. If not, write to |
16 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 16 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
17 * Boston, MA 02110-1301, USA. | 17 * Boston, MA 02110-1301, USA. |
18 */ | 18 */ |
19 | 19 |
20 #ifndef LinearGradientAttributes_h | 20 #ifndef LinearGradientAttributes_h |
21 #define LinearGradientAttributes_h | 21 #define LinearGradientAttributes_h |
22 | 22 |
23 #include "core/svg/GradientAttributes.h" | 23 #include "core/svg/GradientAttributes.h" |
24 | 24 |
25 namespace WebCore { | 25 namespace WebCore { |
26 struct LinearGradientAttributes : GradientAttributes { | 26 struct LinearGradientAttributes : GradientAttributes { |
27 LinearGradientAttributes() | 27 LinearGradientAttributes() |
28 : m_x1() | 28 : m_x1(SVGLength::create(LengthModeWidth)) |
29 , m_y1() | 29 , m_y1(SVGLength::create(LengthModeWidth)) |
30 , m_x2(LengthModeWidth, "100%") | 30 , m_x2(SVGLength::create(LengthModeWidth)) |
31 , m_y2() | 31 , m_y2(SVGLength::create(LengthModeWidth)) |
32 , m_x1Set(false) | 32 , m_x1Set(false) |
33 , m_y1Set(false) | 33 , m_y1Set(false) |
34 , m_x2Set(false) | 34 , m_x2Set(false) |
35 , m_y2Set(false) | 35 , m_y2Set(false) |
36 { | 36 { |
| 37 m_x2->setValueAsString("100%", ASSERT_NO_EXCEPTION); |
37 } | 38 } |
38 | 39 |
39 SVGLength x1() const { return m_x1; } | 40 SVGLength* x1() const { return m_x1.get(); } |
40 SVGLength y1() const { return m_y1; } | 41 SVGLength* y1() const { return m_y1.get(); } |
41 SVGLength x2() const { return m_x2; } | 42 SVGLength* x2() const { return m_x2.get(); } |
42 SVGLength y2() const { return m_y2; } | 43 SVGLength* y2() const { return m_y2.get(); } |
43 | 44 |
44 void setX1(const SVGLength& value) { m_x1 = value; m_x1Set = true; } | 45 void setX1(PassRefPtr<SVGLength> value) { m_x1 = value; m_x1Set = true; } |
45 void setY1(const SVGLength& value) { m_y1 = value; m_y1Set = true; } | 46 void setY1(PassRefPtr<SVGLength> value) { m_y1 = value; m_y1Set = true; } |
46 void setX2(const SVGLength& value) { m_x2 = value; m_x2Set = true; } | 47 void setX2(PassRefPtr<SVGLength> value) { m_x2 = value; m_x2Set = true; } |
47 void setY2(const SVGLength& value) { m_y2 = value; m_y2Set = true; } | 48 void setY2(PassRefPtr<SVGLength> value) { m_y2 = value; m_y2Set = true; } |
48 | 49 |
49 bool hasX1() const { return m_x1Set; } | 50 bool hasX1() const { return m_x1Set; } |
50 bool hasY1() const { return m_y1Set; } | 51 bool hasY1() const { return m_y1Set; } |
51 bool hasX2() const { return m_x2Set; } | 52 bool hasX2() const { return m_x2Set; } |
52 bool hasY2() const { return m_y2Set; } | 53 bool hasY2() const { return m_y2Set; } |
53 | 54 |
54 private: | 55 private: |
55 // Properties | 56 // Properties |
56 SVGLength m_x1; | 57 RefPtr<SVGLength> m_x1; |
57 SVGLength m_y1; | 58 RefPtr<SVGLength> m_y1; |
58 SVGLength m_x2; | 59 RefPtr<SVGLength> m_x2; |
59 SVGLength m_y2; | 60 RefPtr<SVGLength> m_y2; |
60 | 61 |
61 // Property states | 62 // Property states |
62 bool m_x1Set : 1; | 63 bool m_x1Set : 1; |
63 bool m_y1Set : 1; | 64 bool m_y1Set : 1; |
64 bool m_x2Set : 1; | 65 bool m_x2Set : 1; |
65 bool m_y2Set : 1; | 66 bool m_y2Set : 1; |
66 }; | 67 }; |
67 | 68 |
68 } // namespace WebCore | 69 } // namespace WebCore |
69 | 70 |
70 #endif | 71 #endif |
71 | 72 |
72 // vim:ts=4:noet | 73 // vim:ts=4:noet |
OLD | NEW |