class HexaPDF::NameTreeNode

See: PDF2.0 s7.9.6
valid.
HexaPDF::Utils::SortedTreeNode) to add or retrieve entries. They ensure that the name tree stays
build a name tree manually. Instead, use the provided convenience methods (see
Since this is a complex structure that must follow several restrictions, it is not advised to
entry whereas a leaf node contains a /Names entry.
that points to one or more intermediate or leaf nodes. An intermediate node contains a /Kids
stored associations in the /Names entry. Otherwise the root node needs to have a /Kids entry
A name tree consists of one or more NameTreeNodes. If there is only one node, it contains all
always sorted to allow fast lookup of a specific key.
always a string instead of a symbol. Another difference is that the keys in a name tree are
Name trees are used in a similar fashion as dictionaries, however, the key in a name tree is
Implementation of PDF name trees.

def key_type

Defines the class that is used for the keys in the name tree (String). 
def key_type
  String
end

def leaf_node_container_name

Defines the dictionary entry name that contains the leaf node entries. 
def leaf_node_container_name
  :Names
end