o gi@sNdZddlZddlmZddlmZddlmZddlmZGdddZdS) u| Some categories of objects in a PDF file can be referred to by name rather than by object reference. The correspondence between names and objects is established by the document’s name dictionary (PDF 1.2), located by means of the Names entry in the document’s catalog (see 7.7.2, "Document Catalog"). Each entry in this dictionary designates the root of a name tree (see 7.9.6, "Name Trees") defining names for a particular category of objects. A name tree serves a similar purpose to a dictionary—associating keys and values—but by different means. A name tree differs from a dictionary in the following important ways: - Unlike the keys in a dictionary, which are name objects, those in a name tree are strings. - The keys are ordered. - The values associated with the keys may be objects of any type. Stream objects shall be specified by indirect object references (7.3.8, "Stream Objects"). The dictionary, array, and string objects should be specified by indirect object references, and other PDF objects (nulls, numbers, booleans, and names) should be specified as direct objects. - The data structure can represent an arbitrarily large collection of key-value pairs, which can be looked up efficiently without requiring the entire data structure to be read from the PDF file. (In contrast, a dictionary can be subject to an implementation limit on the number of entries it can contain.) N) Dictionary)List)Name)Stringc@seZdZdZdedefddZddZdd Zd ed e d e j fd dZ d ed e d e j fddZ de je jee j ffddZde jefddZd e d e j ddfddZde je j fddZdS)NameTreez A name tree is similar to a dictionary that associates keys and values but the keys in a name tree are strings and are ordered documentnamecCs||_||_dSN) _document_name)selfrrr O/home/ubuntu/.local/lib/python3.10/site-packages/borb/pdf/document/name_tree.py__init__(s zNameTree.__init__cCs t|Sr )len_get_root_or_emptyr r r r__len__0s zNameTree.__len__cCsfd|jvs Jdd|jdvsJdd|jddvs!Jd|jddd}|tdtS)NXRefNo XREF found in this PDFTrailer(No /Trailer dictionary found in the XREFRoot)No /Root dictionary found in the /TrailerNames)r getrr)r rootr r rr3szNameTree._get_root_or_emptyparentkeyvaluecCsdSr r )r rrrr r r _put_existing>szNameTree._put_existingcCst}t||td<t|td<tddD] }|dt|qt|td<|tdt||jdkrK|td|td|td<|jd krY|td||d |dS) NFLimitsrr EmbeddedFilesEFType JavaScriptKids)rrrrrangeappendr )r rrrkid_r r r_put_newBs  zNameTree._put_newreturnc Cs.d|jvs Jdd|jdvsJdd|jddvs!Jd|jddd}d|vr5t|td<|d}||jg}g}g}t|dkr|d}|dd |vrb|d D]}||qZd |vrt|d d}t|d d } | |kr||d d ||dd t|dksIt||S) z This function returns all key/value pairs in this NameTree :return: all key/value pairs in this NameTree rrrrrrrrr(r") r rrr rpopr*strzip) r rnamesnodes_to_visitkeysvaluesnk lower_limit upper_limitr r ritems[s8      zNameTree.itemscCdd|DS)zo This function returns the keys in this NameTree :return: the keys in this NameTree cSsg|]\}}|qSr r .0r8vr r r z!NameTree.keys..r;rr r rr5z NameTree.keysc sJd|jvs Jdd|jdvsJdd|jddvs!Jd|jddd}d|vr5t|td<|d}|j|vrNt||j<t||jtd<||j}d|vr|dD]'}t|d d }t|d d }||krrq[|kr||krnq[|}nq[ tfd d |dDd kr||||S||||S)z This function adds a key/value pair in this NameTree :param key: the key :param value: the value :return: self rrrrrrrr(r"rr/cs8g|]}|dd|ddkrkrnn|qS)r"rr/r )r>xrr rr@s8z NameTree.put..) r rrr rr1rr-r ) r rrrr3rr8r9r:r rErputsB    z NameTree.putcCr<)zs This function returns the values in this NameTree :return: the values in this NameTree cSsg|]\}}|qSr r r=r r rr@rAz#NameTree.values..rBrr r rr6rCzNameTree.valuesN)__name__ __module__ __qualname____doc__rrrrrr1typingAnyr r-IterableTuplerr;rr5rFr6r r r rrs  &3r)rJrKborb.io.read.typesrrrrrr r r rs