pub struct TransitionSchema {
pub metadata: SemId,
pub globals: Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>,
pub inputs: Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>,
pub assignments: Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>,
pub valencies: Confined<BTreeSet<u16>, amplify::::collection::confinement::TinyOrdSet::{constant#0}, amplify::::collection::confinement::TinyOrdSet::{constant#1}>,
}
Fields§
§metadata: SemId
§globals: Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>
§inputs: Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>
§assignments: Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>
§valencies: Confined<BTreeSet<u16>, amplify::::collection::confinement::TinyOrdSet::{constant#0}, amplify::::collection::confinement::TinyOrdSet::{constant#1}>
Trait Implementations§
Source§impl Clone for TransitionSchema
impl Clone for TransitionSchema
Source§fn clone(&self) -> TransitionSchema
fn clone(&self) -> TransitionSchema
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for TransitionSchema
impl Debug for TransitionSchema
Source§impl Default for TransitionSchema
impl Default for TransitionSchema
Source§fn default() -> TransitionSchema
fn default() -> TransitionSchema
Returns the “default value” for a type. Read more
Source§impl<'de> Deserialize<'de> for TransitionSchema
impl<'de> Deserialize<'de> for TransitionSchema
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<TransitionSchema, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<TransitionSchema, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl OpSchema for TransitionSchema
impl OpSchema for TransitionSchema
fn op_type(&self) -> OpType
fn metadata(&self) -> SemId
fn globals( &self, ) -> &Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>
fn inputs( &self, ) -> Option<&Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>>
fn redeems( &self, ) -> Option<&Confined<BTreeSet<u16>, amplify::::collection::confinement::TinyOrdSet::{constant#0}, amplify::::collection::confinement::TinyOrdSet::{constant#1}>>
fn assignments( &self, ) -> &Confined<BTreeMap<u16, Occurrences>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>
fn valencies( &self, ) -> &Confined<BTreeSet<u16>, amplify::::collection::confinement::TinyOrdSet::{constant#0}, amplify::::collection::confinement::TinyOrdSet::{constant#1}>
Source§impl PartialEq for TransitionSchema
impl PartialEq for TransitionSchema
Source§impl Serialize for TransitionSchema
impl Serialize for TransitionSchema
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
Source§impl StrictDecode for TransitionSchema
impl StrictDecode for TransitionSchema
fn strict_decode( reader: &mut impl TypedRead, ) -> Result<TransitionSchema, DecodeError>
fn strict_read(lim: usize, reader: impl Read) -> Result<Self, DecodeError>
Source§impl StrictEncode for TransitionSchema
impl StrictEncode for TransitionSchema
fn strict_encode<W>(&self, writer: W) -> Result<W, Error>where
W: TypedWrite,
fn strict_write(&self, lim: usize, writer: impl Write) -> Result<usize, Error>
Source§impl StrictStruct for TransitionSchema
impl StrictStruct for TransitionSchema
const ALL_FIELDS: &'static [&'static str]
fn strict_check_fields()
fn strict_type_info() -> TypeInfo<Self>
Source§impl StrictType for TransitionSchema
impl StrictType for TransitionSchema
const STRICT_LIB_NAME: &'static str = LIB_NAME_RGB
fn strict_name() -> Option<TypeName>
impl Eq for TransitionSchema
impl StrictProduct for TransitionSchema
impl StructuralPartialEq for TransitionSchema
Auto Trait Implementations§
impl Freeze for TransitionSchema
impl RefUnwindSafe for TransitionSchema
impl Send for TransitionSchema
impl Sync for TransitionSchema
impl Unpin for TransitionSchema
impl UnwindSafe for TransitionSchema
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.