pub struct ObjectFacts<'a> {
pub ordinal: &'a HashMap<String, u32>,
pub trees: &'a HashMap<String, Vec<u8>>,
pub oid_len: usize,
}Expand description
What the builder needs to know about every object in the archive.
Fields§
§ordinal: &'a HashMap<String, u32>Object ordinal for each oid hex — the bitmap space.
trees: &'a HashMap<String, Vec<u8>>Payload of every tree object, by oid hex. Blobs are not needed (they are leaves) and are deliberately not held.
oid_len: usizeRaw oid width, needed to walk tree records.
Auto Trait Implementations§
impl<'a> Freeze for ObjectFacts<'a>
impl<'a> RefUnwindSafe for ObjectFacts<'a>
impl<'a> Send for ObjectFacts<'a>
impl<'a> Sync for ObjectFacts<'a>
impl<'a> Unpin for ObjectFacts<'a>
impl<'a> UnsafeUnpin for ObjectFacts<'a>
impl<'a> UnwindSafe for ObjectFacts<'a>
Blanket Implementations§
impl<T> Allocation for T
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