Skip to main content

StorageBlockIndex

Struct StorageBlockIndex 

Source
pub struct StorageBlockIndex {
    pub entries: HashMap<String, IndexEntry>,
    pub index: HashMap<IndexKey, Vec<String>>,
}
Expand description

Secondary index over stored blocks that accelerates queries by content type, size range, creation time, and custom tags without scanning all blocks.

§Indexing strategy

Every IndexEntry inserted into the index is registered under four categories of IndexKey:

  • ContentType(content_type) — one key per entry.
  • SizeBucket(size_bytes / 1_MiB) — coarse size bucket (1 MiB granularity).
  • DayBucket(created_at_secs / 86_400) — coarse day bucket.
  • Tag(tag) for each tag string in entry.tags.

The inverted index maps each IndexKey to the list of CID strings that carry that key, enabling fast set-based retrieval without a full scan.

Fields§

§entries: HashMap<String, IndexEntry>

Primary storage: maps CID to its full IndexEntry.

§index: HashMap<IndexKey, Vec<String>>

Inverted index: maps an IndexKey to the CIDs that belong to it.

Implementations§

Source§

impl StorageBlockIndex

Source

pub fn new() -> Self

Create a new, empty StorageBlockIndex.

Source

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

Insert (or replace) an entry in the index.

If a previous entry exists for the same CID it is removed first so the inverted index does not accumulate stale pointers.

Source

pub fn remove(&mut self, cid: &str) -> bool

Remove an entry by CID from both the primary store and all index buckets.

Returns true when the entry existed and was removed, false otherwise.

Source

pub fn query<'a>(&'a self, q: &IndexQuery) -> Vec<&'a IndexEntry>

Query the index with an IndexQuery filter.

The implementation performs a full scan of the primary entry map and applies each active filter in turn. Results are sorted by created_at_secs descending (newest first).

Source

pub fn entries_for_key<'a>(&'a self, key: &IndexKey) -> Vec<&'a IndexEntry>

Look up all entries that are indexed under the given IndexKey.

Returns entries sorted by CID string for deterministic ordering.

Source

pub fn stats(&self) -> IndexStats

Compute aggregate statistics over all indexed entries.

Trait Implementations§

Source§

impl Default for StorageBlockIndex

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