pub struct NonEmpty<T>where
T: ?Sized,{ /* private fields */ }
Implementations§
Source§impl<T, const N: usize> NonEmpty<ArrayVec<T, N>>
impl<T, const N: usize> NonEmpty<ArrayVec<T, N>>
Sourcepub unsafe fn from_array_vec_unchecked(items: ArrayVec<T, N>) -> Self
Available on crate feature arrayvec
only.
pub unsafe fn from_array_vec_unchecked(items: ArrayVec<T, N>) -> Self
arrayvec
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of ArrayVec::new()
.
pub fn from_one(item: T) -> Self
arrayvec
only.pub fn from_head_and_tail<I>(head: T, tail: I) -> Selfwhere
I: IntoIterator<Item = T>,
arrayvec
only.pub fn from_tail_and_head<I>(tail: I, head: T) -> Selfwhere
I: IntoIterator<Item = T>,
arrayvec
only.pub fn into_head_and_tail(self) -> (T, ArrayVec<T, N>)
arrayvec
only.pub fn into_tail_and_head(self) -> (ArrayVec<T, N>, T)
arrayvec
only.pub fn into_array_vec(self) -> ArrayVec<T, N>
arrayvec
only.pub fn try_into_array(self) -> Result<[T; N], Self>
arrayvec
only.Sourcepub unsafe fn into_array_unchecked(self) -> [T; N]
Available on crate feature arrayvec
only.
pub unsafe fn into_array_unchecked(self) -> [T; N]
arrayvec
only.§Safety
The ArrayVec1
must be saturated (length equals capacity), otherwise the output is
uninitialized and unsound.
pub fn try_extend_from_slice(
&mut self,
items: &[T],
) -> Result<(), CapacityError>where
T: Copy,
arrayvec
only.pub fn push(&mut self, item: T)
arrayvec
only.pub fn try_push(&mut self, item: T) -> Result<(), CapacityError<T>>
arrayvec
only.Sourcepub unsafe fn push_unchecked(&mut self, item: T)
Available on crate feature arrayvec
only.
pub unsafe fn push_unchecked(&mut self, item: T)
arrayvec
only.§Safety
The ArrayVec1
must have vacancy (available capacity) for the given item. Calling this
function against a saturated ArrayVec1
is undefined behavior.
pub fn pop_or(&mut self) -> PopOr<'_, Self, N>
arrayvec
only.pub fn swap_pop_or(&mut self, index: usize) -> SwapPopOr<'_, Self, N>
arrayvec
only.pub fn insert(&mut self, index: usize, item: T)
arrayvec
only.pub fn try_insert( &mut self, index: usize, item: T, ) -> Result<(), CapacityError<T>>
arrayvec
only.pub fn remove_or(&mut self, index: usize) -> RemoveOr<'_, Self, N>
arrayvec
only.pub fn swap_remove_or(&mut self, index: usize) -> RemoveOr<'_, Self, N>
arrayvec
only.pub const fn len(&self) -> NonZeroUsize
arrayvec
only.pub const fn capacity(&self) -> NonZeroUsize
arrayvec
only.pub const fn as_array_vec(&self) -> &ArrayVec<T, N>
arrayvec
only.pub fn as_slice1(&self) -> &Slice1<T>
arrayvec
only.pub fn as_mut_slice1(&mut self) -> &mut Slice1<T>
arrayvec
only.pub fn as_ptr(&self) -> *const T
arrayvec
only.pub fn as_mut_ptr(&mut self) -> *mut T
arrayvec
only.Source§impl<K, V> NonEmpty<BTreeMap<K, V>>
impl<K, V> NonEmpty<BTreeMap<K, V>>
Sourcepub unsafe fn from_btree_map_unchecked(items: BTreeMap<K, V>) -> Self
Available on crate feature alloc
only.
pub unsafe fn from_btree_map_unchecked(items: BTreeMap<K, V>) -> Self
alloc
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of BTreeMap::new()
.
pub fn from_one(item: (K, V)) -> Selfwhere
K: Ord,
alloc
only.pub fn from_head_and_tail<I>(head: (K, V), tail: I) -> Self
alloc
only.pub fn from_tail_and_head<I>(tail: I, head: (K, V)) -> Self
alloc
only.pub fn into_btree_map(self) -> BTreeMap<K, V>
alloc
only.pub fn into_keys1(self) -> Iterator1<IntoKeys<K, V>>
alloc
only.pub fn into_values1(self) -> Iterator1<IntoValues<K, V>>
alloc
only.pub fn split_off_tail(&mut self) -> BTreeMap<K, V>
alloc
only.pub fn append(&mut self, items: &mut BTreeMap<K, V>)where
K: Ord,
alloc
only.pub fn entry(&mut self, key: K) -> Entry<'_, K, V>where
K: Ord,
alloc
only.pub fn insert(&mut self, key: K, value: V) -> Option<V>where
K: Ord,
alloc
only.pub fn pop_first_or(&mut self) -> PopOr<'_, Self>where
K: Ord,
alloc
only.pub fn pop_first_until_only(&mut self) -> OnlyEntry<'_, K, V>where
K: Ord,
alloc
only.pub fn pop_first_until_only_with<F>(&mut self, f: F) -> OnlyEntry<'_, K, V>
alloc
only.pub fn pop_last_or(&mut self) -> PopOr<'_, Self>where
K: Ord,
alloc
only.pub fn pop_last_until_only(&mut self) -> OnlyEntry<'_, K, V>where
K: Ord,
alloc
only.pub fn pop_last_until_only_with<F>(&mut self, f: F) -> OnlyEntry<'_, K, V>
alloc
only.pub fn remove_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> RemoveOr<'a, 'q, Self, Q>
alloc
only.pub fn remove_entry_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> RemoveEntryOr<'a, 'q, Self, Q>
alloc
only.pub fn get<Q>(&self, query: &Q) -> Option<&V>
alloc
only.pub fn get_key_value<Q>(&self, query: &Q) -> Option<(&K, &V)>
alloc
only.pub fn get_mut<Q>(&mut self, query: &Q) -> Option<&mut V>
alloc
only.pub fn len(&self) -> NonZeroUsize
alloc
only.pub fn first_key_value(&self) -> (&K, &V)where
K: Ord,
alloc
only.pub fn first_entry(&mut self) -> OccupiedEntry<'_, K, V>where
K: Ord,
alloc
only.pub fn last_key_value(&self) -> (&K, &V)where
K: Ord,
alloc
only.pub fn last_entry(&mut self) -> OccupiedEntry<'_, K, V>where
K: Ord,
alloc
only.pub fn iter1(&self) -> Iterator1<Iter<'_, K, V>>
alloc
only.pub fn iter1_mut(&mut self) -> Iterator1<IterMut<'_, K, V>>
alloc
only.pub fn keys1(&self) -> Iterator1<Keys<'_, K, V>>
alloc
only.pub fn values1(&self) -> Iterator1<Values<'_, K, V>>
alloc
only.pub fn values1_mut(&mut self) -> Iterator1<ValuesMut<'_, K, V>>
alloc
only.pub fn contains_key<Q>(&self, query: &Q) -> bool
alloc
only.pub const fn as_btree_map(&self) -> &BTreeMap<K, V>
alloc
only.Source§impl<K, V> NonEmpty<BTreeMap<K, V>>where
K: Ord,
impl<K, V> NonEmpty<BTreeMap<K, V>>where
K: Ord,
pub fn par_iter1( &self, ) -> ParallelIterator1<<&BTreeMap<K, V> as IntoParallelIterator>::Iter>
alloc
and rayon
only.pub fn par_iter1_mut( &mut self, ) -> ParallelIterator1<<&mut BTreeMap<K, V> as IntoParallelIterator>::Iter>
alloc
and rayon
only.Source§impl<T> NonEmpty<BTreeSet<T>>
impl<T> NonEmpty<BTreeSet<T>>
Sourcepub unsafe fn from_btree_set_unchecked(items: BTreeSet<T>) -> Self
Available on crate feature alloc
only.
pub unsafe fn from_btree_set_unchecked(items: BTreeSet<T>) -> Self
alloc
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of BTreeSet::new()
.
pub fn from_one(item: T) -> Selfwhere
T: Ord,
alloc
only.pub fn from_head_and_tail<I>(head: T, tail: I) -> Selfwhere
T: Ord,
I: IntoIterator<Item = T>,
alloc
only.pub fn from_tail_and_head<I>(tail: I, head: T) -> Selfwhere
T: Ord,
I: IntoIterator<Item = T>,
alloc
only.pub fn into_btree_set(self) -> BTreeSet<T>
alloc
only.pub fn split_off_tail(&mut self) -> BTreeSet<T>
alloc
only.pub fn append(&mut self, items: &mut BTreeSet<T>)where
T: Ord,
alloc
only.pub fn insert(&mut self, item: T) -> boolwhere
T: Ord,
alloc
only.pub fn replace(&mut self, item: T) -> Option<T>where
T: Ord,
alloc
only.pub fn pop_first_or(&mut self) -> PopOr<'_, Self>where
T: Ord,
alloc
only.pub fn pop_first_until_only(&mut self) -> &Twhere
T: Ord,
alloc
only.pub fn pop_first_until_only_with<F>(&mut self, f: F) -> &T
alloc
only.pub fn pop_last_or(&mut self) -> PopOr<'_, Self>where
T: Ord,
alloc
only.pub fn pop_last_until_only(&mut self) -> &Twhere
T: Ord,
alloc
only.pub fn pop_last_until_only_with<F>(&mut self, f: F) -> &T
alloc
only.pub fn remove_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> DropRemoveOr<'a, 'q, Self, Q>
alloc
only.pub fn take_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> TakeRemoveOr<'a, 'q, Self, Q>
alloc
only.pub fn get<Q>(&self, query: &Q) -> Option<&T>
alloc
only.pub fn len(&self) -> NonZeroUsize
alloc
only.pub fn first(&self) -> &Twhere
T: Ord,
alloc
only.pub fn last(&self) -> &Twhere
T: Ord,
alloc
only.pub fn range<Q, R>(&self, range: R) -> Range<'_, T>
alloc
only.pub fn difference<'a, R>(&'a self, other: &'a R) -> Difference<'a, T>where
T: Ord,
R: ClosedBTreeSet<Item = T>,
alloc
only.pub fn symmetric_difference<'a, R>(
&'a self,
other: &'a R,
) -> SymmetricDifference<'a, T>where
T: Ord,
R: ClosedBTreeSet<Item = T>,
alloc
only.pub fn intersection<'a, R>(&'a self, other: &'a R) -> Intersection<'a, T>where
T: Ord,
R: ClosedBTreeSet<Item = T>,
alloc
only.pub fn union<'a, R>(&'a self, other: &'a R) -> Iterator1<Union<'a, T>>where
T: Ord,
R: ClosedBTreeSet<Item = T>,
alloc
only.pub fn iter1(&self) -> Iterator1<Iter<'_, T>>
alloc
only.pub fn is_disjoint<R>(&self, other: &R) -> boolwhere
T: Ord,
R: ClosedBTreeSet<Item = T>,
alloc
only.pub fn is_subset<R>(&self, other: &R) -> boolwhere
T: Ord,
R: ClosedBTreeSet<Item = T>,
alloc
only.pub fn is_superset<R>(&self, other: &R) -> boolwhere
T: Ord,
R: ClosedBTreeSet<Item = T>,
alloc
only.pub fn contains<Q>(&self, item: &Q) -> bool
alloc
only.pub const fn as_btree_set(&self) -> &BTreeSet<T>
alloc
only.Source§impl<T> NonEmpty<BTreeSet<T>>where
T: Ord,
impl<T> NonEmpty<BTreeSet<T>>where
T: Ord,
pub fn par_iter1(
&self,
) -> ParallelIterator1<<&BTreeSet<T> as IntoParallelIterator>::Iter>where
T: Sync,
alloc
and rayon
only.Source§impl<K, V> NonEmpty<Slice<K, V>>
impl<K, V> NonEmpty<Slice<K, V>>
Sourcepub const unsafe fn from_slice_unchecked(items: &Slice<K, V>) -> &Self
Available on crate feature indexmap
only.
pub const unsafe fn from_slice_unchecked(items: &Slice<K, V>) -> &Self
indexmap
only.§Safety
items
must be non-empty. For example, it is undefined behavior to call this function with
an empty slice Slice::new()
.
Sourcepub const unsafe fn from_mut_slice_unchecked(
items: &mut Slice<K, V>,
) -> &mut Self
Available on crate feature indexmap
only.
pub const unsafe fn from_mut_slice_unchecked( items: &mut Slice<K, V>, ) -> &mut Self
indexmap
only.§Safety
items
must be non-empty. For example, it is undefined behavior to call this function with
an empty slice Slice::new()
.
pub fn split_first(&self) -> ((&K, &V), &Slice<K, V>)
indexmap
only.pub fn split_last(&self) -> ((&K, &V), &Slice<K, V>)
indexmap
only.pub fn first(&self) -> (&K, &V)
indexmap
only.pub fn last(&self) -> (&K, &V)
indexmap
only.pub fn iter1(&self) -> Iterator1<Iter<'_, K, V>>
indexmap
only.pub const fn len(&self) -> NonZeroUsize
indexmap
only.Source§impl<K, V, S> NonEmpty<IndexMap<K, V, S>>
impl<K, V, S> NonEmpty<IndexMap<K, V, S>>
Sourcepub unsafe fn from_index_map_unchecked(items: IndexMap<K, V, S>) -> Self
Available on crate feature indexmap
only.
pub unsafe fn from_index_map_unchecked(items: IndexMap<K, V, S>) -> Self
indexmap
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of IndexMap::new()
.
pub fn into_index_map(self) -> IndexMap<K, V, S>
indexmap
only.pub fn into_boxed_slice1(self) -> Box<Slice1<K, V>>
indexmap
only.pub fn into_keys1(self) -> Iterator1<IntoKeys<K, V>>
indexmap
only.pub fn into_values1(self) -> Iterator1<IntoValues<K, V>>
indexmap
only.pub fn sorted_by<F>(self, f: F) -> Iterator1<IntoIter<K, V>>
indexmap
only.pub fn sorted_unstable_by<F>(self, f: F) -> Iterator1<IntoIter<K, V>>
indexmap
only.pub fn split_off_tail(&mut self) -> IndexMap<K, V, S>where
S: Clone,
indexmap
only.pub fn reverse(&mut self)
indexmap
only.pub fn sort_keys(&mut self)where
K: Ord,
indexmap
only.pub fn sort_unstable_keys(&mut self)where
K: Ord,
indexmap
only.pub fn sort_by<F>(&mut self, f: F)
indexmap
only.pub fn sort_unstable_by<F>(&mut self, f: F)
indexmap
only.pub fn sort_by_cached_key<T, F>(&mut self, f: F)
indexmap
only.pub fn move_index(&mut self, from: usize, to: usize)
indexmap
only.pub fn swap_indices(&mut self, a: usize, b: usize)
indexmap
only.pub fn get_index(&self, index: usize) -> Option<(&K, &V)>
indexmap
only.pub fn get_index_mut(&mut self, index: usize) -> Option<(&K, &mut V)>
indexmap
only.pub fn get_index_entry( &mut self, index: usize, ) -> Option<IndexedEntry<'_, K, V>>
indexmap
only.pub fn get_range<R>(&self, range: R) -> Option<&Slice<K, V>>where
R: RangeBounds<usize>,
indexmap
only.pub fn get_range_mut<R>(&mut self, range: R) -> Option<&mut Slice<K, V>>where
R: RangeBounds<usize>,
indexmap
only.pub fn binary_search_keys(&self, key: &K) -> Result<usize, usize>where
K: Ord,
indexmap
only.pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
indexmap
only.pub fn binary_search_by_key<'a, Q, F>( &'a self, query: &Q, f: F, ) -> Result<usize, usize>
indexmap
only.pub fn partition_point<F>(&self, f: F) -> usize
indexmap
only.pub fn iter1(&self) -> Iterator1<Iter<'_, K, V>>
indexmap
only.pub fn iter1_mut(&mut self) -> Iterator1<IterMut<'_, K, V>>
indexmap
only.pub fn keys1(&self) -> Iterator1<Keys<'_, K, V>>
indexmap
only.pub fn values1(&self) -> Iterator1<Values<'_, K, V>>
indexmap
only.pub fn values1_mut(&mut self) -> Iterator1<ValuesMut<'_, K, V>>
indexmap
only.pub fn len(&self) -> NonZeroUsize
indexmap
only.pub fn capacity(&self) -> NonZeroUsize
indexmap
only.pub fn hasher(&self) -> &S
indexmap
only.pub const fn as_index_map(&self) -> &IndexMap<K, V, S>
indexmap
only.pub fn as_slice1(&self) -> &Slice1<K, V>
indexmap
only.pub fn as_mut_slice1(&mut self) -> &mut Slice1<K, V>
indexmap
only.Source§impl<K, V, S> NonEmpty<IndexMap<K, V, S>>where
S: BuildHasher,
impl<K, V, S> NonEmpty<IndexMap<K, V, S>>where
S: BuildHasher,
pub fn pop_or(&mut self) -> PopOr<'_, Self>
indexmap
only.pub fn shift_remove_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> RemoveOr<'a, 'q, Self, Q>
indexmap
only.pub fn swap_remove_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> RemoveOr<'a, 'q, Self, Q>
indexmap
only.pub fn shift_remove_entry_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> RemoveEntryOr<'a, 'q, Self, Q>
indexmap
only.pub fn swap_remove_entry_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> RemoveEntryOr<'a, 'q, Self, Q>
indexmap
only.pub fn get<Q>(&self, query: &Q) -> Option<&V>
indexmap
only.pub fn get_mut<Q>(&mut self, query: &Q) -> Option<&mut V>
indexmap
only.pub fn get_key_value<Q>(&self, query: &Q) -> Option<(&K, &V)>
indexmap
only.pub fn get_full<Q>(&self, query: &Q) -> Option<(usize, &K, &V)>
indexmap
only.pub fn get_full_mut<Q>(&mut self, query: &Q) -> Option<(usize, &K, &mut V)>
indexmap
only.pub fn get_index_of<Q>(&self, query: &Q) -> Option<usize>
indexmap
only.pub fn first(&self) -> (&K, &V)
indexmap
only.pub fn first_mut(&mut self) -> (&K, &mut V)
indexmap
only.pub fn first_entry(&mut self) -> IndexedEntry<'_, K, V>
indexmap
only.pub fn last(&self) -> (&K, &V)
indexmap
only.pub fn last_mut(&mut self) -> (&K, &mut V)
indexmap
only.pub fn last_entry(&mut self) -> IndexedEntry<'_, K, V>
indexmap
only.pub fn contains_key<Q>(&self, query: &Q) -> bool
indexmap
only.Source§impl<K, V, S> NonEmpty<IndexMap<K, V, S>>
impl<K, V, S> NonEmpty<IndexMap<K, V, S>>
pub fn from_one(item: (K, V)) -> Selfwhere
S: Default,
indexmap
only.pub fn from_one_with_hasher(item: (K, V), hasher: S) -> Self
indexmap
only.pub fn from_iter1_with_hasher<I>(items: I, hasher: S) -> Selfwhere
I: IntoIterator1<Item = (K, V)>,
indexmap
only.pub fn from_head_and_tail<I>(head: (K, V), tail: I) -> Self
indexmap
only.pub fn from_tail_and_head<I>(tail: I, head: (K, V)) -> Self
indexmap
only.pub fn append<SR>(&mut self, items: &mut IndexMap<K, V, SR>)
indexmap
only.pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
indexmap
only.pub fn insert(&mut self, key: K, value: V) -> Option<V>
indexmap
only.pub fn insert_full(&mut self, key: K, value: V) -> (usize, Option<V>)
indexmap
only.pub fn insert_sorted(&mut self, key: K, value: V) -> (usize, Option<V>)where
K: Ord,
indexmap
only.pub fn insert_before( &mut self, index: usize, key: K, value: V, ) -> (usize, Option<V>)
indexmap
only.pub fn shift_insert(&mut self, index: usize, key: K, value: V) -> Option<V>
indexmap
only.Source§impl<K, V, S> NonEmpty<IndexMap<K, V, S>>
impl<K, V, S> NonEmpty<IndexMap<K, V, S>>
pub fn par_sorted_by<F>(self, f: F) -> ParallelIterator1<IntoParIter<K, V>>
indexmap
and rayon
only.pub fn par_sorted_unstable_by<F>( self, f: F, ) -> ParallelIterator1<IntoParIter<K, V>>
indexmap
and rayon
only.pub fn par_sort_keys(&mut self)
indexmap
and rayon
only.pub fn par_sort_unstable_keys(&mut self)
indexmap
and rayon
only.pub fn par_sort_by<F>(&mut self, f: F)
indexmap
and rayon
only.pub fn par_sort_unstable_by<F>(&mut self, f: F)
indexmap
and rayon
only.pub fn par_sort_by_cached_key<T, F>(&mut self, f: F)
indexmap
and rayon
only.pub fn par_iter1( &self, ) -> ParallelIterator1<<&IndexMap<K, V> as IntoParallelIterator>::Iter>
indexmap
and rayon
only.pub fn par_iter1_mut( &mut self, ) -> ParallelIterator1<<&mut IndexMap<K, V> as IntoParallelIterator>::Iter>
indexmap
and rayon
only.pub fn par_keys1(&self) -> ParallelIterator1<ParKeys<'_, K, V>>
indexmap
and rayon
only.pub fn par_values1(&self) -> ParallelIterator1<ParValues<'_, K, V>>
indexmap
and rayon
only.pub fn par_values1_mut(&mut self) -> ParallelIterator1<ParValuesMut<'_, K, V>>
indexmap
and rayon
only.pub fn par_eq<R>(&self, other: &R) -> boolwhere
K: Eq + Hash + Sync,
V: PartialEq<R::Value> + Sync,
S: BuildHasher,
R: ClosedIndexMap<Key = K>,
R::Value: Sync,
R::State: BuildHasher + Sync,
indexmap
and rayon
only.Source§impl<T> NonEmpty<Slice<T>>
impl<T> NonEmpty<Slice<T>>
Sourcepub const unsafe fn from_slice_unchecked(items: &Slice<T>) -> &Self
Available on crate feature indexmap
only.
pub const unsafe fn from_slice_unchecked(items: &Slice<T>) -> &Self
indexmap
only.§Safety
items
must be non-empty. For example, it is undefined behavior to call this function with
an empty slice Slice::new()
.
pub fn split_first(&self) -> (&T, &Slice<T>)
indexmap
only.pub fn split_last(&self) -> (&T, &Slice<T>)
indexmap
only.pub fn first(&self) -> &T
indexmap
only.pub fn last(&self) -> &T
indexmap
only.pub fn iter1(&self) -> Iterator1<Iter<'_, T>>
indexmap
only.pub const fn len(&self) -> NonZeroUsize
indexmap
only.Source§impl<T, S> NonEmpty<IndexSet<T, S>>
impl<T, S> NonEmpty<IndexSet<T, S>>
Sourcepub unsafe fn from_index_set_unchecked(items: IndexSet<T, S>) -> Self
Available on crate feature indexmap
only.
pub unsafe fn from_index_set_unchecked(items: IndexSet<T, S>) -> Self
indexmap
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of IndexSet::new()
.
pub fn into_index_set(self) -> IndexSet<T, S>
indexmap
only.pub fn into_boxed_slice1(self) -> Box<Slice1<T>>
indexmap
only.pub fn reserve(&mut self, additional: usize)
indexmap
only.pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>
indexmap
only.pub fn reserve_exact(&mut self, additional: usize)
indexmap
only.pub fn try_reserve_exact( &mut self, additional: usize, ) -> Result<(), TryReserveError>
indexmap
only.pub fn shrink_to(&mut self, capacity: usize)
indexmap
only.pub fn shrink_to_fit(&mut self)
indexmap
only.pub fn sort(&mut self)where
T: Ord,
indexmap
only.pub fn sort_by<F>(&mut self, f: F)
indexmap
only.pub fn sorted_by<F>(self, f: F) -> Iterator1<IntoIter<T>>
indexmap
only.pub fn sort_unstable(&mut self)where
T: Ord,
indexmap
only.pub fn sort_unstable_by<F>(&mut self, f: F)
indexmap
only.pub fn sorted_unstable_by<F>(self, f: F) -> Iterator1<IntoIter<T>>
indexmap
only.pub fn sort_by_cached_key<K, F>(&mut self, f: F)
indexmap
only.pub fn reverse(&mut self)
indexmap
only.pub fn split_off_tail(&mut self) -> IndexSet<T, S>where
S: Clone,
indexmap
only.pub fn move_index(&mut self, from: usize, to: usize)
indexmap
only.pub fn swap_indices(&mut self, a: usize, b: usize)
indexmap
only.pub fn pop_or(&mut self) -> PopOr<'_, Self>
indexmap
only.pub fn shift_remove_index_or(&mut self, index: usize) -> TakeRemoveOr<'_, Self>
indexmap
only.pub fn swap_remove_index_or(&mut self, index: usize) -> TakeRemoveOr<'_, Self>
indexmap
only.pub fn get_index(&self, index: usize) -> Option<&T>
indexmap
only.pub fn get_range<R>(&self, range: R) -> Option<&Slice<T>>where
R: RangeBounds<usize>,
indexmap
only.pub fn binary_search(&self, query: &T) -> Result<usize, usize>where
T: Ord,
indexmap
only.pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
indexmap
only.pub fn binary_search_by_key<'a, K, F>( &'a self, key: &K, f: F, ) -> Result<usize, usize>
indexmap
only.pub fn partition_point<F>(&self, f: F) -> usize
indexmap
only.pub fn first(&self) -> &T
indexmap
only.pub fn last(&self) -> &T
indexmap
only.pub fn len(&self) -> NonZeroUsize
indexmap
only.pub fn capacity(&self) -> NonZeroUsize
indexmap
only.pub fn iter1(&self) -> Iterator1<Iter<'_, T>>
indexmap
only.pub fn hasher(&self) -> &S
indexmap
only.pub const fn as_index_set(&self) -> &IndexSet<T, S>
indexmap
only.pub fn as_slice1(&self) -> &Slice1<T>
indexmap
only.Source§impl<T, S> NonEmpty<IndexSet<T, S>>where
S: BuildHasher,
impl<T, S> NonEmpty<IndexSet<T, S>>where
S: BuildHasher,
pub fn get<Q>(&self, query: &Q) -> Option<&T>
indexmap
only.pub fn shift_remove_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> DropRemoveOr<'a, 'q, Self, Q>
indexmap
only.pub fn swap_remove_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> DropRemoveOr<'a, 'q, Self, Q>
indexmap
only.pub fn shift_remove_full_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> TakeRemoveFullOr<'a, 'q, Self, Q>
indexmap
only.pub fn swap_remove_full_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> TakeRemoveFullOr<'a, 'q, Self, Q>
indexmap
only.pub fn shift_take_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> TakeRemoveOr<'a, Self, &'q Q>
indexmap
only.pub fn swap_take_or<'a, 'q, Q>( &'a mut self, query: &'q Q, ) -> TakeRemoveOr<'a, Self, &'q Q>
indexmap
only.pub fn contains<Q>(&self, item: &Q) -> bool
indexmap
only.Source§impl<T, S> NonEmpty<IndexSet<T, S>>
impl<T, S> NonEmpty<IndexSet<T, S>>
pub fn from_one(item: T) -> Selfwhere
S: Default,
indexmap
only.pub fn from_one_with_hasher(item: T, hasher: S) -> Self
indexmap
only.pub fn from_iter1_with_hasher<U>(items: U, hasher: S) -> Selfwhere
U: IntoIterator1<Item = T>,
indexmap
only.pub fn from_head_and_tail<I>(head: T, tail: I) -> Selfwhere
S: Default,
I: IntoIterator<Item = T>,
indexmap
only.pub fn from_tail_and_head<I>(tail: I, head: T) -> Selfwhere
S: Default,
I: IntoIterator<Item = T>,
indexmap
only.pub fn append<SR>(&mut self, items: &mut IndexSet<T, SR>)
indexmap
only.pub fn insert(&mut self, item: T) -> bool
indexmap
only.pub fn insert_full(&mut self, item: T) -> (usize, bool)
indexmap
only.pub fn insert_sorted(&mut self, item: T) -> (usize, bool)where
T: Ord,
indexmap
only.pub fn replace(&mut self, item: T) -> Option<T>
indexmap
only.pub fn replace_full(&mut self, item: T) -> (usize, Option<T>)
indexmap
only.pub fn difference<'a, R, SR>(&'a self, other: &'a R) -> Difference<'a, T, SR>where
R: ClosedIndexSet<Item = T, State = SR>,
SR: BuildHasher,
indexmap
only.pub fn symmetric_difference<'a, R, SR>(
&'a self,
other: &'a R,
) -> SymmetricDifference<'a, T, S, SR>where
R: ClosedIndexSet<Item = T, State = SR>,
SR: BuildHasher,
indexmap
only.pub fn intersection<'a, R, SR>(
&'a self,
other: &'a R,
) -> Intersection<'a, T, SR>where
R: ClosedIndexSet<Item = T, State = SR>,
SR: BuildHasher,
indexmap
only.pub fn union<'a, R, SR>(&'a self, other: &'a R) -> Iterator1<Union<'a, T, S>>where
R: ClosedIndexSet<Item = T, State = SR>,
SR: 'a + BuildHasher,
indexmap
only.pub fn is_disjoint<R, SR>(&self, other: &R) -> boolwhere
R: ClosedIndexSet<Item = T, State = SR>,
SR: BuildHasher,
indexmap
only.pub fn is_subset<R, SR>(&self, other: &R) -> boolwhere
R: ClosedIndexSet<Item = T, State = SR>,
SR: BuildHasher,
indexmap
only.pub fn is_superset<R, SR>(&self, other: &R) -> boolwhere
R: ClosedIndexSet<Item = T, State = SR>,
SR: BuildHasher,
indexmap
only.Source§impl<T, S> NonEmpty<IndexSet<T, S>>
impl<T, S> NonEmpty<IndexSet<T, S>>
pub fn par_iter1( &self, ) -> ParallelIterator1<<&IndexSet<T, S> as IntoParallelIterator>::Iter>
indexmap
and rayon
only.Source§impl<T, S> NonEmpty<IndexSet<T, S>>
impl<T, S> NonEmpty<IndexSet<T, S>>
pub fn par_difference<'a, R, SR>( &'a self, other: &'a R, ) -> ParDifference<'a, T, S, SR>
indexmap
and rayon
only.pub fn par_symmetric_difference<'a, R, SR>( &'a self, other: &'a R, ) -> ParSymmetricDifference<'a, T, S, SR>
indexmap
and rayon
only.pub fn par_intersection<'a, R, SR>( &'a self, other: &'a R, ) -> ParIntersection<'a, T, S, SR>
indexmap
and rayon
only.pub fn par_union<'a, R, SR>( &'a self, other: &'a R, ) -> ParallelIterator1<ParUnion<'a, T, S, SR>>
indexmap
and rayon
only.pub fn par_eq<R, SR>(&self, other: &R) -> bool
indexmap
and rayon
only.pub fn par_is_disjoint<R, SR>(&self, other: &R) -> bool
indexmap
and rayon
only.pub fn par_is_subset<R, SR>(&self, other: &R) -> bool
indexmap
and rayon
only.pub fn par_is_superset<R, SR>(&self, other: &R) -> bool
indexmap
and rayon
only.Source§impl<T, S> NonEmpty<IndexSet<T, S>>
impl<T, S> NonEmpty<IndexSet<T, S>>
pub fn par_sort(&mut self)where
T: Ord,
indexmap
and rayon
only.pub fn par_sort_by<F>(&mut self, f: F)
indexmap
and rayon
only.pub fn par_sorted_by<F>(self, f: F) -> ParallelIterator1<IntoParIter<T>>
indexmap
and rayon
only.pub fn par_sort_unstable(&mut self)where
T: Ord,
indexmap
and rayon
only.pub fn par_sort_unstable_by<F>(&mut self, f: F)
indexmap
and rayon
only.pub fn par_sorted_unstable_by<F>( self, f: F, ) -> ParallelIterator1<IntoParIter<T>>
indexmap
and rayon
only.pub fn par_sort_by_cached_key<K, F>(&mut self, f: F)
indexmap
and rayon
only.Source§impl<T> NonEmpty<IndexSet<T>>
impl<T> NonEmpty<IndexSet<T>>
pub fn from_one_with_capacity(item: T, capacity: usize) -> Self
indexmap
and std
only.pub fn from_iter1_with_capacity<U>(items: U, capacity: usize) -> Selfwhere
U: IntoIterator1<Item = T>,
indexmap
and std
only.Source§impl<T> NonEmpty<[T]>
impl<T> NonEmpty<[T]>
Sourcepub const unsafe fn from_slice_unchecked(items: &[T]) -> &Self
pub const unsafe fn from_slice_unchecked(items: &[T]) -> &Self
§Safety
items
must be non-empty. For example, it is undefined behavior to call this function with
an empty slice literal &[]
.
Sourcepub const unsafe fn from_mut_slice_unchecked(items: &mut [T]) -> &mut Self
pub const unsafe fn from_mut_slice_unchecked(items: &mut [T]) -> &mut Self
§Safety
items
must be non-empty. For example, it is undefined behavior to call this function with
an empty slice literal &mut []
.
pub fn try_from_slice(items: &[T]) -> Result<&Self, &[T]>
pub fn try_from_mut_slice(items: &mut [T]) -> Result<&mut Self, &mut [T]>
pub fn to_vec1(&self) -> Vec1<T> ⓘwhere
T: Clone,
alloc
only.pub fn into_vec1(self: BoxedSlice1<T>) -> Vec1<T> ⓘ
alloc
only.pub fn once_and_then_repeat(&self, n: usize) -> Vec1<T> ⓘwhere
T: Copy,
alloc
only.pub const fn split_first(&self) -> (&T, &[T])
pub const fn split_first_mut(&mut self) -> (&mut T, &mut [T])
pub const fn first(&self) -> &T
pub const fn first_mut(&mut self) -> &mut T
pub const fn last(&self) -> &T
pub const fn last_mut(&mut self) -> &mut T
pub fn chunks(&self, n: usize) -> Iterator1<Chunks<'_, T>>
pub fn chunks_mut(&mut self, n: usize) -> Iterator1<ChunksMut<'_, T>>
pub fn rchunks(&self, n: usize) -> Iterator1<RChunks<'_, T>>
pub fn rchunks_mut(&mut self, n: usize) -> Iterator1<RChunksMut<'_, T>>
pub fn iter1(&self) -> Iterator1<Iter<'_, T>>
pub fn iter1_mut(&mut self) -> Iterator1<IterMut<'_, T>>
pub const fn len(&self) -> NonZeroUsize
pub const fn as_slice(&self) -> &[T]
pub const fn as_mut_slice(&mut self) -> &mut [T]
Source§impl<T> NonEmpty<[T]>
impl<T> NonEmpty<[T]>
pub fn par_iter1(
&self,
) -> ParallelIterator1<<&[T] as IntoParallelIterator>::Iter>where
T: Sync,
rayon
only.pub fn par_iter1_mut(
&mut self,
) -> ParallelIterator1<<&mut [T] as IntoParallelIterator>::Iter>where
T: Send,
rayon
only.Source§impl<A, T> NonEmpty<SmallVec<A>>where
A: Array<Item = T>,
impl<A, T> NonEmpty<SmallVec<A>>where
A: Array<Item = T>,
Sourcepub unsafe fn from_small_vec_unchecked(items: SmallVec<A>) -> Self
Available on crate feature smallvec
only.
pub unsafe fn from_small_vec_unchecked(items: SmallVec<A>) -> Self
smallvec
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of SmallVec::new()
.
pub fn from_one(item: T) -> Self
smallvec
only.pub fn from_one_with_capacity(item: T, capacity: usize) -> Self
smallvec
only.pub fn from_iter1_with_capacity<U>(items: U, capacity: usize) -> Selfwhere
U: IntoIterator1<Item = T>,
smallvec
only.pub fn from_head_and_tail<I>(head: T, tail: I) -> Selfwhere
I: IntoIterator<Item = T>,
smallvec
only.pub fn from_tail_and_head<I>(tail: I, head: T) -> Selfwhere
I: IntoIterator<Item = T>,
smallvec
only.pub fn into_head_and_tail(self) -> (T, SmallVec<A>)
smallvec
only.pub fn into_tail_and_head(self) -> (SmallVec<A>, T)
smallvec
only.pub fn into_small_vec(self) -> SmallVec<A>
smallvec
only.pub fn try_into_array(self) -> Result<A, Self>
smallvec
only.pub fn into_boxed_slice1(self) -> BoxedSlice1<T>
smallvec
only.pub fn reserve(&mut self, additional: usize)
smallvec
only.pub fn reserve_exact(&mut self, additional: usize)
smallvec
only.pub fn shrink_to_fit(&mut self)
smallvec
only.pub fn append(&mut self, items: &mut SmallVec<A>)
smallvec
only.pub fn extend_from_slice(&mut self, items: &[T])where
T: Copy,
smallvec
only.pub fn push(&mut self, item: T)
smallvec
only.pub fn pop_or(&mut self) -> PopOr<'_, Self>
smallvec
only.pub fn insert(&mut self, index: usize, item: T)
smallvec
only.pub fn insert_from_slice(&mut self, index: usize, items: &[T])where
T: Copy,
smallvec
only.pub fn remove_or(&mut self, index: usize) -> RemoveOr<'_, Self>
smallvec
only.pub fn swap_remove_or(&mut self, index: usize) -> RemoveOr<'_, Self>
smallvec
only.pub fn dedup(&mut self)where
T: PartialEq,
smallvec
only.pub fn dedup_by<F>(&mut self, f: F)
smallvec
only.pub fn dedup_by_key<K, F>(&mut self, f: F)
smallvec
only.pub fn len(&self) -> NonZeroUsize
smallvec
only.pub fn capacity(&self) -> NonZeroUsize
smallvec
only.pub fn inline_size(&self) -> usize
smallvec
only.pub const fn as_small_vec(&self) -> &SmallVec<A>
smallvec
only.pub fn as_slice1(&self) -> &Slice1<T>
smallvec
only.pub fn as_mut_slice1(&mut self) -> &mut Slice1<T>
smallvec
only.pub fn as_ptr(&self) -> *const T
smallvec
only.pub fn as_mut_ptr(&mut self) -> *mut T
smallvec
only.pub fn spilled(&self) -> bool
smallvec
only.Source§impl<A> NonEmpty<SmallVec<A>>
impl<A> NonEmpty<SmallVec<A>>
pub fn from_buf(buf: A) -> Self
smallvec
only.pub fn from_buf_and_tail_len(buf: A, len: usize) -> Self
smallvec
only.Source§impl NonEmpty<str>
impl NonEmpty<str>
Sourcepub const unsafe fn from_str_unchecked(items: &str) -> &Self
pub const unsafe fn from_str_unchecked(items: &str) -> &Self
§Safety
items
must be non-empty. For example, it is unsound to call this function with an empty
string literal ""
.
Sourcepub const unsafe fn from_mut_str_unchecked(items: &mut str) -> &mut Self
pub const unsafe fn from_mut_str_unchecked(items: &mut str) -> &mut Self
§Safety
items
must be non-empty. For example, it is unsound to call this function with an empty
string literal ""
.
pub fn try_from_str(items: &str) -> Result<&Self, &str>
pub fn try_from_mut_str(items: &mut str) -> Result<&mut Self, &mut str>
pub fn to_string1(&self) -> String1
alloc
only.pub fn into_string1(self: BoxedStr1) -> String1
alloc
only.pub fn once_and_then_repeat(&self, n: usize) -> String1
alloc
only.pub fn encode1_utf16(&self) -> Iterator1<EncodeUtf16<'_>>
pub fn split1<'a, P>( &'a self, separator: &'a P, ) -> Iterator1<Split<'a, &'a [char]>>
pub fn split1_inclusive<'a, P>( &'a self, separator: &'a P, ) -> Iterator1<SplitInclusive<'a, &'a [char]>>
pub fn split1_terminator<'a, P>( &'a self, separator: &'a P, ) -> Iterator1<SplitTerminator<'a, &'a [char]>>
pub fn chars1(&self) -> Iterator1<Chars<'_>>
pub fn char_indices1(&self) -> Iterator1<CharIndices<'_>>
pub fn bytes1(&self) -> Iterator1<Bytes<'_>>
pub fn lines1(&self) -> Iterator1<Lines<'_>>
pub const fn len(&self) -> NonZeroUsize
pub const fn as_bytes1(&self) -> &Slice1<u8>
pub const fn as_bytes1_mut(&mut self) -> &mut Slice1<u8>
pub const fn as_str(&self) -> &str
pub const fn as_mut_str(&mut self) -> &mut str
Source§impl NonEmpty<str>
impl NonEmpty<str>
pub fn par_encode1_utf16(&self) -> ParallelIterator1<EncodeUtf16<'_>>
rayon
only.pub fn par_split1<'a, P>( &'a self, separator: &'a P, ) -> ParallelIterator1<Split<'a, &'a [char]>>
rayon
only.pub fn par_split1_inclusive<'a, P>( &'a self, separator: &'a P, ) -> ParallelIterator1<SplitInclusive<'a, &'a [char]>>
rayon
only.pub fn par_split1_terminator<'a, P>( &'a self, separator: &'a P, ) -> ParallelIterator1<SplitTerminator<'a, &'a [char]>>
rayon
only.pub fn par_chars1(&self) -> ParallelIterator1<Chars<'_>>
rayon
only.pub fn par_char_indices1(&self) -> ParallelIterator1<CharIndices<'_>>
rayon
only.pub fn par_bytes1(&self) -> ParallelIterator1<Bytes<'_>>
rayon
only.pub fn par_lines1(&self) -> ParallelIterator1<Lines<'_>>
rayon
only.Source§impl NonEmpty<String>
impl NonEmpty<String>
Sourcepub unsafe fn from_string_unchecked(items: String) -> Self
Available on crate feature alloc
only.
pub unsafe fn from_string_unchecked(items: String) -> Self
alloc
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of Vec::new()
.
pub fn from_one_with_capacity<U>(item: char, capacity: usize) -> Self
alloc
only.pub fn from_iter1_with_capacity<U>(items: U, capacity: usize) -> Self
alloc
only.pub fn from_utf8(items: Vec1<u8>) -> Result<Self, FromUtf8Error>
alloc
only.pub fn from_utf8_lossy(items: &Slice1<u8>) -> CowStr1<'_>
alloc
only.pub fn from_utf16(items: &Slice1<u16>) -> Result<Self, FromUtf16Error>
alloc
only.pub fn from_utf16_lossy(items: &Slice1<u16>) -> String1
alloc
only.pub fn into_string(self) -> String
alloc
only.pub fn into_boxed_str1(self) -> BoxedStr1
alloc
only.pub fn leak<'a>(self) -> &'a mut Str1
alloc
only.pub fn reserve(&mut self, additional: usize)
alloc
only.pub fn reserve_exact(&mut self, additional: usize)
alloc
only.pub fn shrink_to(&mut self, capacity: usize)
alloc
only.pub fn shrink_to_fit(&mut self)
alloc
only.pub fn split_off_tail(&mut self) -> String
alloc
only.pub fn push(&mut self, item: char)
alloc
only.pub fn push_str(&mut self, items: &str)
alloc
only.pub fn pop_or(&mut self) -> PopOr<'_>
alloc
only.pub fn insert(&mut self, index: usize, item: char)
alloc
only.pub fn remove_or(&mut self, index: usize) -> RemoveOr<'_>
alloc
only.pub fn len(&self) -> NonZeroUsize
alloc
only.pub fn capacity(&self) -> NonZeroUsize
alloc
only.pub const fn as_string(&self) -> &String
alloc
only.Sourcepub unsafe fn as_mut_vec1(&mut self) -> &mut Vec1<u8> ⓘ
Available on crate feature alloc
only.
pub unsafe fn as_mut_vec1(&mut self) -> &mut Vec1<u8> ⓘ
alloc
only.pub fn as_str1(&self) -> &Str1
alloc
only.pub fn as_mut_str1(&mut self) -> &mut Str1
alloc
only.pub fn as_ptr(&self) -> *const u8
alloc
only.pub fn as_mut_ptr(&mut self) -> *mut u8
alloc
only.Source§impl<T> NonEmpty<Vec<T>>
impl<T> NonEmpty<Vec<T>>
Sourcepub unsafe fn from_vec_unchecked(items: Vec<T>) -> Self
Available on crate feature alloc
only.
pub unsafe fn from_vec_unchecked(items: Vec<T>) -> Self
alloc
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of Vec::new()
.
pub fn from_one(item: T) -> Self
alloc
only.pub fn from_one_with_capacity(item: T, capacity: usize) -> Self
alloc
only.pub fn from_iter1_with_capacity<U>(items: U, capacity: usize) -> Selfwhere
U: IntoIterator1<Item = T>,
alloc
only.pub fn from_head_and_tail<I>(head: T, tail: I) -> Selfwhere
I: IntoIterator<Item = T>,
alloc
only.pub fn from_tail_and_head<I>(tail: I, head: T) -> Selfwhere
I: IntoIterator<Item = T>,
alloc
only.pub fn into_head_and_tail(self) -> (T, Vec<T>)
alloc
only.pub fn into_tail_and_head(self) -> (Vec<T>, T)
alloc
only.pub fn into_vec(self) -> Vec<T>
alloc
only.pub fn into_boxed_slice1(self) -> BoxedSlice1<T>
alloc
only.pub fn leak<'a>(self) -> &'a mut Slice1<T>
alloc
only.pub fn reserve(&mut self, additional: usize)
alloc
only.pub fn reserve_exact(&mut self, additional: usize)
alloc
only.pub fn shrink_to(&mut self, capacity: usize)
alloc
only.pub fn shrink_to_fit(&mut self)
alloc
only.pub fn split_off_tail(&mut self) -> Vec<T>
alloc
only.pub fn append(&mut self, items: &mut Vec<T>)
alloc
only.pub fn extend_from_slice(&mut self, items: &[T])where
T: Clone,
alloc
only.pub fn extend_from_within<R>(&mut self, range: R)
alloc
only.pub fn push(&mut self, item: T)
alloc
only.pub fn pop_or(&mut self) -> PopOr<'_, Self>
alloc
only.pub fn insert(&mut self, index: usize, item: T)
alloc
only.pub fn remove_or(&mut self, index: usize) -> RemoveOr<'_, Self>
alloc
only.pub fn swap_remove_or(&mut self, index: usize) -> RemoveOr<'_, Self>
alloc
only.pub fn dedup(&mut self)where
T: PartialEq,
alloc
only.pub fn dedup_by<F>(&mut self, f: F)
alloc
only.pub fn dedup_by_key<K, F>(&mut self, f: F)
alloc
only.pub fn len(&self) -> NonZeroUsize
alloc
only.pub fn capacity(&self) -> NonZeroUsize
alloc
only.pub const fn as_vec(&self) -> &Vec<T>
alloc
only.pub fn as_slice1(&self) -> &Slice1<T>
alloc
only.pub fn as_mut_slice1(&mut self) -> &mut Slice1<T>
alloc
only.pub fn as_ptr(&self) -> *const T
alloc
only.pub fn as_mut_ptr(&mut self) -> *mut T
alloc
only.Source§impl<T, const N: usize> NonEmpty<Vec<[T; N]>>
impl<T, const N: usize> NonEmpty<Vec<[T; N]>>
pub fn into_flattened(self) -> Vec1<T> ⓘ
alloc
only.Source§impl<T> NonEmpty<VecDeque<T>>
impl<T> NonEmpty<VecDeque<T>>
Sourcepub unsafe fn from_vec_deque_unchecked(items: VecDeque<T>) -> Self
Available on crate feature alloc
only.
pub unsafe fn from_vec_deque_unchecked(items: VecDeque<T>) -> Self
alloc
only.§Safety
items
must be non-empty. For example, it is unsound to call this function with the
immediate output of VecDeque::new()
.
pub fn from_one(item: T) -> Self
alloc
only.pub fn from_one_with_capacity(item: T, capacity: usize) -> Self
alloc
only.pub fn from_iter1_with_capacity<U>(items: U, capacity: usize) -> Selfwhere
U: IntoIterator1<Item = T>,
alloc
only.pub fn from_head_and_tail<I>(head: T, tail: I) -> Selfwhere
I: IntoIterator<Item = T>,
alloc
only.pub fn from_tail_and_head<I>(tail: I, head: T) -> Selfwhere
I: IntoIterator<Item = T>,
alloc
only.pub fn into_vec_deque(self) -> VecDeque<T>
alloc
only.pub fn shrink_to(&mut self, capacity: usize)
alloc
only.pub fn shrink_to_fit(&mut self)
alloc
only.pub fn make_contiguous(&mut self) -> &mut Slice1<T>
alloc
only.pub fn rotate_left(&mut self, n: usize)
alloc
only.pub fn rotate_right(&mut self, n: usize)
alloc
only.pub fn split_off_tail(&mut self) -> VecDeque<T>
alloc
only.pub fn append(&mut self, items: &mut VecDeque<T>)
alloc
only.pub fn push_front(&mut self, item: T)
alloc
only.pub fn push_back(&mut self, item: T)
alloc
only.pub fn pop_front_or(&mut self) -> PopOr<'_, Self>
alloc
only.pub fn pop_back_or(&mut self) -> PopOr<'_, Self>
alloc
only.pub fn insert(&mut self, index: usize, item: T)
alloc
only.pub fn remove_or(&mut self, index: usize) -> RemoveOr<'_, Self>
alloc
only.pub fn swap_remove_front_or(&mut self, index: usize) -> RemoveOr<'_, Self>
alloc
only.pub fn swap_remove_back_or(&mut self, index: usize) -> RemoveOr<'_, Self>
alloc
only.pub fn get(&self, index: usize) -> Option<&T>
alloc
only.pub fn get_mut(&mut self, index: usize) -> Option<&mut T>
alloc
only.pub fn len(&self) -> NonZeroUsize
alloc
only.pub fn capacity(&self) -> NonZeroUsize
alloc
only.pub fn front(&self) -> &T
alloc
only.pub fn front_mut(&mut self) -> &mut T
alloc
only.pub fn back(&self) -> &T
alloc
only.pub fn back_mut(&mut self) -> &mut T
alloc
only.pub fn iter1(&self) -> Iterator1<Iter<'_, T>>
alloc
only.pub fn iter1_mut(&mut self) -> Iterator1<IterMut<'_, T>>
alloc
only.pub const fn as_vec_deque(&self) -> &VecDeque<T>
alloc
only.Source§impl<T> NonEmpty<VecDeque<T>>
impl<T> NonEmpty<VecDeque<T>>
pub fn par_iter1(
&self,
) -> ParallelIterator1<<&VecDeque<T> as IntoParallelIterator>::Iter>where
T: Sync,
alloc
and rayon
only.pub fn par_iter1_mut(
&mut self,
) -> ParallelIterator1<<&mut VecDeque<T> as IntoParallelIterator>::Iter>where
T: Send,
alloc
and rayon
only.Trait Implementations§
Source§impl<T, const N: usize> AsMut<NonEmpty<[T]>> for ArrayVec1<T, N>
Available on crate feature arrayvec
only.
impl<T, const N: usize> AsMut<NonEmpty<[T]>> for ArrayVec1<T, N>
arrayvec
only.Source§impl<A, T> AsMut<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
Available on crate feature smallvec
only.
impl<A, T> AsMut<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
smallvec
only.Source§impl<T, const N: usize> AsRef<NonEmpty<[T]>> for ArrayVec1<T, N>
Available on crate feature arrayvec
only.
impl<T, const N: usize> AsRef<NonEmpty<[T]>> for ArrayVec1<T, N>
arrayvec
only.Source§impl<A, T> AsRef<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
Available on crate feature smallvec
only.
impl<A, T> AsRef<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
smallvec
only.Source§impl<T> BitAnd<&NonEmpty<BTreeSet<T>>> for &BTreeSet<T>
Available on crate feature alloc
only.
impl<T> BitAnd<&NonEmpty<BTreeSet<T>>> for &BTreeSet<T>
alloc
only.Source§impl<T, S, S1> BitAnd<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
Available on crate feature indexmap
only.
impl<T, S, S1> BitAnd<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
indexmap
only.Source§impl<T, S, S1> BitOr<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
Available on crate feature indexmap
only.
impl<T, S, S1> BitOr<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
indexmap
only.Source§impl<T> BitXor<&NonEmpty<BTreeSet<T>>> for &BTreeSet<T>
Available on crate feature alloc
only.
impl<T> BitXor<&NonEmpty<BTreeSet<T>>> for &BTreeSet<T>
alloc
only.Source§impl<T, S, S1> BitXor<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
Available on crate feature indexmap
only.
impl<T, S, S1> BitXor<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
indexmap
only.Source§impl<T, const N: usize> Borrow<NonEmpty<[T]>> for ArrayVec1<T, N>
Available on crate feature arrayvec
only.
impl<T, const N: usize> Borrow<NonEmpty<[T]>> for ArrayVec1<T, N>
arrayvec
only.Source§impl<A, T> Borrow<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
Available on crate feature smallvec
only.
impl<A, T> Borrow<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
smallvec
only.Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 1]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 1]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 10]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 10]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 11]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 11]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 12]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 12]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 13]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 13]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 14]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 14]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 15]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 15]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 16]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 16]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 17]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 17]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 18]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 18]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 19]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 19]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 2]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 2]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 20]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 20]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 21]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 21]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 22]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 22]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 23]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 23]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 24]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 24]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 25]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 25]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 26]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 26]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 27]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 27]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 28]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 28]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 29]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 29]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 3]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 3]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 30]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 30]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 31]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 31]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 32]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 32]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 33]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 33]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 34]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 34]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 35]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 35]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 36]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 36]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 37]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 37]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 38]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 38]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 39]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 39]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 4]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 4]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 40]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 40]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 41]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 41]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 42]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 42]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 43]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 43]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 44]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 44]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 45]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 45]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 46]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 46]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 47]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 47]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 48]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 48]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 49]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 49]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 5]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 5]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 50]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 50]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 51]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 51]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 52]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 52]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 53]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 53]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 54]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 54]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 55]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 55]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 56]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 56]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 57]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 57]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 58]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 58]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 59]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 59]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 6]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 6]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 60]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 60]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 61]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 61]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 62]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 62]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 63]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 63]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 64]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 64]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 7]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 7]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 8]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 8]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for [T; 9]
impl<T> BorrowMut<NonEmpty<[T]>> for [T; 9]
Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T, const N: usize> BorrowMut<NonEmpty<[T]>> for ArrayVec1<T, N>
Available on crate feature arrayvec
only.
impl<T, const N: usize> BorrowMut<NonEmpty<[T]>> for ArrayVec1<T, N>
arrayvec
only.Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<A, T> BorrowMut<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
Available on crate feature smallvec
only.
impl<A, T> BorrowMut<NonEmpty<[T]>> for SmallVec1<A>where
A: Array<Item = T>,
smallvec
only.Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl<T> BorrowMut<NonEmpty<[T]>> for Vec1<T>
Available on crate feature alloc
only.
impl<T> BorrowMut<NonEmpty<[T]>> for Vec1<T>
alloc
only.Source§fn borrow_mut(&mut self) -> &mut Slice1<T>
fn borrow_mut(&mut self) -> &mut Slice1<T>
Source§impl BorrowMut<NonEmpty<str>> for String1
Available on crate feature alloc
only.
impl BorrowMut<NonEmpty<str>> for String1
alloc
only.Source§fn borrow_mut(&mut self) -> &mut Str1
fn borrow_mut(&mut self) -> &mut Str1
Source§impl<'de, T> Deserialize<'de> for NonEmpty<T>
impl<'de, T> Deserialize<'de> for NonEmpty<T>
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl<'a, T> From<&'a NonEmpty<[T]>> for ArcSlice1<T>where
T: Clone,
Available on crate feature alloc
and target_has_atomic="ptr"
only.
impl<'a, T> From<&'a NonEmpty<[T]>> for ArcSlice1<T>where
T: Clone,
alloc
and target_has_atomic="ptr"
only.Source§impl<'a, T> From<&'a NonEmpty<[T]>> for BoxedSlice1<T>where
T: Clone,
Available on crate feature alloc
only.
impl<'a, T> From<&'a NonEmpty<[T]>> for BoxedSlice1<T>where
T: Clone,
alloc
only.Source§impl<'a, T> From<&'a NonEmpty<[T]>> for CowSlice1<'a, T>where
T: Clone,
Available on crate feature alloc
only.
impl<'a, T> From<&'a NonEmpty<[T]>> for CowSlice1<'a, T>where
T: Clone,
alloc
only.Source§impl<'a, A, T> From<&'a NonEmpty<[T]>> for SmallVec1<A>
Available on crate feature smallvec
only.
impl<'a, A, T> From<&'a NonEmpty<[T]>> for SmallVec1<A>
smallvec
only.Source§impl<'a, T> From<&'a NonEmpty<[T]>> for Vec1<T>where
T: Clone,
Available on crate feature alloc
only.
impl<'a, T> From<&'a NonEmpty<[T]>> for Vec1<T>where
T: Clone,
alloc
only.Source§impl<'a, T> From<&'a NonEmpty<[T]>> for Vec<T>where
T: Clone,
Available on crate feature alloc
only.
impl<'a, T> From<&'a NonEmpty<[T]>> for Vec<T>where
T: Clone,
alloc
only.Source§impl<'a, T> From<&'a NonEmpty<Vec<T>>> for CowSlice1<'a, T>where
T: Clone,
Available on crate feature alloc
only.
impl<'a, T> From<&'a NonEmpty<Vec<T>>> for CowSlice1<'a, T>where
T: Clone,
alloc
only.Source§impl<'a, A, T> From<&'a mut NonEmpty<[T]>> for SmallVec1<A>
Available on crate feature smallvec
only.
impl<'a, A, T> From<&'a mut NonEmpty<[T]>> for SmallVec1<A>
smallvec
only.Source§impl<'a, T> From<&'a mut NonEmpty<[T]>> for Vec1<T>where
T: Clone,
Available on crate feature alloc
only.
impl<'a, T> From<&'a mut NonEmpty<[T]>> for Vec1<T>where
T: Clone,
alloc
only.Source§impl<T, const N: usize> From<NonEmpty<ArrayVec<T, N>>> for ArrayVec<T, N>
Available on crate feature arrayvec
only.
impl<T, const N: usize> From<NonEmpty<ArrayVec<T, N>>> for ArrayVec<T, N>
arrayvec
only.Source§impl<K, V> From<NonEmpty<BTreeMap<K, V>>> for BTreeMap<K, V>
Available on crate feature alloc
only.
impl<K, V> From<NonEmpty<BTreeMap<K, V>>> for BTreeMap<K, V>
alloc
only.Source§impl<K, V, S> From<NonEmpty<IndexMap<K, V, S>>> for IndexMap<K, V, S>
Available on crate feature indexmap
only.
impl<K, V, S> From<NonEmpty<IndexMap<K, V, S>>> for IndexMap<K, V, S>
indexmap
only.Source§impl<T, S> From<NonEmpty<IndexSet<T, S>>> for IndexSet<T, S>
Available on crate feature indexmap
only.
impl<T, S> From<NonEmpty<IndexSet<T, S>>> for IndexSet<T, S>
indexmap
only.Source§impl<A> From<NonEmpty<SmallVec<A>>> for SmallVec<A>where
A: Array,
Available on crate feature smallvec
only.
impl<A> From<NonEmpty<SmallVec<A>>> for SmallVec<A>where
A: Array,
smallvec
only.Source§impl<T> From<NonEmpty<Vec<T>>> for ArcSlice1<T>
Available on crate feature alloc
and target_has_atomic="ptr"
only.
impl<T> From<NonEmpty<Vec<T>>> for ArcSlice1<T>
alloc
and target_has_atomic="ptr"
only.Source§impl<T> From<NonEmpty<Vec<T>>> for CowSlice1<'_, T>where
T: Clone,
Available on crate feature alloc
only.
impl<T> From<NonEmpty<Vec<T>>> for CowSlice1<'_, T>where
T: Clone,
alloc
only.Source§impl<A, T> From<NonEmpty<Vec<T>>> for SmallVec1<A>where
A: Array<Item = T>,
Available on crate feature smallvec
only.
impl<A, T> From<NonEmpty<Vec<T>>> for SmallVec1<A>where
A: Array<Item = T>,
smallvec
only.Source§impl<T> Ord for NonEmpty<T>
impl<T> Ord for NonEmpty<T>
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl<T> PartialOrd for NonEmpty<T>where
T: ?Sized + PartialOrd,
impl<T> PartialOrd for NonEmpty<T>where
T: ?Sized + PartialOrd,
Source§impl<T, S, S1> Sub<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
Available on crate feature indexmap
only.
impl<T, S, S1> Sub<&NonEmpty<IndexSet<T, S1>>> for &IndexSet<T, S>
indexmap
only.Source§impl<'a, T, const N: usize> TryFrom<&'a NonEmpty<[T]>> for ArrayVec1<T, N>
Available on crate feature arrayvec
only.
impl<'a, T, const N: usize> TryFrom<&'a NonEmpty<[T]>> for ArrayVec1<T, N>
arrayvec
only.impl<T> Copy for NonEmpty<T>
impl<T> Eq for NonEmpty<T>
impl<T> StructuralPartialEq for NonEmpty<T>where
T: ?Sized,
Auto Trait Implementations§
impl<T> Freeze for NonEmpty<T>
impl<T> RefUnwindSafe for NonEmpty<T>where
T: RefUnwindSafe + ?Sized,
impl<T> Send for NonEmpty<T>
impl<T> Sync for NonEmpty<T>
impl<T> Unpin for NonEmpty<T>
impl<T> UnwindSafe for NonEmpty<T>where
T: UnwindSafe + ?Sized,
Blanket Implementations§
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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.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 moreSource§impl<'data, I> IntoParallelRefIterator<'data> for I
impl<'data, I> IntoParallelRefIterator<'data> for I
Source§impl<'data, I> IntoParallelRefMutIterator<'data> for I
impl<'data, I> IntoParallelRefMutIterator<'data> for I
Source§type Iter = <&'data mut I as IntoParallelIterator>::Iter
type Iter = <&'data mut I as IntoParallelIterator>::Iter
Source§type Item = <&'data mut I as IntoParallelIterator>::Item
type Item = <&'data mut I as IntoParallelIterator>::Item
&'data mut T
reference.Source§fn par_iter_mut(
&'data mut self,
) -> <I as IntoParallelRefMutIterator<'data>>::Iter
fn par_iter_mut( &'data mut self, ) -> <I as IntoParallelRefMutIterator<'data>>::Iter
self
. Read more