pub enum Depth {
Fast,
Balanced,
Forensic,
}Expand description
How hard to push. Repeat-count driven: more samples buy tighter consistency and jitter signals at linear cost.
Variants§
Fast
Cheapest useful pass. Single samples, no repeat probes.
Balanced
Default. Enough repeats to see jitter and cache replay.
Forensic
Consistency-heavy. Use when building a case against a provider.
Implementations§
Source§impl Depth
impl Depth
pub fn parse(s: &str) -> Option<Self>
pub fn as_str(&self) -> &'static str
Sourcepub fn tier_questions(&self) -> usize
pub fn tier_questions(&self) -> usize
Questions per difficulty band in the tier estimator.
Measured on a live endpoint, two per band was not enough: the same
model scored hard 0/2 on one run and 1/2 on the next, which moved
the fitted tier by a whole step. The abstention gates caught it — the
second run degraded to a warning instead of accusing — but a real
downgrade can be missed that way. Three narrows the swing at the cost
of three extra requests; forensic is still the setting to reach for
when the answer has to hold up.
Trait Implementations§
impl Copy for Depth
impl Eq for Depth
impl StructuralPartialEq for Depth
Auto Trait Implementations§
impl Freeze for Depth
impl RefUnwindSafe for Depth
impl Send for Depth
impl Sync for Depth
impl Unpin for Depth
impl UnsafeUnpin for Depth
impl UnwindSafe for Depth
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
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§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.