Struct move_model::model::AbilitySet

pub struct AbilitySet(_);

A set of Abilitys

Implementations

impl AbilitySet

pub const EMPTY: AbilitySet = Self(0)

The empty ability set

pub const PRIMITIVES: AbilitySet = Self(Ability::Copy as u8 | Ability::Drop as u8 | Ability::Store as u8)

Abilities for Bool, U8, U64, U128, and Address

pub const REFERENCES: AbilitySet = Self(Ability::Copy as u8 | Ability::Drop as u8)

Abilities for Reference and MutableReference

pub const SIGNER: AbilitySet = Self(Ability::Drop as u8)

Abilities for Signer

pub const VECTOR: AbilitySet = Self(Ability::Copy as u8 | Ability::Drop as u8 | Ability::Store as u8)

Abilities for Vector, note they are predicated on the type argument

pub const ALL: AbilitySet = Self(Ability::Copy as u8 | Ability::Drop as u8 | Ability::Store as u8 | Ability::Key as u8)

Ability set containing all abilities

pub fn has_ability(self, ability: Ability) -> bool

pub fn has_copy(self) -> bool

pub fn has_drop(self) -> bool

pub fn has_store(self) -> bool

pub fn has_key(self) -> bool

pub fn remove(self, ability: Ability) -> AbilitySet

pub fn intersect(self, other: AbilitySet) -> AbilitySet

pub fn union(self, other: AbilitySet) -> AbilitySet

pub fn is_subset(self, other: AbilitySet) -> bool

pub fn polymorphic_abilities<I1, I2>( declared_abilities: AbilitySet, declared_phantom_parameters: I1, type_arguments: I2 ) -> Result<AbilitySet, PartialVMError>where I1: IntoIterator<Item = bool>, I2: IntoIterator<Item = AbilitySet>, <I1 as IntoIterator>::IntoIter: ExactSizeIterator, <I2 as IntoIterator>::IntoIter: ExactSizeIterator,

For a polymorphic type, its actual abilities correspond to its declared abilities but predicated on its non-phantom type arguments having that ability. For Key, instead of needing the same ability, the type arguments need Store.

pub fn from_u8(byte: u8) -> Option<AbilitySet>

pub fn into_u8(self) -> u8

Trait Implementations

impl Arbitrary for AbilitySet

type Strategy = BoxedStrategy<AbilitySet>

The type of Strategy used to generate values of type Self.

type Parameters = ()

The type of parameters that arbitrary_with accepts for configuration of the generated Strategy. Parameters must implement Default.

fn arbitrary_with( _params: <AbilitySet as Arbitrary>::Parameters ) -> <AbilitySet as Arbitrary>::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self). The strategy is passed the arguments given in args.

fn arbitrary() -> Self::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self).

impl BitOr<Ability> for AbilitySet

type Output = AbilitySet

The resulting type after applying the | operator.

fn bitor(self, rhs: Ability) -> AbilitySet

Performs the | operation.

impl BitOr<AbilitySet> for AbilitySet

type Output = AbilitySet

The resulting type after applying the | operator.

fn bitor(self, rhs: AbilitySet) -> AbilitySet

Performs the | operation.

impl Clone for AbilitySet

fn clone(&self) -> AbilitySet

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AbilitySet

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

Formats the value using the given formatter.

impl Hash for AbilitySet

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

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 IntoIterator for AbilitySet

type Item = Ability

The type of the elements being iterated over.

type IntoIter = AbilitySetIterator

Which kind of iterator are we turning this into?

fn into_iter(self) -> <AbilitySet as IntoIterator>::IntoIter

Creates an iterator from a value.

impl Ord for AbilitySet

fn cmp(&self, other: &AbilitySet) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<AbilitySet> for AbilitySet

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl PartialOrd<AbilitySet> for AbilitySet

fn partial_cmp(&self, other: &AbilitySet) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for AbilitySet

impl Eq for AbilitySet

impl StructuralEq for AbilitySet

impl StructuralPartialEq for AbilitySet