Struct scrypto_test::prelude::EnabledModules
source · pub struct EnabledModules {
bits: u32,
}
Fields§
§bits: u32
Implementations§
source§impl EnabledModules
impl EnabledModules
pub const KERNEL_TRACE: EnabledModules = _
pub const LIMITS: EnabledModules = _
pub const COSTING: EnabledModules = _
pub const AUTH: EnabledModules = _
pub const TRANSACTION_RUNTIME: EnabledModules = _
pub const EXECUTION_TRACE: EnabledModules = _
sourcepub const fn empty() -> EnabledModules
pub const fn empty() -> EnabledModules
Returns an empty set of flags.
sourcepub const fn all() -> EnabledModules
pub const fn all() -> EnabledModules
Returns the set containing all flags.
sourcepub const fn from_bits(bits: u32) -> Option<EnabledModules>
pub const fn from_bits(bits: u32) -> Option<EnabledModules>
Convert from underlying bit representation, unless that representation contains bits that do not correspond to a flag.
sourcepub const fn from_bits_truncate(bits: u32) -> EnabledModules
pub const fn from_bits_truncate(bits: u32) -> EnabledModules
Convert from underlying bit representation, dropping any bits that do not correspond to flags.
sourcepub const unsafe fn from_bits_unchecked(bits: u32) -> EnabledModules
pub const unsafe fn from_bits_unchecked(bits: u32) -> EnabledModules
Convert from underlying bit representation, preserving all bits (even those not corresponding to a defined flag).
§Safety
The caller of the bitflags!
macro can chose to allow or
disallow extra bits for their bitflags type.
The caller of from_bits_unchecked()
has to ensure that
all bits correspond to a defined flag or that extra bits
are valid for this bitflags type.
sourcepub const fn intersects(&self, other: EnabledModules) -> bool
pub const fn intersects(&self, other: EnabledModules) -> bool
Returns true
if there are flags common to both self
and other
.
sourcepub const fn contains(&self, other: EnabledModules) -> bool
pub const fn contains(&self, other: EnabledModules) -> bool
Returns true
if all of the flags in other
are contained within self
.
sourcepub fn insert(&mut self, other: EnabledModules)
pub fn insert(&mut self, other: EnabledModules)
Inserts the specified flags in-place.
sourcepub fn remove(&mut self, other: EnabledModules)
pub fn remove(&mut self, other: EnabledModules)
Removes the specified flags in-place.
sourcepub fn toggle(&mut self, other: EnabledModules)
pub fn toggle(&mut self, other: EnabledModules)
Toggles the specified flags in-place.
sourcepub fn set(&mut self, other: EnabledModules, value: bool)
pub fn set(&mut self, other: EnabledModules, value: bool)
Inserts or removes the specified flags depending on the passed value.
sourcepub const fn intersection(self, other: EnabledModules) -> EnabledModules
pub const fn intersection(self, other: EnabledModules) -> EnabledModules
Returns the intersection between the flags in self
and
other
.
Specifically, the returned set contains only the flags which are
present in both self
and other
.
This is equivalent to using the &
operator (e.g.
ops::BitAnd
), as in flags & other
.
sourcepub const fn union(self, other: EnabledModules) -> EnabledModules
pub const fn union(self, other: EnabledModules) -> EnabledModules
Returns the union of between the flags in self
and other
.
Specifically, the returned set contains all flags which are
present in either self
or other
, including any which are
present in both (see Self::symmetric_difference
if that
is undesirable).
This is equivalent to using the |
operator (e.g.
ops::BitOr
), as in flags | other
.
sourcepub const fn difference(self, other: EnabledModules) -> EnabledModules
pub const fn difference(self, other: EnabledModules) -> EnabledModules
Returns the difference between the flags in self
and other
.
Specifically, the returned set contains all flags present in
self
, except for the ones present in other
.
It is also conceptually equivalent to the “bit-clear” operation:
flags & !other
(and this syntax is also supported).
This is equivalent to using the -
operator (e.g.
ops::Sub
), as in flags - other
.
sourcepub const fn symmetric_difference(self, other: EnabledModules) -> EnabledModules
pub const fn symmetric_difference(self, other: EnabledModules) -> EnabledModules
Returns the symmetric difference between the flags
in self
and other
.
Specifically, the returned set contains the flags present which
are present in self
or other
, but that are not present in
both. Equivalently, it contains the flags present in exactly
one of the sets self
and other
.
This is equivalent to using the ^
operator (e.g.
ops::BitXor
), as in flags ^ other
.
sourcepub const fn complement(self) -> EnabledModules
pub const fn complement(self) -> EnabledModules
Returns the complement of this set of flags.
Specifically, the returned set contains all the flags which are
not set in self
, but which are allowed for this type.
Alternatively, it can be thought of as the set difference
between Self::all()
and self
(e.g. Self::all() - self
)
This is equivalent to using the !
operator (e.g.
ops::Not
), as in !flags
.
source§impl EnabledModules
impl EnabledModules
sourcepub fn for_genesis_transaction() -> EnabledModules
pub fn for_genesis_transaction() -> EnabledModules
The difference between genesis transaction and system transaction is “no auth”. TODO: double check if this is the right assumption.
pub fn for_system_transaction() -> EnabledModules
pub fn for_notarized_transaction() -> EnabledModules
pub fn for_test_transaction() -> EnabledModules
pub fn for_preview() -> EnabledModules
Trait Implementations§
source§impl Binary for EnabledModules
impl Binary for EnabledModules
source§impl BitAnd for EnabledModules
impl BitAnd for EnabledModules
source§fn bitand(self, other: EnabledModules) -> EnabledModules
fn bitand(self, other: EnabledModules) -> EnabledModules
Returns the intersection between the two sets of flags.
§type Output = EnabledModules
type Output = EnabledModules
&
operator.source§impl BitAndAssign for EnabledModules
impl BitAndAssign for EnabledModules
source§fn bitand_assign(&mut self, other: EnabledModules)
fn bitand_assign(&mut self, other: EnabledModules)
Disables all flags disabled in the set.
source§impl BitOr for EnabledModules
impl BitOr for EnabledModules
source§fn bitor(self, other: EnabledModules) -> EnabledModules
fn bitor(self, other: EnabledModules) -> EnabledModules
Returns the union of the two sets of flags.
§type Output = EnabledModules
type Output = EnabledModules
|
operator.source§impl BitOrAssign for EnabledModules
impl BitOrAssign for EnabledModules
source§fn bitor_assign(&mut self, other: EnabledModules)
fn bitor_assign(&mut self, other: EnabledModules)
Adds the set of flags.
source§impl BitXor for EnabledModules
impl BitXor for EnabledModules
source§fn bitxor(self, other: EnabledModules) -> EnabledModules
fn bitxor(self, other: EnabledModules) -> EnabledModules
Returns the left flags, but with all the right flags toggled.
§type Output = EnabledModules
type Output = EnabledModules
^
operator.source§impl BitXorAssign for EnabledModules
impl BitXorAssign for EnabledModules
source§fn bitxor_assign(&mut self, other: EnabledModules)
fn bitxor_assign(&mut self, other: EnabledModules)
Toggles the set of flags.
source§impl Clone for EnabledModules
impl Clone for EnabledModules
source§fn clone(&self) -> EnabledModules
fn clone(&self) -> EnabledModules
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for EnabledModules
impl Debug for EnabledModules
source§impl Extend<EnabledModules> for EnabledModules
impl Extend<EnabledModules> for EnabledModules
source§fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = EnabledModules>,
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = EnabledModules>,
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)source§impl FromIterator<EnabledModules> for EnabledModules
impl FromIterator<EnabledModules> for EnabledModules
source§fn from_iter<T>(iterator: T) -> EnabledModuleswhere
T: IntoIterator<Item = EnabledModules>,
fn from_iter<T>(iterator: T) -> EnabledModuleswhere
T: IntoIterator<Item = EnabledModules>,
source§impl Hash for EnabledModules
impl Hash for EnabledModules
source§impl LowerHex for EnabledModules
impl LowerHex for EnabledModules
source§impl Not for EnabledModules
impl Not for EnabledModules
source§fn not(self) -> EnabledModules
fn not(self) -> EnabledModules
Returns the complement of this set of flags.
§type Output = EnabledModules
type Output = EnabledModules
!
operator.source§impl Octal for EnabledModules
impl Octal for EnabledModules
source§impl Ord for EnabledModules
impl Ord for EnabledModules
source§fn cmp(&self, other: &EnabledModules) -> Ordering
fn cmp(&self, other: &EnabledModules) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl PartialEq for EnabledModules
impl PartialEq for EnabledModules
source§fn eq(&self, other: &EnabledModules) -> bool
fn eq(&self, other: &EnabledModules) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd for EnabledModules
impl PartialOrd for EnabledModules
source§fn partial_cmp(&self, other: &EnabledModules) -> Option<Ordering>
fn partial_cmp(&self, other: &EnabledModules) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moresource§impl Sub for EnabledModules
impl Sub for EnabledModules
source§fn sub(self, other: EnabledModules) -> EnabledModules
fn sub(self, other: EnabledModules) -> EnabledModules
Returns the set difference of the two sets of flags.
§type Output = EnabledModules
type Output = EnabledModules
-
operator.source§impl SubAssign for EnabledModules
impl SubAssign for EnabledModules
source§fn sub_assign(&mut self, other: EnabledModules)
fn sub_assign(&mut self, other: EnabledModules)
Disables all flags enabled in the set.
source§impl UpperHex for EnabledModules
impl UpperHex for EnabledModules
impl Copy for EnabledModules
impl Eq for EnabledModules
impl StructuralPartialEq for EnabledModules
Auto Trait Implementations§
impl RefUnwindSafe for EnabledModules
impl Send for EnabledModules
impl Sync for EnabledModules
impl Unpin for EnabledModules
impl UnwindSafe for EnabledModules
Blanket Implementations§
§impl<U> As for U
impl<U> As for U
§fn as_<T>(self) -> Twhere
T: CastFrom<U>,
fn as_<T>(self) -> Twhere
T: CastFrom<U>,
self
to type T
. The semantics of numeric casting with the as
operator are followed, so <T as As>::as_::<U>
can be used in the same way as T as U
for numeric conversions. Read moresource§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
§impl<T> CallHasher for T
impl<T> CallHasher for T
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
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
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
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
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.