Struct SortPerm 

pub(super) struct SortPerm {
    pub(super) ids: Vec<EntryId>,
    covers: u32,
}

Pre-sorted id order for one sort key, built on the first query that sorts by it and extended per content generation after that — the same insertion-point in-place merge the name permutation uses, through the same cmp_by order (ADR-0006).

Never persisted: a snapshot restore re-sorts on first use, which also resets any staleness in-place stat updates accumulated.

Fields

ids: Vec<EntryId>

covers: u32

Entries [0, covers) are placed; a generation step sorts and merges only the ids past the watermark.

Implementations

impl SortPerm

fn build(idx: &VolumeIndex, key: SortKey) -> Self

fn extend(idx: &VolumeIndex, perm: Self, key: SortKey) -> Self

Trait Implementations

impl Clone for SortPerm

fn clone(&self) -> SortPerm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl From<MtimePerm> for SortPerm

fn from(p: MtimePerm) -> Self

Converts to this type from the input type.

impl From<SizePerm> for SortPerm

fn from(p: SizePerm) -> Self

Converts to this type from the input type.