Struct frame_support::BoundedBTreeSet
pub struct BoundedBTreeSet<T, S>(_, _);
Expand description
A bounded set based on a B-Tree.
B-Trees represent a fundamental compromise between cache-efficiency and actually minimizing
the amount of work performed in a search. See BTreeSet
for more details.
Unlike a standard BTreeSet
, there is an enforced upper limit to the number of items in the
set. All internal operations ensure this bound is respected.
Implementations§
§impl<T, S> BoundedBTreeSet<T, S>where
S: Get<u32>,
impl<T, S> BoundedBTreeSet<T, S>where S: Get<u32>,
§impl<T, S> BoundedBTreeSet<T, S>where
T: Ord,
S: Get<u32>,
impl<T, S> BoundedBTreeSet<T, S>where T: Ord, S: Get<u32>,
pub fn new() -> BoundedBTreeSet<T, S>
pub fn new() -> BoundedBTreeSet<T, S>
Create a new BoundedBTreeSet
.
Does not allocate.
pub fn into_inner(self) -> BTreeSet<T, Global>
pub fn into_inner(self) -> BTreeSet<T, Global>
Consume self, and return the inner BTreeSet
.
This is useful when a mutating API of the inner type is desired, and closure-based mutation
such as provided by try_mutate
is inconvenient.
pub fn try_mutate(
self,
mutate: impl FnMut(&mut BTreeSet<T, Global>)
) -> Option<BoundedBTreeSet<T, S>>
pub fn try_mutate( self, mutate: impl FnMut(&mut BTreeSet<T, Global>) ) -> Option<BoundedBTreeSet<T, S>>
Consumes self and mutates self via the given mutate
function.
If the outcome of mutation is within bounds, Some(Self)
is returned. Else, None
is
returned.
This is essentially a consuming shorthand Self::into_inner
-> ...
->
Self::try_from
.
pub fn clear(&mut self)
pub fn clear(&mut self)
Clears the set, removing all elements.
pub fn try_insert(&mut self, item: T) -> Result<bool, T>
pub fn try_insert(&mut self, item: T) -> Result<bool, T>
Exactly the same semantics as BTreeSet::insert
, but returns an Err
(and is a noop) if
the new length of the set exceeds S
.
In the Err
case, returns the inserted item so it can be further used without cloning.
pub fn remove<Q>(&mut self, item: &Q) -> boolwhere
T: Borrow<Q>,
Q: Ord + ?Sized,
pub fn remove<Q>(&mut self, item: &Q) -> boolwhere T: Borrow<Q>, Q: Ord + ?Sized,
Remove an item from the set, returning whether it was previously in the set.
The item may be any borrowed form of the set’s item type, but the ordering on the borrowed form must match the ordering on the item type.
pub fn take<Q>(&mut self, value: &Q) -> Option<T>where
T: Borrow<Q> + Ord,
Q: Ord + ?Sized,
pub fn take<Q>(&mut self, value: &Q) -> Option<T>where T: Borrow<Q> + Ord, Q: Ord + ?Sized,
Removes and returns the value in the set, if any, that is equal to the given one.
The value may be any borrowed form of the set’s value type, but the ordering on the borrowed form must match the ordering on the value type.
Methods from Deref<Target = BTreeSet<T, Global>>§
1.17.0 · sourcepub fn range<K, R>(&self, range: R) -> Range<'_, T>where
K: Ord + ?Sized,
T: Borrow<K> + Ord,
R: RangeBounds<K>,
pub fn range<K, R>(&self, range: R) -> Range<'_, T>where K: Ord + ?Sized, T: Borrow<K> + Ord, R: RangeBounds<K>,
Constructs a double-ended iterator over a sub-range of elements in the set.
The simplest way is to use the range syntax min..max
, thus range(min..max)
will
yield elements from min (inclusive) to max (exclusive).
The range may also be entered as (Bound<T>, Bound<T>)
, so for example
range((Excluded(4), Included(10)))
will yield a left-exclusive, right-inclusive
range from 4 to 10.
Panics
Panics if range start > end
.
Panics if range start == end
and both bounds are Excluded
.
Examples
use std::collections::BTreeSet;
use std::ops::Bound::Included;
let mut set = BTreeSet::new();
set.insert(3);
set.insert(5);
set.insert(8);
for &elem in set.range((Included(&4), Included(&8))) {
println!("{elem}");
}
assert_eq!(Some(&5), set.range(4..).next());
1.0.0 · sourcepub fn difference<'a>(
&'a self,
other: &'a BTreeSet<T, A>
) -> Difference<'a, T, A>where
T: Ord,
pub fn difference<'a>( &'a self, other: &'a BTreeSet<T, A> ) -> Difference<'a, T, A>where T: Ord,
Visits the elements representing the difference,
i.e., the elements that are in self
but not in other
,
in ascending order.
Examples
use std::collections::BTreeSet;
let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);
let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);
let diff: Vec<_> = a.difference(&b).cloned().collect();
assert_eq!(diff, [1]);
1.0.0 · sourcepub fn symmetric_difference<'a>(
&'a self,
other: &'a BTreeSet<T, A>
) -> SymmetricDifference<'a, T>where
T: Ord,
pub fn symmetric_difference<'a>( &'a self, other: &'a BTreeSet<T, A> ) -> SymmetricDifference<'a, T>where T: Ord,
Visits the elements representing the symmetric difference,
i.e., the elements that are in self
or in other
but not in both,
in ascending order.
Examples
use std::collections::BTreeSet;
let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);
let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);
let sym_diff: Vec<_> = a.symmetric_difference(&b).cloned().collect();
assert_eq!(sym_diff, [1, 3]);
1.0.0 · sourcepub fn intersection<'a>(
&'a self,
other: &'a BTreeSet<T, A>
) -> Intersection<'a, T, A>where
T: Ord,
pub fn intersection<'a>( &'a self, other: &'a BTreeSet<T, A> ) -> Intersection<'a, T, A>where T: Ord,
Visits the elements representing the intersection,
i.e., the elements that are both in self
and other
,
in ascending order.
Examples
use std::collections::BTreeSet;
let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);
let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);
let intersection: Vec<_> = a.intersection(&b).cloned().collect();
assert_eq!(intersection, [2]);
1.0.0 · sourcepub fn union<'a>(&'a self, other: &'a BTreeSet<T, A>) -> Union<'a, T>where
T: Ord,
pub fn union<'a>(&'a self, other: &'a BTreeSet<T, A>) -> Union<'a, T>where T: Ord,
Visits the elements representing the union,
i.e., all the elements in self
or other
, without duplicates,
in ascending order.
Examples
use std::collections::BTreeSet;
let mut a = BTreeSet::new();
a.insert(1);
let mut b = BTreeSet::new();
b.insert(2);
let union: Vec<_> = a.union(&b).cloned().collect();
assert_eq!(union, [1, 2]);
1.0.0 · sourcepub fn contains<Q>(&self, value: &Q) -> boolwhere
T: Borrow<Q> + Ord,
Q: Ord + ?Sized,
pub fn contains<Q>(&self, value: &Q) -> boolwhere T: Borrow<Q> + Ord, Q: Ord + ?Sized,
Returns true
if the set contains an element equal to the value.
The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.
Examples
use std::collections::BTreeSet;
let set = BTreeSet::from([1, 2, 3]);
assert_eq!(set.contains(&1), true);
assert_eq!(set.contains(&4), false);
1.9.0 · sourcepub fn get<Q>(&self, value: &Q) -> Option<&T>where
T: Borrow<Q> + Ord,
Q: Ord + ?Sized,
pub fn get<Q>(&self, value: &Q) -> Option<&T>where T: Borrow<Q> + Ord, Q: Ord + ?Sized,
Returns a reference to the element in the set, if any, that is equal to the value.
The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.
Examples
use std::collections::BTreeSet;
let set = BTreeSet::from([1, 2, 3]);
assert_eq!(set.get(&2), Some(&2));
assert_eq!(set.get(&4), None);
1.0.0 · sourcepub fn is_disjoint(&self, other: &BTreeSet<T, A>) -> boolwhere
T: Ord,
pub fn is_disjoint(&self, other: &BTreeSet<T, A>) -> boolwhere T: Ord,
Returns true
if self
has no elements in common with other
.
This is equivalent to checking for an empty intersection.
Examples
use std::collections::BTreeSet;
let a = BTreeSet::from([1, 2, 3]);
let mut b = BTreeSet::new();
assert_eq!(a.is_disjoint(&b), true);
b.insert(4);
assert_eq!(a.is_disjoint(&b), true);
b.insert(1);
assert_eq!(a.is_disjoint(&b), false);
1.0.0 · sourcepub fn is_subset(&self, other: &BTreeSet<T, A>) -> boolwhere
T: Ord,
pub fn is_subset(&self, other: &BTreeSet<T, A>) -> boolwhere T: Ord,
Returns true
if the set is a subset of another,
i.e., other
contains at least all the elements in self
.
Examples
use std::collections::BTreeSet;
let sup = BTreeSet::from([1, 2, 3]);
let mut set = BTreeSet::new();
assert_eq!(set.is_subset(&sup), true);
set.insert(2);
assert_eq!(set.is_subset(&sup), true);
set.insert(4);
assert_eq!(set.is_subset(&sup), false);
1.0.0 · sourcepub fn is_superset(&self, other: &BTreeSet<T, A>) -> boolwhere
T: Ord,
pub fn is_superset(&self, other: &BTreeSet<T, A>) -> boolwhere T: Ord,
Returns true
if the set is a superset of another,
i.e., self
contains at least all the elements in other
.
Examples
use std::collections::BTreeSet;
let sub = BTreeSet::from([1, 2]);
let mut set = BTreeSet::new();
assert_eq!(set.is_superset(&sub), false);
set.insert(0);
set.insert(1);
assert_eq!(set.is_superset(&sub), false);
set.insert(2);
assert_eq!(set.is_superset(&sub), true);
1.66.0 · sourcepub fn first(&self) -> Option<&T>where
T: Ord,
pub fn first(&self) -> Option<&T>where T: Ord,
Returns a reference to the first element in the set, if any. This element is always the minimum of all elements in the set.
Examples
Basic usage:
use std::collections::BTreeSet;
let mut set = BTreeSet::new();
assert_eq!(set.first(), None);
set.insert(1);
assert_eq!(set.first(), Some(&1));
set.insert(2);
assert_eq!(set.first(), Some(&1));
1.66.0 · sourcepub fn last(&self) -> Option<&T>where
T: Ord,
pub fn last(&self) -> Option<&T>where T: Ord,
Returns a reference to the last element in the set, if any. This element is always the maximum of all elements in the set.
Examples
Basic usage:
use std::collections::BTreeSet;
let mut set = BTreeSet::new();
assert_eq!(set.last(), None);
set.insert(1);
assert_eq!(set.last(), Some(&1));
set.insert(2);
assert_eq!(set.last(), Some(&2));
1.0.0 · sourcepub fn iter(&self) -> Iter<'_, T>
pub fn iter(&self) -> Iter<'_, T>
Gets an iterator that visits the elements in the BTreeSet
in ascending
order.
Examples
use std::collections::BTreeSet;
let set = BTreeSet::from([1, 2, 3]);
let mut set_iter = set.iter();
assert_eq!(set_iter.next(), Some(&1));
assert_eq!(set_iter.next(), Some(&2));
assert_eq!(set_iter.next(), Some(&3));
assert_eq!(set_iter.next(), None);
Values returned by the iterator are returned in ascending order:
use std::collections::BTreeSet;
let set = BTreeSet::from([3, 1, 2]);
let mut set_iter = set.iter();
assert_eq!(set_iter.next(), Some(&1));
assert_eq!(set_iter.next(), Some(&2));
assert_eq!(set_iter.next(), Some(&3));
assert_eq!(set_iter.next(), None);
Trait Implementations§
§impl<T, S> Clone for BoundedBTreeSet<T, S>where
BTreeSet<T, Global>: Clone,
impl<T, S> Clone for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: Clone,
§fn clone(&self) -> BoundedBTreeSet<T, S>
fn clone(&self) -> BoundedBTreeSet<T, S>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§impl<T, S> Decode for BoundedBTreeSet<T, S>where
T: Decode + Ord,
S: Get<u32>,
impl<T, S> Decode for BoundedBTreeSet<T, S>where T: Decode + Ord, S: Get<u32>,
§fn decode<I>(input: &mut I) -> Result<BoundedBTreeSet<T, S>, Error>where
I: Input,
fn decode<I>(input: &mut I) -> Result<BoundedBTreeSet<T, S>, 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 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 encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
§impl<T, S> DecodeLength for BoundedBTreeSet<T, S>
impl<T, S> DecodeLength for BoundedBTreeSet<T, S>
§impl<T, S> Default for BoundedBTreeSet<T, S>where
T: Ord,
S: Get<u32>,
impl<T, S> Default for BoundedBTreeSet<T, S>where T: Ord, S: Get<u32>,
§fn default() -> BoundedBTreeSet<T, S>
fn default() -> BoundedBTreeSet<T, S>
§impl<T, S> Deref for BoundedBTreeSet<T, S>where
T: Ord,
impl<T, S> Deref for BoundedBTreeSet<T, S>where T: Ord,
§impl<T, S> Encode for BoundedBTreeSet<T, S>where
BTreeSet<T, Global>: Encode,
PhantomData<S>: Encode,
impl<T, S> Encode for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: Encode, PhantomData<S>: Encode,
§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
§impl<T, S> From<BoundedBTreeSet<T, S>> for BTreeSet<T, Global>where
T: Ord,
impl<T, S> From<BoundedBTreeSet<T, S>> for BTreeSet<T, Global>where T: Ord,
§fn from(set: BoundedBTreeSet<T, S>) -> BTreeSet<T, Global>
fn from(set: BoundedBTreeSet<T, S>) -> BTreeSet<T, Global>
§impl<T, S> Hash for BoundedBTreeSet<T, S>where
T: Hash,
impl<T, S> Hash for BoundedBTreeSet<T, S>where T: Hash,
§impl<'a, T, S> IntoIterator for &'a BoundedBTreeSet<T, S>
impl<'a, T, S> IntoIterator for &'a BoundedBTreeSet<T, S>
§impl<T, S> IntoIterator for BoundedBTreeSet<T, S>
impl<T, S> IntoIterator for BoundedBTreeSet<T, S>
§impl<T, S> MaxEncodedLen for BoundedBTreeSet<T, S>where
T: MaxEncodedLen,
S: Get<u32>,
impl<T, S> MaxEncodedLen for BoundedBTreeSet<T, S>where T: MaxEncodedLen, S: Get<u32>,
§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
§impl<T, S> Ord for BoundedBTreeSet<T, S>where
BTreeSet<T, Global>: Ord,
S: Get<u32>,
impl<T, S> Ord for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: Ord, S: Get<u32>,
§fn cmp(&self, other: &BoundedBTreeSet<T, S>) -> Ordering
fn cmp(&self, other: &BoundedBTreeSet<T, S>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
§impl<T, S> PartialEq<BTreeSet<T, Global>> for BoundedBTreeSet<T, S>where
BTreeSet<T, Global>: PartialEq<BTreeSet<T, Global>>,
S: Get<u32>,
impl<T, S> PartialEq<BTreeSet<T, Global>> for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: PartialEq<BTreeSet<T, Global>>, S: Get<u32>,
§impl<T, S1, S2> PartialEq<BoundedBTreeSet<T, S1>> for BoundedBTreeSet<T, S2>where
BTreeSet<T, Global>: PartialEq<BTreeSet<T, Global>>,
S1: Get<u32>,
S2: Get<u32>,
impl<T, S1, S2> PartialEq<BoundedBTreeSet<T, S1>> for BoundedBTreeSet<T, S2>where BTreeSet<T, Global>: PartialEq<BTreeSet<T, Global>>, S1: Get<u32>, S2: Get<u32>,
§fn eq(&self, other: &BoundedBTreeSet<T, S1>) -> bool
fn eq(&self, other: &BoundedBTreeSet<T, S1>) -> bool
self
and other
values to be equal, and is used
by ==
.§impl<T, S> PartialOrd<BoundedBTreeSet<T, S>> for BoundedBTreeSet<T, S>where
BTreeSet<T, Global>: PartialOrd<BTreeSet<T, Global>>,
S: Get<u32>,
impl<T, S> PartialOrd<BoundedBTreeSet<T, S>> for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: PartialOrd<BTreeSet<T, Global>>, S: Get<u32>,
§fn partial_cmp(&self, other: &BoundedBTreeSet<T, S>) -> Option<Ordering>
fn partial_cmp(&self, other: &BoundedBTreeSet<T, S>) -> 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<T, S> StorageDecodeLength for BoundedBTreeSet<T, S>
impl<T, S> StorageDecodeLength for BoundedBTreeSet<T, S>
§impl<T, S> TypeInfo for BoundedBTreeSet<T, S>where
BTreeSet<T, Global>: TypeInfo + 'static,
PhantomData<S>: TypeInfo + 'static,
T: TypeInfo + 'static,
S: 'static,
impl<T, S> TypeInfo for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: TypeInfo + 'static, PhantomData<S>: TypeInfo + 'static, T: TypeInfo + 'static, S: 'static,
impl<T, S> EncodeLike<BTreeSet<T, Global>> for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: Encode,
impl<T, S> EncodeLike<BoundedBTreeSet<T, S>> for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: Encode, PhantomData<S>: Encode,
impl<T, S> Eq for BoundedBTreeSet<T, S>where BTreeSet<T, Global>: Eq, S: Get<u32>,
Auto Trait Implementations§
impl<T, S> RefUnwindSafe for BoundedBTreeSet<T, S>where S: RefUnwindSafe, T: RefUnwindSafe,
impl<T, S> Send for BoundedBTreeSet<T, S>where S: Send, T: Send,
impl<T, S> Sync for BoundedBTreeSet<T, S>where S: Sync, T: Sync,
impl<T, S> Unpin for BoundedBTreeSet<T, S>where S: Unpin,
impl<T, S> UnwindSafe for BoundedBTreeSet<T, S>where S: UnwindSafe, T: RefUnwindSafe,
Blanket Implementations§
§impl<'a, F, I> BatchInvert<F> for Iwhere
F: Field + ConstantTimeEq,
I: IntoIterator<Item = &'a mut F>,
impl<'a, F, I> BatchInvert<F> for Iwhere F: Field + ConstantTimeEq, I: IntoIterator<Item = &'a mut F>,
§fn batch_invert(self) -> F
fn batch_invert(self) -> F
source§impl<T> CheckedConversion for T
impl<T> CheckedConversion 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,
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
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>
source§impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,
source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,
T
. Read more§impl<I, T, Bound> TryCollect<BoundedBTreeSet<T, Bound>> for Iwhere
T: Ord,
I: ExactSizeIterator<Item = T> + Iterator,
Bound: Get<u32>,
impl<I, T, Bound> TryCollect<BoundedBTreeSet<T, Bound>> for Iwhere T: Ord, I: ExactSizeIterator<Item = T> + Iterator, Bound: Get<u32>,
§type Error = &'static str
type Error = &'static str
self
.§fn try_collect(
self
) -> Result<BoundedBTreeSet<T, Bound>, <I as TryCollect<BoundedBTreeSet<T, Bound>>>::Error>
fn try_collect( self ) -> Result<BoundedBTreeSet<T, Bound>, <I as TryCollect<BoundedBTreeSet<T, Bound>>>::Error>
C
. Read moresource§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.source§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.