Struct cedar_policy_core::ast::Entity

pub struct Entity { /* private fields */ }

Entity datatype

Implementations

impl Entity

pub fn new( uid: EntityUID, attrs: HashMap<SmolStr, RestrictedExpr>, ancestors: HashSet<EntityUID>, ) -> Self

Create a new Entity with this UID, attributes, and ancestors

pub fn uid(&self) -> EntityUID

Get the UID of this entity

pub fn get(&self, attr: &str) -> Option<&RestrictedExpr>

Get the value for the given attribute, or None if not present

pub fn is_descendant_of(&self, e: &EntityUID) -> bool

Is this Entity a descendant of e in the entity hierarchy?

pub fn ancestors(&self) -> impl Iterator<Item = &EntityUID>

Iterate over this entity’s ancestors

pub fn with_uid(uid: EntityUID) -> Self

Create an Entity with the given UID, no attributes, and no parents.

Trait Implementations

impl Clone for Entity

fn clone(&self) -> Entity

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Entity

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Entity

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Entity

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for Entity

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Entity

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StaticallyTyped for Entity

fn type_of(&self) -> Type

Get the object’s type

impl TCNode<EntityUID> for Entity

fn get_key(&self) -> EntityUID

Extract a unique identifier for the node.

fn add_edge_to(&mut self, k: EntityUID)

Add an edge out off this node to the node with key k.

fn out_edges(&self) -> Box<dyn Iterator<Item = &EntityUID> + '_>

Retrieve an iterator for the edges out of this node.

fn has_edge_to(&self, e: &EntityUID) -> bool

Return true when their is an edge between this node and the node with key k.

impl Eq for Entity