regorus 0.10.1

A fast, lightweight Rego (OPA policy language) interpreter
Documentation 
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

// Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.

use alloc::collections::BTreeSet;

use crate::value::Value;

use super::evaluator::RbacBuiltinError;

// Check whether a list or set contains the provided element(s).
pub(super) fn list_contains(left: &Value, right: &Value) -> Result<bool, RbacBuiltinError> {
    match *left {
        // Lists and sets share containment semantics.
        Value::Array(ref list) => Ok(list_contains_values(list, right)),
        Value::Set(ref set) => Ok(set_contains_values(set, right)),
        _ => Ok(false),
    }
}

// For lists, treat a list/set needle as "all elements are contained".
fn list_contains_values(list: &[Value], needle: &Value) -> bool {
    match *needle {
        // For collection needles, require all elements to be present.
        Value::Array(ref right_list) => right_list.iter().all(|item| list.contains(item)),
        Value::Set(ref right_set) => right_set.iter().all(|item| list.contains(item)),
        _ => list.contains(needle),
    }
}

// For sets, treat a list/set needle as "all elements are contained".
fn set_contains_values(set: &BTreeSet<Value>, needle: &Value) -> bool {
    match *needle {
        // For collection needles, require all elements to be present.
        Value::Array(ref right_list) => right_list.iter().all(|item| set.contains(item)),
        Value::Set(ref right_set) => right_set.iter().all(|item| set.contains(item)),
        _ => set.contains(needle),
    }
}