pub struct DurableGraphDriverOptions { /* private fields */ }Expand description
Resource, lease, deadline, and retry policy for one durable driver.
Implementations§
Source§impl DurableGraphDriverOptions
impl DurableGraphDriverOptions
Sourcepub const HARD_MAXIMUM_DURABLE_EVENTS: u32 = 65_536
pub const HARD_MAXIMUM_DURABLE_EVENTS: u32 = 65_536
Absolute work quantum accepted for one call to DurableGraphDriver::drive.
Sourcepub const HARD_MAXIMUM_MUTATION_ATTEMPTS: u8 = 10
pub const HARD_MAXIMUM_MUTATION_ATTEMPTS: u8 = 10
Absolute number of identical durable mutation attempts.
Sourcepub const HARD_MINIMUM_CANCELLATION_POLL_INTERVAL: Duration
pub const HARD_MINIMUM_CANCELLATION_POLL_INTERVAL: Duration
Fastest accepted database polling cadence for durable cancellation intent.
Sourcepub const HARD_MAXIMUM_CANCELLATION_POLL_INTERVAL: Duration
pub const HARD_MAXIMUM_CANCELLATION_POLL_INTERVAL: Duration
Slowest accepted observation cadence for durable cancellation intent.
Sourcepub const HARD_MAXIMUM_CANCELLATION_GRACE_PERIOD: Duration
pub const HARD_MAXIMUM_CANCELLATION_GRACE_PERIOD: Duration
Longest cooperative cleanup window after durable cancellation wins.
Sourcepub const HARD_MAXIMUM_PARALLEL_NODES: u16 = 64
pub const HARD_MAXIMUM_PARALLEL_NODES: u16 = 64
Absolute process-local concurrency ceiling for one run.
Sourcepub fn new(
replay_limits: GraphReplayLimits,
maximum_durable_events: u32,
lease_renewal_interval: Duration,
node_execution_timeout: Duration,
maximum_mutation_attempts: u8,
mutation_retry_initial_delay: Duration,
) -> Result<Self, DurableGraphDriverOptionsError>
pub fn new( replay_limits: GraphReplayLimits, maximum_durable_events: u32, lease_renewal_interval: Duration, node_execution_timeout: Duration, maximum_mutation_attempts: u8, mutation_retry_initial_delay: Duration, ) -> Result<Self, DurableGraphDriverOptionsError>
Constructs a fully explicit driver policy.
§Errors
Rejects a work quantum below one complete node start/completion pair, invalid renewal precision, a zero or excessive node deadline, and unsafe mutation retry parameters.
Sourcepub fn with_cancellation_timing(
self,
poll_interval: Duration,
grace_period: Duration,
) -> Result<Self, DurableGraphDriverOptionsError>
pub fn with_cancellation_timing( self, poll_interval: Duration, grace_period: Duration, ) -> Result<Self, DurableGraphDriverOptionsError>
Overrides the database cancellation-observation cadence and cooperative node cleanup window.
§Errors
Rejects non-microsecond-aligned or production-unbounded values. The poll interval is also bounded below so one bad configuration cannot turn each active node into an unbounded database query loop.
Sourcepub fn with_parallel_node_limit(
self,
maximum_parallel_nodes: u16,
) -> Result<Self, DurableGraphDriverOptionsError>
pub fn with_parallel_node_limit( self, maximum_parallel_nodes: u16, ) -> Result<Self, DurableGraphDriverOptionsError>
Enables bounded overlap for executors that explicitly declare the journal-isolated scheduling contract.
The effective batch width is the minimum of this value, the compiled graph limit, the ready set, and the remaining durable-event quantum. Exclusive executors always run alone.
§Errors
Rejects zero or process-unbounded concurrency.
Sourcepub const fn replay_limits(self) -> GraphReplayLimits
pub const fn replay_limits(self) -> GraphReplayLimits
Returns the memory ceiling shared by historical replay and current barrier materialization.
Sourcepub const fn maximum_durable_events(self) -> u32
pub const fn maximum_durable_events(self) -> u32
Returns the maximum driver-owned durable events in one drive call.
Sourcepub const fn lease_renewal_interval(self) -> Duration
pub const fn lease_renewal_interval(self) -> Duration
Returns the monotonic interval between renewal attempts.
Sourcepub const fn node_execution_timeout(self) -> Duration
pub const fn node_execution_timeout(self) -> Duration
Returns the hard wall-clock deadline for one node task.
Sourcepub const fn cancellation_poll_interval(self) -> Duration
pub const fn cancellation_poll_interval(self) -> Duration
Returns the bounded database polling cadence for cancellation intent.
Sourcepub const fn cancellation_grace_period(self) -> Duration
pub const fn cancellation_grace_period(self) -> Duration
Returns the cooperative cleanup window after cancellation is observed.
Sourcepub const fn maximum_parallel_nodes(self) -> u16
pub const fn maximum_parallel_nodes(self) -> u16
Returns the process-local ready-node concurrency ceiling.
Sourcepub const fn maximum_mutation_attempts(self) -> u8
pub const fn maximum_mutation_attempts(self) -> u8
Returns the maximum identical attempts for one idempotent mutation.
Sourcepub const fn mutation_retry_initial_delay(self) -> Duration
pub const fn mutation_retry_initial_delay(self) -> Duration
Returns the first exponential mutation retry delay.
Trait Implementations§
Source§impl Clone for DurableGraphDriverOptions
impl Clone for DurableGraphDriverOptions
impl Copy for DurableGraphDriverOptions
Source§impl Debug for DurableGraphDriverOptions
impl Debug for DurableGraphDriverOptions
Source§impl Default for DurableGraphDriverOptions
impl Default for DurableGraphDriverOptions
impl Eq for DurableGraphDriverOptions
impl StructuralPartialEq for DurableGraphDriverOptions
Auto Trait Implementations§
impl Forget for DurableGraphDriverOptions
impl Freeze for DurableGraphDriverOptions
impl Move for DurableGraphDriverOptions
impl RefUnwindSafe for DurableGraphDriverOptions
impl Send for DurableGraphDriverOptions
impl Sync for DurableGraphDriverOptions
impl Unpin for DurableGraphDriverOptions
impl UnsafeUnpin for DurableGraphDriverOptions
impl UnwindSafe for DurableGraphDriverOptions
Blanket Implementations§
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.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> 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 more