Type Alias freya_native_core::FxDashSet
source · pub type FxDashSet<K> = DashSet<K, BuildHasherDefault<FxHasher>>;
Expand description
A set that can be sent between threads
Aliased Type§
struct FxDashSet<K> { /* private fields */ }
Implementations
§impl<'a, K, S> DashSet<K, S>
impl<'a, K, S> DashSet<K, S>
pub fn with_hasher(hasher: S) -> DashSet<K, S>
pub fn with_hasher(hasher: S) -> DashSet<K, S>
Creates a new DashMap with a capacity of 0 and the provided hasher.
§Examples
use dashmap::DashSet;
use std::collections::hash_map::RandomState;
let s = RandomState::new();
let games = DashSet::with_hasher(s);
games.insert("Veloren");
pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> DashSet<K, S>
pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> DashSet<K, S>
Creates a new DashMap with a specified starting capacity and hasher.
§Examples
use dashmap::DashSet;
use std::collections::hash_map::RandomState;
let s = RandomState::new();
let numbers = DashSet::with_capacity_and_hasher(2, s);
numbers.insert(2);
numbers.insert(8);
pub fn hash_usize<T>(&self, item: &T) -> usizewhere
T: Hash,
pub fn hash_usize<T>(&self, item: &T) -> usizewhere
T: Hash,
Hash a given item to produce a usize. Uses the provided or default HashBuilder.
pub fn insert(&self, key: K) -> bool
pub fn insert(&self, key: K) -> bool
Inserts a key into the set. Returns true if the key was not already in the set.
§Examples
use dashmap::DashSet;
let set = DashSet::new();
set.insert("I am the key!");
pub fn remove<Q>(&self, key: &Q) -> Option<K>
pub fn remove<Q>(&self, key: &Q) -> Option<K>
Removes an entry from the map, returning the key if it existed in the map.
§Examples
use dashmap::DashSet;
let soccer_team = DashSet::new();
soccer_team.insert("Jack");
assert_eq!(soccer_team.remove("Jack").unwrap(), "Jack");
pub fn remove_if<Q>(&self, key: &Q, f: impl FnOnce(&K) -> bool) -> Option<K>
pub fn remove_if<Q>(&self, key: &Q, f: impl FnOnce(&K) -> bool) -> Option<K>
Removes an entry from the set, returning the key if the entry existed and the provided conditional function returned true.
use dashmap::DashSet;
let soccer_team = DashSet::new();
soccer_team.insert("Sam");
soccer_team.remove_if("Sam", |player| player.starts_with("Ja"));
assert!(soccer_team.contains("Sam"));
use dashmap::DashSet;
let soccer_team = DashSet::new();
soccer_team.insert("Sam");
soccer_team.remove_if("Jacob", |player| player.starts_with("Ja"));
assert!(!soccer_team.contains("Jacob"));
pub fn iter(&'a self) -> Iter<'a, K, S, DashMap<K, (), S>>
pub fn iter(&'a self) -> Iter<'a, K, S, DashMap<K, (), S>>
Creates an iterator over a DashMap yielding immutable references.
§Examples
use dashmap::DashSet;
let words = DashSet::new();
words.insert("hello");
assert_eq!(words.iter().count(), 1);
pub fn get<Q>(&'a self, key: &Q) -> Option<Ref<'a, K>>
pub fn get<Q>(&'a self, key: &Q) -> Option<Ref<'a, K>>
Get a reference to an entry in the set
§Examples
use dashmap::DashSet;
let youtubers = DashSet::new();
youtubers.insert("Bosnian Bill");
assert_eq!(*youtubers.get("Bosnian Bill").unwrap(), "Bosnian Bill");
pub fn shrink_to_fit(&self)
pub fn shrink_to_fit(&self)
Remove excess capacity to reduce memory usage.
pub fn retain(&self, f: impl FnMut(&K) -> bool)
pub fn retain(&self, f: impl FnMut(&K) -> bool)
Retain elements that whose predicates return true and discard elements whose predicates return false.
§Examples
use dashmap::DashSet;
let people = DashSet::new();
people.insert("Albin");
people.insert("Jones");
people.insert("Charlie");
people.retain(|name| name.contains('i'));
assert_eq!(people.len(), 2);
pub fn len(&self) -> usize
pub fn len(&self) -> usize
Fetches the total number of keys stored in the set.
§Examples
use dashmap::DashSet;
let people = DashSet::new();
people.insert("Albin");
people.insert("Jones");
people.insert("Charlie");
assert_eq!(people.len(), 3);
pub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Checks if the set is empty or not.
§Examples
use dashmap::DashSet;
let map = DashSet::<()>::new();
assert!(map.is_empty());
Trait Implementations
§impl<K, S> Extend<K> for DashSet<K, S>
impl<K, S> Extend<K> for DashSet<K, S>
§fn extend<T>(&mut self, iter: T)where
T: IntoIterator<Item = K>,
fn extend<T>(&mut self, iter: T)where
T: IntoIterator<Item = K>,
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)