Struct Restrictions

pub struct Restrictions<N: Network> { /* private fields */ }

Implementations

impl<N: Network> Restrictions<N>

pub fn load() -> Result<Self>

Initializes the Restrictions instance for the current network.

pub fn new_blank() -> Result<Self>

Initializes a new Restrictions instance.

impl<N: Network> Restrictions<N>

pub const fn restrictions_id(&self) -> Field<N>

Returns the restrictions ID, for the current state of the Restrictions list.

pub const fn programs(&self) -> &IndexMap<ProgramID<N>, BlockRange>

Returns the set of program IDs that are restricted from being executed.

pub const fn functions(&self) -> &IndexMap<Locator<N>, BlockRange>

Returns the set of (program ID, function ID) pairs that are restricted from being executed.

pub const fn arguments( &self, ) -> &IndexMap<Locator<N>, IndexMap<ArgumentLocator, IndexMap<Literal<N>, BlockRange>>>

Returns the set of (program ID, function ID, argument) triples that are restricted from being executed.

impl<N: Network> Restrictions<N>

pub fn is_program_restricted( &self, program_id: &ProgramID<N>, block_height: u32, ) -> bool

Returns true if the given program ID is restricted from being executed.

pub fn is_function_restricted( &self, program_id: &ProgramID<N>, function_name: &Identifier<N>, block_height: u32, ) -> bool

Returns true if the given (program ID, function name) pair is restricted from being executed.

pub fn is_argument_restricted( &self, transition: &Transition<N>, block_height: u32, ) -> bool

Returns true if the given (program ID, function ID, argument) triple is restricted from being executed.

impl<N: Network> Restrictions<N>

pub fn contains_restricted_transitions( &self, execution: &Execution<N>, block_height: u32, ) -> bool

Returns true if the given execution contains any restricted transitions for the given block height.

impl<N: Network> Restrictions<N>

pub fn compute_restrictions_id( programs: &IndexMap<ProgramID<N>, BlockRange>, functions: &IndexMap<Locator<N>, BlockRange>, arguments: &IndexMap<Locator<N>, IndexMap<ArgumentLocator, IndexMap<Literal<N>, BlockRange>>>, ) -> Result<Field<N>>

Returns the restrictions ID.

Trait Implementations

impl<N: Clone + Network> Clone for Restrictions<N>

fn clone(&self) -> Restrictions<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Network> Debug for Restrictions<N>

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

Prints the restrictions as a JSON-string.

impl<'de, N: Network> Deserialize<'de> for Restrictions<N>

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserializes the restrictions from a JSON-string.

impl<N: Network> Display for Restrictions<N>

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

Displays the restrictions as a JSON-string.

impl<N: Network> FromStr for Restrictions<N>

fn from_str(restrictions: &str) -> Result<Self, Self::Err>

Initializes the restrictions from a JSON-string.

type Err = Error

The associated error which can be returned from parsing.

impl<N: PartialEq + Network> PartialEq for Restrictions<N>

fn eq(&self, other: &Restrictions<N>) -> 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<N: Network + Serialize> Serialize for Restrictions<N>

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<N: Eq + Network> Eq for Restrictions<N>

impl<N: Network> StructuralPartialEq for Restrictions<N>