Operational Reliability Reports

Incident Queue Reliability Report

Count incidents visible at a minimum severity and summarize high-severity work.

incident queue A deterministic incident queue can be filtered into visible and high-severity counts without modeling live tickets.

Incident Queue Reliability Report

minSeverity
IncidentQueueReliabilityReport.java
Replay: real traced execution (multi-file project)
public class IncidentQueueReliabilityReport {
    public static void main(String[] args) {
        int minSeverity = 2;
        int[] severities = {1, 2, 3, 3};
        int visible = 0;
        int high = 0;

        for (int severity : severities) {
            if (severity >= minSeverity) {
                visible += 1;
            }
            if (severity >= 3) {
                high += 1;
            }
        }

        System.out.println("min=" + minSeverity + " visible=" + visible + " high=" + high);
    }
}

public class IncidentQueueReliabilityReport {
    public static void main(String[] args) {
        int minSeverity = 1;
        int[] severities = {1, 2, 3, 3};
        int visible = 0;
        int high = 0;

        for (int severity : severities) {
            if (severity >= minSeverity) {
                visible += 1;
            }
            if (severity >= 3) {
                high += 1;
            }
        }

        System.out.println("min=" + minSeverity + " visible=" + visible + " high=" + high);
    }
}

public class IncidentQueueReliabilityReport {
    public static void main(String[] args) {
        int minSeverity = 3;
        int[] severities = {1, 2, 3, 3};
        int visible = 0;
        int high = 0;

        for (int severity : severities) {
            if (severity >= minSeverity) {
                visible += 1;
            }
            if (severity >= 3) {
                high += 1;
            }
        }

        System.out.println("min=" + minSeverity + " visible=" + visible + " high=" + high);
    }
}

  1. minSeverity ← 2, visible ← 0, high ← 0

    1public class IncidentQueueReliabilityReport {2    public static void main(String[] args) {3        int minSeverity→ 2 = 2;  //@minSeverity=1, 34        int[] severities = {1, 2, 3, 3};5        int visible→ 0 = 0;6        int high→ 0 = 0;

  2. for (int severity : severities)

    pass 1 of 4
    8for (int severity1 : severities) {9    if (severity >= minSeverity) {
    All 4 passes — pass 1 is the card above
    passseverityhigh
    11—
    22—
    330 → 1
    431 → 2

  3. visible ← 1

    pass 1 of 3
    8for (int severity : severities) {9    if (severity2 >= minSeverity2) {10        visible→ 1 += 1;11    }
    All 3 passes — pass 1 is the card above
    passseverityvisiblehigh
    120 → 1—
    231 → 20 → 1
    332 → 31 → 2

  4. high ← 1

    pass 1 of 2
    11}12if (severity3 >= 3) {13    high→ 1 += 1;14}

  5. high ← 2

    pass 2 of 2
    11}12if (severity3 >= 3) {13    high→ 2 += 1;14}

  6. System.out.println("min=" + minSeverity + " visible=" + visible + " hi…

    17    System.out.println("min=" + minSeverity2 + " visible=" + visible3 + " high=" + high2);18}
    outputmin=2 visible=3 high=2

  1. minSeverity ← 1, visible ← 0, high ← 0

    1public class IncidentQueueReliabilityReport {2    public static void main(String[] args) {3        int minSeverity→ 1 = 1;4        int[] severities = {1, 2, 3, 3};5        int visible→ 0 = 0;6        int high→ 0 = 0;

  2. for (int severity : severities)

    pass 1 of 4
    8for (int severity1 : severities) {9    if (severity >= minSeverity) {
    All 4 passes — pass 1 is the card above
    passseverityhigh
    11—
    22—
    330 → 1
    431 → 2

  3. visible ← 1

    pass 1 of 4
    8for (int severity : severities) {9    if (severity1 >= minSeverity1) {10        visible→ 1 += 1;11    }
    All 4 passes — pass 1 is the card above
    passseverityvisiblehigh
    110 → 1—
    221 → 2—
    332 → 30 → 1
    433 → 41 → 2

  4. high ← 1

    pass 1 of 2
    11}12if (severity3 >= 3) {13    high→ 1 += 1;14}

  5. high ← 2

    pass 2 of 2
    11}12if (severity3 >= 3) {13    high→ 2 += 1;14}

  6. System.out.println("min=" + minSeverity + " visible=" + visible + " hi…

    17    System.out.println("min=" + minSeverity1 + " visible=" + visible4 + " high=" + high2);18}
    outputmin=1 visible=4 high=2

  1. minSeverity ← 3, visible ← 0, high ← 0

    1public class IncidentQueueReliabilityReport {2    public static void main(String[] args) {3        int minSeverity→ 3 = 3;4        int[] severities = {1, 2, 3, 3};5        int visible→ 0 = 0;6        int high→ 0 = 0;

  2. for (int severity : severities)

    pass 1 of 4
    8for (int severity1 : severities) {9    if (severity >= minSeverity) {
    All 4 passes — pass 1 is the card above
    passseverityminSeverityvisiblehigh
    11———
    22———
    3330 → 10 → 1
    4331 → 21 → 2

  3. visible ← 1

    pass 1 of 2
    8for (int severity : severities) {9    if (severity3 >= minSeverity3) {10        visible→ 1 += 1;11    }

  4. high ← 1

    pass 1 of 2
    11}12if (severity3 >= 3) {13    high→ 1 += 1;14}

  5. visible ← 2

    pass 2 of 2
    8for (int severity : severities) {9    if (severity3 >= minSeverity3) {10        visible→ 2 += 1;11    }

  6. high ← 2

    pass 2 of 2
    11}12if (severity3 >= 3) {13    high→ 2 += 1;14}

  7. System.out.println("min=" + minSeverity + " visible=" + visible + " hi…

    17    System.out.println("min=" + minSeverity3 + " visible=" + visible2 + " high=" + high2);18}
    outputmin=3 visible=2 high=2