pub enum Junctions {
Here,
X1(Arc<[Junction; 1]>),
X2(Arc<[Junction; 2]>),
X3(Arc<[Junction; 3]>),
X4(Arc<[Junction; 4]>),
X5(Arc<[Junction; 5]>),
X6(Arc<[Junction; 6]>),
X7(Arc<[Junction; 7]>),
X8(Arc<[Junction; 8]>),
}
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 Location
for
instructions on constructing parent junctions.
Variants§
Here
The interpreting consensus system.
X1(Arc<[Junction; 1]>)
A relative path comprising 1 junction.
X2(Arc<[Junction; 2]>)
A relative path comprising 2 junctions.
X3(Arc<[Junction; 3]>)
A relative path comprising 3 junctions.
X4(Arc<[Junction; 4]>)
A relative path comprising 4 junctions.
X5(Arc<[Junction; 5]>)
A relative path comprising 5 junctions.
X6(Arc<[Junction; 6]>)
A relative path comprising 6 junctions.
X7(Arc<[Junction; 7]>)
A relative path comprising 7 junctions.
X8(Arc<[Junction; 8]>)
A relative path comprising 8 junctions.
Implementations§
§impl Junctions
impl Junctions
pub const fn into_location(self) -> Location
pub const fn into_location(self) -> Location
Convert self
into a Location
containing 0 parents.
Similar to Into::into
, except that this method can be used in a const evaluation context.
pub const fn into_exterior(self, n: u8) -> Location
pub const fn into_exterior(self, n: u8) -> Location
Convert self
into a Location
containing n
parents.
Similar to Self::into_location
, with the added ability to specify the number of parent
junctions.
pub fn as_slice_mut(&mut self) -> &mut [Junction]
pub fn as_slice_mut(&mut self) -> &mut [Junction]
Casts self
into a mutable slice containing Junction
s.
pub fn remove_network_id(&mut self)
pub fn remove_network_id(&mut self)
Remove the NetworkId
value in any Junction
s.
pub fn invert_target(&self, target: &Location) -> Result<Location, ()>
pub fn invert_target(&self, target: &Location) -> Result<Location, ()>
Treating self
as the universal context, return the location of the local consensus system
from the point of view of the given target
.
pub 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.
pub 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.
pub 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.
pub fn within_global(self, relative: Location) -> Result<Junctions, ()>
pub fn within_global(self, relative: Location) -> 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.
pub fn relative_to(self, viewer: &Junctions) -> Location
pub fn relative_to(self, viewer: &Junctions) -> Location
Consumes self
and returns how viewer
would address it locally.
pub 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.
pub 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.
pub 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).
pub 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).
pub 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.
pub 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.
pub 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.
pub 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.
pub 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 = Junctions::from([Parachain(21)]);
assert_eq!(m.append_with([PalletInstance(3)]), Ok(()));
assert_eq!(m, [Parachain(21), PalletInstance(3)]);
pub 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.
pub 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.
pub fn iter(&self) -> JunctionsRefIterator<'_>
pub fn iter(&self) -> JunctionsRefIterator<'_>
Returns a reference iterator over the junctions.
pub 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 = Junctions::from([Parachain(2), PalletInstance(3), OnlyChild]);
assert_eq!(m.match_and_split(&[Parachain(2), PalletInstance(3)].into()), Some(&OnlyChild));
assert_eq!(m.match_and_split(&[Parachain(2)].into()), None);
pub fn starts_with(&self, prefix: &Junctions) -> bool
Trait Implementations§
source§impl<T: Get<InteriorLocation>> Contains<Junctions> for StartsWith<T>
impl<T: Get<InteriorLocation>> Contains<Junctions> for StartsWith<T>
source§fn contains(t: &InteriorLocation) -> bool
fn contains(t: &InteriorLocation) -> bool
true
if this “contains” the given value t
.source§impl<T: Get<NetworkId>> Contains<Junctions> for StartsWithExplicitGlobalConsensus<T>
impl<T: Get<NetworkId>> Contains<Junctions> for StartsWithExplicitGlobalConsensus<T>
source§fn contains(location: &InteriorLocation) -> bool
fn contains(location: &InteriorLocation) -> bool
true
if this “contains” the given value t
.§impl Decode for Junctions
impl Decode for Junctions
§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>
§impl<'de> Deserialize<'de> for Junctions
impl<'de> Deserialize<'de> for Junctions
§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>,
§impl Encode for Junctions
impl Encode for Junctions
§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) -> R
fn using_encoded<R, F>(&self, f: F) -> R
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
§impl<J0, J1, J2> From<(J0, J1, J2)> for Junctions
impl<J0, J1, J2> From<(J0, J1, J2)> for Junctions
§fn from(_: (J0, J1, J2)) -> Junctions
fn from(_: (J0, J1, J2)) -> Junctions
§impl<J0, J1, J2, J3> From<(J0, J1, J2, J3)> for Junctions
impl<J0, J1, J2, J3> From<(J0, J1, J2, J3)> for Junctions
§fn from(_: (J0, J1, J2, J3)) -> Junctions
fn from(_: (J0, J1, J2, J3)) -> Junctions
§impl<J0, J1, J2, J3, J4> From<(J0, J1, J2, J3, J4)> for Junctions
impl<J0, J1, J2, J3, J4> From<(J0, J1, J2, J3, J4)> for Junctions
§fn from(_: (J0, J1, J2, J3, J4)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4)) -> Junctions
§impl<J0, J1, J2, J3, J4, J5> From<(J0, J1, J2, J3, J4, J5)> for Junctions
impl<J0, J1, J2, J3, J4, J5> From<(J0, J1, J2, J3, J4, J5)> for Junctions
§fn from(_: (J0, J1, J2, J3, J4, J5)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4, J5)) -> Junctions
§impl<J0, J1, J2, J3, J4, J5, J6> From<(J0, J1, J2, J3, J4, J5, J6)> for Junctions
impl<J0, J1, J2, J3, J4, J5, J6> From<(J0, J1, J2, J3, J4, J5, J6)> for Junctions
§fn from(_: (J0, J1, J2, J3, J4, J5, J6)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4, J5, J6)) -> Junctions
§impl<J0, J1, J2, J3, J4, J5, J6, J7> From<(J0, J1, J2, J3, J4, J5, J6, J7)> for Junctions
impl<J0, J1, J2, J3, J4, J5, J6, J7> From<(J0, J1, J2, J3, J4, J5, J6, J7)> for Junctions
§fn from(_: (J0, J1, J2, J3, J4, J5, J6, J7)) -> Junctions
fn from(_: (J0, J1, J2, J3, J4, J5, J6, J7)) -> Junctions
§impl<'a> IntoIterator for &'a Junctions
impl<'a> IntoIterator for &'a Junctions
§impl IntoIterator for Junctions
impl IntoIterator for Junctions
§impl MaxEncodedLen for Junctions
impl MaxEncodedLen for Junctions
§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
§impl Ord for Junctions
impl Ord for Junctions
§impl PartialEq<[Junction; 1]> for Junctions
impl PartialEq<[Junction; 1]> for Junctions
§impl PartialEq<[Junction; 2]> for Junctions
impl PartialEq<[Junction; 2]> for Junctions
§impl PartialEq<[Junction; 3]> for Junctions
impl PartialEq<[Junction; 3]> for Junctions
§impl PartialEq<[Junction; 4]> for Junctions
impl PartialEq<[Junction; 4]> for Junctions
§impl PartialEq<[Junction; 5]> for Junctions
impl PartialEq<[Junction; 5]> for Junctions
§impl PartialEq<[Junction; 6]> for Junctions
impl PartialEq<[Junction; 6]> for Junctions
§impl PartialEq<[Junction; 7]> for Junctions
impl PartialEq<[Junction; 7]> for Junctions
§impl PartialEq<[Junction; 8]> for Junctions
impl PartialEq<[Junction; 8]> for Junctions
§impl PartialOrd for Junctions
impl PartialOrd for Junctions
§fn partial_cmp(&self, other: &Junctions) -> Option<Ordering>
fn partial_cmp(&self, other: &Junctions) -> 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 more§impl Serialize for Junctions
impl Serialize for Junctions
§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,
impl EncodeLike for Junctions
impl Eq for Junctions
impl StructuralPartialEq for Junctions
Auto Trait Implementations§
impl Freeze for Junctions
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 I
impl<I> BidiIterator for I
source§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> 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>,
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§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,
impl<T> DefensiveMax<T> for Twhere
T: PartialOrd,
§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,
impl<T> DefensiveMin<T> for Twhere
T: PartialOrd,
§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
§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.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<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,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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§impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> 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) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
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) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self
, then passes self.deref()
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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
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)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref()
only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
§impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
type Error = <U as TryFromKey<T>>::Error
fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>
§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 S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.