1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* Copyright (C) 2006 Nikolas Zimmermann <zimmermann@kde.org>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#ifndef LinearGradientAttributes_h
#define LinearGradientAttributes_h
#include "core/svg/GradientAttributes.h"
#include "core/svg/SVGLength.h"
#include "platform/heap/Handle.h"
namespace blink {
struct LinearGradientAttributes : GradientAttributes {
DISALLOW_NEW();
public:
LinearGradientAttributes()
: m_x1(SVGLength::create(SVGLengthMode::Width)),
m_y1(SVGLength::create(SVGLengthMode::Height)),
m_x2(SVGLength::create(SVGLengthMode::Width)),
m_y2(SVGLength::create(SVGLengthMode::Height)),
m_x1Set(false),
m_y1Set(false),
m_x2Set(false),
m_y2Set(false) {
m_x2->setValueAsString("100%");
}
SVGLength* x1() const { return m_x1.get(); }
SVGLength* y1() const { return m_y1.get(); }
SVGLength* x2() const { return m_x2.get(); }
SVGLength* y2() const { return m_y2.get(); }
void setX1(SVGLength* value) {
m_x1 = value;
m_x1Set = true;
}
void setY1(SVGLength* value) {
m_y1 = value;
m_y1Set = true;
}
void setX2(SVGLength* value) {
m_x2 = value;
m_x2Set = true;
}
void setY2(SVGLength* value) {
m_y2 = value;
m_y2Set = true;
}
bool hasX1() const { return m_x1Set; }
bool hasY1() const { return m_y1Set; }
bool hasX2() const { return m_x2Set; }
bool hasY2() const { return m_y2Set; }
DEFINE_INLINE_TRACE() {
visitor->trace(m_x1);
visitor->trace(m_y1);
visitor->trace(m_x2);
visitor->trace(m_y2);
}
private:
// Properties
Member<SVGLength> m_x1;
Member<SVGLength> m_y1;
Member<SVGLength> m_x2;
Member<SVGLength> m_y2;
// Property states
bool m_x1Set : 1;
bool m_y1Set : 1;
bool m_x2Set : 1;
bool m_y2Set : 1;
};
// Wrapper object for the LinearGradientAttributes part object.
class LinearGradientAttributesWrapper
: public GarbageCollectedFinalized<LinearGradientAttributesWrapper> {
public:
static LinearGradientAttributesWrapper* create() {
return new LinearGradientAttributesWrapper;
}
LinearGradientAttributes& attributes() { return m_attributes; }
void set(const LinearGradientAttributes& attributes) {
m_attributes = attributes;
}
DEFINE_INLINE_TRACE() { visitor->trace(m_attributes); }
private:
LinearGradientAttributesWrapper() {}
LinearGradientAttributes m_attributes;
};
} // namespace blink
#endif
// vim:ts=4:noet
|
