Add an intern.rs module that I forgot.

This commit is contained in:
Nick Mathewson 2021-03-29 12:32:35 -04:00
parent 83ebd56f64
commit 278ee1fcb3
1 changed files with 54 additions and 0 deletions

View File

@ -0,0 +1,54 @@
//! Declare types for interning various objects.
use once_cell::sync::OnceCell;
use std::hash::Hash;
use std::sync::{Arc, Mutex, MutexGuard, Weak};
use weak_table::WeakHashSet;
/// An InternCache is a lazily-constructed weak set of objects.
///
/// Let's break that down! It's "lazily constructed" because it
/// doesn't actually allocate anything until you use it for the first
/// time. That allows it to have a const [`new`](InternCache::new)
/// method, so you can make these static.
///
/// It's "weak" because it only holds weak references to its objects;
/// once every strong reference is gone, the object is unallocated.
/// Later, the hash entry is (lazily) removed.
pub struct InternCache<T> {
/// Underlying hashset for interned objects
cache: OnceCell<Mutex<WeakHashSet<Weak<T>>>>,
}
impl<T> InternCache<T> {
/// Create a new, empty, InternCache.
pub const fn new() -> Self {
InternCache {
cache: OnceCell::new(),
}
}
}
impl<T: Eq + Hash> InternCache<T> {
/// Helper: initialize the cache if needed, then lock it.
fn cache(&self) -> MutexGuard<WeakHashSet<Weak<T>>> {
let cache = self.cache.get_or_init(|| Mutex::new(WeakHashSet::new()));
cache.lock().unwrap()
}
/// Intern a given value into this cache.
///
/// If `value` is already stored in this cache, we return a
/// reference to the stored value. Otherwise, we insert `value`
/// into the cache, and return that.
pub fn intern(&self, value: T) -> Arc<T> {
let mut cache = self.cache();
if let Some(pp) = cache.get(&value) {
pp
} else {
let arc = Arc::new(value);
cache.insert(Arc::clone(&arc));
arc
}
}
}