pub struct NameTree<'a, T> { /* private fields */ }
Expand description
Writer for a name tree node.
Name trees associate a large number of names with PDF objects. They are lexically ordered search trees. Root nodes may directly contain all leafs, however, this might degrade performance for very large numbers of name-object pairs.
For each node, either the /Kids
or /Names
attribute must be set, but
never both.
Implementations§
source§impl<T> NameTree<'_, T>
impl<T> NameTree<'_, T>
sourcepub fn kids(&mut self) -> TypedArray<'_, Ref>
pub fn kids(&mut self) -> TypedArray<'_, Ref>
Start writing the /Kids
attribute with the children of this node.
sourcepub fn names(&mut self) -> NameTreeEntries<'_, T>
pub fn names(&mut self) -> NameTreeEntries<'_, T>
Start writing the /Names
attribute to set the immediate name-to-object
mappings of this node.
Trait Implementations§
Auto Trait Implementations§
impl<'a, T> Freeze for NameTree<'a, T>
impl<'a, T> RefUnwindSafe for NameTree<'a, T>where
T: RefUnwindSafe,
impl<'a, T> Send for NameTree<'a, T>where
T: Send,
impl<'a, T> Sync for NameTree<'a, T>where
T: Sync,
impl<'a, T> Unpin for NameTree<'a, T>where
T: Unpin,
impl<'a, T> !UnwindSafe for NameTree<'a, T>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more