fn find_denylisted_releases(graph: &client::Graph, depls: BTreeSet<Release>) -> BTreeSet<Release> {
    use std::collections::HashSet;

    let mut local_releases = BTreeSet::new();
    let checksums: HashSet<String> = depls.into_iter().map(|rel| rel.checksum).collect();

    for entry in &graph.nodes {
        if !checksums.contains(&entry.payload) {
            continue;
        }

        if let Ok(release) = Release::from_cincinnati(entry.clone()) {
            local_releases.insert(release);
        }
    }

    local_releases
}
/// Try to match a set of (denylisted) deployments to their graph entries.
Try to match a set of (denylisted) deployments to their graph entries.
Try to match a set of ( denylisted ) deployments to their graph entries .
fn find_denylisted_releases(graph: &client::Graph, depls: BTreeSet<Release>) -> BTreeSet<Release> {
    use std::collections::HashSet;
    let mut local_releases = BTreeSet::new();
    let checksums: HashSet<String> = depls.into_iter().map(|rel| rel.checksum).collect();
    for entry in &graph.nodes {
        if !checksums.contains(&entry.payload) {
            continue;
        }
        if let Ok(release) = Release::from_cincinnati(entry.clone()) {
            local_releases.insert(release);
        }
    }
    local_releases
}
fn find_denylisted_releases ( graph : & client :: Graph , depls : BTreeSet < Release > ) -> BTreeSet < Release > { use std :: collections :: HashSet ; let mut local_releases = BTreeSet :: new ( ) ; let checksums : HashSet < String > = depls . into_iter ( ) . map ( | rel | rel . checksum ) . collect ( ) ; for entry in & graph . nodes { if ! checksums . contains ( & entry . payload ) { continue ; } if let Ok ( release ) = Release :: from_cincinnati ( entry . clone ( ) ) { local_releases . insert ( release ) ; } } local_releases }
Try to match a set of (denylisted) deployments to their graph entries.
Try to match a set of ( denylisted ) deployments to their graph entries .
graph
&client::Graph
depls
BTreeSet<Release>