Skip to main content

StorageMetadataIndex

Struct StorageMetadataIndex 

Source
pub struct StorageMetadataIndex {
    pub entries: HashMap<u64, MetadataIndexEntry>,
    pub field_index: HashMap<MetadataField, Vec<u64>>,
    pub stats: MetadataIndexStats,
}
Expand description

Secondary index over block metadata fields enabling efficient filtered queries.

§Design

Two data structures are maintained in tandem:

  • entries — a HashMap<block_id, MetadataIndexEntry> for O(1) point lookups and to support fast replacement when the same block is re-inserted.
  • field_index — an inverted index mapping each MetadataField to the set of block_ids that carry that field.

Queries intersect the posting lists of all must_have fields (giving the candidate set), then subtract any block whose entry contains a must_not_have field.

Fields§

§entries: HashMap<u64, MetadataIndexEntry>

Primary store: block_id → entry.

§field_index: HashMap<MetadataField, Vec<u64>>

Inverted index: field → block_ids.

§stats: MetadataIndexStats

Running statistics.

Implementations§

Source§

impl StorageMetadataIndex

Source

pub fn new() -> Self

Create an empty StorageMetadataIndex.

Source

pub fn insert(&mut self, entry: MetadataIndexEntry)

Insert (or replace) a block entry.

If a block with the same block_id already exists its old field index postings are removed before the new entry is written.

Source

pub fn remove(&mut self, block_id: u64) -> bool

Remove the entry for block_id.

Returns true if an entry was present and removed, false otherwise.

Source

pub fn query(&mut self, q: &MetadataQuery) -> Vec<MetadataQueryResult>

Execute a structured metadata query.

§Algorithm
  1. Candidate set – if must_have is empty, all block IDs are candidates; otherwise the candidate set is the intersection of the posting lists for each must_have field.
  2. Exclusion – remove any candidate whose entry contains any must_not_have field.
  3. Projection – build a MetadataQueryResult per surviving candidate recording which must_have fields matched.
  4. Sort – apply sort_by if present.
  5. Limit – truncate to limit if present.
  6. Stats – increment total_queries.
Source

pub fn get(&self, block_id: u64) -> Option<&MetadataIndexEntry>

Return a reference to the entry for block_id, or None.

Source

pub fn stats(&self) -> &MetadataIndexStats

Return a reference to the current statistics snapshot.

Trait Implementations§

Source§

impl Default for StorageMetadataIndex

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more