pub struct Limits {
pub max_executions: usize,
pub max_events: usize,
pub max_log_chars: usize,
pub max_subscriber_queue: usize,
pub max_running: usize,
}Expand description
What the store keeps, and how much of it.
The defaults are for a development server a person is watching: enough history that a browser reload during a long run loses nothing, and little enough that a process left running for a week is not holding a transcript of it.
Fields§
§max_executions: usizeHow many executions are remembered. The oldest finished one is forgotten first; an execution that is still running is never forgotten.
max_events: usizeHow many events are retained per execution. The oldest are dropped and the snapshot says so, so a client that asks for history knows it did not get all of it.
max_log_chars: usizeThe longest a single log line may be; longer is cut with a marker.
max_subscriber_queue: usizeHow many events a subscriber may be behind before it is told to resynchronise instead of being waited for.
max_running: usizeHow many executions may be running at once. Beyond it, an execution waits queued.
Trait Implementations§
impl Copy for Limits
impl Eq for Limits
impl StructuralPartialEq for Limits
Auto Trait Implementations§
impl Freeze for Limits
impl RefUnwindSafe for Limits
impl Send for Limits
impl Sync for Limits
impl Unpin for Limits
impl UnsafeUnpin for Limits
impl UnwindSafe for Limits
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.