Removing deprecation from the non stable hashsets

Author: andristarr

crates/bevy_utils/src/lib.rs

@@ -87,7 +87,6 @@ impl BuildHasher for FixedState {
 /// speed keyed hashing algorithm intended for use in in-memory hashmaps.
 ///
 /// aHash is designed for performance and is NOT cryptographically secure.
-#[deprecated(note = "Will be required to use the hash library of your choice.")]
 pub type HashMap<K, V> = hashbrown::HashMap<K, V, BuildHasherDefault<AHasher>>;
 
 /// A stable hash map implementing aHash, a high speed keyed hashing algorithm
@@ -97,14 +96,13 @@ pub type HashMap<K, V> = hashbrown::HashMap<K, V, BuildHasherDefault<AHasher>>;
 /// of insertions and deletions and not a random source.
 ///
 /// aHash is designed for performance and is NOT cryptographically secure.
-#[deprecated(note = "Will be required to use the hash library of your choice.")]
+#[deprecated(note = "Will be required to use the hash library of your choice. Alias for: hashbrown::HashMap<K, V, FixedState>")]
 pub type StableHashMap<K, V> = hashbrown::HashMap<K, V, FixedState>;
 
 /// A [`HashSet`][hashbrown::HashSet] implementing aHash, a high
 /// speed keyed hashing algorithm intended for use in in-memory hashmaps.
 ///
 /// aHash is designed for performance and is NOT cryptographically secure.
-#[deprecated(note = "Will be required to use the hash library of your choice.")]
 pub type HashSet<K> = hashbrown::HashSet<K, BuildHasherDefault<AHasher>>;
 
 /// A stable hash set implementing aHash, a high speed keyed hashing algorithm
@@ -114,7 +112,7 @@ pub type HashSet<K> = hashbrown::HashSet<K, BuildHasherDefault<AHasher>>;
 /// of insertions and deletions and not a random source.
 ///
 /// aHash is designed for performance and is NOT cryptographically secure.
-#[deprecated(note = "Will be required to use the hash library of your choice.")]
+#[deprecated(note = "Will be required to use the hash library of your choice. Alias for: hashbrown::HashMap<K, V, FixedState>")]
 pub type StableHashSet<K> = hashbrown::HashSet<K, FixedState>;
 
 /// A pre-hashed value of a specific type. Pre-hashing enables memoization of hashes that are expensive to compute.