### ----------------------------------------------------
### -- PDF::ISO_32000_2
### -- Licenses: Artistic-2.0
### -- Authors: David Warring
### -- File: resources/ISO_32000_2/Table_36-Entries_in_a_name_tree_node_dictionary.json
### ----------------------------------------------------
{
  "table": {
    "caption": "Table 36 — Entries in a name tree node dictionary",
    "head": [
      "Key",
      "Type",
      "Value"
    ],
    "rows": [
      [
        "Kids",
        "array",
        "(Root and intermediate nodes only; required in intermediate nodes; present in the root node if and only if Names is not present) Shall be an array of indirect references to the immediate children of this node. The children may be intermediate or leaf nodes."
      ],
      [
        "Names",
        "array",
        "(Root and leaf nodes only; required in leaf nodes; present in the root node if and only if Kids is not present) Shall be an array of the form\n[key1 value1 key2 value2 …keyn valuen]\nwhere each keyi is a string and the corresponding valuei is the object associated with that key. The keys is sorted in lexical order, as described below."
      ],
      [
        "Limits",
        "array",
        "(Required for intermediate and leaf nodes; not permitted in root nodes) Shall be an array of two strings, that specifies the (lexically) least and greatest keys included in the Names array of a leaf node or in the Names arrays of any leaf nodes that are descendants of an intermediate node."
      ]
    ]
  }
}


