[−][src]Struct alloc_wg::collections::btree_set::BTreeSet
A set based on a B-Tree.
See BTreeMap
's documentation for a detailed discussion of this collection's performance
benefits and drawbacks.
It is a logic error for an item to be modified in such a way that the item's ordering relative
to any other item, as determined by the Ord
trait, changes while it is in the set. This is
normally only possible through Cell
, RefCell
, global state, I/O, or unsafe code.
Examples
use std::collections::BTreeSet; // Type inference lets us omit an explicit type signature (which // would be `BTreeSet<&str>` in this example). let mut books = BTreeSet::new(); // Add some books. books.insert("A Dance With Dragons"); books.insert("To Kill a Mockingbird"); books.insert("The Odyssey"); books.insert("The Great Gatsby"); // Check for a specific one. if !books.contains("The Winds of Winter") { println!( "We have {} books, but The Winds of Winter ain't one.", books.len() ); } // Remove a book. books.remove("The Odyssey"); // Iterate over everything. for book in &books { println!("{}", book); }
Implementations
impl<T: Ord> BTreeSet<T>
[src]
pub const fn new() -> BTreeSet<T>
[src]
Makes a new BTreeSet
with a reasonable choice of B.
Examples
use std::collections::BTreeSet; let mut set: BTreeSet<i32> = BTreeSet::new();
impl<T: Ord, A: AllocRef> BTreeSet<T, A>
[src]
pub const fn new_in(alloc: A) -> BTreeSet<T, A>
[src]
Makes a new BTreeSet
with a reasonable choice of B.
Examples
use alloc_wg::collections::BTreeSet; use std::alloc::Global; let mut set: BTreeSet<i32> = BTreeSet::new_in(Global);
pub fn range<K: ?Sized, R>(&self, range: R) -> Range<'_, T>ⓘ where
K: Ord,
T: Borrow<K>,
R: RangeBounds<K>,
[src]
K: Ord,
T: Borrow<K>,
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.
Examples
use std::{collections::BTreeSet, 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());
pub fn difference<'a>(
&'a self,
other: &'a BTreeSet<T, A>
) -> Difference<'a, T, A>ⓘNotable traits for Difference<'a, T, A>
impl<'a, T: Ord, A: AllocRef> Iterator for Difference<'a, T, A> type Item = &'a T;
[src]
&'a self,
other: &'a BTreeSet<T, A>
) -> Difference<'a, T, A>ⓘ
Notable traits for Difference<'a, T, A>
impl<'a, T: Ord, A: AllocRef> Iterator for Difference<'a, T, A> type Item = &'a T;
Visits the values representing the difference,
i.e., the values 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]);
pub fn symmetric_difference<'a>(
&'a self,
other: &'a BTreeSet<T, A>
) -> SymmetricDifference<'a, T>ⓘNotable traits for SymmetricDifference<'a, T>
impl<'a, T: Ord> Iterator for SymmetricDifference<'a, T> type Item = &'a T;
[src]
&'a self,
other: &'a BTreeSet<T, A>
) -> SymmetricDifference<'a, T>ⓘ
Notable traits for SymmetricDifference<'a, T>
impl<'a, T: Ord> Iterator for SymmetricDifference<'a, T> type Item = &'a T;
Visits the values representing the symmetric difference,
i.e., the values 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]);
pub fn intersection<'a>(
&'a self,
other: &'a BTreeSet<T, A>
) -> Intersection<'a, T, A>ⓘNotable traits for Intersection<'a, T, A>
impl<'a, T: Ord, A: AllocRef> Iterator for Intersection<'a, T, A> type Item = &'a T;
[src]
&'a self,
other: &'a BTreeSet<T, A>
) -> Intersection<'a, T, A>ⓘ
Notable traits for Intersection<'a, T, A>
impl<'a, T: Ord, A: AllocRef> Iterator for Intersection<'a, T, A> type Item = &'a T;
Visits the values representing the intersection,
i.e., the values 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]);
pub fn union<'a>(&'a self, other: &'a BTreeSet<T, A>) -> Union<'a, T>ⓘ
[src]
Visits the values representing the union,
i.e., all the values 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]);
pub fn clear(&mut self) where
A: Clone,
[src]
A: Clone,
Clears the set, removing all values.
Examples
use std::collections::BTreeSet; let mut v = BTreeSet::new(); v.insert(1); v.clear(); assert!(v.is_empty());
pub fn contains<Q: ?Sized>(&self, value: &Q) -> bool where
T: Borrow<Q>,
Q: Ord,
[src]
T: Borrow<Q>,
Q: Ord,
Returns true
if the set contains a value.
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.
Examples
use std::collections::BTreeSet; let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); assert_eq!(set.contains(&1), true); assert_eq!(set.contains(&4), false);
pub fn get<Q: ?Sized>(&self, value: &Q) -> Option<&T> where
T: Borrow<Q>,
Q: Ord,
[src]
T: Borrow<Q>,
Q: Ord,
Returns a reference to the value in the set, if any, that is equal to the given value.
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.
Examples
use std::collections::BTreeSet; let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); assert_eq!(set.get(&2), Some(&2)); assert_eq!(set.get(&4), None);
pub fn is_disjoint(&self, other: &BTreeSet<T, A>) -> bool
[src]
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<_> = [1, 2, 3].iter().cloned().collect(); 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);
pub fn is_subset(&self, other: &BTreeSet<T, A>) -> bool
[src]
Returns true
if the set is a subset of another,
i.e., other
contains at least all the values in self
.
Examples
use std::collections::BTreeSet; let sup: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); 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);
pub fn is_superset(&self, other: &BTreeSet<T, A>) -> bool
[src]
Returns true
if the set is a superset of another,
i.e., self
contains at least all the values in other
.
Examples
use std::collections::BTreeSet; let sub: BTreeSet<_> = [1, 2].iter().cloned().collect(); 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);
pub fn first(&self) -> Option<&T>
[src]
Returns a reference to the first value in the set, if any. This value is always the minimum of all values in the set.
Examples
Basic usage:
#![feature(map_first_last)] use std::collections::BTreeSet; let mut map = BTreeSet::new(); assert_eq!(map.first(), None); map.insert(1); assert_eq!(map.first(), Some(&1)); map.insert(2); assert_eq!(map.first(), Some(&1));
pub fn last(&self) -> Option<&T>
[src]
Returns a reference to the last value in the set, if any. This value is always the maximum of all values in the set.
Examples
Basic usage:
#![feature(map_first_last)] use std::collections::BTreeSet; let mut map = BTreeSet::new(); assert_eq!(map.first(), None); map.insert(1); assert_eq!(map.last(), Some(&1)); map.insert(2); assert_eq!(map.last(), Some(&2));
pub fn pop_first(&mut self) -> Option<T>
[src]
Removes the first value from the set and returns it, if any. The first value is always the minimum value in the set.
Examples
#![feature(map_first_last)] use std::collections::BTreeSet; let mut set = BTreeSet::new(); set.insert(1); while let Some(n) = set.pop_first() { assert_eq!(n, 1); } assert!(set.is_empty());
pub fn pop_last(&mut self) -> Option<T>
[src]
Removes the last value from the set and returns it, if any. The last value is always the maximum value in the set.
Examples
#![feature(map_first_last)] use std::collections::BTreeSet; let mut set = BTreeSet::new(); set.insert(1); while let Some(n) = set.pop_last() { assert_eq!(n, 1); } assert!(set.is_empty());
pub fn insert(&mut self, value: T) -> bool
[src]
Adds a value to the set.
If the set did not have this value present, true
is returned.
If the set did have this value present, false
is returned, and the
entry is not updated. See the module-level documentation for more.
Examples
use std::collections::BTreeSet; let mut set = BTreeSet::new(); assert_eq!(set.insert(2), true); assert_eq!(set.insert(2), false); assert_eq!(set.len(), 1);
pub fn replace(&mut self, value: T) -> Option<T>
[src]
Adds a value to the set, replacing the existing value, if any, that is equal to the given one. Returns the replaced value.
Examples
use std::collections::BTreeSet; let mut set = BTreeSet::new(); set.insert(Vec::<i32>::new()); assert_eq!(set.get(&[][..]).unwrap().capacity(), 0); set.replace(Vec::with_capacity(10)); assert_eq!(set.get(&[][..]).unwrap().capacity(), 10);
pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool where
T: Borrow<Q>,
Q: Ord,
[src]
T: Borrow<Q>,
Q: Ord,
Removes a value from the set. Returns whether the value was present in the set.
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.
Examples
use std::collections::BTreeSet; let mut set = BTreeSet::new(); set.insert(2); assert_eq!(set.remove(&2), true); assert_eq!(set.remove(&2), false);
pub fn take<Q: ?Sized>(&mut self, value: &Q) -> Option<T> where
T: Borrow<Q>,
Q: Ord,
[src]
T: Borrow<Q>,
Q: Ord,
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.
Examples
use std::collections::BTreeSet; let mut set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); assert_eq!(set.take(&2), Some(2)); assert_eq!(set.take(&2), None);
pub fn append(&mut self, other: &mut Self) where
A: Clone,
[src]
A: Clone,
Moves all elements from other
into Self
, leaving other
empty.
Examples
use std::collections::BTreeSet; let mut a = BTreeSet::new(); a.insert(1); a.insert(2); a.insert(3); let mut b = BTreeSet::new(); b.insert(3); b.insert(4); b.insert(5); a.append(&mut b); assert_eq!(a.len(), 5); assert_eq!(b.len(), 0); assert!(a.contains(&1)); assert!(a.contains(&2)); assert!(a.contains(&3)); assert!(a.contains(&4)); assert!(a.contains(&5));
pub fn split_off<Q: ?Sized + Ord>(&mut self, key: &Q) -> Self where
T: Borrow<Q>,
A: Clone,
[src]
T: Borrow<Q>,
A: Clone,
Splits the collection into two at the given key. Returns everything after the given key, including the key.
Examples
Basic usage:
use std::collections::BTreeSet; let mut a = BTreeSet::new(); a.insert(1); a.insert(2); a.insert(3); a.insert(17); a.insert(41); let b = a.split_off(&3); assert_eq!(a.len(), 2); assert_eq!(b.len(), 3); assert!(a.contains(&1)); assert!(a.contains(&2)); assert!(b.contains(&3)); assert!(b.contains(&17)); assert!(b.contains(&41));
pub fn drain_filter<'a, F>(&'a mut self, pred: F) -> DrainFilter<'a, T, F, A>ⓘNotable traits for DrainFilter<'_, T, F, A>
impl<'a, T, F, A: AllocRef, '_> Iterator for DrainFilter<'_, T, F, A> where
F: 'a + FnMut(&T) -> bool, type Item = T;
where
F: 'a + FnMut(&T) -> bool,
[src]
Notable traits for DrainFilter<'_, T, F, A>
impl<'a, T, F, A: AllocRef, '_> Iterator for DrainFilter<'_, T, F, A> where
F: 'a + FnMut(&T) -> bool, type Item = T;
F: 'a + FnMut(&T) -> bool,
Creates an iterator which uses a closure to determine if a value should be removed.
If the closure returns true, then the value is removed and yielded. If the closure returns false, the value will remain in the list and will not be yielded by the iterator.
If the iterator is only partially consumed or not consumed at all, each of the remaining values will still be subjected to the closure and removed and dropped if it returns true.
It is unspecified how many more values will be subjected to the closure
if a panic occurs in the closure, or if a panic occurs while dropping a value, or if the
DrainFilter
itself is leaked.
Examples
Splitting a set into even and odd values, reusing the original set:
#![feature(btree_drain_filter)] use std::collections::BTreeSet; let mut set: BTreeSet<i32> = (0..8).collect(); let evens: BTreeSet<_> = set.drain_filter(|v| v % 2 == 0).collect(); let odds = set; assert_eq!(evens.into_iter().collect::<Vec<_>>(), vec![0, 2, 4, 6]); assert_eq!(odds.into_iter().collect::<Vec<_>>(), vec![1, 3, 5, 7]);
impl<T, A: AllocRef> BTreeSet<T, A>
[src]
pub fn iter(&self) -> Iter<'_, T>ⓘ
[src]
Gets an iterator that visits the values in the BTreeSet
in ascending order.
Examples
use std::collections::BTreeSet; let set: BTreeSet<usize> = [1, 2, 3].iter().cloned().collect(); 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<usize> = [3, 1, 2].iter().cloned().collect(); 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);
pub fn len(&self) -> usize
[src]
Returns the number of elements in the set.
Examples
use std::collections::BTreeSet; let mut v = BTreeSet::new(); assert_eq!(v.len(), 0); v.insert(1); assert_eq!(v.len(), 1);
pub fn is_empty(&self) -> bool
[src]
Returns true
if the set contains no elements.
Examples
use std::collections::BTreeSet; let mut v = BTreeSet::new(); assert!(v.is_empty()); v.insert(1); assert!(!v.is_empty());
Trait Implementations
impl<T: Ord + Clone, A: AllocRef + Clone, '_, '_> BitAnd<&'_ BTreeSet<T, A>> for &'_ BTreeSet<T, A>
[src]
type Output = BTreeSet<T, A>
The resulting type after applying the &
operator.
fn bitand(self, rhs: &BTreeSet<T, A>) -> BTreeSet<T, A>
[src]
Returns the intersection of self
and rhs
as a new BTreeSet<T>
.
Examples
use std::collections::BTreeSet; let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect(); let b: BTreeSet<_> = vec![2, 3, 4].into_iter().collect(); let result = &a & &b; let result_vec: Vec<_> = result.into_iter().collect(); assert_eq!(result_vec, [2, 3]);
impl<T: Ord + Clone, A: AllocRef + Clone, '_, '_> BitOr<&'_ BTreeSet<T, A>> for &'_ BTreeSet<T, A>
[src]
type Output = BTreeSet<T, A>
The resulting type after applying the |
operator.
fn bitor(self, rhs: &BTreeSet<T, A>) -> BTreeSet<T, A>
[src]
Returns the union of self
and rhs
as a new BTreeSet<T>
.
Examples
use std::collections::BTreeSet; let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect(); let b: BTreeSet<_> = vec![3, 4, 5].into_iter().collect(); let result = &a | &b; let result_vec: Vec<_> = result.into_iter().collect(); assert_eq!(result_vec, [1, 2, 3, 4, 5]);
impl<T: Ord + Clone, A: AllocRef + Clone, '_, '_> BitXor<&'_ BTreeSet<T, A>> for &'_ BTreeSet<T, A>
[src]
type Output = BTreeSet<T, A>
The resulting type after applying the ^
operator.
fn bitxor(self, rhs: &BTreeSet<T, A>) -> BTreeSet<T, A>
[src]
Returns the symmetric difference of self
and rhs
as a new BTreeSet<T>
.
Examples
use std::collections::BTreeSet; let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect(); let b: BTreeSet<_> = vec![2, 3, 4].into_iter().collect(); let result = &a ^ &b; let result_vec: Vec<_> = result.into_iter().collect(); assert_eq!(result_vec, [1, 4]);
impl<T: Clone, A: AllocRef + Clone> Clone for BTreeSet<T, A>
[src]
fn clone(&self) -> Self
[src]
fn clone_from(&mut self, other: &Self)
[src]
impl<T: Debug, A: AllocRef> Debug for BTreeSet<T, A>
[src]
impl<T: Ord> Default for BTreeSet<T>
[src]
impl<T: Eq, A: Eq + AllocRef> Eq for BTreeSet<T, A>
[src]
impl<'a, T: 'a + Ord + Copy, A: AllocRef> Extend<&'a T> for BTreeSet<T, A>
[src]
fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I)
[src]
fn extend_one(&mut self, elem: &'a T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<T: Ord, A: AllocRef> Extend<T> for BTreeSet<T, A>
[src]
fn extend<Iter: IntoIterator<Item = T>>(&mut self, iter: Iter)
[src]
fn extend_one(&mut self, elem: T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<T: Ord> FromIterator<T> for BTreeSet<T>
[src]
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> BTreeSet<T>
[src]
impl<T: Hash, A: Hash + AllocRef> Hash for BTreeSet<T, A>
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<T, A: AllocRef> IntoIterator for BTreeSet<T, A>
[src]
type Item = T
The type of the elements being iterated over.
type IntoIter = IntoIter<T, A>
Which kind of iterator are we turning this into?
fn into_iter(self) -> IntoIter<T, A>ⓘ
[src]
Gets an iterator for moving out the BTreeSet
's contents.
Examples
use std::collections::BTreeSet; let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect(); let v: Vec<_> = set.into_iter().collect(); assert_eq!(v, [1, 2, 3, 4]);
impl<'a, T, A: AllocRef> IntoIterator for &'a BTreeSet<T, A>
[src]
type Item = &'a T
The type of the elements being iterated over.
type IntoIter = Iter<'a, T>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Iter<'a, T>ⓘ
[src]
impl<T: Ord, A: Ord + AllocRef> Ord for BTreeSet<T, A>
[src]
fn cmp(&self, other: &BTreeSet<T, A>) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<T: PartialEq, A: PartialEq + AllocRef> PartialEq<BTreeSet<T, A>> for BTreeSet<T, A>
[src]
impl<T: PartialOrd, A: PartialOrd + AllocRef> PartialOrd<BTreeSet<T, A>> for BTreeSet<T, A>
[src]
fn partial_cmp(&self, other: &BTreeSet<T, A>) -> Option<Ordering>
[src]
fn lt(&self, other: &BTreeSet<T, A>) -> bool
[src]
fn le(&self, other: &BTreeSet<T, A>) -> bool
[src]
fn gt(&self, other: &BTreeSet<T, A>) -> bool
[src]
fn ge(&self, other: &BTreeSet<T, A>) -> bool
[src]
impl<T, A: AllocRef> StructuralEq for BTreeSet<T, A>
[src]
impl<T, A: AllocRef> StructuralPartialEq for BTreeSet<T, A>
[src]
impl<T: Ord + Clone, A: AllocRef + Clone, '_, '_> Sub<&'_ BTreeSet<T, A>> for &'_ BTreeSet<T, A>
[src]
type Output = BTreeSet<T, A>
The resulting type after applying the -
operator.
fn sub(self, rhs: &BTreeSet<T, A>) -> BTreeSet<T, A>
[src]
Returns the difference of self
and rhs
as a new BTreeSet<T>
.
Examples
use std::collections::BTreeSet; let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect(); let b: BTreeSet<_> = vec![3, 4, 5].into_iter().collect(); let result = &a - &b; let result_vec: Vec<_> = result.into_iter().collect(); assert_eq!(result_vec, [1, 2]);
Auto Trait Implementations
impl<T, A> RefUnwindSafe for BTreeSet<T, A> where
A: RefUnwindSafe,
T: RefUnwindSafe,
A: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, A> Send for BTreeSet<T, A> where
A: Send,
T: Send,
A: Send,
T: Send,
impl<T, A> Sync for BTreeSet<T, A> where
A: Sync,
T: Sync,
A: Sync,
T: Sync,
impl<T, A> Unpin for BTreeSet<T, A> where
A: Unpin,
T: Unpin,
A: Unpin,
T: Unpin,
impl<T, A> UnwindSafe for BTreeSet<T, A> where
A: UnwindSafe,
T: RefUnwindSafe + UnwindSafe,
A: UnwindSafe,
T: RefUnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,