Struct Set

pub struct Set {
    pub id: SetId,
    pub name: String,
    pub expr: SetExpr,
}

Fields

id: SetId

name: String

expr: SetExpr

Trait Implementations

impl Clone for Set

fn clone(&self) -> Set

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Set

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Set

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Set

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

Formats the value using the given formatter.

impl Hash for Set

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl LedgerItem for Set

type Error = ()

type Key = Uuid

type Modifier = SetAction

The type that is responsible for mutating the item and thus create a new genreation

type RefType = String

The different ways an item can reference another item

type PropertyType = String

Cache regarding property of a card so you get like all the cards that have a certain value or whatever

fn inner_run_event(self, event: SetAction) -> Result<Self, Self::Error>

Modifies Self.

fn new_default(id: Self::Key) -> Self

fn item_id(&self) -> Self::Key

fn verify(self, ledger: &Ledger<Self>) -> Result<Self, EventError<Self>>

fn run_event( self, event: Self::Modifier, ledger: &Ledger<Self>, verify: bool, ) -> Result<Self, EventError<Self>>

Modifies Self and checks for cycles and invariants.

fn find_cycle( &self, ledger: &LedgerType<Self>, ) -> Option<Vec<(Self::Key, Self::RefType)>>

fn validate(&self, ledger: &LedgerType<Self>) -> Result<(), Self::Error>

Assertions that should hold true. Like invariants with other cards that it references. called by run_event, if it returns error after an event is run, the event is not applied.

fn ref_cache(&self) -> HashSet<ItemReference<Self>>

List of references to other items, along with the name of the type of reference.

fn dependencies(&self) -> HashSet<Self::Key>

fn recursive_dependent_ids( &self, ledger: &LedgerType<Self>, ) -> HashSet<Self::Key>

where Self: Sized,

fn recursive_dependents(&self, ledger: &LedgerType<Self>) -> HashSet<Self>

where Self: Sized,

fn dependents(&self, ledger: &LedgerType<Self>) -> HashSet<Self::Key>

fn properties_cache( &self, ledger: &Ledger<Self>, ) -> HashSet<PropertyCache<Self>>

where Self: LedgerItem,

List of defined properties that this item has.

fn listed_cache( &self, ledger: &Ledger<Self>, ) -> HashMap<Either<PropertyCache<Self>, ItemRefCache<Self>>, HashSet<Self::Key>>

fn caches( &self, ledger: &Ledger<Self>, ) -> HashSet<(Either<PropertyCache<Self>, ItemRefCache<Self>>, Self::Key)>

where Self: LedgerItem,

impl PartialEq for Set

fn eq(&self, other: &Set) -> 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 Set

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Set

impl StructuralPartialEq for Set