Enum xcm_builder::test_utils::Junctions
source · pub enum Junctions {
Here,
X1(Junction),
X2(Junction, Junction),
X3(Junction, Junction, Junction),
X4(Junction, Junction, Junction, Junction),
X5(Junction, Junction, Junction, Junction, Junction),
X6(Junction, Junction, Junction, Junction, Junction, Junction),
X7(Junction, Junction, Junction, Junction, Junction, Junction, Junction),
X8(Junction, Junction, Junction, Junction, Junction, Junction, Junction, Junction),
}Expand description
Non-parent junctions that can be constructed, up to the length of 8. This specific Junctions
implementation uses a Rust enum in order to make pattern matching easier.
Parent junctions cannot be constructed with this type. Refer to MultiLocation for
instructions on constructing parent junctions.
Variants§
Here
The interpreting consensus system.
X1(Junction)
A relative path comprising 1 junction.
X2(Junction, Junction)
A relative path comprising 2 junctions.
X3(Junction, Junction, Junction)
A relative path comprising 3 junctions.
X4(Junction, Junction, Junction, Junction)
A relative path comprising 4 junctions.
X5(Junction, Junction, Junction, Junction, Junction)
A relative path comprising 5 junctions.
X6(Junction, Junction, Junction, Junction, Junction, Junction)
A relative path comprising 6 junctions.
X7(Junction, Junction, Junction, Junction, Junction, Junction, Junction)
A relative path comprising 7 junctions.
X8(Junction, Junction, Junction, Junction, Junction, Junction, Junction, Junction)
A relative path comprising 8 junctions.
Implementations§
source§impl Junctions
impl Junctions
sourcepub const fn into_location(self) -> MultiLocation
pub const fn into_location(self) -> MultiLocation
Convert self into a MultiLocation containing 0 parents.
Similar to Into::into, except that this method can be used in a const evaluation context.
sourcepub const fn into_exterior(self, n: u8) -> MultiLocation
pub const fn into_exterior(self, n: u8) -> MultiLocation
Convert self into a MultiLocation containing n parents.
Similar to Self::into_location, with the added ability to specify the number of parent
junctions.
sourcepub fn remove_network_id(&mut self)
pub fn remove_network_id(&mut self)
Remove the NetworkId value in any Junctions.
sourcepub fn invert_target(self, target: &MultiLocation) -> Result<MultiLocation, ()>
pub fn invert_target(self, target: &MultiLocation) -> Result<MultiLocation, ()>
Treating self as the universal context, return the location of the local consensus system
from the point of view of the given target.
sourcepub fn for_each_mut(&mut self, x: impl FnMut(&mut Junction))
pub fn for_each_mut(&mut self, x: impl FnMut(&mut Junction))
Execute a function f on every junction. We use this since we cannot implement a mutable
Iterator without unsafe code.
sourcepub fn global_consensus(&self) -> Result<NetworkId, ()>
pub fn global_consensus(&self) -> Result<NetworkId, ()>
Extract the network ID treating this value as a universal location.
This will return an Err if the first item is not a GlobalConsensus, which would indicate
that this value is not a universal location.
sourcepub fn split_global(self) -> Result<(NetworkId, Junctions), ()>
pub fn split_global(self) -> Result<(NetworkId, Junctions), ()>
Extract the network ID and the interior consensus location, treating this value as a universal location.
This will return an Err if the first item is not a GlobalConsensus, which would indicate
that this value is not a universal location.
sourcepub fn within_global(self, relative: MultiLocation) -> Result<Junctions, ()>
pub fn within_global(self, relative: MultiLocation) -> Result<Junctions, ()>
Treat self as a universal location and the context of relative, returning the universal
location of relative.
This will return an error if relative has as many (or more) parents than there are
junctions in self, implying that relative refers into a different global consensus.
sourcepub fn relative_to(self, viewer: &Junctions) -> MultiLocation
pub fn relative_to(self, viewer: &Junctions) -> MultiLocation
Consumes self and returns how viewer would address it locally.
sourcepub fn first(&self) -> Option<&Junction>
pub fn first(&self) -> Option<&Junction>
Returns first junction, or None if the location is empty.
sourcepub fn last(&self) -> Option<&Junction>
pub fn last(&self) -> Option<&Junction>
Returns last junction, or None if the location is empty.
sourcepub fn split_first(self) -> (Junctions, Option<Junction>)
pub fn split_first(self) -> (Junctions, Option<Junction>)
Splits off the first junction, returning the remaining suffix (first item in tuple) and the
first element (second item in tuple) or None if it was empty.
sourcepub fn split_last(self) -> (Junctions, Option<Junction>)
pub fn split_last(self) -> (Junctions, Option<Junction>)
Splits off the last junction, returning the remaining prefix (first item in tuple) and the
last element (second item in tuple) or None if it was empty.
sourcepub fn take_first(&mut self) -> Option<Junction>
pub fn take_first(&mut self) -> Option<Junction>
Removes the first element from self, returning it (or None if it was empty).
sourcepub fn take_last(&mut self) -> Option<Junction>
pub fn take_last(&mut self) -> Option<Junction>
Removes the last element from self, returning it (or None if it was empty).
sourcepub fn push(&mut self, new: impl Into<Junction>) -> Result<(), Junction>
pub fn push(&mut self, new: impl Into<Junction>) -> Result<(), Junction>
Mutates self to be appended with new or returns an Err with new if would overflow.
sourcepub fn push_front(&mut self, new: impl Into<Junction>) -> Result<(), Junction>
pub fn push_front(&mut self, new: impl Into<Junction>) -> Result<(), Junction>
Mutates self to be prepended with new or returns an Err with new if would overflow.
sourcepub fn pushed_with(
self,
new: impl Into<Junction>
) -> Result<Junctions, (Junctions, Junction)>
pub fn pushed_with( self, new: impl Into<Junction> ) -> Result<Junctions, (Junctions, Junction)>
Consumes self and returns a Junctions suffixed with new, or an Err with the
original value of self and new in case of overflow.
sourcepub fn pushed_front_with(
self,
new: impl Into<Junction>
) -> Result<Junctions, (Junctions, Junction)>
pub fn pushed_front_with( self, new: impl Into<Junction> ) -> Result<Junctions, (Junctions, Junction)>
Consumes self and returns a Junctions prefixed with new, or an Err with the
original value of self and new in case of overflow.
sourcepub fn append_with(
&mut self,
suffix: impl Into<Junctions>
) -> Result<(), Junctions>
pub fn append_with( &mut self, suffix: impl Into<Junctions> ) -> Result<(), Junctions>
Mutate self so that it is suffixed with suffix.
Does not modify self and returns Err with suffix in case of overflow.
Example
let mut m = X1(Parachain(21));
assert_eq!(m.append_with(X1(PalletInstance(3))), Ok(()));
assert_eq!(m, X2(Parachain(21), PalletInstance(3)));sourcepub fn at(&self, i: usize) -> Option<&Junction>
pub fn at(&self, i: usize) -> Option<&Junction>
Returns the junction at index i, or None if the location doesn’t contain that many
elements.
sourcepub fn at_mut(&mut self, i: usize) -> Option<&mut Junction>
pub fn at_mut(&mut self, i: usize) -> Option<&mut Junction>
Returns a mutable reference to the junction at index i, or None if the location doesn’t
contain that many elements.
sourcepub fn iter(&self) -> JunctionsRefIterator<'_>
pub fn iter(&self) -> JunctionsRefIterator<'_>
Returns a reference iterator over the junctions.
sourcepub fn match_and_split(&self, prefix: &Junctions) -> Option<&Junction>
pub fn match_and_split(&self, prefix: &Junctions) -> Option<&Junction>
Ensures that self begins with prefix and that it has a single Junction item following.
If so, returns a reference to this Junction item.
Example
let mut m = X3(Parachain(2), PalletInstance(3), OnlyChild);
assert_eq!(m.match_and_split(&X2(Parachain(2), PalletInstance(3))), Some(&OnlyChild));
assert_eq!(m.match_and_split(&X1(Parachain(2))), None);pub fn starts_with(&self, prefix: &Junctions) -> bool
Trait Implementations§
source§impl Decode for Junctions
impl Decode for Junctions
source§fn decode<__CodecInputEdqy>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<Junctions, Error>where
__CodecInputEdqy: Input,
fn decode<__CodecInputEdqy>( __codec_input_edqy: &mut __CodecInputEdqy ) -> Result<Junctions, Error>where __CodecInputEdqy: Input,
§fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>
) -> Result<DecodeFinished, Error>where
I: Input,
fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self> ) -> Result<DecodeFinished, Error>where I: Input,
§fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where I: Input,
§fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
source§impl<'de> Deserialize<'de> for Junctions
impl<'de> Deserialize<'de> for Junctions
source§fn deserialize<__D>(
__deserializer: __D
) -> Result<Junctions, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>( __deserializer: __D ) -> Result<Junctions, <__D as Deserializer<'de>>::Error>where __D: Deserializer<'de>,
source§impl Encode for Junctions
impl Encode for Junctions
source§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
source§fn encode_to<__CodecOutputEdqy>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)where
__CodecOutputEdqy: Output + ?Sized,
fn encode_to<__CodecOutputEdqy>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy )where __CodecOutputEdqy: Output + ?Sized,
§fn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> Rwhere F: FnOnce(&[u8]) -> R,
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
source§impl<J0, J1, J2> From<(J0, J1, J2)> for Junctionswhere
J0: Into<Junction>,
J1: Into<Junction>,
J2: Into<Junction>,
impl<J0, J1, J2> From<(J0, J1, J2)> for Junctionswhere J0: Into<Junction>, J1: Into<Junction>, J2: Into<Junction>,
source§fn from(_: (J0, J1, J2)) -> Junctions
fn from(_: (J0, J1, J2)) -> Junctions
source§impl<J0, J1, J2, J3> From<(J0, J1, J2, J3)> for Junctionswhere
J0: Into<Junction>,
J1: Into<Junction>,
J2: Into<Junction>,
J3: Into<Junction>,
impl<J0, J1, J2, J3> From<(J0, J1, J2, J3)> for Junctionswhere J0: Into<Junction>, J1: Into<Junction>, J2: Into<Junction>, J3: Into<Junction>,
source§fn from(_: (J0, J1, J2, J3)) -> Junctions
fn from(_: (J0, J1, J2, J3)) -> Junctions
source§impl<J0, J1, J2, J3, J4> From<(J0, J1, J2, J3, J4)> for Junctionswhere
J0: Into<Junction>,
J1: Into<Junction>,
J2: Into<Junction>,
J3: Into<Junction>,
J4: Into<Junction>,
impl<J0, J1, J2, J3, J4> From<(J0, J1, J2, J3, J4)> for Junctionswhere J0: Into<Junction>, J1: Into<Junction>, J2: Into<Junction>, J3: Into<Junction>, J4: Into<Junction>,
source§fn from(_: (J0, J1, J2, J3, J4)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4)) -> Junctions
source§impl<J0, J1, J2, J3, J4, J5> From<(J0, J1, J2, J3, J4, J5)> for Junctionswhere
J0: Into<Junction>,
J1: Into<Junction>,
J2: Into<Junction>,
J3: Into<Junction>,
J4: Into<Junction>,
J5: Into<Junction>,
impl<J0, J1, J2, J3, J4, J5> From<(J0, J1, J2, J3, J4, J5)> for Junctionswhere J0: Into<Junction>, J1: Into<Junction>, J2: Into<Junction>, J3: Into<Junction>, J4: Into<Junction>, J5: Into<Junction>,
source§fn from(_: (J0, J1, J2, J3, J4, J5)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4, J5)) -> Junctions
source§impl<J0, J1, J2, J3, J4, J5, J6> From<(J0, J1, J2, J3, J4, J5, J6)> for Junctionswhere
J0: Into<Junction>,
J1: Into<Junction>,
J2: Into<Junction>,
J3: Into<Junction>,
J4: Into<Junction>,
J5: Into<Junction>,
J6: Into<Junction>,
impl<J0, J1, J2, J3, J4, J5, J6> From<(J0, J1, J2, J3, J4, J5, J6)> for Junctionswhere J0: Into<Junction>, J1: Into<Junction>, J2: Into<Junction>, J3: Into<Junction>, J4: Into<Junction>, J5: Into<Junction>, J6: Into<Junction>,
source§fn from(_: (J0, J1, J2, J3, J4, J5, J6)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4, J5, J6)) -> Junctions
source§impl<J0, J1, J2, J3, J4, J5, J6, J7> From<(J0, J1, J2, J3, J4, J5, J6, J7)> for Junctionswhere
J0: Into<Junction>,
J1: Into<Junction>,
J2: Into<Junction>,
J3: Into<Junction>,
J4: Into<Junction>,
J5: Into<Junction>,
J6: Into<Junction>,
J7: Into<Junction>,
impl<J0, J1, J2, J3, J4, J5, J6, J7> From<(J0, J1, J2, J3, J4, J5, J6, J7)> for Junctionswhere J0: Into<Junction>, J1: Into<Junction>, J2: Into<Junction>, J3: Into<Junction>, J4: Into<Junction>, J5: Into<Junction>, J6: Into<Junction>, J7: Into<Junction>,
source§fn from(_: (J0, J1, J2, J3, J4, J5, J6, J7)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4, J5, J6, J7)) -> Junctions
source§impl From<Junctions> for MultiLocation
impl From<Junctions> for MultiLocation
source§fn from(junctions: Junctions) -> MultiLocation
fn from(junctions: Junctions) -> MultiLocation
source§impl<'a> IntoIterator for &'a Junctions
impl<'a> IntoIterator for &'a Junctions
source§impl IntoIterator for Junctions
impl IntoIterator for Junctions
source§impl MaxEncodedLen for Junctions
impl MaxEncodedLen for Junctions
source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
source§impl Ord for Junctions
impl Ord for Junctions
source§impl PartialEq<Junctions> for Junctions
impl PartialEq<Junctions> for Junctions
source§impl PartialOrd<Junctions> for Junctions
impl PartialOrd<Junctions> for Junctions
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 Serialize for Junctions
impl Serialize for Junctions
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,
source§impl TryFrom<MultiLocation> for Junctions
impl TryFrom<MultiLocation> for Junctions
§type Error = MultiLocation
type Error = MultiLocation
source§fn try_from(x: MultiLocation) -> Result<Junctions, MultiLocation>
fn try_from(x: MultiLocation) -> Result<Junctions, MultiLocation>
impl Copy for Junctions
impl EncodeLike<Junctions> for Junctions
impl Eq for Junctions
impl StructuralEq for Junctions
impl StructuralPartialEq for Junctions
Auto Trait Implementations§
impl RefUnwindSafe for Junctions
impl Send for Junctions
impl Sync for Junctions
impl Unpin for Junctions
impl UnwindSafe for Junctions
Blanket Implementations§
§impl<I> BidiIterator for Iwhere
I: IntoIterator,
<I as IntoIterator>::IntoIter: DoubleEndedIterator,
impl<I> BidiIterator for Iwhere I: IntoIterator, <I as IntoIterator>::IntoIter: DoubleEndedIterator,
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> DecodeAll for Twhere
T: Decode,
impl<T> DecodeAll for Twhere T: Decode,
§fn decode_all(input: &mut &[u8]) -> Result<T, Error>
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
Self and consume all of the given input data. Read more§impl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere T: Decode,
§impl<T> DefensiveMax<T> for Twhere
T: PartialOrd<T>,
impl<T> DefensiveMax<T> for Twhere T: PartialOrd<T>,
§fn defensive_max(self, other: T) -> T
fn defensive_max(self, other: T) -> T
§fn defensive_strict_max(self, other: T) -> T
fn defensive_strict_max(self, other: T) -> T
§impl<T> DefensiveMin<T> for Twhere
T: PartialOrd<T>,
impl<T> DefensiveMin<T> for Twhere T: PartialOrd<T>,
§fn defensive_min(self, other: T) -> T
fn defensive_min(self, other: T) -> T
§fn defensive_strict_min(self, other: T) -> T
fn defensive_strict_min(self, other: T) -> T
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
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 Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where &'a Self: for<'a> IntoIterator,
§impl<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere T: Codec,
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T> KeyedVec for Twhere
T: Codec,
impl<T> KeyedVec for Twhere T: Codec,
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere Self: Borrow<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> Rwhere
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> Rwhere Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere
Self: AsRef<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere Self: AsRef<U>, U: 'a + ?Sized, R: 'a,
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere
Self: AsMut<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere Self: AsMut<U>, U: 'a + ?Sized, R: 'a,
self, then passes self.as_mut() into the pipe
function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,
§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,
T. Read more§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere
Self: Deref<Target = T>,
T: ?Sized,
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere
Self: DerefMut<Target = T> + Deref,
T: ?Sized,
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
.tap_ref_mut() only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from.§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T.