Adding upstream version 110.0.1.upstream/110.0.1upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 198 insertions, 0 deletions

diff --git a/third_party/rust/dashmap/src/mapref/entry.rs b/third_party/rust/dashmap/src/mapref/entry.rs
new file mode 100644
index 0000000000..7a609ee61a
--- /dev/null
+++ b/third_party/rust/dashmap/src/mapref/entry.rs
@@ -0,0 +1,198 @@
+use super::one::RefMut;
+use crate::lock::RwLockWriteGuard;
+use crate::util;
+use crate::util::SharedValue;
+use crate::HashMap;
+use core::hash::{BuildHasher, Hash};
+use core::mem;
+use core::ptr;
+use std::collections::hash_map::RandomState;
+
+pub enum Entry<'a, K, V, S = RandomState> {
+    Occupied(OccupiedEntry<'a, K, V, S>),
+    Vacant(VacantEntry<'a, K, V, S>),
+}
+
+impl<'a, K: Eq + Hash, V, S: BuildHasher> Entry<'a, K, V, S> {
+    /// Apply a function to the stored value if it exists.
+    pub fn and_modify(self, f: impl FnOnce(&mut V)) -> Self {
+        match self {
+            Entry::Occupied(mut entry) => {
+                f(entry.get_mut());
+
+                Entry::Occupied(entry)
+            }
+
+            Entry::Vacant(entry) => Entry::Vacant(entry),
+        }
+    }
+
+    /// Get the key of the entry.
+    pub fn key(&self) -> &K {
+        match *self {
+            Entry::Occupied(ref entry) => entry.key(),
+            Entry::Vacant(ref entry) => entry.key(),
+        }
+    }
+
+    /// Into the key of the entry.
+    pub fn into_key(self) -> K {
+        match self {
+            Entry::Occupied(entry) => entry.into_key(),
+            Entry::Vacant(entry) => entry.into_key(),
+        }
+    }
+
+    /// Return a mutable reference to the element if it exists,
+    /// otherwise insert the default and return a mutable reference to that.
+    pub fn or_default(self) -> RefMut<'a, K, V, S>
+    where
+        V: Default,
+    {
+        match self {
+            Entry::Occupied(entry) => entry.into_ref(),
+            Entry::Vacant(entry) => entry.insert(V::default()),
+        }
+    }
+
+    /// Return a mutable reference to the element if it exists,
+    /// otherwise a provided value and return a mutable reference to that.
+    pub fn or_insert(self, value: V) -> RefMut<'a, K, V, S> {
+        match self {
+            Entry::Occupied(entry) => entry.into_ref(),
+            Entry::Vacant(entry) => entry.insert(value),
+        }
+    }
+
+    /// Return a mutable reference to the element if it exists,
+    /// otherwise insert the result of a provided function and return a mutable reference to that.
+    pub fn or_insert_with(self, value: impl FnOnce() -> V) -> RefMut<'a, K, V, S> {
+        match self {
+            Entry::Occupied(entry) => entry.into_ref(),
+            Entry::Vacant(entry) => entry.insert(value()),
+        }
+    }
+
+    pub fn or_try_insert_with<E>(
+        self,
+        value: impl FnOnce() -> Result<V, E>,
+    ) -> Result<RefMut<'a, K, V, S>, E> {
+        match self {
+            Entry::Occupied(entry) => Ok(entry.into_ref()),
+            Entry::Vacant(entry) => Ok(entry.insert(value()?)),
+        }
+    }
+}
+
+pub struct VacantEntry<'a, K, V, S> {
+    shard: RwLockWriteGuard<'a, HashMap<K, V, S>>,
+    key: K,
+}
+
+unsafe impl<'a, K: Eq + Hash + Send, V: Send, S: BuildHasher> Send for VacantEntry<'a, K, V, S> {}
+
+unsafe impl<'a, K: Eq + Hash + Send + Sync, V: Send + Sync, S: BuildHasher> Sync
+    for VacantEntry<'a, K, V, S>
+{
+}
+
+impl<'a, K: Eq + Hash, V, S: BuildHasher> VacantEntry<'a, K, V, S> {
+    pub(crate) fn new(shard: RwLockWriteGuard<'a, HashMap<K, V, S>>, key: K) -> Self {
+        Self { shard, key }
+    }
+
+    pub fn insert(mut self, value: V) -> RefMut<'a, K, V, S> {
+        unsafe {
+            let c: K = ptr::read(&self.key);
+
+            self.shard.insert(self.key, SharedValue::new(value));
+
+            let (k, v) = self.shard.get_key_value(&c).unwrap();
+
+            let k = util::change_lifetime_const(k);
+
+            let v = &mut *v.as_ptr();
+
+            let r = RefMut::new(self.shard, k, v);
+
+            mem::forget(c);
+
+            r
+        }
+    }
+
+    pub fn into_key(self) -> K {
+        self.key
+    }
+
+    pub fn key(&self) -> &K {
+        &self.key
+    }
+}
+
+pub struct OccupiedEntry<'a, K, V, S> {
+    shard: RwLockWriteGuard<'a, HashMap<K, V, S>>,
+    elem: (&'a K, &'a mut V),
+    key: K,
+}
+
+unsafe impl<'a, K: Eq + Hash + Send, V: Send, S: BuildHasher> Send for OccupiedEntry<'a, K, V, S> {}
+
+unsafe impl<'a, K: Eq + Hash + Send + Sync, V: Send + Sync, S: BuildHasher> Sync
+    for OccupiedEntry<'a, K, V, S>
+{
+}
+
+impl<'a, K: Eq + Hash, V, S: BuildHasher> OccupiedEntry<'a, K, V, S> {
+    pub(crate) fn new(
+        shard: RwLockWriteGuard<'a, HashMap<K, V, S>>,
+        key: K,
+        elem: (&'a K, &'a mut V),
+    ) -> Self {
+        Self { shard, elem, key }
+    }
+
+    pub fn get(&self) -> &V {
+        self.elem.1
+    }
+
+    pub fn get_mut(&mut self) -> &mut V {
+        self.elem.1
+    }
+
+    pub fn insert(&mut self, value: V) -> V {
+        mem::replace(self.elem.1, value)
+    }
+
+    pub fn into_ref(self) -> RefMut<'a, K, V, S> {
+        RefMut::new(self.shard, self.elem.0, self.elem.1)
+    }
+
+    pub fn into_key(self) -> K {
+        self.key
+    }
+
+    pub fn key(&self) -> &K {
+        self.elem.0
+    }
+
+    pub fn remove(mut self) -> V {
+        self.shard.remove(self.elem.0).unwrap().into_inner()
+    }
+
+    pub fn remove_entry(mut self) -> (K, V) {
+        let (k, v) = self.shard.remove_entry(self.elem.0).unwrap();
+
+        (k, v.into_inner())
+    }
+
+    pub fn replace_entry(mut self, value: V) -> (K, V) {
+        let nk = self.key;
+
+        let (k, v) = self.shard.remove_entry(self.elem.0).unwrap();
+
+        self.shard.insert(nk, SharedValue::new(value));
+
+        (k, v.into_inner())
+    }
+}