pub struct Histogram {
pub min: Vec<u8>,
pub max: Vec<u8>,
pub distinct: u64,
pub buckets: [u32; 64],
pub partial: bool,
}Expand description
Value-domain shape of one (kind, pid) for planner estimates:
exact extrema and distinct count, plus an equi-width histogram over the
order-preserving payload space. Computed on demand from the value
dictionary; never a query result.
Fields§
§min: Vec<u8>Smallest payload.
max: Vec<u8>Largest payload.
distinct: u64Distinct payloads.
buckets: [u32; 64]Owner-occurrence counts per fixed bucket.
partial: boolThe walk that built this stopped at its budget: buckets, distinct and
max cover only the walked (smallest) prefix of the value domain.
Implementations§
Trait Implementations§
impl Eq for Histogram
impl StructuralPartialEq for Histogram
Auto Trait Implementations§
impl Freeze for Histogram
impl RefUnwindSafe for Histogram
impl Send for Histogram
impl Sync for Histogram
impl Unpin for Histogram
impl UnsafeUnpin for Histogram
impl UnwindSafe for Histogram
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.