kanidmd_lib/valueset/
restricted.rs
1use crate::prelude::*;
2use crate::schema::SchemaAttribute;
3use crate::utils::trigraph_iter;
4use crate::valueset::ScimResolveStatus;
5use crate::valueset::{DbValueSetV2, ValueSet};
6
7use std::collections::BTreeSet;
8
9#[derive(Debug, Clone)]
10pub struct ValueSetRestricted {
11 set: BTreeSet<String>,
12}
13
14impl ValueSetRestricted {
15 pub fn new(s: String) -> Box<Self> {
16 let mut set = BTreeSet::new();
17 set.insert(s);
18 Box::new(ValueSetRestricted { set })
19 }
20
21 pub fn push(&mut self, s: String) -> bool {
22 self.set.insert(s)
23 }
24
25 pub fn from_dbvs2(data: Vec<String>) -> Result<ValueSet, OperationError> {
26 let set = data.into_iter().collect();
27 Ok(Box::new(ValueSetRestricted { set }))
28 }
29
30 #[allow(clippy::should_implement_trait)]
33 pub fn from_iter<T>(iter: T) -> Option<Box<Self>>
34 where
35 T: IntoIterator<Item = String>,
36 {
37 let set = iter.into_iter().collect();
38 Some(Box::new(ValueSetRestricted { set }))
39 }
40}
41
42impl ValueSetT for ValueSetRestricted {
43 fn insert_checked(&mut self, value: Value) -> Result<bool, OperationError> {
44 match value {
45 Value::RestrictedString(s) => Ok(self.set.insert(s)),
46 _ => {
47 debug_assert!(false);
48 Err(OperationError::InvalidValueState)
49 }
50 }
51 }
52
53 fn clear(&mut self) {
54 self.set.clear();
55 }
56
57 fn remove(&mut self, pv: &PartialValue, _cid: &Cid) -> bool {
58 match pv {
59 PartialValue::RestrictedString(s) => self.set.remove(s),
60 _ => {
61 debug_assert!(false);
62 true
63 }
64 }
65 }
66
67 fn contains(&self, pv: &PartialValue) -> bool {
68 match pv {
69 PartialValue::RestrictedString(s) => self.set.contains(s.as_str()),
70 _ => false,
71 }
72 }
73
74 fn substring(&self, pv: &PartialValue) -> bool {
75 match pv {
76 PartialValue::RestrictedString(s2) => self.set.iter().any(|s1| s1.contains(s2)),
77 _ => {
78 debug_assert!(false);
79 false
80 }
81 }
82 }
83
84 fn startswith(&self, pv: &PartialValue) -> bool {
85 match pv {
86 PartialValue::RestrictedString(s2) => self.set.iter().any(|s1| s1.starts_with(s2)),
87 _ => {
88 debug_assert!(false);
89 false
90 }
91 }
92 }
93
94 fn endswith(&self, pv: &PartialValue) -> bool {
95 match pv {
96 PartialValue::RestrictedString(s2) => self.set.iter().any(|s1| s1.ends_with(s2)),
97 _ => {
98 debug_assert!(false);
99 false
100 }
101 }
102 }
103
104 fn lessthan(&self, _pv: &PartialValue) -> bool {
105 false
106 }
107
108 fn len(&self) -> usize {
109 self.set.len()
110 }
111
112 fn generate_idx_eq_keys(&self) -> Vec<String> {
113 self.set.iter().cloned().collect()
114 }
115
116 fn generate_idx_sub_keys(&self) -> Vec<String> {
117 let lower: Vec<_> = self.set.iter().map(|s| s.to_lowercase()).collect();
118 let mut trigraphs: Vec<_> = lower.iter().flat_map(|v| trigraph_iter(v)).collect();
119
120 trigraphs.sort_unstable();
121 trigraphs.dedup();
122
123 trigraphs.into_iter().map(String::from).collect()
124 }
125
126 fn syntax(&self) -> SyntaxType {
127 unreachable!();
128 }
130
131 fn validate(&self, _schema_attr: &SchemaAttribute) -> bool {
132 self.set.iter().all(|_s| {
133 false
135 })
136 }
137
138 fn to_proto_string_clone_iter(&self) -> Box<dyn Iterator<Item = String> + '_> {
139 Box::new(self.set.iter().cloned())
140 }
141
142 fn to_scim_value(&self) -> Option<ScimResolveStatus> {
143 let mut iter = self.set.iter().cloned();
144 if self.len() == 1 {
145 let v = iter.next().unwrap_or_default();
146 Some(v.into())
147 } else {
148 let arr = iter.collect::<Vec<_>>();
149 Some(arr.into())
150 }
151 }
152
153 fn to_db_valueset_v2(&self) -> DbValueSetV2 {
154 DbValueSetV2::RestrictedString(self.set.iter().cloned().collect())
155 }
156
157 fn to_partialvalue_iter(&self) -> Box<dyn Iterator<Item = PartialValue> + '_> {
158 Box::new(self.set.iter().cloned().map(PartialValue::RestrictedString))
159 }
160
161 fn to_value_iter(&self) -> Box<dyn Iterator<Item = Value> + '_> {
162 Box::new(self.set.iter().cloned().map(Value::RestrictedString))
163 }
164
165 fn equal(&self, other: &ValueSet) -> bool {
166 if let Some(other) = other.as_restricted_string_set() {
167 &self.set == other
168 } else {
169 debug_assert!(false);
170 false
171 }
172 }
173
174 fn merge(&mut self, other: &ValueSet) -> Result<(), OperationError> {
175 if let Some(b) = other.as_restricted_string_set() {
176 mergesets!(self.set, b)
177 } else {
178 debug_assert!(false);
179 Err(OperationError::InvalidValueState)
180 }
181 }
182
183 fn to_restricted_string_single(&self) -> Option<&str> {
184 if self.set.len() == 1 {
185 self.set.iter().take(1).next().map(|s| s.as_str())
186 } else {
187 None
188 }
189 }
190
191 fn as_restricted_string_set(&self) -> Option<&BTreeSet<String>> {
192 Some(&self.set)
193 }
194
195 fn as_restricted_string_iter(&self) -> Option<Box<dyn Iterator<Item = &str> + '_>> {
196 Some(Box::new(self.set.iter().map(|s| s.as_str())))
197 }
198}
199
200#[cfg(test)]
201mod tests {
202 use super::ValueSetRestricted;
203 use crate::prelude::ValueSet;
204
205 #[test]
206 fn test_scim_restricted() {
207 let vs: ValueSet = ValueSetRestricted::new("Test".to_string());
208 crate::valueset::scim_json_reflexive(&vs, r#""Test""#);
209 }
210}