Struct Chain

pub struct Chain<T> { /* private fields */ }

Implementations

impl<T, const N: usize> Chain<[T; N]>

pub fn as_slice(self, cb: impl FnOnce(&[T])) -> Self

See documentation for [T; N]::as_slice for more details on the underlying function.

pub fn each_ref(self, cb: impl FnOnce([&T; N])) -> Self

See documentation for [T; N]::each_ref for more details on the underlying function.

pub fn each_mut(self, cb: impl FnOnce([&mut T; N])) -> Self

See documentation for [T; N]::each_mut for more details on the underlying function.

impl<'h, T, const N: usize> Chain<&'h mut [T; N]>

pub fn as_slice(self, cb: impl FnOnce(&[T])) -> Self

See documentation for [T; N]::as_slice for more details on the underlying function.

pub fn each_ref(self, cb: impl FnOnce([&T; N])) -> Self

See documentation for [T; N]::each_ref for more details on the underlying function.

pub fn each_mut(self, cb: impl FnOnce([&mut T; N])) -> Self

See documentation for [T; N]::each_mut for more details on the underlying function.

impl<T, const N: usize> Chain<[T; N]>

pub fn map<T2>(self, f: impl FnMut(T) -> T2) -> Chain<[T2; N]>

See documentation for [T; N]::map for more details on the underlying function.

impl<K, V, S> Chain<HashMap<K, V, S>>

pub fn clear(self) -> Self

See documentation for HashMap::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for HashMap::len for more details on the underlying function.

impl<'h, K, V, S> Chain<&'h mut HashMap<K, V, S>>

pub fn clear(self) -> Self

See documentation for HashMap::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for HashMap::len for more details on the underlying function.

impl<K, V> Chain<BTreeMap<K, V>>

pub fn clear(self) -> Self

See documentation for BTreeMap::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for BTreeMap::len for more details on the underlying function.

impl<'h, K, V> Chain<&'h mut BTreeMap<K, V>>

pub fn clear(self) -> Self

See documentation for BTreeMap::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for BTreeMap::len for more details on the underlying function.

impl<K, V, S> Chain<HashMap<K, V, S>>

pub fn insert(self, k: K, v: V, out: impl Output<Option<V>>) -> Self

where K: Eq + Hash, S: BuildHasher,

See documentation for HashMap::insert for more details on the underlying function.

impl<'h, K, V, S> Chain<&'h mut HashMap<K, V, S>>

pub fn insert(self, k: K, v: V, out: impl Output<Option<V>>) -> Self

where K: Eq + Hash, S: BuildHasher,

See documentation for HashMap::insert for more details on the underlying function.

impl<K, V> Chain<BTreeMap<K, V>>

pub fn insert(self, k: K, v: V, out: impl Output<Option<V>>) -> Self

where K: Ord,

See documentation for BTreeMap::insert for more details on the underlying function.

impl<'h, K, V> Chain<&'h mut BTreeMap<K, V>>

pub fn insert(self, k: K, v: V, out: impl Output<Option<V>>) -> Self

where K: Ord,

See documentation for BTreeMap::insert for more details on the underlying function.

impl<T, S> Chain<HashSet<T, S>>

pub fn clear(self) -> Self

See documentation for HashSet::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for HashSet::len for more details on the underlying function.

impl<'h, T, S> Chain<&'h mut HashSet<T, S>>

pub fn clear(self) -> Self

See documentation for HashSet::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for HashSet::len for more details on the underlying function.

impl<T> Chain<BTreeSet<T>>

pub fn clear(self) -> Self

See documentation for BTreeSet::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for BTreeSet::len for more details on the underlying function.

impl<'h, T> Chain<&'h mut BTreeSet<T>>

pub fn clear(self) -> Self

See documentation for BTreeSet::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for BTreeSet::len for more details on the underlying function.

impl Chain<String>

pub fn clear(self) -> Self

