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
|
/*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "Test.h"
#include "SkParsePath.h"
static void test_to_from(skiatest::Reporter* reporter, const SkPath& path) {
SkString str, str2;
SkParsePath::ToSVGString(path, &str);
SkPath path2;
bool success = SkParsePath::FromSVGString(str.c_str(), &path2);
REPORTER_ASSERT(reporter, success);
SkParsePath::ToSVGString(path2, &str2);
REPORTER_ASSERT(reporter, str == str2);
#if 0 // closed paths are not equal, the iter explicitly gives the closing
// edge, even if it is not in the path.
REPORTER_ASSERT(reporter, path == path2);
if (path != path2) {
SkDebugf("str1=%s\nstr2=%s\n", str.c_str(), str2.c_str());
}
#endif
}
static void TestParsePath(skiatest::Reporter* reporter) {
static const struct {
const char* fStr;
SkRect fBounds;
} gRec[] = {
{ "", { 0, 0, 0, 0 } },
{ "M0,0L10,10", { 0, 0, SkIntToScalar(10), SkIntToScalar(10) } },
{ "M-5.5,-0.5 Q 0 0 6,6.50",
{ SkFloatToScalar(-5.5f), SkFloatToScalar(-0.5f),
SkFloatToScalar(6), SkFloatToScalar(6.5f) } }
};
for (size_t i = 0; i < SK_ARRAY_COUNT(gRec); i++) {
SkPath path;
bool success = SkParsePath::FromSVGString(gRec[i].fStr, &path);
REPORTER_ASSERT(reporter, success);
const SkRect& expectedBounds = gRec[i].fBounds;
const SkRect& pathBounds = path.getBounds();
REPORTER_ASSERT(reporter, expectedBounds == pathBounds);
test_to_from(reporter, path);
}
SkRect r;
r.set(0, 0, SkFloatToScalar(10), SkFloatToScalar(10.5));
SkPath p;
p.addRect(r);
test_to_from(reporter, p);
p.addOval(r);
test_to_from(reporter, p);
p.addRoundRect(r, SkFloatToScalar(4), SkFloatToScalar(4.5));
test_to_from(reporter, p);
}
#include "TestClassDef.h"
DEFINE_TESTCLASS("ParsePath", ParsePathClass, TestParsePath)
|
