OLD | NEW |
1 | 1 |
2 /* | 2 /* |
3 * Copyright 2012 Google Inc. | 3 * Copyright 2012 Google Inc. |
4 * | 4 * |
5 * Use of this source code is governed by a BSD-style license that can be | 5 * Use of this source code is governed by a BSD-style license that can be |
6 * found in the LICENSE file. | 6 * found in the LICENSE file. |
7 */ | 7 */ |
8 | 8 |
9 #include "SkObjectParser.h" | 9 #include "SkObjectParser.h" |
10 #include "SkData.h" | 10 #include "SkData.h" |
(...skipping 156 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
167 mPath->append("("); | 167 mPath->append("("); |
168 mPath->appendScalar(iter.conicWeight()); | 168 mPath->appendScalar(iter.conicWeight()); |
169 mPath->append(")"); | 169 mPath->append(")"); |
170 } | 170 } |
171 | 171 |
172 mPath->append(" "); | 172 mPath->append(" "); |
173 } | 173 } |
174 | 174 |
175 SkString* boundStr = SkObjectParser::RectToString(path.getBounds(), " Bou
nd: "); | 175 SkString* boundStr = SkObjectParser::RectToString(path.getBounds(), " Bou
nd: "); |
176 | 176 |
177 if (NULL != boundStr) { | 177 if (boundStr) { |
178 mPath->append(*boundStr); | 178 mPath->append(*boundStr); |
179 SkDELETE(boundStr); | 179 SkDELETE(boundStr); |
180 } | 180 } |
181 | 181 |
182 return mPath; | 182 return mPath; |
183 } | 183 } |
184 | 184 |
185 SkString* SkObjectParser::PointsToString(const SkPoint pts[], size_t count) { | 185 SkString* SkObjectParser::PointsToString(const SkPoint pts[], size_t count) { |
186 SkString* mPoints = new SkString("SkPoints pts[]: "); | 186 SkString* mPoints = new SkString("SkPoints pts[]: "); |
187 for (unsigned int i = 0; i < count; i++) { | 187 for (unsigned int i = 0; i < count; i++) { |
(...skipping 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
359 } | 359 } |
360 break; | 360 break; |
361 } | 361 } |
362 default: | 362 default: |
363 decodedText->append("Unknown text encoding."); | 363 decodedText->append("Unknown text encoding."); |
364 break; | 364 break; |
365 } | 365 } |
366 | 366 |
367 return decodedText; | 367 return decodedText; |
368 } | 368 } |
OLD | NEW |