OLD | NEW |
1 #ifndef __DEFINED__SkPdfNameTreeNodeDictionary | 1 #ifndef __DEFINED__SkPdfNameTreeNodeDictionary |
2 #define __DEFINED__SkPdfNameTreeNodeDictionary | 2 #define __DEFINED__SkPdfNameTreeNodeDictionary |
3 | 3 |
4 #include "SkPdfUtils.h" | 4 #include "SkPdfUtils.h" |
5 #include "SkPdfEnums_autogen.h" | 5 #include "SkPdfEnums_autogen.h" |
6 #include "SkPdfArray_autogen.h" | 6 #include "SkPdfArray_autogen.h" |
7 #include "SkPdfDictionary_autogen.h" | 7 #include "SkPdfDictionary_autogen.h" |
8 | 8 |
9 // Entries in a name tree node dictionary | 9 // Entries in a name tree node dictionary |
10 class SkPdfNameTreeNodeDictionary : public SkPdfDictionary { | 10 class SkPdfNameTreeNodeDictionary : public SkPdfDictionary { |
(...skipping 515 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
526 SkPdfNameTreeNodeDictionary& operator=(const SkPdfNameTreeNodeDictionary& from
) {this->fPodofoDoc = from.fPodofoDoc; this->fPodofoObj = from.fPodofoObj; retur
n *this;} | 526 SkPdfNameTreeNodeDictionary& operator=(const SkPdfNameTreeNodeDictionary& from
) {this->fPodofoDoc = from.fPodofoDoc; this->fPodofoObj = from.fPodofoObj; retur
n *this;} |
527 | 527 |
528 /** (Root and intermediate nodes only; required in intermediate nodes; present i
n the root node | 528 /** (Root and intermediate nodes only; required in intermediate nodes; present i
n the root node |
529 * if and only if Names is not present) An array of indirect references to the
immediate chil- | 529 * if and only if Names is not present) An array of indirect references to the
immediate chil- |
530 * dren of this node. The children may be intermediate or leaf nodes. | 530 * dren of this node. The children may be intermediate or leaf nodes. |
531 **/ | 531 **/ |
532 bool has_Kids() const { | 532 bool has_Kids() const { |
533 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Kids"
, "", NULL)); | 533 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Kids"
, "", NULL)); |
534 } | 534 } |
535 | 535 |
536 SkPdfArray* Kids() const { | 536 SkPdfArray* Kids() const; |
537 SkPdfArray* ret; | |
538 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Kids", "",
&ret)) return ret; | |
539 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | |
540 return NULL; | |
541 } | |
542 | |
543 /** (Root and leaf nodes only; required in leaf nodes; present in the root node
if and only if Kids | 537 /** (Root and leaf nodes only; required in leaf nodes; present in the root node
if and only if Kids |
544 * is not present) An array of the form | 538 * is not present) An array of the form |
545 * [key1 value1 key2 value2 ... keyn valuen ] | 539 * [key1 value1 key2 value2 ... keyn valuen ] |
546 * where each keyi is a string and the corresponding valuei is an indirect refe
rence to the | 540 * where each keyi is a string and the corresponding valuei is an indirect refe
rence to the |
547 * object associated with that key. The keys are sorted in lexical order, as de
scribed below. | 541 * object associated with that key. The keys are sorted in lexical order, as de
scribed below. |
548 **/ | 542 **/ |
549 bool has_Names() const { | 543 bool has_Names() const { |
550 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Names
", "", NULL)); | 544 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Names
", "", NULL)); |
551 } | 545 } |
552 | 546 |
553 SkPdfArray* Names() const { | 547 SkPdfArray* Names() const; |
554 SkPdfArray* ret; | |
555 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Names", ""
, &ret)) return ret; | |
556 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | |
557 return NULL; | |
558 } | |
559 | |
560 /** (Intermediate and leaf nodes only; required) An array of two strings, specif
ying the (lexi- | 548 /** (Intermediate and leaf nodes only; required) An array of two strings, specif
ying the (lexi- |
561 * cally) least and greatest keys included in the Names array of a leaf node or
in the Names | 549 * cally) least and greatest keys included in the Names array of a leaf node or
in the Names |
562 * arrays of any leaf nodes that are descendants of an intermediate node. | 550 * arrays of any leaf nodes that are descendants of an intermediate node. |
563 **/ | 551 **/ |
564 bool has_Limits() const { | 552 bool has_Limits() const { |
565 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limit
s", "", NULL)); | 553 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limit
s", "", NULL)); |
566 } | 554 } |
567 | 555 |
568 SkPdfArray* Limits() const { | 556 SkPdfArray* Limits() const; |
569 SkPdfArray* ret; | |
570 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limits", "
", &ret)) return ret; | |
571 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | |
572 return NULL; | |
573 } | |
574 | |
575 }; | 557 }; |
576 | 558 |
577 #endif // __DEFINED__SkPdfNameTreeNodeDictionary | 559 #endif // __DEFINED__SkPdfNameTreeNodeDictionary |
OLD | NEW |