main-spex 0.21.0

AI-first development framework that turns specifications into deterministic, verifiable code
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98

use std::collections::BTreeSet;
use std::process::ExitCode;

use strum::IntoEnumIterator;

use crate::spec::{Spec, Status};

use super::annotation_index::AnnotationIndex;
use super::spec_coverage::SpecCoverage;

#[cfg(test)]
#[path = "report_test.rs"]
mod report_test;

pub struct CoverageReport<'a> {
    pub specs: Vec<SpecCoverage<'a>>,
}

impl<'a> CoverageReport<'a> {
    pub fn new(specs: &'a [Spec], index: &AnnotationIndex) -> Self {
        Self {
            specs: specs
                .iter()
                .map(|spec| SpecCoverage::new(spec, index))
                .collect(),
        }
    }

    pub fn count(&self, status: Status) -> usize {
        self.specs
            .iter()
            .filter(|coverage| coverage.spec.status == status)
            .count()
    }

    pub fn has_tracked_specs(&self) -> bool {
        self.specs.iter().any(SpecCoverage::is_tracked)
    }

    pub fn status_groups(&self) -> Vec<(Status, Vec<&SpecCoverage<'a>>)> {
        Status::iter()
            .filter_map(|status| {
                let group: Vec<&SpecCoverage> = self
                    .specs
                    .iter()
                    .filter(|coverage| coverage.spec.status == status)
                    .collect();
                (!group.is_empty()).then_some((status, group))
            })
            .collect()
    }

    pub fn gapped(&self) -> Vec<&SpecCoverage<'a>> {
        self.specs
            .iter()
            .filter(|coverage| coverage.has_gap())
            .collect()
    }

    pub fn gapped_by_package(&self) -> Vec<(Option<&str>, Vec<&SpecCoverage<'a>>)> {
        let gapped = self.gapped();
        let packages: BTreeSet<&str> = gapped
            .iter()
            .flat_map(|coverage| coverage.spec.packages.iter().map(String::as_str))
            .collect();

        let mut groups: Vec<(Option<&str>, Vec<&SpecCoverage>)> = packages
            .into_iter()
            .map(|package| {
                let in_package = gapped
                    .iter()
                    .filter(|coverage| coverage.spec.packages.iter().any(|name| name == package))
                    .copied()
                    .collect();
                (Some(package), in_package)
            })
            .collect();

        let without_package: Vec<&SpecCoverage> = gapped
            .iter()
            .filter(|coverage| coverage.spec.packages.is_empty())
            .copied()
            .collect();
        if !without_package.is_empty() {
            groups.push((None, without_package));
        }

        groups
    }

    pub fn exit_code(&self) -> ExitCode {
        if self.gapped().is_empty() {
            ExitCode::SUCCESS
        } else {
            ExitCode::FAILURE
        }
    }
}