Operational Reliability Reports

Incident Queue Report

Filter Severity

Queue reports often show how many incidents match a selected threshold. This program filters a fixed severity list and also counts high-severity incidents.

Program

Play the program to choose the minimum severity and watch the visible queue count change.

min_severity
incident_queue_report.rs
Replay: real traced execution (multi-file project)
fn main() {
    let min_severity = 2;
    let severities = [1, 3, 2, 3];
    let visible_count = severities.iter().filter(|score| **score >= min_severity).count();
    let high_count = severities.iter().filter(|score| **score == 3).count();
    let line = format!("{min_severity} {visible_count} {high_count}");
    println!("{line}");
}

fn main() {
    let min_severity = 1;
    let severities = [1, 3, 2, 3];
    let visible_count = severities.iter().filter(|score| **score >= min_severity).count();
    let high_count = severities.iter().filter(|score| **score == 3).count();
    let line = format!("{min_severity} {visible_count} {high_count}");
    println!("{line}");
}

fn main() {
    let min_severity = 3;
    let severities = [1, 3, 2, 3];
    let visible_count = severities.iter().filter(|score| **score >= min_severity).count();
    let high_count = severities.iter().filter(|score| **score == 3).count();
    let line = format!("{min_severity} {visible_count} {high_count}");
    println!("{line}");
}

  1. min_severity ← 2, severities ← [1, 3, 2, 3], visible_count ← 3

    1fn main() {2    let min_severit→ 2y = 2; //@min_severity=2, 1, 33    let severitie→ [1, 3, 2, 3]s = [1, 3, 2, 3];4    let visible_coun→ 3t = severities.iter().filter(|score| **score >= min_severity).count();5    let high_coun→ 2t = severities.iter().filter(|score| **score == 3).count();6    let lin→ "2 3 2"e = format!("{min_severity} {visible_count} {high_count}");7    println!("{line}");8}
    output2 3 2

  1. min_severity ← 1, severities ← [1, 3, 2, 3], visible_count ← 4

    1fn main() {2    let min_severit→ 1y = 1;3    let severitie→ [1, 3, 2, 3]s = [1, 3, 2, 3];4    let visible_coun→ 4t = severities.iter().filter(|score| **score >= min_severity).count();5    let high_coun→ 2t = severities.iter().filter(|score| **score == 3).count();6    let lin→ "1 4 2"e = format!("{min_severity} {visible_count} {high_count}");7    println!("{line}");8}
    output1 4 2

  1. min_severity ← 3, severities ← [1, 3, 2, 3], visible_count ← 2

    1fn main() {2    let min_severit→ 3y = 3;3    let severitie→ [1, 3, 2, 3]s = [1, 3, 2, 3];4    let visible_coun→ 2t = severities.iter().filter(|score| **score >= min_severity).count();5    let high_coun→ 2t = severities.iter().filter(|score| **score == 3).count();6    let lin→ "3 2 2"e = format!("{min_severity} {visible_count} {high_count}");7    println!("{line}");8}
    output3 2 2
severity threshold `min_severity` controls which incidents are visible in the report.
iterator count The filters count matching entries without mutating the queue.
high count A separate fixed threshold keeps critical incidents visible.