Skip to main content

Rule

Enum Rule 

Source
pub enum Rule {
Show 246 variants EOI, COMMENT, WHITESPACE, Id, IdAt, IdInfix, IdList, IdInfixList, Number, MCRL2Spec, DataSpec, ActSpec, ActDecl, SortSpec, SortDecl, SortExpr, SortExprPrimary, SortExprBool, SortExprPos, SortExprNat, SortExprInt, SortExprReal, SortExprList, SortExprSet, SortExprBag, SortExprFSet, SortExprFBag, SortExprParens, SortExprStruct, SortExprInfix, SortExprFunction, SortExprProduct, ConstrDecl, ConstrDeclList, SortProduct, DataExpr, DataExprUnit, DataExprPrefix, DataExprForall, DataExprExists, DataExprLambda, DataExprNegation, DataExprMinus, DataExprSize, DataExprPrimary, DataExprTrue, DataExprFalse, DataExprEmptyList, DataExprEmptySet, DataExprEmptyBag, DataExprListEnum, DataExprBagEnum, DataExprSetBagComp, DataExprSetEnum, DataExprBrackets, DataExprPostfix, DataExprUpdate, DataExprApplication, DataExprWhr, DataExprInfix, DataExprImpl, DataExprDisj, DataExprConj, DataExprEq, DataExprNeq, DataExprLeq, DataExprSnoc, DataExprLess, DataExprGeq, DataExprGreater, DataExprIn, DataExprCons, DataExprConcat, DataExprAdd, DataExprSubtract, DataExprDiv, DataExprIntDiv, DataExprMod, DataExprMult, DataExprAt, DataExprList, Assignment, AssignmentList, VarDecl, VarsDecl, VarsDeclList, BagEnumElt, BagEnumEltList, Action, ActIdSet, MultActId, MultActIdList, MultActIdSet, ProjDecl, ProjDeclList, CommExpr, CommExprList, CommExprSet, RenExpr, RenExprList, RenExprSet, ProcExpr, ProcExprPrimary, ProcExprDelta, ProcExprTau, ProcExprBlock, ProcExprAllow, ProcExprHide, ProcExprRename, ProcExprComm, ProcExprBrackets, ProcExprId, ProcExprPrefix, ProcExprSum, ProcExprDist, ProcExprIfThen, ProcExprIf, ProcExprInfix, ProcExprChoice, ProcExprLeftMerge, ProcExprParallel, ProcExprSeq, ProcExprUntil, ProcExprSync, ProcExprPostfix, ProcExprAt, ProcExprNoIf, ProcExprNoIfInfix, ProcDecl, ProcSpec, Init, IdsDecl, ConsSpec, MapSpec, GlobVarSpec, VarSpec, EqnSpec, EqnDecl, StateFrmSpec, FormSpec, StateFrmSpecElt, StateFrm, StateFrmPrimary, StateFrmBrackets, StateFrmTrue, StateFrmFalse, StateFrmDelay, StateFrmYaled, StateFrmId, StateFrmDataValExpr, StateFrmPrefix, StateFrmMu, StateFrmNu, StateFrmInf, StateFrmSup, StateFrmSum, StateFrmForall, StateFrmExists, StateFrmBox, StateFrmDiamond, StateFrmUnaryMinus, StateFrmNegation, StateFrmLeftConstantMultiply, StateFrmInfix, StateFrmAddition, StateFrmImplication, StateFrmDisjunction, StateFrmConjunction, StateFrmPostfix, StateFrmRightConstantMultiply, RegFrm, RegFrmPrimary, RegFrmBackets, RegFrmInfix, RegFrmAlternative, RegFrmComposition, RegFrmPostfix, RegFrmIteration, RegFrmPlus, ActFrm, ActFrmPrimary, ActFrmBrackets, ActFrmTrue, ActFrmFalse, ActFrmPrefix, ActFrmNegation, ActFrmForall, ActFrmExists, ActFrmInfix, ActFrmImplies, ActFrmUnion, ActFrmIntersect, ActFrmPostfix, ActFrmAt, MultAct, MultiActTau, ActionList, DataValExpr, StateVarDecl, StateVarAssignment, StateVarAssignmentList, ActionRenameSpec, ActionRenameRuleSpec, ActionRenameRule, ActionRenameRuleRHS, FixedPointOperator, FixedPointMu, FixedPointNu, PbesSpec, PbesEqnSpec, PbesEqnDecl, PropVarDecl, PropVarInst, PbesInit, PbesExpr, PbesExprPrimary, PbesExprParens, PbesExprTrue, PbesExprFalse, PbesExprPrefix, PbesExprForall, PbesExprExists, PbesExprNegation, PbesExprInfix, PbesExprImplies, PbesExprConj, PbesExprDisj, PresSpec, PresEqnSpec, PresEqnDecl, PresExpr, PresExprPrimary, PresExprParens, PresExprEqinf, PresExprEqninf, PresExprCondsm, PresExprCondeq, PresExprPrefix, PresExprInf, PresExprSup, PresExprSum, PresExprLeftConstantMultiply, PresExprInfix, PresExprAdd, PresExprPostfix, PresExprRightConstMultiply,
}
Expand description

