Struct ckb_util::LinkedHashSet

pub struct LinkedHashSet<T, S = BuildHasherDefault<DefaultHasher>> { /* private fields */ }

A HashSet that holds elements in insertion order.

Examples

use ckb_util::LinkedHashSet;

let mut set = LinkedHashSet::new();
set.insert(2);
set.insert(1);
set.insert(3);

let items: Vec<i32> = set.iter().copied().collect();
assert_eq!(items, [2, 1, 3]);

Implementations

impl<T: Hash + Eq> LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>

pub fn new() -> LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>

Creates a linked hash set.

Examples

use ckb_util::LinkedHashSet;
let set: LinkedHashSet<i32> = LinkedHashSet::new();

pub fn with_capacity( capacity: usize ) -> LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>

Creates an empty linked hash map with the given initial capacity.

Examples

use ckb_util::LinkedHashSet;
let set: LinkedHashSet<i32> = LinkedHashSet::with_capacity(42);

impl<T, S> LinkedHashSet<T, S>

where T: Eq + Hash, S: BuildHasher,

pub fn contains(&self, value: &T) -> bool

Returns true if the set contains a value.

use ckb_util::LinkedHashSet;

let mut set: LinkedHashSet<_> = LinkedHashSet::new();
set.insert(1);
set.insert(2);
set.insert(3);
assert_eq!(set.contains(&1), true);
assert_eq!(set.contains(&4), false);

pub fn capacity(&self) -> usize

Returns the number of elements the set can hold without reallocating.

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

pub fn insert(&mut self, value: T) -> bool

Adds a value to the set.

If the set did not have this value present, true is returned.

If the set did have this value present, false is returned.

pub fn iter(&self) -> Iter<'_, T>

Gets an iterator visiting all elements in insertion order.

The iterator element type is &'a T.

pub fn difference<'a>( &'a self, other: &'a LinkedHashSet<T, S> ) -> Difference<'a, T, S>

Visits the values representing the difference, i.e., the values that are in self but not in other.

pub fn clear(&mut self)

Clears the set of all value.

Trait Implementations

impl<T: Hash + Eq> Default for LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>

fn default() -> LinkedHashSet<T, BuildHasherDefault<DefaultHasher>>

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,

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<'a, T, S> IntoIterator for &'a LinkedHashSet<T, S>

where 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>

Creates an iterator from a value.

impl<T, S> IntoIterator for LinkedHashSet<T, S>

where 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?

fn into_iter(self) -> IntoIter<T>

Creates an iterator from a value.