cedar-policy-symcc 0.2.0

/*
 * Copyright Cedar Contributors
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      https://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

//! This module is as straightforward a translation as possible of
//! <https://github.com/cedar-policy/cedar-spec/blob/main/cedar-lean/Cedar/SymCCOpt/Enforcer.lean>.

use std::collections::BTreeSet;

use crate::symcc::{self, term::Term};

use super::{CompiledPolicies, CompiledPolicy};

pub fn enforce_compiled_policy(cp: &CompiledPolicy) -> BTreeSet<Term> {
    let tr = cp.footprint.iter().flat_map(|term1| {
        cp.footprint
            .iter()
            .map(|term2| symcc::enforcer::transitivity(term1, term2, &cp.symenv.entities))
    });
    cp.acyclicity.iter().cloned().chain(tr).collect()
}

#[allow(dead_code, reason = "exists in the Lean")]
pub fn enforce_compiled_policies(cps: &CompiledPolicies) -> BTreeSet<Term> {
    let tr = cps.footprint.iter().flat_map(|term1| {
        cps.footprint
            .iter()
            .map(|term2| symcc::enforcer::transitivity(term1, term2, &cps.symenv.entities))
    });
    cps.acyclicity.iter().cloned().chain(tr).collect()
}

pub fn enforce_pair_compiled_policies(
    cps1: &CompiledPolicies,
    cps2: &CompiledPolicies,
) -> BTreeSet<Term> {
    assert_eq!(&cps1.symenv, &cps2.symenv);
    let footprint = cps1.footprint.iter().chain(cps2.footprint.iter()); // since `footprint` is just an iterator, it is cheap to clone
    let tr = footprint.clone().flat_map(|term1| {
        footprint
            .clone()
            .map(|term2| symcc::enforcer::transitivity(term1, term2, &cps1.symenv.entities))
    });
    cps1.acyclicity
        .iter()
        .cloned()
        .chain(cps2.acyclicity.iter().cloned())
        .chain(tr)
        .collect()
}