OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 University of Szeged | 2 * Copyright (C) 2011 University of Szeged |
3 * Copyright (C) 2011 Renata Hodovan <reni@webkit.org> | 3 * Copyright (C) 2011 Renata Hodovan <reni@webkit.org> |
4 * All rights reserved. | 4 * All rights reserved. |
5 * | 5 * |
6 * Redistribution and use in source and binary forms, with or without | 6 * Redistribution and use in source and binary forms, with or without |
7 * modification, are permitted provided that the following conditions | 7 * modification, are permitted provided that the following conditions |
8 * are met: | 8 * are met: |
9 * 1. Redistributions of source code must retain the above copyright | 9 * 1. Redistributions of source code must retain the above copyright |
10 * notice, this list of conditions and the following disclaimer. | 10 * notice, this list of conditions and the following disclaimer. |
11 * 2. Redistributions in binary form must reproduce the above copyright | 11 * 2. Redistributions in binary form must reproduce the above copyright |
12 * notice, this list of conditions and the following disclaimer in the | 12 * notice, this list of conditions and the following disclaimer in the |
13 * documentation and/or other materials provided with the distribution. | 13 * documentation and/or other materials provided with the distribution. |
14 * | 14 * |
15 * THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY | 15 * THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY |
16 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 16 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
18 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UNIVERSITY OF SZEGED OR | 18 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UNIVERSITY OF SZEGED OR |
19 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 19 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
20 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 20 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
21 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 21 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
22 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 22 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
23 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 23 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
25 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 25 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 */ | 26 */ |
27 | 27 |
28 #include "config.h" | |
29 #include "core/layout/svg/LayoutSVGRect.h" | 28 #include "core/layout/svg/LayoutSVGRect.h" |
30 | 29 |
31 #include "core/svg/SVGRectElement.h" | 30 #include "core/svg/SVGRectElement.h" |
32 #include "wtf/MathExtras.h" | 31 #include "wtf/MathExtras.h" |
33 | 32 |
34 namespace blink { | 33 namespace blink { |
35 | 34 |
36 LayoutSVGRect::LayoutSVGRect(SVGRectElement* node) | 35 LayoutSVGRect::LayoutSVGRect(SVGRectElement* node) |
37 : LayoutSVGShape(node) | 36 : LayoutSVGShape(node) |
38 , m_usePathFallback(false) | 37 , m_usePathFallback(false) |
(...skipping 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
138 // An approximation of sqrt(2) is used here because at certain precise | 137 // An approximation of sqrt(2) is used here because at certain precise |
139 // miterlimits, the join style used might not be correct (e.g. a miterlimit | 138 // miterlimits, the join style used might not be correct (e.g. a miterlimit |
140 // of 1.4142135 should result in bevel joins, but may be drawn using miter | 139 // of 1.4142135 should result in bevel joins, but may be drawn using miter |
141 // joins). | 140 // joins). |
142 return svgStyle.strokeDashArray()->isEmpty() | 141 return svgStyle.strokeDashArray()->isEmpty() |
143 && svgStyle.joinStyle() == MiterJoin | 142 && svgStyle.joinStyle() == MiterJoin |
144 && svgStyle.strokeMiterLimit() >= 1.5; | 143 && svgStyle.strokeMiterLimit() >= 1.5; |
145 } | 144 } |
146 | 145 |
147 } | 146 } |
OLD | NEW |