This contains the grammar for .mcrl2 specifications.

Considerations for PEG parsers

AFTER parsing we can use a PrattParser to define the associativity and precedence of operators for rules of the following shape:

expr = { prefix* ~ primary ~ postfix* ~ (infix ~ prefix* ~ primary ~ postfix* )* }

The | operator defines a choice operator and does not mean OR with backtracking. This means the following rules

Expr = { “Bool” ~ ASCII_ALPHANUMERIC* }

Will match the expression “Boolean” by eating up “Bool” and leaving “ean” as the remaining. However, this is undesirable since this should be an identifier Boolean. This is resolved by only allowing keywords to match whenever it is not by something that is part of an identifier.

Variants§

§

EOI

End-of-input

§

COMMENT

This is a silent rule eating all the comments.

§

WHITESPACE

This is a silent rule eating all the white space in the input.

§

Id

Identifiers

§

IdAt

Internal identifiers that can start with at “@”.

§

IdInfix

Identifiers that can also be the allowed infix operators.

§

IdList

List of identifiers

§

IdInfixList

List of identifiers

§

Number

Numbers

§

MCRL2Spec

Parsing an mCRL2 specification

§

DataSpec

Parsing an mCRL2 specification

§

ActSpec

Action specification

§

ActDecl

Declaration of actions

§

SortSpec

Sort specification

§

SortDecl

§

SortExpr

A general sort expression with infix operators.

§

SortExprPrimary

A single sort expression

§

SortExprBool

§

SortExprPos

§

SortExprNat

§

SortExprInt

§

SortExprReal

§

SortExprList

§

SortExprSet

§

SortExprBag

§

SortExprFSet

§

SortExprFBag

§

SortExprParens

§

SortExprStruct

§

SortExprInfix

§

SortExprFunction

§

SortExprProduct

§

ConstrDecl

Constructor declaration

§

ConstrDeclList

Constructor declaration list

§

SortProduct

A single sort A -> B -> …

§

DataExpr

Data Expression

§

DataExprUnit

Data Expressions without infix operators

§

DataExprPrefix

§

DataExprForall

§

DataExprExists

§

DataExprLambda

§

DataExprNegation

§

DataExprMinus

§

DataExprSize

§

DataExprPrimary

§

DataExprTrue

§

DataExprFalse

§

DataExprEmptyList

§

DataExprEmptySet

§

DataExprEmptyBag

§

DataExprListEnum

§

DataExprBagEnum

§

DataExprSetBagComp

§

DataExprSetEnum

§

DataExprBrackets

§

DataExprPostfix

§

DataExprUpdate

§

DataExprApplication

§

DataExprWhr

§

DataExprInfix

§

DataExprImpl

§

DataExprDisj

§

DataExprConj

§

DataExprEq

§

DataExprNeq

§

DataExprLeq

§

DataExprSnoc

§

DataExprLess

§

DataExprGeq

§

DataExprGreater

§

DataExprIn

§

DataExprCons

§

DataExprConcat

§

DataExprAdd

§

