[−][src]Struct ckb_util::LinkedHashSet
Implementations
impl<T: Hash + Eq> LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>[src]
pub fn new() -> LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>[src]
impl<T, S> LinkedHashSet<T, S> where
T: Eq + Hash,
S: BuildHasher, [src]
T: Eq + Hash,
S: BuildHasher,
pub fn contains(&self, value: &T) -> bool[src]
pub fn capacity(&self) -> usize[src]
pub fn len(&self) -> usize[src]
pub fn is_empty(&self) -> bool[src]
pub fn insert(&mut self, value: T) -> bool[src]
pub fn iter(&self) -> Iter<'_, T>[src]
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>
Trait Implementations
impl<T: Hash + Eq> Default for LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>[src]
fn default() -> LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>[src]
Creates an empty HashSet<T> with the Default value for the hasher.
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]
fn extend_one(&mut self, item: A)[src]
fn extend_reserve(&mut self, additional: usize)[src]
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?
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,
Auto Trait Implementations
impl<T, S> RefUnwindSafe for LinkedHashSet<T, S> where
S: RefUnwindSafe,
T: RefUnwindSafe,
S: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, S> Send for LinkedHashSet<T, S> where
S: Send,
T: Send,
S: Send,
T: Send,
impl<T, S> Sync for LinkedHashSet<T, S> where
S: Sync,
T: Sync,
S: Sync,
T: Sync,
impl<T, S> Unpin for LinkedHashSet<T, S> where
S: Unpin,
S: Unpin,
impl<T, S> UnwindSafe for LinkedHashSet<T, S> where
S: UnwindSafe,
T: RefUnwindSafe,
S: UnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> Erased for T
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator, [src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I[src]
impl<T, 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>,