Struct cedar_policy_validator::ValidatorEntityType

pub struct ValidatorEntityType {
    pub descendants: HashSet<EntityType>,
    /* private fields */
}

Contains entity type information for use by the validator. The contents of the struct are the same as the schema entity type structure, but the member_of relation is reversed to instead be descendants.

Fields

descendants: HashSet<EntityType>

The set of entity types that can be members of this entity type. When this structure is initially constructed, the field will contain direct children, but it will be updated to contain the closure of all descendants before it is used in any validation.

Implementations

impl ValidatorEntityType

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

Get the type of the attribute with the given name, if it exists

pub fn attributes(&self) -> impl Iterator<Item = (&SmolStr, &AttributeType)>

An iterator over the attributes of this entity

pub fn has_descendant_entity_type(&self, ety: &EntityType) -> bool

Return true if this entity type has an EntityType declared as a possible descendant in the schema.

Trait Implementations

impl Clone for ValidatorEntityType

fn clone(&self) -> ValidatorEntityType

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ValidatorEntityType

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

Formats the value using the given formatter.

impl Serialize for ValidatorEntityType

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl TCNode<EntityType> for ValidatorEntityType

fn get_key(&self) -> EntityType

Extract a unique identifier for the node.

fn add_edge_to(&mut self, k: EntityType)

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

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

Retrieve an iterator for the edges out of this node.

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

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