DataExprSubtract

§

DataExprDiv

§

DataExprIntDiv

§

DataExprMod

§

DataExprMult

§

DataExprAt

§

DataExprList

List of data expressions

§

Assignment

Assignment x = expression

§

AssignmentList

List of assignments

§

VarDecl

Typed variable

§

VarsDecl

Typed variables

§

VarsDeclList

Individually typed variables

§

BagEnumElt

Bag element with multiplicity

§

BagEnumEltList

Elements in a finite bag

§

Action

Action, process instantiation

§

ActIdSet

Action set

§

MultActId

Multi-action label

§

MultActIdList

§

MultActIdSet

Multi-action label set

§

ProjDecl

Domain with optional projection

§

ProjDeclList

Declaration of projection functions

§

CommExpr

Action synchronization

§

CommExprList

Action synchronizations

§

CommExprSet

Action synchronization set

§

RenExpr

Action renaming

§

RenExprList

Multiple action renamings

§

RenExprSet

An action renaming set.

§

ProcExpr

§

ProcExprPrimary

Single Process expressions

§

ProcExprDelta

§

ProcExprTau

§

ProcExprBlock

§

ProcExprAllow

§

ProcExprHide

§

ProcExprRename

§

ProcExprComm

§

ProcExprBrackets

§

ProcExprId

§

ProcExprPrefix

§

ProcExprSum

§

ProcExprDist

§

ProcExprIfThen

§

ProcExprIf

§

ProcExprInfix

§

ProcExprChoice

§

ProcExprLeftMerge

§

ProcExprParallel

§

ProcExprSeq

§

ProcExprUntil

§

ProcExprSync

§

ProcExprPostfix

§

ProcExprAt

§

ProcExprNoIf

§

ProcExprNoIfInfix

§

ProcDecl

§

ProcSpec

Process specification

§

Init

Initial process

§

IdsDecl

Typed parameters

§

ConsSpec

Declaration of constructors

§

MapSpec

Declaration of mappings

§

GlobVarSpec

Declaration of global variables

§

VarSpec

Declaration of variables

§

EqnSpec

Definition of equations

§

EqnDecl

Conditional equation

§

StateFrmSpec

Single state formula or state formula specification

§

FormSpec

§

StateFrmSpecElt

§

StateFrm

§

StateFrmPrimary

§

StateFrmBrackets

§

StateFrmTrue

§

StateFrmFalse

§

StateFrmDelay

§

StateFrmYaled

§

StateFrmId

§

StateFrmDataValExpr

§

StateFrmPrefix

§

StateFrmMu

§

StateFrmNu

§

StateFrmInf

§

StateFrmSup

§

StateFrmSum

§

StateFrmForall

§

StateFrmExists

§

StateFrmBox

§

StateFrmDiamond

§

StateFrmUnaryMinus

§

StateFrmNegation

§

StateFrmLeftConstantMultiply

§

StateFrmInfix

§

StateFrmAddition

§

StateFrmImplication

§

StateFrmDisjunction

§

StateFrmConjunction

§

StateFrmPostfix

§

StateFrmRightConstantMultiply

§

RegFrm

Regular formulas. To guard for the ambiguity of a + b and a+ we use a negative premise

§

RegFrmPrimary

§

RegFrmBackets

§

RegFrmInfix

§

RegFrmAlternative

§

RegFrmComposition

§

RegFrmPostfix

§

RegFrmIteration

§

RegFrmPlus

§

ActFrm

§

ActFrmPrimary

§

ActFrmBrackets

§

ActFrmTrue

§

ActFrmFalse

§

ActFrmPrefix

§

ActFrmNegation

§

ActFrmForall

§

ActFrmExists

§

ActFrmInfix

§

ActFrmImplies

§

ActFrmUnion

§

ActFrmIntersect

§

ActFrmPostfix

§

ActFrmAt

§

MultAct

§

MultiActTau

§

ActionList

§

DataValExpr

Marked data exression

§

StateVarDecl

State variable declaration

§

StateVarAssignment

Typed variable with initial value

§

StateVarAssignmentList

Typed variable list

§

ActionRenameSpec

