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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
/*
* Copyright (C) 2015 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "PathParser.h"
#include "jni.h"
#include <utils/Log.h>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
namespace android {
namespace uirenderer {
static size_t nextStart(const char* s, size_t length, size_t startIndex) {
size_t index = startIndex;
while (index < length) {
char c = s[index];
// Note that 'e' or 'E' are not valid path commands, but could be
// used for floating point numbers' scientific notation.
// Therefore, when searching for next command, we should ignore 'e'
// and 'E'.
if ((((c - 'A') * (c - 'Z') <= 0) || ((c - 'a') * (c - 'z') <= 0))
&& c != 'e' && c != 'E') {
return index;
}
index++;
}
return index;
}
/**
* Calculate the position of the next comma or space or negative sign
* @param s the string to search
* @param start the position to start searching
* @param result the result of the extraction, including the position of the
* the starting position of next number, whether it is ending with a '-'.
*/
static void extract(int* outEndPosition, bool* outEndWithNegOrDot, const char* s, int start, int end) {
// Now looking for ' ', ',', '.' or '-' from the start.
int currentIndex = start;
bool foundSeparator = false;
*outEndWithNegOrDot = false;
bool secondDot = false;
bool isExponential = false;
for (; currentIndex < end; currentIndex++) {
bool isPrevExponential = isExponential;
isExponential = false;
char currentChar = s[currentIndex];
switch (currentChar) {
case ' ':
case ',':
foundSeparator = true;
break;
case '-':
// The negative sign following a 'e' or 'E' is not a separator.
if (currentIndex != start && !isPrevExponential) {
foundSeparator = true;
*outEndWithNegOrDot = true;
}
break;
case '.':
if (!secondDot) {
secondDot = true;
} else {
// This is the second dot, and it is considered as a separator.
foundSeparator = true;
*outEndWithNegOrDot = true;
}
break;
case 'e':
case 'E':
isExponential = true;
break;
}
if (foundSeparator) {
break;
}
}
// In the case where nothing is found, we put the end position to the end of
// our extract range. Otherwise, end position will be where separator is found.
*outEndPosition = currentIndex;
}
/**
* Parse the floats in the string.
* This is an optimized version of parseFloat(s.split(",|\\s"));
*
* @param s the string containing a command and list of floats
* @return array of floats
*/
static void getFloats(std::vector<float>* outPoints, const char* pathStr, int start, int end) {
if (pathStr[start] == 'z' || pathStr[start] == 'Z') {
return;
}
int startPosition = start + 1;
int endPosition = start;
// The startPosition should always be the first character of the
// current number, and endPosition is the character after the current
// number.
while (startPosition < end) {
bool endWithNegOrDot;
extract(&endPosition, &endWithNegOrDot, pathStr, startPosition, end);
if (startPosition < endPosition) {
outPoints->push_back(strtof(&pathStr[startPosition], NULL));
}
if (endWithNegOrDot) {
// Keep the '-' or '.' sign with next number.
startPosition = endPosition;
} else {
startPosition = endPosition + 1;
}
}
}
void PathParser::getPathDataFromString(PathData* data, const char* pathStr, size_t strLen) {
if (pathStr == NULL) {
return;
}
size_t start = 0;
size_t end = 1;
while (end < strLen) {
end = nextStart(pathStr, strLen, end);
std::vector<float> points;
getFloats(&points, pathStr, start, end);
data->verbs.push_back(pathStr[start]);
data->verbSizes.push_back(points.size());
data->points.insert(data->points.end(), points.begin(), points.end());
start = end;
end++;
}
if ((end - start) == 1 && pathStr[start] != '\0') {
data->verbs.push_back(pathStr[start]);
data->verbSizes.push_back(0);
}
int i = 0;
while(pathStr[i] != '\0') {
i++;
}
}
void PathParser::dump(const PathData& data) {
// Print out the path data.
size_t start = 0;
for (size_t i = 0; i < data.verbs.size(); i++) {
std::ostringstream os;
os << data.verbs[i];
for (size_t j = 0; j < data.verbSizes[i]; j++) {
os << " " << data.points[start + j];
}
start += data.verbSizes[i];
ALOGD("%s", os.str().c_str());
}
std::ostringstream os;
for (size_t i = 0; i < data.points.size(); i++) {
os << data.points[i] << ", ";
}
ALOGD("points are : %s", os.str().c_str());
}
bool PathParser::parseStringForSkPath(SkPath* skPath, const char* pathStr, size_t strLen) {
PathData pathData;
getPathDataFromString(&pathData, pathStr, strLen);
// Check if there is valid data coming out of parsing the string.
if (pathData.verbs.size() == 0) {
return false;
}
VectorDrawablePath::verbsToPath(skPath, &pathData);
return true;
}
}; // namespace uirenderer
}; //namespace android
|