See documentation for String::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for String::len for more details on the underlying function.

pub fn push(self, ch: char) -> Self

See documentation for String::push for more details on the underlying function.

pub fn push_str(self, string: &str) -> Self

See documentation for String::push_str for more details on the underlying function.

pub fn reserve(self, additional: usize) -> Self

See documentation for String::reserve for more details on the underlying function.

pub fn reserve_exact(self, additional: usize) -> Self

See documentation for String::reserve_exact for more details on the underlying function.

pub fn retain(self, f: impl FnMut(char) -> bool) -> Self

See documentation for String::retain for more details on the underlying function.

impl<'h> Chain<&'h mut String>

pub fn clear(self) -> Self

See documentation for String::clear for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for String::len for more details on the underlying function.

pub fn push(self, ch: char) -> Self

See documentation for String::push for more details on the underlying function.

pub fn push_str(self, string: &str) -> Self

See documentation for String::push_str for more details on the underlying function.

pub fn reserve(self, additional: usize) -> Self

See documentation for String::reserve for more details on the underlying function.

pub fn reserve_exact(self, additional: usize) -> Self

See documentation for String::reserve_exact for more details on the underlying function.

pub fn retain(self, f: impl FnMut(char) -> bool) -> Self

See documentation for String::retain for more details on the underlying function.

impl<T> Chain<Vec<T>>

pub unsafe fn align_to<U>(self, cb: impl FnOnce((&[T], &[U], &[T]))) -> Self

Safety

You must uphold safety invariants of [T]::align_to.

See documentation for [T]::align_to for more details on the underlying function.

pub unsafe fn align_to_mut<U>( self, cb: impl FnOnce((&mut [T], &mut [U], &mut [T])), ) -> Self

Safety

You must uphold safety invariants of [T]::align_to_mut.

See documentation for [T]::align_to_mut for more details on the underlying function.

pub fn append(self, other: &mut impl ChainConversions<Inner = Vec<T>>) -> Self

See documentation for Vec::append for more details on the underlying function.

pub fn binary_search( self, x: &T, out: impl Output<Result<usize, usize>>, ) -> Self

where T: Ord,

See documentation for [T]::binary_search for more details on the underlying function.

pub fn binary_search_by( self, f: impl FnMut(&T) -> Ordering, out: impl Output<Result<usize, usize>>, ) -> Self

See documentation for [T]::binary_search_by for more details on the underlying function.

pub fn binary_search_by_key<B>( self, b: &B, f: impl FnMut(&T) -> B, out: impl Output<Result<usize, usize>>, ) -> Self

where B: Ord,

See documentation for [T]::binary_search_by_key for more details on the underlying function.

pub fn capacity(self, out: impl Output<usize>) -> Self

See documentation for Vec::capacity for more details on the underlying function.

pub fn clear(self) -> Self

See documentation for Vec::clear for more details on the underlying function.

pub fn dedup(self) -> Self

where T: PartialEq,

See documentation for Vec::dedup for more details on the underlying function.

pub fn dedup_by(self, same_bucket: impl FnMut(&mut T, &mut T) -> bool) -> Self

See documentation for Vec::dedup_by for more details on the underlying function.

pub fn dedup_by_key<K>(self, key: impl FnMut(&mut T) -> K) -> Self

where K: PartialEq,

See documentation for Vec::dedup_by_key for more details on the underlying function.

pub fn fill(self, value: T) -> Self

where T: Clone,

See documentation for [T]::fill for more details on the underlying function.

pub fn fill_with(self, f: impl FnMut() -> T) -> Self

See documentation for [T]::fill_with for more details on the underlying function.

pub fn insert(self, index: usize, element: T) -> Self

See documentation for Vec::insert for more details on the underlying function.

pub fn is_empty(self, out: impl Output<bool>) -> Self

See documentation for Vec::is_empty for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for Vec::len for more details on the underlying function.

