pub struct GraphWriteOptions {
pub node_id_width: NodeIdWidth,
pub weight_type: WeightType,
pub weight_range: Option<(f64, f64)>,
pub num_nodes: Option<u64>,
pub properties: BTreeMap<String, String>,
}Expand description
Fields§
§node_id_width: NodeIdWidthStorage width for node ids (default U32); ids above the limit
surface StorageError::Overflow instead of being truncated.
weight_type: WeightTypeStorage width for edge weights (default F64, mirroring
node_id_width, #106): weights are f64 at the API boundary.
The default matches the sparse-matrix value column (bit-exact
f64 round trips); an explicit F32 declaration halves the storage
bytes but rejects values that cannot be stored exactly instead of
silently narrowing them.
weight_range: Option<(f64, f64)>Opt-in weight-range compliance check (#106): when Some((low, high)), every weight must already lie in the closed interval — a
bounds assertion that catches a forgotten producer transform,
never a transform the storage layer performs (normalization
belongs upstream; values are persisted faithfully). NaN lies in
no interval and is rejected; an inverted interval is a rejected
configuration.
num_nodes: Option<u64>Explicit node count (e.g. to keep isolated vertices). Must be at
least max(src, dst) + 1 over all edges; defaults to exactly that.
properties: BTreeMap<String, String>User properties stored on the collection (registry level) and stamped into the dataset schema metadata (dataset level).
Implementations§
Source§impl GraphWriteOptions
impl GraphWriteOptions
pub fn with_width(node_id_width: NodeIdWidth) -> Self
Trait Implementations§
Source§impl Clone for GraphWriteOptions
impl Clone for GraphWriteOptions
Source§fn clone(&self) -> GraphWriteOptions
fn clone(&self) -> GraphWriteOptions
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for GraphWriteOptions
impl Debug for GraphWriteOptions
Auto Trait Implementations§
impl Freeze for GraphWriteOptions
impl RefUnwindSafe for GraphWriteOptions
impl Send for GraphWriteOptions
impl Sync for GraphWriteOptions
impl Unpin for GraphWriteOptions
impl UnsafeUnpin for GraphWriteOptions
impl UnwindSafe for GraphWriteOptions
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.