OLD | NEW |
1 #ifndef __DEFINED__SkPdfNumberTreeNodeDictionary | 1 #ifndef __DEFINED__SkPdfNumberTreeNodeDictionary |
2 #define __DEFINED__SkPdfNumberTreeNodeDictionary | 2 #define __DEFINED__SkPdfNumberTreeNodeDictionary |
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 number tree node dictionary | 9 // Entries in a number tree node dictionary |
10 class SkPdfNumberTreeNodeDictionary : public SkPdfDictionary { | 10 class SkPdfNumberTreeNodeDictionary : public SkPdfDictionary { |
(...skipping 515 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
526 SkPdfNumberTreeNodeDictionary& operator=(const SkPdfNumberTreeNodeDictionary&
from) {this->fPodofoDoc = from.fPodofoDoc; this->fPodofoObj = from.fPodofoObj; r
eturn *this;} | 526 SkPdfNumberTreeNodeDictionary& operator=(const SkPdfNumberTreeNodeDictionary&
from) {this->fPodofoDoc = from.fPodofoDoc; this->fPodofoObj = from.fPodofoObj; r
eturn *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 Nums is not present) An array of indirect references to the i
mmediate chil- | 529 * if and only if Nums is not present) An array of indirect references to the i
mmediate 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 an integer and the corresponding valuei is an indirect re
ference to the | 540 * where each keyi is an integer and the corresponding valuei is an indirect re
ference to the |
547 * object associated with that key. The keys are sorted in numerical order, ana
logously to | 541 * object associated with that key. The keys are sorted in numerical order, ana
logously to |
548 * the arrangement of keys in a name tree as described in Section 3.8.4, "Name
Trees." | 542 * the arrangement of keys in a name tree as described in Section 3.8.4, "Name
Trees." |
549 **/ | 543 **/ |
550 bool has_Nums() const { | 544 bool has_Nums() const { |
551 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Nums"
, "", NULL)); | 545 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Nums"
, "", NULL)); |
552 } | 546 } |
553 | 547 |
554 SkPdfArray* Nums() const { | 548 SkPdfArray* Nums() const; |
555 SkPdfArray* ret; | |
556 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Nums", "",
&ret)) return ret; | |
557 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | |
558 return NULL; | |
559 } | |
560 | |
561 /** (Intermediate and leaf nodes only; required) An array of two integers, speci
fying the | 549 /** (Intermediate and leaf nodes only; required) An array of two integers, speci
fying the |
562 * (numerically) least and greatest keys included in the Nums array of a leaf n
ode or in the | 550 * (numerically) least and greatest keys included in the Nums array of a leaf n
ode or in the |
563 * Nums arrays of any leaf nodes that are descendants of an intermediate node. | 551 * Nums arrays of any leaf nodes that are descendants of an intermediate node. |
564 **/ | 552 **/ |
565 bool has_Limits() const { | 553 bool has_Limits() const { |
566 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limit
s", "", NULL)); | 554 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limit
s", "", NULL)); |
567 } | 555 } |
568 | 556 |
569 SkPdfArray* Limits() const { | 557 SkPdfArray* Limits() const; |
570 SkPdfArray* ret; | |
571 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limits", "
", &ret)) return ret; | |
572 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | |
573 return NULL; | |
574 } | |
575 | |
576 }; | 558 }; |
577 | 559 |
578 #endif // __DEFINED__SkPdfNumberTreeNodeDictionary | 560 #endif // __DEFINED__SkPdfNumberTreeNodeDictionary |
OLD | NEW |