pub fn pop(self, out: impl Output<Option<T>>) -> Self

See documentation for Vec::pop for more details on the underlying function.

pub fn push(self, value: T) -> Self

See documentation for Vec::push for more details on the underlying function.

pub fn remove(self, index: usize, out: impl Output<T>) -> Self

See documentation for Vec::remove for more details on the underlying function.

pub fn reserve(self, additional: usize) -> Self

See documentation for Vec::reserve for more details on the underlying function.

pub fn reserve_exact(self, additional: usize) -> Self

See documentation for Vec::reserve_exact for more details on the underlying function.

pub fn resize(self, new_len: usize, value: T) -> Self

where T: Clone,

See documentation for Vec::resize for more details on the underlying function.

pub fn resize_with(self, new_len: usize, f: impl FnMut() -> T) -> Self

See documentation for Vec::resize_with for more details on the underlying function.

pub fn retain(self, f: impl FnMut(&T) -> bool) -> Self

See documentation for Vec::retain for more details on the underlying function.

pub fn retain_mut(self, f: impl FnMut(&mut T) -> bool) -> Self

See documentation for Vec::retain_mut for more details on the underlying function.

pub unsafe fn set_len(self, new_len: usize) -> Self

Safety

You must uphold safety invariants of Vec::set_len.

See documentation for Vec::set_len for more details on the underlying function.

pub fn shrink_to(self, min_capacity: usize) -> Self

See documentation for Vec::shrink_to for more details on the underlying function.

pub fn shrink_to_fit(self) -> Self

See documentation for Vec::shrink_to_fit for more details on the underlying function.

pub fn sort(self) -> Self

where T: Ord,

See documentation for [T]::sort for more details on the underlying function.

pub fn sort_by(self, compare: impl FnMut(&T, &T) -> Ordering) -> Self

See documentation for [T]::sort_by for more details on the underlying function.

pub fn sort_by_key<K>(self, f: impl FnMut(&T) -> K) -> Self

where K: Ord,

See documentation for [T]::sort_by_key for more details on the underlying function.

pub fn sort_by_cached_key<K>(self, f: impl FnMut(&T) -> K) -> Self

where K: Ord,

See documentation for [T]::sort_by_cached_key for more details on the underlying function.

pub fn spare_capacity_mut(self, cb: impl FnOnce(&mut [MaybeUninit<T>])) -> Self

See documentation for Vec::spare_capacity_mut for more details on the underlying function.

impl<'h, T> Chain<&'h mut Vec<T>>

pub unsafe fn align_to<U>(self, cb: impl FnOnce((&[T], &[U], &[T]))) -> Self

Safety

You must uphold safety invariants of [T]::align_to.

See documentation for [T]::align_to for more details on the underlying function.

pub unsafe fn align_to_mut<U>( self, cb: impl FnOnce((&mut [T], &mut [U], &mut [T])), ) -> Self

Safety

You must uphold safety invariants of [T]::align_to_mut.

See documentation for [T]::align_to_mut for more details on the underlying function.

pub fn append(self, other: &mut impl ChainConversions<Inner = Vec<T>>) -> Self

See documentation for Vec::append for more details on the underlying function.

pub fn binary_search( self, x: &T, out: impl Output<Result<usize, usize>>, ) -> Self

where T: Ord,

See documentation for [T]::binary_search for more details on the underlying function.

pub fn binary_search_by( self, f: impl FnMut(&T) -> Ordering, out: impl Output<Result<usize, usize>>, ) -> Self

See documentation for [T]::binary_search_by for more details on the underlying function.

pub fn binary_search_by_key<B>( self, b: &B, f: impl FnMut(&T) -> B, out: impl Output<Result<usize, usize>>, ) -> Self

where B: Ord,

See documentation for [T]::binary_search_by_key for more details on the underlying function.

pub fn capacity(self, out: impl Output<usize>) -> Self

