Struct PageTreeNode 

pub struct PageTreeNode { /* private fields */ }

Intermediate page nodes, and the type of the Pages element in the document’s Catalog.

From the PDF specification:

The simplest structure can consist of a single page tree node that references all of the document’s page objects directly. However, to optimise application performance, a PDF writer can construct trees of a particular form, known as balanced trees.

In Livre, the page tree is immediately transformed into a vector of Pages for simplicity. Hence this type, along with other low-level types, are made public for reference only.

Implementations

impl PageTreeNode

pub fn list_pages<B>(&self, builder: &B) -> PResult<Vec<Page>>

where B: Builder,

Trait Implementations

impl Build for PageTreeNode

fn build<B>(input: &mut &BStr, _: &B) -> PResult<Self>

where B: Builder,

Build an object that rely on a reference, which would be instantiated with the help of the supplied builder.

impl Clone for PageTreeNode

fn clone(&self) -> PageTreeNode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PageTreeNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> FromRawDict<'de> for PageTreeNode

fn from_raw_dict(dict: &mut RawDict<'de>) -> PResult<Self>

Build a type from a raw dictionary. Note that the supplied dict is not consumed. Rather, the method takes hold of a mutable reference to extract only the fields that are needed, removing them from the dictionary.

impl PartialEq for PageTreeNode

fn eq(&self, other: &PageTreeNode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for PageTreeNode