OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2011 Google Inc. | 2 * Copyright 2011 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 | 8 |
9 #ifndef SkPDFUtils_DEFINED | 9 #ifndef SkPDFUtils_DEFINED |
10 #define SkPDFUtils_DEFINED | 10 #define SkPDFUtils_DEFINED |
11 | 11 |
12 #include "SkPaint.h" | 12 #include "SkPaint.h" |
13 #include "SkPath.h" | 13 #include "SkPath.h" |
14 | 14 |
15 class SkMatrix; | 15 class SkMatrix; |
16 class SkPath; | |
17 class SkPDFArray; | 16 class SkPDFArray; |
18 struct SkRect; | 17 struct SkRect; |
19 class SkWStream; | 18 class SkWStream; |
20 | 19 |
21 #if 0 | 20 #if 0 |
22 #define PRINT_NOT_IMPL(str) fprintf(stderr, str) | 21 #define PRINT_NOT_IMPL(str) fprintf(stderr, str) |
23 #else | 22 #else |
24 #define PRINT_NOT_IMPL(str) | 23 #define PRINT_NOT_IMPL(str) |
25 #endif | 24 #endif |
26 | 25 |
(...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
63 // abs(FLT_MIN_10_EXP) = number of zeros in FLT_MIN | 62 // abs(FLT_MIN_10_EXP) = number of zeros in FLT_MIN |
64 static const size_t kMaximumFloatDecimalLength = 3 + 9 - FLT_MIN_10_EXP; | 63 static const size_t kMaximumFloatDecimalLength = 3 + 9 - FLT_MIN_10_EXP; |
65 // FloatToDecimal is exposed for unit tests. | 64 // FloatToDecimal is exposed for unit tests. |
66 static size_t FloatToDecimal(float value, | 65 static size_t FloatToDecimal(float value, |
67 char output[kMaximumFloatDecimalLength]); | 66 char output[kMaximumFloatDecimalLength]); |
68 static void AppendScalar(SkScalar value, SkWStream* stream); | 67 static void AppendScalar(SkScalar value, SkWStream* stream); |
69 static void WriteString(SkWStream* wStream, const char* input, size_t len); | 68 static void WriteString(SkWStream* wStream, const char* input, size_t len); |
70 }; | 69 }; |
71 | 70 |
72 #endif | 71 #endif |
OLD | NEW |