See documentation for Vec::capacity for more details on the underlying function.

pub fn clear(self) -> Self

See documentation for Vec::clear for more details on the underlying function.

pub fn dedup(self) -> Self

where T: PartialEq,

See documentation for Vec::dedup for more details on the underlying function.

pub fn dedup_by(self, same_bucket: impl FnMut(&mut T, &mut T) -> bool) -> Self

See documentation for Vec::dedup_by for more details on the underlying function.

pub fn dedup_by_key<K>(self, key: impl FnMut(&mut T) -> K) -> Self

where K: PartialEq,

See documentation for Vec::dedup_by_key for more details on the underlying function.

pub fn fill(self, value: T) -> Self

where T: Clone,

See documentation for [T]::fill for more details on the underlying function.

pub fn fill_with(self, f: impl FnMut() -> T) -> Self

See documentation for [T]::fill_with for more details on the underlying function.

pub fn insert(self, index: usize, element: T) -> Self

See documentation for Vec::insert for more details on the underlying function.

pub fn is_empty(self, out: impl Output<bool>) -> Self

See documentation for Vec::is_empty for more details on the underlying function.

pub fn len(self, out: impl Output<usize>) -> Self

See documentation for Vec::len for more details on the underlying function.

pub fn pop(self, out: impl Output<Option<T>>) -> Self

See documentation for Vec::pop for more details on the underlying function.

pub fn push(self, value: T) -> Self

See documentation for Vec::push for more details on the underlying function.

pub fn remove(self, index: usize, out: impl Output<T>) -> Self

See documentation for Vec::remove for more details on the underlying function.

pub fn reserve(self, additional: usize) -> Self

See documentation for Vec::reserve for more details on the underlying function.

pub fn reserve_exact(self, additional: usize) -> Self

See documentation for Vec::reserve_exact for more details on the underlying function.

pub fn resize(self, new_len: usize, value: T) -> Self

where T: Clone,

See documentation for Vec::resize for more details on the underlying function.

pub fn resize_with(self, new_len: usize, f: impl FnMut() -> T) -> Self

See documentation for Vec::resize_with for more details on the underlying function.

pub fn retain(self, f: impl FnMut(&T) -> bool) -> Self

See documentation for Vec::retain for more details on the underlying function.

pub fn retain_mut(self, f: impl FnMut(&mut T) -> bool) -> Self

See documentation for Vec::retain_mut for more details on the underlying function.

pub unsafe fn set_len(self, new_len: usize) -> Self

Safety

You must uphold safety invariants of Vec::set_len.

See documentation for Vec::set_len for more details on the underlying function.

pub fn shrink_to(self, min_capacity: usize) -> Self

See documentation for Vec::shrink_to for more details on the underlying function.

pub fn shrink_to_fit(self) -> Self

See documentation for Vec::shrink_to_fit for more details on the underlying function.

pub fn sort(self) -> Self

where T: Ord,

See documentation for [T]::sort for more details on the underlying function.

pub fn sort_by(self, compare: impl FnMut(&T, &T) -> Ordering) -> Self

See documentation for [T]::sort_by for more details on the underlying function.

pub fn sort_by_key<K>(self, f: impl FnMut(&T) -> K) -> Self

where K: Ord,

See documentation for [T]::sort_by_key for more details on the underlying function.

pub fn sort_by_cached_key<K>(self, f: impl FnMut(&T) -> K) -> Self

where K: Ord,

See documentation for [T]::sort_by_cached_key for more details on the underlying function.

pub fn spare_capacity_mut(self, cb: impl FnOnce(&mut [MaybeUninit<T>])) -> Self

See documentation for Vec::spare_capacity_mut for more details on the underlying function.

impl<T> Chain<T>

pub fn from_inner(inner: T) -> Self

pub fn into_inner(self) -> T

pub fn as_inner(&self) -> &T

pub fn as_inner_mut(&mut self) -> &mut T