Action rename specification

§

ActionRenameRuleSpec

Action rename rule section

§

ActionRenameRule

Conditional action renaming

§

ActionRenameRuleRHS

§

FixedPointOperator

§

FixedPointMu

§

FixedPointNu

§

PbesSpec

Parameterised boolean equations systems

§

PbesEqnSpec

§

PbesEqnDecl

§

PropVarDecl

§

PropVarInst

§

PbesInit

§

PbesExpr

§

PbesExprPrimary

§

PbesExprParens

§

PbesExprTrue

§

PbesExprFalse

§

PbesExprPrefix

§

PbesExprForall

§

PbesExprExists

§

PbesExprNegation

§

PbesExprInfix

§

PbesExprImplies

§

PbesExprConj

§

PbesExprDisj

§

PresSpec

Parameterised boolean equations systems

§

PresEqnSpec

§

PresEqnDecl

§

PresExpr

§

PresExprPrimary

§

PresExprParens

§

PresExprEqinf

§

PresExprEqninf

§

PresExprCondsm

§

PresExprCondeq

§

PresExprPrefix

§

PresExprInf

§

PresExprSup

§

PresExprSum

§

PresExprLeftConstantMultiply

§

PresExprInfix

§

PresExprAdd

§

PresExprPostfix

§

PresExprRightConstMultiply

Implementations§

Source§

impl Rule

Source

pub fn all_rules() -> &'static [Rule]

Trait Implementations§

Source§

impl Clone for Rule

Source§

fn clone(&self) -> Rule

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for Rule

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Hash for Rule

Source§

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

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

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

Feeds a slice of this type into the given Hasher. Read more
Source§

impl Ord for Rule

Source§

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

This method returns an Ordering between self and other. Read more
1.21.0 (const: unstable) · Source§

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

Compares and returns the maximum of two values. Read more
1.21.0 (const: unstable) · Source§

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

Compares and returns the minimum of two values. Read more
1.50.0 (const: unstable) · Source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized,

Restrict a value to a certain interval. Read more
Source§

impl Parser<Rule> for Mcrl2Parser

Source§

fn parse<'i>(rule: Rule, input: &'i str) -> Result<Pairs<'i, Rule>, Error<Rule>>

Parses a &str starting from rule.
Source§

impl PartialEq for Rule

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl PartialOrd for Rule

Source§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 (const: unstable) · Source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
Source§

impl Copy for Rule

Source§

impl Eq for Rule

Source§

impl StructuralPartialEq for Rule

Auto Trait Implementations§

§

impl Freeze for Rule

§

impl RefUnwindSafe for Rule

§

impl Send for Rule

§

impl Sync for Rule

§

impl Unpin for Rule

§

impl UnsafeUnpin for Rule

§

impl UnwindSafe for Rule

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
Source§

impl<T> Conv for T

Source§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> Erasable for T

Source§

fn erase(this: NonNull<T>) -> NonNull<Erased>

Turn this erasable pointer into an erased pointer. Read more
Source§

unsafe fn unerase(this: NonNull<Erased>) -> NonNull<T>

Unerase this erased pointer. Read more
Source§

impl<T> FmtForward for T

Source§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
Source§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
Source§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
Source§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
Source§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
Source§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
Source§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
Source§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
Source§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pipe for T
where T: ?Sized,

Source§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
Source§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
Source§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
Source§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
Source§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
Source§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
Source§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
Source§

impl<T> SliceDst for T

Source§

fn layout_for(_length: usize) -> Result<Layout, LayoutError>

Returns the layout of the slice containing length elements for this DST.
Source§

fn retype(ptr: NonNull<[()]>) -> NonNull<T>

Add the type on an untyped pointer
Source§

fn length(&self) -> usize

The number of elements in this dynamic sized type. This information is necessary for deallocation.
Source§

impl<T> Tap for T

Source§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
Source§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
Source§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
Source§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
Source§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
Source§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
Source§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
Source§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
Source§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
Source§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
Source§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
Source§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
Source§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> TryConv for T

Source§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> RuleType for T
where T: Copy + Debug + Eq + Hash + Ord,