ldap-acis 0.2.1

LDAP Access Control Instructions (ACI) system built on acls-rs
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
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

//! ACI scope — how deep the ACI applies in the directory tree.

use acls_rs::algebra::{BoundedJoinSemilattice, BoundedMeetSemilattice};
use acls_rs::prelude::*;

#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};

use std::cmp::Ordering;

/// ACI scope - how deep the ACI applies in the directory tree.
///
/// Ordered by breadth: `Base < OneLevel < Subtree`.
/// Forms a bounded lattice where meet = min (narrower) and join = max (wider).
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
#[non_exhaustive]
pub enum Scope {
    /// Only the target entry itself
    Base,
    /// One level below the target
    OneLevel,
    /// Entire subtree below the target
    Subtree,
}

impl Scope {
    fn rank(self) -> u8 {
        match self {
            Self::Base => 0,
            Self::OneLevel => 1,
            Self::Subtree => 2,
        }
    }
}

impl Ord for Scope {
    fn cmp(&self, other: &Self) -> Ordering {
        self.rank().cmp(&other.rank())
    }
}

impl PartialOrd for Scope {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl Semigroup for Scope {
    fn combine(self, other: Self) -> Self {
        self.max(other)
    }
}

impl Monoid for Scope {
    fn identity() -> Self {
        Self::Base
    }
}

impl MeetSemilattice for Scope {
    fn meet(self, other: Self) -> Self {
        self.min(other)
    }
}

impl JoinSemilattice for Scope {
    fn join(self, other: Self) -> Self {
        self.max(other)
    }
}

impl BoundedMeetSemilattice for Scope {
    fn top() -> Self {
        Self::Subtree
    }
}

impl BoundedJoinSemilattice for Scope {
    fn bottom() -> Self {
        Self::Base
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn total_order() {
        assert!(Scope::Base < Scope::OneLevel);
        assert!(Scope::OneLevel < Scope::Subtree);
        assert!(Scope::Base < Scope::Subtree);
    }

    #[test]
    fn reflexive() {
        for s in [Scope::Base, Scope::OneLevel, Scope::Subtree] {
            assert_eq!(s.partial_cmp(&s), Some(Ordering::Equal));
        }
    }

    #[test]
    fn lattice_meet_is_min() {
        assert_eq!(Scope::Base.meet(Scope::Subtree), Scope::Base);
        assert_eq!(Scope::Subtree.meet(Scope::OneLevel), Scope::OneLevel);
        assert_eq!(Scope::OneLevel.meet(Scope::OneLevel), Scope::OneLevel);
    }

    #[test]
    fn lattice_join_is_max() {
        assert_eq!(Scope::Base.join(Scope::Subtree), Scope::Subtree);
        assert_eq!(Scope::Base.join(Scope::OneLevel), Scope::OneLevel);
        assert_eq!(Scope::Subtree.join(Scope::Subtree), Scope::Subtree);
    }

    #[test]
    fn monoid_identity() {
        for s in [Scope::Base, Scope::OneLevel, Scope::Subtree] {
            assert_eq!(s.combine(Scope::identity()), s);
            assert_eq!(Scope::identity().combine(s), s);
        }
    }

    #[test]
    fn bounded_top_bottom() {
        for s in [Scope::Base, Scope::OneLevel, Scope::Subtree] {
            assert_eq!(s.meet(Scope::top()), s);
            assert_eq!(s.join(Scope::bottom()), s);
        }
    }

    #[test]
    fn absorption() {
        for a in [Scope::Base, Scope::OneLevel, Scope::Subtree] {
            for b in [Scope::Base, Scope::OneLevel, Scope::Subtree] {
                assert_eq!(a.meet(a.join(b)), a);
                assert_eq!(a.join(a.meet(b)), a);
            }
        }
    }
}