pub fn with_inner(self, f: impl FnOnce(&mut T)) -> Self

Takes a closure that is called, passing in a reference to the inner value

This is useful for if there is something we have not implemented, or you otherwise need to borrow the inner struct for something, but are in the middle of some chain. It lets you do otherwise nonchainable operations inline with other chaining operations, so no need to break the chain c:

Examples

let chain = VecChain::<usize>::new();

// let's pretend `push` and `reserve` don't already have chainable versions...
let chain = chain
   .with_inner(|v| v.reserve(10))
   .with_inner(|v| v.push(1))
   .with_inner(|v| v.push(2));

assert!(chain.as_inner().len() == 2);
assert!(chain.as_inner().capacity() >= 10);

impl<T> Chain<&T>

pub fn cloned(&self) -> Chain<T>

where T: Clone,

pub fn copied(&self) -> Chain<T>

where T: Copy,

impl<T> Chain<&mut T>

pub fn cloned(&self) -> Chain<T>

where T: Clone,

pub fn copied(&self) -> Chain<T>

where T: Copy,

impl<'h, T> Chain<&'h &'h T>

pub fn flatten(self) -> Chain<&'h T>

impl<'h, T> Chain<&'h mut &'h mut T>

pub fn flatten(self) -> Chain<&'h mut T>

impl<T> Chain<Chain<T>>

pub fn flatten(self) -> Chain<T>

Trait Implementations

impl<T, T2> AsMut<T2> for Chain<T>

where T: AsMut<T2>,

fn as_mut(&mut self) -> &mut T2

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T, T2> AsRef<T2> for Chain<T>

where T: AsRef<T2>,

fn as_ref(&self) -> &T2

Converts this type into a shared reference of the (usually inferred) input type.

impl<'h, T, const N: usize> ChainConversions for Chain<&'h mut [T; N]>

type Inner = [T; N]

type MutChain<'mut_chain> = Chain<&'mut_chain mut [T; N]> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut [T; N]>

impl<'h, K, V> ChainConversions for Chain<&'h mut BTreeMap<K, V>>

type Inner = BTreeMap<K, V>

type MutChain<'mut_chain> = Chain<&'mut_chain mut BTreeMap<K, V>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut BTreeMap<K, V>>

impl<'h, T> ChainConversions for Chain<&'h mut BTreeSet<T>>

type Inner = BTreeSet<T>

type MutChain<'mut_chain> = Chain<&'mut_chain mut BTreeSet<T>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut BTreeSet<T>>

impl<'h, K, V, S> ChainConversions for Chain<&'h mut HashMap<K, V, S>>

type Inner = HashMap<K, V, S>

type MutChain<'mut_chain> = Chain<&'mut_chain mut HashMap<K, V, S>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut HashMap<K, V, S>>

impl<'h, T, S> ChainConversions for Chain<&'h mut HashSet<T, S>>

type Inner = HashSet<T, S>

type MutChain<'mut_chain> = Chain<&'mut_chain mut HashSet<T, S>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut HashSet<T, S>>

impl<'h> ChainConversions for Chain<&'h mut String>

type Inner = String

type MutChain<'mut_chain> = Chain<&'mut_chain mut String> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut String>

impl<'h, T> ChainConversions for Chain<&'h mut Vec<T>>

type Inner = Vec<T>

type MutChain<'mut_chain> = Chain<&'mut_chain mut Vec<T>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut Vec<T>>

impl<T, const N: usize> ChainConversions for Chain<[T; N]>

type Inner = [T; N]

type MutChain<'mut_chain> = Chain<&'mut_chain mut [T; N]> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut [T; N]>

impl<K, V> ChainConversions for Chain<BTreeMap<K, V>>

type Inner = BTreeMap<K, V>

type MutChain<'mut_chain> = Chain<&'mut_chain mut BTreeMap<K, V>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut BTreeMap<K, V>>

