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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
/*
* 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.
*/
// NOTE: Unlike most modules in this crate, all types in the PST are intentionally
// public. This is by design — the PST is meant for programmatic policy construction,
// so users need direct access to all constituent types.
//! The PST is a syntax tree representation of Cedar policies designed for programmatic
//! manipulation.
//!
//! # Identifiers and names
//!
//! Entity type names and other identifiers are validated at construction time via [`Id`].
//! [`Id::new()`] checks that a string is a legal Cedar identifier (not a reserved keyword,
//! no special characters). [`Name`] is built from `Id` components, so
//! [`Name::unqualified()`] and [`Name::qualified()`] are fallible. This ensures that
//! conversion from PST to AST cannot fail due to invalid names.
//!
//! # Third-party type re-exports
//!
//! Several PST types use third-party crate types in their public fields
//! ([`SmolStr`], [`LinkedHashMap`], [`NonEmpty`]). These are re-exported from this
//! module so that you don't need to add separate dependencies or match the exact
//! dependency versions that Cedar uses.
//!
//! # Constructing a policy
//!
//! Build a PST [`Template`] directly from its constituent types. This example constructs:
//! ```cedar
//! permit (
//! principal == User::"alice",
//! action == Action::"view",
//! resource in Album::"vacation"
//! ) when { resource.public == true };
//! ```
//!
//! ```
//! # use cedar_policy_core::pst::*;
//! # use smol_str::SmolStr;
//! # use std::sync::Arc;
//! # use std::collections::BTreeMap;
//! let user_alice = EntityUID {
//! ty: EntityType::from_name(Name::unqualified("User").unwrap()),
//! eid: SmolStr::from("alice"),
//! };
//! let action_view = EntityUID {
//! ty: EntityType::from_name(Name::unqualified("Action").unwrap()),
//! eid: SmolStr::from("view"),
//! };
//! let album_vacation = EntityUID {
//! ty: EntityType::from_name(Name::unqualified("Album").unwrap()),
//! eid: SmolStr::from("vacation"),
//! };
//! let template = Template::new(
//! PolicyID(SmolStr::from("policy0")),
//! Effect::Permit,
//! PrincipalConstraint::Eq(EntityOrSlot::Entity(user_alice)),
//! ActionConstraint::Eq(action_view),
//! ResourceConstraint::In(EntityOrSlot::Entity(album_vacation)),
//! )
//! .try_with_clauses(vec![Clause::When(Arc::new(Expr::BinaryOp {
//! op: BinaryOp::Eq,
//! left: Arc::new(Expr::GetAttr {
//! expr: Arc::new(Expr::Var(Var::Resource)),
//! attr: SmolStr::from("public"),
//! }),
//! right: Arc::new(Expr::Literal(Literal::Bool(true))),
//! }))])
//! .unwrap();
//! // If there are no slots, it can be converted into a static policy
//! let policy : Policy = Policy::Static(template.try_into().unwrap());
//! assert_eq!(policy.body().effect, Effect::Permit);
//! ```
//!
//! # Matching / inspecting a policy
//!
//! The PST types that are likely to be extended in the future are marked `#[non_exhaustive]`
//! ([`Expr`], [`Literal`], [`BinaryOp`], [`UnaryOp`], [`SlotId`], [`StaticPolicy`],
//! [`LinkedPolicy`]), so match arms must include a wildcard. Types that are *not*
//! `#[non_exhaustive]` (constraints, [`Effect`], [`Clause`], [`Var`], [`PatternElem`],
//! [`Policy`]) can be exhaustively matched.
//!
//! ```
//! # use cedar_policy_core::pst::*;
//! # use smol_str::SmolStr;
//! # use std::sync::Arc;
//! # use std::collections::BTreeMap;
//! # let user_alice = EntityUID {
//! # ty: EntityType::from_name(Name::unqualified("User").unwrap()),
//! # eid: SmolStr::from("alice"),
//! # };
//! # let action_view = EntityUID {
//! # ty: EntityType::from_name(Name::unqualified("Action").unwrap()),
//! # eid: SmolStr::from("view"),
//! # };
//! # let template = Template::new(
//! # PolicyID(SmolStr::from("policy0")),
//! # Effect::Permit,
//! # PrincipalConstraint::Eq(EntityOrSlot::Entity(user_alice)),
//! # ActionConstraint::Eq(action_view),
//! # ResourceConstraint::Any,
//! # )
//! # .try_with_clauses(vec![Clause::When(Arc::new(Expr::BinaryOp {
//! # op: BinaryOp::Eq,
//! # left: Arc::new(Expr::GetAttr {
//! # expr: Arc::new(Expr::Var(Var::Resource)),
//! # attr: SmolStr::from("public"),
//! # }),
//! # right: Arc::new(Expr::Literal(Literal::Bool(true))),
//! # }))])
//! # .unwrap();
//! // Effect and constraints are exhaustively matchable:
//! let is_permit = match template.effect {
//! Effect::Permit => true,
//! Effect::Forbid => false,
//! };
//!
//! // PrincipalConstraint is also exhaustively matchable:
//! let principal_entity = match &template.principal {
//! PrincipalConstraint::Eq(EntityOrSlot::Entity(uid)) => Some(uid),
//! PrincipalConstraint::Any
//! | PrincipalConstraint::Eq(EntityOrSlot::Slot(_))
//! | PrincipalConstraint::In(_)
//! | PrincipalConstraint::Is(_)
//! | PrincipalConstraint::IsIn(_, _) => None,
//! };
//!
//! // Expr is #[non_exhaustive] — a wildcard arm is required:
//! for clause in template.clauses() {
//! let expr = match clause {
//! Clause::When(e) => e,
//! Clause::Unless(e) => e,
//! };
//! match expr.as_ref() {
//! Expr::BinaryOp { op, left, right } => {
//! // BinaryOp is also #[non_exhaustive]:
//! match op {
//! BinaryOp::Eq => println!("found equality check"),
//! _ => {}
//! }
//! }
//! Expr::Literal(lit) => {
//! // Literal is #[non_exhaustive]:
//! match lit {
//! Literal::Bool(b) => println!("bool: {b}"),
//! _ => {}
//! }
//! }
//! _ => {} // required for Expr
//! }
//! }
//! ```
//!
//! # Converting to and from the `cedar-policy` API
//!
//! PST types convert to and from the public `cedar-policy` API types via
//! methods on `Policy`, `Template`, and `PolicySet`:
//!
//! - `from_pst()` — construct from a PST value
//! - `to_pst()` — convert to PST (clones the internal representation)
//! - `try_into_pst()` — convert to PST by consuming the value, avoiding a clone
//!
//! All PST types also implement [`Display`](std::fmt::Display), producing valid Cedar syntax.
pub
pub
pub use ;
pub use error_body;
pub use PstConstructionError;
pub use ;
pub use ;
pub use ;
// Re-exported third-party types used in PST public fields and type signatures.
// These are re-exported so that users don't need to add separate dependencies
// or worry about matching the exact version Cedar uses.
pub use LinkedHashMap;
pub use NonEmpty;
pub use SmolStr;