pub struct GraphTuning {
pub max_visited: usize,
pub max_depth: usize,
pub lcc_high_degree_threshold: usize,
pub lcc_sample_pairs: usize,
pub varlen_max_results: usize,
pub varlen_max_frontier: usize,
pub max_gathered_algo_edges: usize,
}Expand description
Graph engine tuning (traversal limits, LCC algorithm).
Fields§
§max_visited: usize§max_depth: usize§lcc_high_degree_threshold: usize§lcc_sample_pairs: usize§varlen_max_results: usizeHard cap on results emitted from a single variable-length MATCH
([*min..max]) expansion. When an expansion would exceed this it
truncates at the current hop boundary and surfaces a resume cursor so
the remainder is paged across follow-up rounds (cross-shard or local) —
no row is silently dropped. Bounds peak per-expansion result allocation.
varlen_max_frontier: usizeHard cap on the live (per-hop) frontier of a single variable-length MATCH expansion. When a single hop would grow the frontier past this it truncates and pages via resume, bounding peak intermediate allocation on dense / bidirectional traversals.
max_gathered_algo_edges: usizeHard cap on the distinct edges a gathered graph algorithm collects from every owner before it runs on one core. The algorithm needs every edge in one CSR, so a run over more edges is refused with the edge count rather than answered from part of the graph.
Trait Implementations§
Source§impl Clone for GraphTuning
impl Clone for GraphTuning
Source§impl Debug for GraphTuning
impl Debug for GraphTuning
Source§impl Default for GraphTuning
impl Default for GraphTuning
Source§impl<'de> Deserialize<'de> for GraphTuning
impl<'de> Deserialize<'de> for GraphTuning
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Auto Trait Implementations§
impl Freeze for GraphTuning
impl RefUnwindSafe for GraphTuning
impl Send for GraphTuning
impl Sync for GraphTuning
impl Unpin for GraphTuning
impl UnsafeUnpin for GraphTuning
impl UnwindSafe for GraphTuning
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.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§fn to_subset_unchecked(&self) -> SS
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.