impl<T> ChainConversions for Chain<BTreeSet<T>>

type Inner = BTreeSet<T>

type MutChain<'mut_chain> = Chain<&'mut_chain mut BTreeSet<T>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut BTreeSet<T>>

impl<K, V, S> ChainConversions for Chain<HashMap<K, V, S>>

type Inner = HashMap<K, V, S>

type MutChain<'mut_chain> = Chain<&'mut_chain mut HashMap<K, V, S>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut HashMap<K, V, S>>

impl<T, S> ChainConversions for Chain<HashSet<T, S>>

type Inner = HashSet<T, S>

type MutChain<'mut_chain> = Chain<&'mut_chain mut HashSet<T, S>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut HashSet<T, S>>

impl ChainConversions for Chain<String>

type Inner = String

type MutChain<'mut_chain> = Chain<&'mut_chain mut String> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut String>

impl<T> ChainConversions for Chain<Vec<T>>

type Inner = Vec<T>

type MutChain<'mut_chain> = Chain<&'mut_chain mut Vec<T>> where Self: 'mut_chain

fn as_inner(&self) -> &Self::Inner

fn as_inner_mut(&mut self) -> &mut Self::Inner

fn as_mut_chain(&mut self) -> Chain<&mut Vec<T>>

impl<T, const N: usize> ChainConversionsOwned for Chain<[T; N]>

type OwnedChain = Chain<[T; N]>

fn into_chain(self) -> Chain<[T; N]>

fn into_inner(self) -> [T; N]

impl<K, V> ChainConversionsOwned for Chain<BTreeMap<K, V>>

type OwnedChain = Chain<BTreeMap<K, V>>

fn into_chain(self) -> Chain<BTreeMap<K, V>>

fn into_inner(self) -> BTreeMap<K, V>

impl<T> ChainConversionsOwned for Chain<BTreeSet<T>>

type OwnedChain = Chain<BTreeSet<T>>

fn into_chain(self) -> Chain<BTreeSet<T>>

fn into_inner(self) -> BTreeSet<T>

impl<K, V, S> ChainConversionsOwned for Chain<HashMap<K, V, S>>

type OwnedChain = Chain<HashMap<K, V, S>>

fn into_chain(self) -> Chain<HashMap<K, V, S>>

fn into_inner(self) -> HashMap<K, V, S>

impl<T, S> ChainConversionsOwned for Chain<HashSet<T, S>>

type OwnedChain = Chain<HashSet<T, S>>

fn into_chain(self) -> Chain<HashSet<T, S>>

fn into_inner(self) -> HashSet<T, S>

impl ChainConversionsOwned for Chain<String>

type OwnedChain = Chain<String>

fn into_chain(self) -> Chain<String>

fn into_inner(self) -> String

impl<T> ChainConversionsOwned for Chain<Vec<T>>

type OwnedChain = Chain<Vec<T>>

fn into_chain(self) -> Chain<Vec<T>>

fn into_inner(self) -> Vec<T>

impl<T> Clone for Chain<T>

where T: Clone,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Chain<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for Chain<T>

where T: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<T> Display for Chain<T>

where T: Display,

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

Formats the value using the given formatter.

impl<T> Hash for Chain<T>

where T: Hash,

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'h, T> IntoIterator for &'h Chain<T>

where &'h T: IntoIterator,

type Item = <&'h T as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'h T as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'h T as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'h, T> IntoIterator for &'h mut Chain<T>

where &'h mut T: IntoIterator,

type Item = <&'h mut T as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'h mut T as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'h mut T as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for Chain<T>

where T: IntoIterator,

type Item = <T as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <T as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> T::IntoIter

Creates an iterator from a value.

impl<T, T2> PartialEq<T2> for Chain<T>

where T: PartialEq<T2>,

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T> Copy for Chain<T>

where T: Copy,