Update hashbrown to 0.15 and adjust some methods

as well as removing some from std as they no longer
exists in Hashbrown it-self.

Author: Urgau

library/Cargo.lock

@@ -135,9 +135,9 @@ dependencies = [
 
 [[package]]
 name = "hashbrown"
-version = "0.14.5"
+version = "0.15.0"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "e5274423e17b7c9fc20b6e7e208532f9b19825d82dfd615708b70edd83df41f1"
+checksum = "1e087f84d4f86bf4b218b927129862374b72199ae7d8657835f1e89000eea4fb"
 dependencies = [
 "allocator-api2",
 "compiler_builtins",

library/std/Cargo.toml

@@ -20,7 +20,7 @@ core = { path = "../core", public = true }
 compiler_builtins = { version = "0.1.130" }
 profiler_builtins = { path = "../profiler_builtins", optional = true }
 unwind = { path = "../unwind" }
-hashbrown = { version = "0.14", default-features = false, features = [
+hashbrown = { version = "0.15", default-features = false, features = [
 'rustc-dep-of-std',
 ] }
 # FIXME(#127890): `object` depends on `memchr`, but `memchr` > v2.5 causes

library/std/src/collections/hash/map.rs

@@ -909,8 +909,11 @@ where
 /// Attempts to get mutable references to `N` values in the map at once.
 ///
 /// Returns an array of length `N` with the results of each query. For soundness, at most one
-/// mutable reference will be returned to any value. `None` will be returned if any of the
-/// keys are duplicates or missing.
+/// mutable reference will be returned to any value. `None` will be used if the key is missing.
+///
+/// # Panics
+///
+/// Panics if any keys are overlapping.
 ///
 /// # Examples
 ///
@@ -924,35 +927,55 @@ where
 /// libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
 /// libraries.insert("Library of Congress".to_string(), 1800);
 ///
+/// // Get Athenæum and Bodleian Library
+/// let [Some(a), Some(b)] = libraries.get_many_mut([
+/// "Athenæum",
+/// "Bodleian Library",
+/// ]) else { panic!() };
+///
+/// // Assert values of Athenæum and Library of Congress
 /// let got = libraries.get_many_mut([
 /// "Athenæum",
 /// "Library of Congress",
 /// ]);
 /// assert_eq!(
 /// got,
-/// Some([
-/// &mut 1807,
-/// &mut 1800,
-/// ]),
+/// [
+/// Some(&mut 1807),
+/// Some(&mut 1800),
+/// ],
 /// );
 ///
 /// // Missing keys result in None
 /// let got = libraries.get_many_mut([
 /// "Athenæum",
 /// "New York Public Library",
 /// ]);
-/// assert_eq!(got, None);
+/// assert_eq!(
+/// got,
+/// [
+/// Some(&mut 1807),
+/// None
+/// ]
+/// );
+/// ```
+///
+/// ```should_panic
+/// #![feature(map_many_mut)]
+/// use std::collections::HashMap;
 ///
-/// // Duplicate keys result in None
+/// let mut libraries = HashMap::new();
+/// libraries.insert("Athenæum".to_string(), 1807);
+///
+/// // Duplicate keys panic!
 /// let got = libraries.get_many_mut([
 /// "Athenæum",
 /// "Athenæum",
 /// ]);
-/// assert_eq!(got, None);
 /// ```
 #[inline]
 #[unstable(feature = "map_many_mut", issue = "97601")]
-pubfnget_many_mut<Q: ?Sized,constN:usize>(&mutself,ks:[&Q;N]) -> Option<[&'_mutV;N]>
+pubfnget_many_mut<Q: ?Sized,constN:usize>(&mutself,ks:[&Q;N]) -> [Option<&'_mutV>;N]
 where
 K:Borrow<Q>,
 Q:Hash + Eq,
@@ -963,10 +986,10 @@ where
 /// Attempts to get mutable references to `N` values in the map at once, without validating that
 /// the values are unique.
 ///
-/// Returns an array of length `N` with the results of each query. `None` will be returned if
-/// any of the keys are missing.
+/// Returns an array of length `N` with the results of each query. `None` will be used if
+/// the key is missing.
 ///
-/// For a safe alternative see [`get_many_mut`](Self::get_many_mut).
+/// For a safe alternative see [`get_many_mut`](`HashMap::get_many_mut`).
 ///
 /// # Safety
 ///
@@ -987,31 +1010,39 @@ where
 /// libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
 /// libraries.insert("Library of Congress".to_string(), 1800);
 ///
-/// let got = libraries.get_many_mut([
+/// // SAFETY: The keys do not overlap.
+/// let [Some(a), Some(b)] = (unsafe { libraries.get_many_unchecked_mut([
+/// "Athenæum",
+/// "Bodleian Library",
+/// ]) }) else { panic!() };
+///
+/// // SAFETY: The keys do not overlap.
+/// let got = unsafe { libraries.get_many_unchecked_mut([
 /// "Athenæum",
 /// "Library of Congress",
-/// ]);
+/// ]) };
 /// assert_eq!(
 /// got,
-/// Some([
-/// &mut 1807,
-/// &mut 1800,
-/// ]),
+/// [
+/// Some(&mut 1807),
+/// Some(&mut 1800),
+/// ],
 /// );
 ///
-/// // Missing keys result in None
-/// let got = libraries.get_many_mut([
+/// // SAFETY: The keys do not overlap.
+/// let got = unsafe { libraries.get_many_unchecked_mut([
 /// "Athenæum",
 /// "New York Public Library",
-/// ]);
-/// assert_eq!(got, None);
+/// ]) };
+/// // Missing keys result in None
+/// assert_eq!(got, [Some(&mut 1807), None]);
 /// ```
 #[inline]
 #[unstable(feature = "map_many_mut", issue = "97601")]
 pubunsafefnget_many_unchecked_mut<Q: ?Sized,constN:usize>(
 &mutself,
 ks:[&Q;N],
-) -> Option<[&'_mutV;N]>
+) -> [Option<&'_mutV>;N]
 where
 K:Borrow<Q>,
 Q:Hash + Eq,
@@ -2978,64 +3009,6 @@ impl<'a, K, V> OccupiedEntry<'a, K, V> {
 pubfnremove(self) -> V{
 self.base.remove()
 }
-
-/// Replaces the entry, returning the old key and value. The new key in the hash map will be
-/// the key used to create this entry.
-///
-/// # Examples
-///
-/// ```
-/// #![feature(map_entry_replace)]
-/// use std::collections::hash_map::{Entry, HashMap};
-/// use std::rc::Rc;
-///
-/// let mut map: HashMap<Rc<String>, u32> = HashMap::new();
-/// map.insert(Rc::new("Stringthing".to_string()), 15);
-///
-/// let my_key = Rc::new("Stringthing".to_string());
-///
-/// if let Entry::Occupied(entry) = map.entry(my_key) {
-/// // Also replace the key with a handle to our other key.
-/// let (old_key, old_value): (Rc<String>, u32) = entry.replace_entry(16);
-/// }
-///
-/// ```
-#[inline]
-#[unstable(feature = "map_entry_replace", issue = "44286")]
-pubfnreplace_entry(self,value:V) -> (K,V){
-self.base.replace_entry(value)
-}
-
-/// Replaces the key in the hash map with the key used to create this entry.
-///
-/// # Examples
-///
-/// ```
-/// #![feature(map_entry_replace)]
-/// use std::collections::hash_map::{Entry, HashMap};
-/// use std::rc::Rc;
-///
-/// let mut map: HashMap<Rc<String>, u32> = HashMap::new();
-/// let known_strings: Vec<Rc<String>> = Vec::new();
-///
-/// // Initialise known strings, run program, etc.
-///
-/// reclaim_memory(&mut map, &known_strings);
-///
-/// fn reclaim_memory(map: &mut HashMap<Rc<String>, u32>, known_strings: &[Rc<String>] ) {
-/// for s in known_strings {
-/// if let Entry::Occupied(entry) = map.entry(Rc::clone(s)) {
-/// // Replaces the entry's key with our version of it in `known_strings`.
-/// entry.replace_key();
-/// }
-/// }
-/// }
-/// ```
-#[inline]
-#[unstable(feature = "map_entry_replace", issue = "44286")]
-pubfnreplace_key(self) -> K{
-self.base.replace_key()
-}
 }
 
 impl<'a,K:'a,V:'a>VacantEntry<'a,K,V>{

library/std/src/collections/hash/set.rs

@@ -724,38 +724,6 @@ where
 self.base.get_or_insert(value)
 }
 
-/// Inserts an owned copy of the given `value` into the set if it is not
-/// present, then returns a reference to the value in the set.
-///
-/// # Examples
-///
-/// ```
-/// #![feature(hash_set_entry)]
-///
-/// use std::collections::HashSet;
-///
-/// let mut set: HashSet<String> = ["cat", "dog", "horse"]
-/// .iter().map(|&pet| pet.to_owned()).collect();
-///
-/// assert_eq!(set.len(), 3);
-/// for &pet in &["cat", "dog", "fish"] {
-/// let value = set.get_or_insert_owned(pet);
-/// assert_eq!(value, pet);
-/// }
-/// assert_eq!(set.len(), 4); // a new "fish" was inserted
-/// ```
-#[inline]
-#[unstable(feature = "hash_set_entry", issue = "60896")]
-pubfnget_or_insert_owned<Q: ?Sized>(&mutself,value:&Q) -> &T
-where
-T:Borrow<Q>,
-Q:Hash + Eq + ToOwned<Owned = T>,
-{
-// Although the raw entry gives us `&mut T`, we only return `&T` to be consistent with
-// `get`. Key mutation is "raw" because you're not supposed to affect `Eq` or `Hash`.
-self.base.get_or_insert_owned(value)
-}
-
 /// Inserts a value computed from `f` into the set if the given `value` is
 /// not present, then returns a reference to the value in the set.
 ///