| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright 2013 Google Inc. | |
| 3 | |
| 4 * Use of this source code is governed by a BSD-style license that can be | |
| 5 * found in the LICENSE file. | |
| 6 */ | |
| 7 | |
| 8 #include "SkPdfType3FunctionDictionary_autogen.h" | |
| 9 #include "SkPdfNativeDoc.h" | |
| 10 | |
| 11 SkPdfArray* SkPdfType3FunctionDictionary::Functions(SkPdfNativeDoc* doc) { | |
| 12 SkPdfNativeObject* ret = get("Functions", ""); | |
| 13 if (doc) {ret = doc->resolveReference(ret);} | |
| 14 if ((ret != NULL && ret->isArray()) || (doc == NULL && ret != NULL && ret->isR
eference())) return (SkPdfArray*)ret; | |
| 15 // TODO(edisonn): warn about missing required field, assert for known good pdf
s | |
| 16 return NULL; | |
| 17 } | |
| 18 | |
| 19 bool SkPdfType3FunctionDictionary::has_Functions() const { | |
| 20 return get("Functions", "") != NULL; | |
| 21 } | |
| 22 | |
| 23 SkPdfArray* SkPdfType3FunctionDictionary::Bounds(SkPdfNativeDoc* doc) { | |
| 24 SkPdfNativeObject* ret = get("Bounds", ""); | |
| 25 if (doc) {ret = doc->resolveReference(ret);} | |
| 26 if ((ret != NULL && ret->isArray()) || (doc == NULL && ret != NULL && ret->isR
eference())) return (SkPdfArray*)ret; | |
| 27 // TODO(edisonn): warn about missing required field, assert for known good pdf
s | |
| 28 return NULL; | |
| 29 } | |
| 30 | |
| 31 bool SkPdfType3FunctionDictionary::has_Bounds() const { | |
| 32 return get("Bounds", "") != NULL; | |
| 33 } | |
| 34 | |
| 35 SkPdfArray* SkPdfType3FunctionDictionary::Encode(SkPdfNativeDoc* doc) { | |
| 36 SkPdfNativeObject* ret = get("Encode", ""); | |
| 37 if (doc) {ret = doc->resolveReference(ret);} | |
| 38 if ((ret != NULL && ret->isArray()) || (doc == NULL && ret != NULL && ret->isR
eference())) return (SkPdfArray*)ret; | |
| 39 // TODO(edisonn): warn about missing required field, assert for known good pdf
s | |
| 40 return NULL; | |
| 41 } | |
| 42 | |
| 43 bool SkPdfType3FunctionDictionary::has_Encode() const { | |
| 44 return get("Encode", "") != NULL; | |
| 45 } | |
| OLD | NEW |