Struct NameTree 

pub struct NameTree<T> {
    pub limits: Option<(PdfString, PdfString)>,
    pub node: NameTreeNode<T>,
}

Note: The PDF concept of ‘root’ node is an intermediate or leaf node which has no ‘Limits’ entry. Hence, limits,

Fields

limits: Option<(PdfString, PdfString)>

node: NameTreeNode<T>

Implementations

impl<T: Object + DataSize> NameTree<T>

pub fn walk( &self, r: &impl Resolve, callback: &mut dyn FnMut(&PdfString, &T), ) -> Result<(), PdfError>

Trait Implementations

impl<T> DataSize for NameTree<T>

where NameTreeNode<T>: DataSize,

const IS_DYNAMIC: bool

If true, the type has a heap size that can vary at runtime, depending on the actual value.

const STATIC_HEAP_SIZE: usize

The amount of space a value of the type always occupies. If IS_DYNAMIC is false, this is the total amount of heap memory occupied by the value. Otherwise this is a lower bound.

fn estimate_heap_size(&self) -> usize

Estimates the size of heap memory taken up by this value.

impl<T: Debug> Debug for NameTree<T>

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

Formats the value using the given formatter.

impl<T: Object> Object for NameTree<T>

fn from_primitive(p: Primitive, resolve: &impl Resolve) -> Result<Self>

Convert primitive to Self

impl<T: ObjectWrite> ObjectWrite for NameTree<T>

fn to_primitive(&self, _update: &mut impl Updater) -> Result<Primitive>