Struct rustc_ap_rustc_data_structures::sharded::Sharded

pub struct Sharded<T> { /* fields omitted */ }

An array of cache-line aligned inner locked structures with convenience methods.

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_index_by_hash(&self, hash: u64) -> usize

Get a shard with a pre-computed hash value. If get_shard_by_value is ever used in combination with get_shard_by_hash on a single Sharded instance, then hash must be computed with FxHasher. Otherwise, hash can be computed with any hasher, so long as that hasher is used consistently for each Sharded instance.

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_shards(&self) -> Vec<LockGuard<'_, T>>

pub fn try_lock_shards(&self) -> Option<Vec<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, V, BuildHasherDefault<FxHasher>>>

pub fn intern_ref<Q: ?Sized>(&self, value: &Q, make: impl FnOnce() -> K) -> K where
    K: Borrow<Q>,
    Q: Hash + Eq, 

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, V, BuildHasherDefault<FxHasher>>>

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

Trait Implementations

impl<T: Clone> Clone for Sharded<T>

pub fn clone(&self) -> Sharded<T>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

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

pub fn default() -> Self

Returns the "default value" for a type.