pub struct NameTree<T> {
pub limits: Option<(PdfString, PdfString)>,
pub node: NameTreeNode<T>,
}
Expand description
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§
Trait Implementations§
source§impl<T> DataSize for NameTree<T>where
NameTreeNode<T>: DataSize,
impl<T> DataSize for NameTree<T>where NameTreeNode<T>: DataSize,
source§const IS_DYNAMIC: bool = _
const IS_DYNAMIC: bool = _
If
true
, the type has a heap size that can vary at runtime, depending on the actual value.source§const STATIC_HEAP_SIZE: usize = _
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.source§fn estimate_heap_size(&self) -> usize
fn estimate_heap_size(&self) -> usize
Estimates the size of heap memory taken up by this value. Read more
source§impl<T: ObjectWrite> ObjectWrite for NameTree<T>
impl<T: ObjectWrite> ObjectWrite for NameTree<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for NameTree<T>where T: RefUnwindSafe,
impl<T> Send for NameTree<T>where T: Send,
impl<T> Sync for NameTree<T>where T: Sync,
impl<T> Unpin for NameTree<T>where T: Unpin,
impl<T> UnwindSafe for NameTree<T>where T: UnwindSafe,
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