Enum rustc_data_structures::sharded::Sharded

pub enum Sharded<T> {
    Single(Lock<T>),
}

An array of cache-line aligned inner locked structures with convenience methods. A single field is used when the compiler uses only one thread.

Variants

Single(Lock<T>)

Implementations

impl<T> Sharded<T>

pub fn new(value: impl FnMut() -> T) -> Self

pub fn get_shard_by_value<K: Hash + ?Sized>(&self, _val: &K) -> &Lock<T>

The shard is selected by hashing val with FxHasher.

pub fn get_shard_by_hash(&self, hash: u64) -> &Lock<T>

pub fn get_shard_by_index(&self, _i: usize) -> &Lock<T>

pub fn lock_shard_by_value<K: Hash + ?Sized>( &self, _val: &K, ) -> LockGuard<'_, T>

The shard is selected by hashing val with FxHasher.

pub fn lock_shard_by_hash(&self, hash: u64) -> LockGuard<'_, T>

pub fn lock_shard_by_index(&self, _i: usize) -> LockGuard<'_, T>

pub fn lock_shards(&self) -> impl Iterator<Item = LockGuard<'_, T>>

pub fn try_lock_shards(&self) -> impl Iterator<Item = Option<LockGuard<'_, T>>>

impl<K: Eq, V> Sharded<HashMap<K, V, BuildHasherDefault<FxHasher>>>

pub fn len(&self) -> usize

impl<K: Eq + Hash + Copy> Sharded<HashMap<K, (), BuildHasherDefault<FxHasher>>>

pub fn intern_ref<Q>(&self, value: &Q, make: impl FnOnce() -> K) -> K

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn intern<Q>(&self, value: Q, make: impl FnOnce(Q) -> K) -> K

where K: Borrow<Q>, Q: Hash + Eq,

impl<K: Eq + Hash + Copy + IntoPointer> Sharded<HashMap<K, (), BuildHasherDefault<FxHasher>>>

pub fn contains_pointer_to<T: Hash + IntoPointer>(&self, value: &T) -> bool

Trait Implementations

impl<T: Default> Default for Sharded<T>

fn default() -> Self

Returns the “default value” for a type.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.