Skip to main content

ShardedCsrIndex

Struct ShardedCsrIndex 

Source
pub struct ShardedCsrIndex { /* private fields */ }
Expand description

Per-tenant partitioned CSR index.

Holds one CsrIndex per tenant on the owning Data Plane core. Handlers resolve the caller’s tenant to a partition up front; all downstream graph operations (algorithms, MATCH, traversal) run against that single partition and cannot reach any other tenant’s state.

Implementations§

Source§

impl ShardedCsrIndex

Source

pub fn new() -> Self

Construct an empty sharded index with no partitions.

Source

pub fn partition(&self, tid: TenantId) -> Option<&CsrIndex>

Shared access to a tenant’s partition, if it exists.

Returns None if the tenant has never inserted any graph data. Callers expecting a read-only view of a possibly-empty partition should treat None as “empty” rather than as an error.

Source

pub fn partition_mut(&mut self, tid: TenantId) -> Option<&mut CsrIndex>

Mutable access to a tenant’s partition, if it exists.

Source

pub fn get_or_create(&mut self, tid: TenantId) -> &mut CsrIndex

Mutable access to a tenant’s partition, creating an empty one on first use.

This is the canonical write-path entry point: insertion handlers call this once to resolve the partition, then operate on the returned &mut CsrIndex exactly as they would on a standalone instance.

Source

pub fn drop_partition(&mut self, tid: TenantId) -> bool

Drop a tenant’s entire graph state.

Returns true if a partition existed and was removed, false if the tenant had no graph state. Used by tenant-purge flows — O(1) structural deletion replaces the former “range-scan and erase every key with the {tid}: prefix” approach, which was both slow and coupled to the lexical encoding.

Source

pub fn drop_collection(&mut self, _tid: TenantId, _collection: &str)

Collection-scoped in-memory reclaim.

The CSR is collection-agnostic in memory: a tenant’s partition holds edges from all collections in a single adjacency structure. There is no per-collection sub-partition to drop. As a result this method is intentionally a no-op — collection-scoped edge removal from persistent storage is handled by [EdgeStore::purge_collection], and the stale in-memory CSR state is eliminated on the next tenant drop_partition call (triggered by tenant deletion) or on server restart (CSR is rebuilt from the now-clean EdgeStore).

Source

pub fn contains_partition(&self, tid: TenantId) -> bool

Whether a partition exists for the tenant.

Source

pub fn partition_count(&self) -> usize

Number of tenants with graph state on this core.

Source

pub fn iter(&self) -> Iter<'_, TenantId, CsrIndex>

Iterate all (tenant, partition) pairs. Used for checkpointing, memory accounting, and administrative views that genuinely need to see every tenant’s state.

Source

pub fn iter_mut(&mut self) -> IterMut<'_, TenantId, CsrIndex>

Mutable iteration over all partitions. Used by compact() and similar maintenance passes that apply per-partition without needing tenant routing.

Source

pub fn compact_all(&mut self) -> Result<(), GraphError>

Compact every partition. Mirrors CsrIndex::compact but across the full set — maintenance handlers call this once per core.

§Errors

Returns the first GraphError::MemoryBudget encountered if any partition has a memory governor installed and the budget is exhausted. Partitions already compacted before the error are not rolled back.

Source

pub fn install_partition(&mut self, tid: TenantId, csr: CsrIndex)

Replace an existing partition (or install a new one) with the given CsrIndex. Used by the rebuild path — after rebuilding a tenant’s CSR from persistent edge storage, this installs it atomically.

Source

pub fn entry(&mut self, tid: TenantId) -> Entry<'_, TenantId, CsrIndex>

Access or create a partition via the Entry API, for cases that need conditional initialization with a non-default constructor.

Trait Implementations§

Source§

impl Default for ShardedCsrIndex

Source§

fn default() -> Self

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

Auto Trait Implementations§

Blanket Implementations§

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> ArchivePointee for T

Source§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
Source§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
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<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> LayoutRaw for T

Source§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>

Returns the layout of the type.
Source§

impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
where T: SharedNiching<N1, N2>, N1: Niching<T>, N2: Niching<T>,

Source§

unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool

Returns whether the given value has been niched. Read more
Source§

fn resolve_niched(out: Place<NichedOption<T, N1>>)

Writes data to out indicating that a T is niched.
Source§

impl<T> Pointee for T

Source§

type Metadata = ()

The metadata type for pointers and references to this type.
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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