pub struct ReplayArm {
pub total: ReplayTally,
pub per_analyzer: BTreeMap<String, ReplayTally>,
pub queue_per_step: Vec<u64>,
pub findings: Vec<ReplayFinding>,
pub skipped: BTreeMap<String, String>,
}Expand description
One arm of the comparison: the incumbent or the candidate.
Fields§
§total: ReplayTally§per_analyzer: BTreeMap<String, ReplayTally>§queue_per_step: Vec<u64>Findings per step, in step order — the queue volume.
findings: Vec<ReplayFinding>§skipped: BTreeMap<String, String>Analyzers skipped at any step and why (disabled, denied, not replayed).
Trait Implementations§
impl StructuralPartialEq for ReplayArm
Auto Trait Implementations§
impl Freeze for ReplayArm
impl RefUnwindSafe for ReplayArm
impl Send for ReplayArm
impl Sync for ReplayArm
impl Unpin for ReplayArm
impl UnsafeUnpin for ReplayArm
impl UnwindSafe for ReplayArm
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
Mutably borrows from an owned value. Read more