pub struct XrefTable { /* private fields */ }Implementations§
Source§impl XrefTable
impl XrefTable
pub fn new() -> Self
pub fn get(&self, id: ObjectId) -> Option<&XrefEntry>
pub fn insert(&mut self, id: ObjectId, entry: XrefEntry)
Sourcepub fn insert_overwrite(&mut self, id: ObjectId, entry: XrefEntry)
pub fn insert_overwrite(&mut self, id: ObjectId, entry: XrefEntry)
Insert overwriting any existing entry. Used by tail-scan recovery, where a
later byte offset for the same ObjectId supersedes an earlier one
(incremental-update semantics). The regular insert is first-wins because
the /Prev chain walks newest-to-oldest.
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn object_ids(&self) -> impl Iterator<Item = ObjectId> + '_
Trait Implementations§
Auto Trait Implementations§
impl Freeze for XrefTable
impl RefUnwindSafe for XrefTable
impl Send for XrefTable
impl Sync for XrefTable
impl Unpin for XrefTable
impl UnsafeUnpin for XrefTable
impl UnwindSafe for XrefTable
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