Table 36 – Entries in a name tree node dictionary

Key

Type

Value

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

[ key 1 value 1 key 2 value 2 … key n value n ]

where each key i shall be a string and the corresponding value i shall be the object associated with that key. The keys shall be sorted in lexical order, as described below.

Limits

array

(Intermediate and leaf nodes only; required) Shall be an array of two strings, that shall specify 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.