pub struct StartupTuning {
pub raft_ready_timeout_ms: u64,
pub data_group_recovery_timeout_ms: u64,
}Expand description
[tuning.startup]: how long each boot wait can go without progress.
A wait that keeps progressing never fails, however long the replay takes. The server range-checks both values at load. An unknown key is refused, so a misspelt bound never leaves the default in force silently.
Fields§
§raft_ready_timeout_ms: u64Stall bound of the metadata group’s replay. Every applied entry resets it. Default: 30_000.
data_group_recovery_timeout_ms: u64Stall bound of the data groups’ replay, then of the Calvin scheduler catch-up. An election, a commit or apply advance, a scheduler epoch, or a finished group or scheduler resets it. Default: 60_000.
Implementations§
Source§impl StartupTuning
impl StartupTuning
Sourcepub fn raft_ready_timeout(&self) -> RaftReadyTimeout
pub fn raft_ready_timeout(&self) -> RaftReadyTimeout
Stall bound of the metadata group’s replay wait.
Sourcepub fn data_group_recovery_timeout(&self) -> DataGroupRecoveryTimeout
pub fn data_group_recovery_timeout(&self) -> DataGroupRecoveryTimeout
Stall bound of the data groups’ replay and Calvin catch-up waits.
Trait Implementations§
Source§impl Clone for StartupTuning
impl Clone for StartupTuning
Source§impl Debug for StartupTuning
impl Debug for StartupTuning
Source§impl Default for StartupTuning
impl Default for StartupTuning
Source§impl<'de> Deserialize<'de> for StartupTuning
impl<'de> Deserialize<'de> for StartupTuning
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>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for StartupTuning
impl RefUnwindSafe for StartupTuning
impl Send for StartupTuning
impl Sync for StartupTuning
impl Unpin for StartupTuning
impl UnsafeUnpin for StartupTuning
impl UnwindSafe for StartupTuning
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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
Mutably borrows from an owned value. Read more
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>
Returns the layout of the type.
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
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.