[−][src]Struct hashlink::linked_hash_set::LinkedHashSet
Methods
impl<T: Hash + Eq> LinkedHashSet<T, DefaultHashBuilder>
[src]
pub fn new() -> LinkedHashSet<T, DefaultHashBuilder>
[src]
pub fn with_capacity(capacity: usize) -> LinkedHashSet<T, DefaultHashBuilder>
[src]
impl<T, S> LinkedHashSet<T, S>
[src]
pub fn capacity(&self) -> usize
[src]
ⓘImportant traits for Iter<'a, K>pub fn iter(&self) -> Iter<T>
[src]
pub fn len(&self) -> usize
[src]
pub fn is_empty(&self) -> bool
[src]
ⓘImportant traits for Drain<'a, K>pub fn drain(&mut self) -> Drain<T>
[src]
pub fn clear(&mut self)
[src]
impl<T, S> LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
pub fn with_hasher(hasher: S) -> LinkedHashSet<T, S>
[src]
pub fn with_capacity_and_hasher(
capacity: usize,
hasher: S
) -> LinkedHashSet<T, S>
[src]
capacity: usize,
hasher: S
) -> LinkedHashSet<T, S>
pub fn hasher(&self) -> &S
[src]
pub fn reserve(&mut self, additional: usize)
[src]
pub fn try_reserve(
&mut self,
additional: usize
) -> Result<(), CollectionAllocErr>
[src]
&mut self,
additional: usize
) -> Result<(), CollectionAllocErr>
pub fn shrink_to_fit(&mut self)
[src]
ⓘImportant traits for Difference<'a, T, S>pub fn difference<'a>(
&'a self,
other: &'a LinkedHashSet<T, S>
) -> Difference<'a, T, S>
[src]
&'a self,
other: &'a LinkedHashSet<T, S>
) -> Difference<'a, T, S>
ⓘImportant traits for SymmetricDifference<'a, T, S>pub fn symmetric_difference<'a>(
&'a self,
other: &'a LinkedHashSet<T, S>
) -> SymmetricDifference<'a, T, S>
[src]
&'a self,
other: &'a LinkedHashSet<T, S>
) -> SymmetricDifference<'a, T, S>
ⓘImportant traits for Intersection<'a, T, S>pub fn intersection<'a>(
&'a self,
other: &'a LinkedHashSet<T, S>
) -> Intersection<'a, T, S>
[src]
&'a self,
other: &'a LinkedHashSet<T, S>
) -> Intersection<'a, T, S>
ⓘImportant traits for Union<'a, T, S>pub fn union<'a>(&'a self, other: &'a LinkedHashSet<T, S>) -> Union<'a, T, S>
[src]
pub fn contains<Q: ?Sized>(&self, value: &Q) -> bool where
T: Borrow<Q>,
Q: Hash + Eq,
[src]
T: Borrow<Q>,
Q: Hash + Eq,
pub fn get<Q: ?Sized>(&self, value: &Q) -> Option<&T> where
T: Borrow<Q>,
Q: Hash + Eq,
[src]
T: Borrow<Q>,
Q: Hash + Eq,
pub fn get_or_insert(&mut self, value: T) -> &T
[src]
pub fn get_or_insert_with<Q: ?Sized, F>(&mut self, value: &Q, f: F) -> &T where
T: Borrow<Q>,
Q: Hash + Eq,
F: FnOnce(&Q) -> T,
[src]
T: Borrow<Q>,
Q: Hash + Eq,
F: FnOnce(&Q) -> T,
pub fn is_disjoint(&self, other: &LinkedHashSet<T, S>) -> bool
[src]
pub fn is_subset(&self, other: &LinkedHashSet<T, S>) -> bool
[src]
pub fn is_superset(&self, other: &LinkedHashSet<T, S>) -> bool
[src]
pub fn insert(&mut self, value: T) -> bool
[src]
pub fn replace(&mut self, value: T) -> Option<T>
[src]
pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool where
T: Borrow<Q>,
Q: Hash + Eq,
[src]
T: Borrow<Q>,
Q: Hash + Eq,
pub fn take<Q: ?Sized>(&mut self, value: &Q) -> Option<T> where
T: Borrow<Q>,
Q: Hash + Eq,
[src]
T: Borrow<Q>,
Q: Hash + Eq,
pub fn retain<F>(&mut self, f: F) where
F: FnMut(&T) -> bool,
[src]
F: FnMut(&T) -> bool,
pub fn front(&self) -> Option<&T>
[src]
pub fn pop_front(&mut self) -> Option<T>
[src]
pub fn back(&mut self) -> Option<&T>
[src]
pub fn pop_back(&mut self) -> Option<T>
[src]
Trait Implementations
impl<T, S> PartialEq<LinkedHashSet<T, S>> for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
fn eq(&self, other: &LinkedHashSet<T, S>) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl<'a, T, S> IntoIterator for &'a LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
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?
ⓘImportant traits for Iter<'a, K>fn into_iter(self) -> Iter<'a, T>
[src]
impl<T, S> IntoIterator for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
type Item = T
The type of the elements being iterated over.
type IntoIter = IntoIter<T>
Which kind of iterator are we turning this into?
ⓘImportant traits for IntoIter<K>fn into_iter(self) -> IntoIter<T>
[src]
impl<T, S> Eq for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
impl<T, S> Extend<T> for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
[src]
impl<'a, T, S> Extend<&'a T> for LinkedHashSet<T, S> where
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
[src]
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I)
[src]
impl<T, S> Default for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher + Default,
[src]
T: Eq + Hash,
S: BuildHasher + Default,
fn default() -> LinkedHashSet<T, S>
[src]
impl<T: Hash + Eq + Clone, S: BuildHasher + Clone> Clone for LinkedHashSet<T, S>
[src]
fn clone(&self) -> Self
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<T, S> Hash for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
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,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<'a, 'b, T, S> Sub<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
[src]
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
The resulting type after applying the -
operator.
fn sub(self, rhs: &LinkedHashSet<T, S>) -> LinkedHashSet<T, S>
[src]
impl<'a, 'b, T, S> BitAnd<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
[src]
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
The resulting type after applying the &
operator.
fn bitand(self, rhs: &LinkedHashSet<T, S>) -> LinkedHashSet<T, S>
[src]
impl<'a, 'b, T, S> BitOr<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
[src]
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
The resulting type after applying the |
operator.
fn bitor(self, rhs: &LinkedHashSet<T, S>) -> LinkedHashSet<T, S>
[src]
impl<'a, 'b, T, S> BitXor<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
[src]
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
The resulting type after applying the ^
operator.
fn bitxor(self, rhs: &LinkedHashSet<T, S>) -> LinkedHashSet<T, S>
[src]
impl<T, S> Debug for LinkedHashSet<T, S> where
T: Eq + Hash + Debug,
S: BuildHasher,
[src]
T: Eq + Hash + Debug,
S: BuildHasher,
impl<T, S> FromIterator<T> for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher + Default,
[src]
T: Eq + Hash,
S: BuildHasher + Default,
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> LinkedHashSet<T, S>
[src]
Auto Trait Implementations
impl<T, S> Send for LinkedHashSet<T, S> where
S: Send,
T: Send,
S: Send,
T: Send,
impl<T, S> Unpin for LinkedHashSet<T, S> where
S: Unpin,
T: Unpin,
S: Unpin,
T: Unpin,
impl<T, S> Sync for LinkedHashSet<T, S> where
S: Sync,
T: Sync,
S: Sync,
T: Sync,
impl<T, S> UnwindSafe for LinkedHashSet<T, S> where
S: UnwindSafe,
T: RefUnwindSafe,
S: UnwindSafe,
T: RefUnwindSafe,
impl<T, S> RefUnwindSafe for LinkedHashSet<T, S> where
S: RefUnwindSafe,
T: RefUnwindSafe,
S: RefUnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
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> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
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>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,