Struct PropertyManager 

pub struct PropertyManager { /* private fields */ }

Implementations

impl PropertyManager

pub fn new( storage: Arc<StorageManager>, schema_manager: Arc<SchemaManager>, capacity: usize, ) -> Self

Construct a PropertyManager with an empty plugin registry.

Back-compat shim for the ~17 algorithm and test call sites that don’t need registry-dispatched CRDT merges. Equivalent to Self::with_plugin_registry with Arc::new(PluginRegistry::new()).

pub fn with_plugin_registry( storage: Arc<StorageManager>, schema_manager: Arc<SchemaManager>, capacity: usize, plugin_registry: Arc<PluginRegistry>, ) -> Self

Construct a PropertyManager wired to a shared PluginRegistry.

CRDT merges in this PropertyManager consult plugin_registry for CrdtKindProviders matching each Crdt::kind(); matched kinds dispatch through the provider (so hot-reloaded plugins take effect immediately), unmatched kinds fall back to the native Crdt::try_merge.

pub fn cache_size(&self) -> usize

pub fn caching_enabled(&self) -> bool

Check if caching is enabled

pub async fn clear_cache(&self)

Clear all caches. Call this when L0 is rotated, flushed, or compaction occurs to prevent stale reads.

pub async fn invalidate_vertex(&self, _vid: Vid)

Invalidate a specific vertex’s cached properties.

pub async fn invalidate_edge(&self, _eid: Eid)

Invalidate a specific edge’s cached properties.

pub async fn get_edge_prop( &self, eid: Eid, prop: &str, ctx: Option<&QueryContext>, ) -> Result<Value>

pub async fn get_all_edge_props_with_ctx( &self, eid: Eid, ctx: Option<&QueryContext>, ) -> Result<Option<Properties>>

pub async fn flushed_edge_key_conflict( &self, edge_type: &str, key_values: &[(String, Value)], exclude_eid: Option<Eid>, ) -> Result<bool>

Reports whether a live flushed edge of edge_type already carries the given unique-key values, excluding exclude_eid.

The committed-storage half of the edge-uniqueness full-horizon probe (the in-memory L0 layers are checked separately via has_edge_constraint_key). The per-type delta table is an LSM log — multiple versions per eid, later op = 0 writes overwrite properties, op = 1 deletes — so a naive prop = val AND op = 0 count would wrongly flag an edge that was later deleted or updated away from val. Instead this narrows to candidate eids on ONE key property (guaranteed present in some op = 0 row iff the edge currently holds that value), then resolves each candidate’s current merged properties via fetch_all_edge_props_from_storage_with_hint and confirms the full key still matches on a live edge. Correct — never leaks a duplicate — without an O(edges) full scan.

Errors

Propagates backend scan errors — fails closed rather than treating a conflict as absent.

pub async fn get_batch_vertex_props( &self, vids: &[Vid], properties: &[&str], ctx: Option<&QueryContext>, ) -> Result<HashMap<Vid, Properties>>

Batch load properties for multiple vertices

pub async fn get_batch_edge_props( &self, eids: &[Eid], properties: &[&str], ctx: Option<&QueryContext>, ) -> Result<HashMap<Vid, Properties>>

Load properties as Arrow columns for vectorized processing Batch load properties for multiple edges

pub async fn get_batch_labels( &self, vids: &[Vid], ctx: Option<&QueryContext>, ) -> Result<HashMap<Vid, Vec<String>>>

Batch load labels for multiple vertices.

pub async fn get_all_vertex_props(&self, vid: Vid) -> Result<Properties>

pub async fn get_all_vertex_props_with_ctx( &self, vid: Vid, ctx: Option<&QueryContext>, ) -> Result<Option<Properties>>

pub async fn get_batch_vertex_props_for_label( &self, vids: &[Vid], label: &str, ctx: Option<&QueryContext>, ) -> Result<HashMap<Vid, Properties>>

Batch-fetch properties for multiple vertices of a known label.

Queries L0 layers in-memory, then fetches remaining VIDs from LanceDB in a single _vid IN (...) query on the label table. Much faster than per-vertex get_all_vertex_props_with_ctx when many vertices need loading.

Fetches every columnar property. Callers that only need a subset (e.g. a vector/search procedure materializing RETURN node.<prop>) should prefer Self::get_batch_vertex_props_for_label_projected to avoid decoding unread heavy columns such as List(Vector) (issue #134).

pub async fn get_batch_vertex_props_for_label_projected( &self, vids: &[Vid], label: &str, ctx: Option<&QueryContext>, requested_props: Option<&[String]>, ) -> Result<HashMap<Vid, Properties>>

Like Self::get_batch_vertex_props_for_label, but restricts the LanceDB fetch to requested_props (plus the id/version/overflow bookkeeping columns) when Some. Unread columnar properties — notably heavy List(Vector) columns — are then never decoded (issue #134). None fetches all columnar properties, identical to the unprojected method.

Requested names that are not declared columnar properties are ignored here; they are served from overflow_json, which is always fetched.

pub async fn get_batch_edge_props_for_type( &self, eids: &[Eid], type_name: &str, ctx: Option<&QueryContext>, ) -> Result<HashMap<Eid, Properties>>

Batch-fetch properties for multiple edges of a known type.

Mirrors get_batch_vertex_props_for_label (above) for the edge path. Issues one eid IN (...) scan against the delta table for the edge type, replaying per-EID version history (op-replay + CRDT merge) the same way fetch_all_edge_props_from_storage_with_hint does. Far faster than per-edge get_all_edge_props_with_ctx when many edges of the same type need loading (e.g., batched SET/REMOVE on edges matched by a MATCH).

EIDs of deleted edges or those with no rows in delta storage are omitted from the returned map; callers can fall back to the per-EID path for misses.

pub async fn get_vertex_prop(&self, vid: Vid, prop: &str) -> Result<Value>

pub async fn get_vertex_prop_with_ctx( &self, vid: Vid, prop: &str, ctx: Option<&QueryContext>, ) -> Result<Value>

pub fn value_from_column( col: &dyn Array, data_type: &DataType, row: usize, ) -> Result<Value>

Decode an Arrow column value with strict CRDT error handling.

pub fn merge_crdt_values(&self, a: &Value, b: &Value) -> Result<Value>

Merge two Value-wrapped CRDT operands.

Routes through uni_crdt::Crdt::merge_via_registry using the PropertyManager’s plugin_registry. With an empty registry (the legacy 3-arg Self::new default) merge_via_registry falls back to Crdt::try_merge, preserving native semantics.

Errors

Returns an anyhow::Error when either operand is malformed CRDT JSON, the variants disagree, or the registry-dispatched merge surfaces a CrdtError.