Struct ritelinked::linked_hash_set::LinkedHashSet [−][src]
pub struct LinkedHashSet<T, S = DefaultHashBuilder> { /* fields omitted */ }
Implementations
pub fn difference<'a>(
&'a self,
other: &'a LinkedHashSet<T, S>
) -> Difference<'a, T, S>ⓘNotable traits for Difference<'a, T, S>impl<'a, T, S> Iterator for Difference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for Difference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
pub fn symmetric_difference<'a>(
&'a self,
other: &'a LinkedHashSet<T, S>
) -> SymmetricDifference<'a, T, S>ⓘNotable traits for SymmetricDifference<'a, T, S>impl<'a, T, S> Iterator for SymmetricDifference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for SymmetricDifference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
pub fn intersection<'a>(
&'a self,
other: &'a LinkedHashSet<T, S>
) -> Intersection<'a, T, S>ⓘNotable traits for Intersection<'a, T, S>impl<'a, T, S> Iterator for Intersection<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for Intersection<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
pub fn union<'a>(&'a self, other: &'a LinkedHashSet<T, S>) -> Union<'a, T, S>ⓘ
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,
Inserts the given value into the set.
If the set did not have this value present, inserts it at the back of the internal linked list and returns true, otherwise it moves the existing value to the back of the internal linked list and returns false.
Adds the given value to the set, replacing the existing value.
If a previous value existed, returns the replaced value. In this case, the value’s position in the internal linked list is not changed.
Trait Implementations
impl<'a, 'b, T, S> BitAnd<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
impl<'a, 'b, T, S> BitAnd<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
type Output = LinkedHashSet<T, S>
The resulting type after applying the &
operator.
Performs the &
operation. Read more
impl<'a, 'b, T, S> BitOr<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
impl<'a, 'b, T, S> BitOr<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
type Output = LinkedHashSet<T, S>
The resulting type after applying the |
operator.
Performs the |
operation. Read more
impl<'a, 'b, T, S> BitXor<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
impl<'a, 'b, T, S> BitXor<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
type Output = LinkedHashSet<T, S>
The resulting type after applying the ^
operator.
Performs the ^
operation. Read more
Returns the “default value” for a type. Read more
impl<'a, T, S> Extend<&'a T> for LinkedHashSet<T, S> where
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
impl<'a, T, S> Extend<&'a T> for LinkedHashSet<T, S> where
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
impl<T, S> FromIterator<T> for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher + Default,
impl<T, S> FromIterator<T> for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher + Default,
Creates a value from an iterator. Read more
type Item = &'a T
type Item = &'a T
The type of the elements being iterated over.
impl<T, S> PartialEq<LinkedHashSet<T, S>> for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
impl<T, S> PartialEq<LinkedHashSet<T, S>> for LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
impl<'a, 'b, T, S> Sub<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
impl<'a, 'b, T, S> Sub<&'b LinkedHashSet<T, S>> for &'a LinkedHashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
type Output = LinkedHashSet<T, S>
type Output = LinkedHashSet<T, S>
The resulting type after applying the -
operator.
Performs the -
operation. Read more
Auto Trait Implementations
impl<T, S> RefUnwindSafe for LinkedHashSet<T, S> where
S: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, S> Send for LinkedHashSet<T, S> where
S: Send,
T: Send,
impl<T, S> Sync for LinkedHashSet<T, S> where
S: Sync,
T: Sync,
impl<T, S> Unpin for LinkedHashSet<T, S> where
S: Unpin,
impl<T, S> UnwindSafe for LinkedHashSet<T, S> where
S: UnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more