OLD | NEW |
1 #ifndef __DEFINED__SkPdfNumberTreeNodeDictionary | 1 #ifndef __DEFINED__SkPdfNumberTreeNodeDictionary |
2 #define __DEFINED__SkPdfNumberTreeNodeDictionary | 2 #define __DEFINED__SkPdfNumberTreeNodeDictionary |
3 | 3 |
4 #include "SkPdfEnums_autogen.h" | 4 #include "SkPdfEnums_autogen.h" |
5 #include "SkPdfArray_autogen.h" | 5 #include "SkPdfArray_autogen.h" |
6 #include "SkPdfDictionary_autogen.h" | 6 #include "SkPdfDictionary_autogen.h" |
7 | 7 |
| 8 // Entries in a number tree node dictionary |
8 class SkPdfNumberTreeNodeDictionary : public SkPdfDictionary { | 9 class SkPdfNumberTreeNodeDictionary : public SkPdfDictionary { |
9 public: | 10 public: |
10 virtual SkPdfObjectType getType() const { return kNumberTreeNodeDictionary_SkP
dfObjectType;} | 11 virtual SkPdfObjectType getType() const { return kNumberTreeNodeDictionary_SkP
dfObjectType;} |
11 virtual SkPdfObjectType getTypeEnd() const { return (SkPdfObjectType)(kNumberT
reeNodeDictionary_SkPdfObjectType + 1);} | 12 virtual SkPdfObjectType getTypeEnd() const { return (SkPdfObjectType)(kNumberT
reeNodeDictionary_SkPdfObjectType + 1);} |
12 public: | 13 public: |
13 virtual SkPdfNumberTreeNodeDictionary* asNumberTreeNodeDictionary() {return th
is;} | 14 virtual SkPdfNumberTreeNodeDictionary* asNumberTreeNodeDictionary() {return th
is;} |
14 virtual const SkPdfNumberTreeNodeDictionary* asNumberTreeNodeDictionary() cons
t {return this;} | 15 virtual const SkPdfNumberTreeNodeDictionary* asNumberTreeNodeDictionary() cons
t {return this;} |
15 | 16 |
16 private: | 17 private: |
17 virtual SkPdfALinkAnnotationDictionary* asALinkAnnotationDictionary() {return
NULL;} | 18 virtual SkPdfALinkAnnotationDictionary* asALinkAnnotationDictionary() {return
NULL;} |
(...skipping 496 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
514 | 515 |
515 public: | 516 public: |
516 private: | 517 private: |
517 public: | 518 public: |
518 SkPdfNumberTreeNodeDictionary(const PdfMemDocument* podofoDoc = NULL, const Pd
fObject* podofoObj = NULL) : SkPdfDictionary(podofoDoc, podofoObj) {} | 519 SkPdfNumberTreeNodeDictionary(const PdfMemDocument* podofoDoc = NULL, const Pd
fObject* podofoObj = NULL) : SkPdfDictionary(podofoDoc, podofoObj) {} |
519 | 520 |
520 virtual bool valid() const {return true;} | 521 virtual bool valid() const {return true;} |
521 | 522 |
522 SkPdfNumberTreeNodeDictionary& operator=(const SkPdfNumberTreeNodeDictionary&
from) {this->fPodofoDoc = from.fPodofoDoc; this->fPodofoObj = from.fPodofoObj; r
eturn *this;} | 523 SkPdfNumberTreeNodeDictionary& operator=(const SkPdfNumberTreeNodeDictionary&
from) {this->fPodofoDoc = from.fPodofoDoc; this->fPodofoObj = from.fPodofoObj; r
eturn *this;} |
523 | 524 |
| 525 /** (Root and intermediate nodes only; required in intermediate nodes; present i
n the root node |
| 526 * if and only if Nums is not present) An array of indirect references to the i
mmediate chil- |
| 527 * dren of this node. The children may be intermediate or leaf nodes. |
| 528 **/ |
| 529 bool has_Kids() const { |
| 530 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Kids"
, "", NULL)); |
| 531 } |
| 532 |
524 SkPdfArray Kids() const { | 533 SkPdfArray Kids() const { |
525 SkPdfArray ret; | 534 SkPdfArray ret; |
526 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Kids", "",
&ret)) return ret; | 535 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Kids", "",
&ret)) return ret; |
527 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | 536 // TODO(edisonn): warn about missing required field, assert for known good p
dfs |
528 return SkPdfArray(); | 537 return SkPdfArray(); |
529 } | 538 } |
530 | 539 |
| 540 /** (Root and leaf nodes only; required in leaf nodes; present in the root node
if and only if Kids |
| 541 * is not present) An array of the form |
| 542 * [key1 value1 key2 value2 ... keyn valuen ] |
| 543 * where each keyi is an integer and the corresponding valuei is an indirect re
ference to the |
| 544 * object associated with that key. The keys are sorted in numerical order, ana
logously to |
| 545 * the arrangement of keys in a name tree as described in Section 3.8.4, "Name
Trees." |
| 546 **/ |
| 547 bool has_Nums() const { |
| 548 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Nums"
, "", NULL)); |
| 549 } |
| 550 |
531 SkPdfArray Nums() const { | 551 SkPdfArray Nums() const { |
532 SkPdfArray ret; | 552 SkPdfArray ret; |
533 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Nums", "",
&ret)) return ret; | 553 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Nums", "",
&ret)) return ret; |
534 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | 554 // TODO(edisonn): warn about missing required field, assert for known good p
dfs |
535 return SkPdfArray(); | 555 return SkPdfArray(); |
536 } | 556 } |
537 | 557 |
| 558 /** (Intermediate and leaf nodes only; required) An array of two integers, speci
fying the |
| 559 * (numerically) least and greatest keys included in the Nums array of a leaf n
ode or in the |
| 560 * Nums arrays of any leaf nodes that are descendants of an intermediate node. |
| 561 **/ |
| 562 bool has_Limits() const { |
| 563 return (ObjectFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limit
s", "", NULL)); |
| 564 } |
| 565 |
538 SkPdfArray Limits() const { | 566 SkPdfArray Limits() const { |
539 SkPdfArray ret; | 567 SkPdfArray ret; |
540 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limits", "
", &ret)) return ret; | 568 if (ArrayFromDictionary(fPodofoDoc, fPodofoObj->GetDictionary(), "Limits", "
", &ret)) return ret; |
541 // TODO(edisonn): warn about missing required field, assert for known good p
dfs | 569 // TODO(edisonn): warn about missing required field, assert for known good p
dfs |
542 return SkPdfArray(); | 570 return SkPdfArray(); |
543 } | 571 } |
544 | 572 |
545 }; | 573 }; |
546 | 574 |
547 #endif // __DEFINED__SkPdfNumberTreeNodeDictionary | 575 #endif // __DEFINED__SkPdfNumberTreeNodeDictionary |
OLD | NEW |