NumberTree Class Documentation

classNumberTree

Namespace:com::datalogics::PDFL

Detailed Description

The number tree is a common data structure in PDF files. The number tree is a type of dictionary that can store many more pairs of matched records than a standard object dictionary.

A number tree uses keys that are integers to map to data objects, sorted in ascending numerical order.

Referenced by

DocumentNumberTree

Constructor & Destructor Documentation

Member Function Documentation

DisposeChildren

voidDisposeChildren()

Returns:

void

[static initializer]

static void[static initializer]()

delete

synchronized voiddelete(Booleandisposing)

Parameters

disposing: Boolean

Returns:

synchronized void

delete

synchronized voiddelete()

Returns:

synchronized void

equals

booleanequals(Objectrhs)

Parameters

rhs: Object

Returns:

boolean

finalize

voidfinalize()

Returns:

void

get

PDFObjectget(intkey)

Parameters

key: int

The integer of the PDFObject to get from the tree.

Returns:

- The PDFObject value corresponding to the supplied key

Retrieves an entry from this NumberTree.

getPDFDict

PDFDictgetPDFDict()

Returns:

PDFDict of the NumberTree

Return the PDFDict of this NumberTree.

put

voidput(intkey, PDFObjectvalue)

Parameters

key: int

The integer of the PDFObject to put in the tree.

value: PDFObject

The PDFObject to be associated with key.

Returns:

void

Puts a new entry in this NumberTree. If an entry with this name is already in the tree, it is replaced.

remove

voidremove(intkey)

Parameters

key: int

The integer of the PDFObject to remove from the tree.

Returns:

void

Removes the specified PDFObject from this NumberTree. It does nothing if no PDFObject of that number exists in this NumberTree.