struct PackedAncientStorageTuning {
percent_of_alive_shrunk_data: u64,
max_ancient_slots: usize,
ideal_storage_size: NonZeroU64,
can_randomly_shrink: bool,
}
Expand description
ancient packing algorithm tuning per pass
Fields§
§percent_of_alive_shrunk_data: u64
shrink enough of these ancient append vecs to realize this% of the total dead data that needs to be shrunk Doing too much burns too much time and disk i/o. Doing too little could cause us to never catch up and have old data accumulate.
max_ancient_slots: usize
number of ancient slots we should aim to have. If we have more than this, combine further.
ideal_storage_size: NonZeroU64
§can_randomly_shrink: bool
true if storages can be randomly shrunk even if they aren’t eligible
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for PackedAncientStorageTuning
impl Send for PackedAncientStorageTuning
impl Sync for PackedAncientStorageTuning
impl Unpin for PackedAncientStorageTuning
impl UnwindSafe for PackedAncientStorageTuning
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