mirror of
https://github.com/bevyengine/bevy
synced 2024-11-10 07:04:33 +00:00
Ahash constructor extensions and HashMap / HashSet (#790)
Ahash constructor extensions and HashMap / HashSet
This commit is contained in:
parent
0c30762ab7
commit
c9acef04e3
2 changed files with 82 additions and 7 deletions
|
@ -1,4 +1,5 @@
|
|||
use std::{collections::HashMap, hash::Hash};
|
||||
use bevy_utils::{AHashExt, HashMap};
|
||||
use std::hash::Hash;
|
||||
|
||||
#[derive(Debug)]
|
||||
pub struct Axis<T> {
|
||||
|
|
|
@ -9,15 +9,89 @@ pub type BoxedFuture<'a, T> = Pin<Box<dyn Future<Output = T> + Send + 'a>>;
|
|||
#[cfg(target_arch = "wasm32")]
|
||||
pub type BoxedFuture<'a, T> = Pin<Box<dyn Future<Output = T> + 'a>>;
|
||||
|
||||
/// A std hash map 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.
|
||||
pub type HashMap<K, V> = std::collections::HashMap<K, V, RandomState>;
|
||||
pub type HashSet<K> = std::collections::HashSet<K, RandomState>;
|
||||
|
||||
pub trait HashMapExt {
|
||||
fn with_capacity(cap: usize) -> Self;
|
||||
pub trait AHashExt {
|
||||
fn new() -> Self;
|
||||
|
||||
fn with_capacity(capacity: usize) -> Self;
|
||||
}
|
||||
|
||||
impl<K, V> HashMapExt for HashMap<K, V> {
|
||||
fn with_capacity(cap: usize) -> Self {
|
||||
HashMap::with_capacity_and_hasher(cap, RandomState::default())
|
||||
impl<K, V> AHashExt for HashMap<K, V> {
|
||||
/// Creates an empty `HashMap` with AHash.
|
||||
///
|
||||
/// The hash map is initially created with a capacity of 0, so it will not
|
||||
/// allocate until it is first inserted into.
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
/// ```
|
||||
/// use bevy_utils::{HashMap, AHashExt};
|
||||
/// let mut map: HashMap<&str, i32> = HashMap::new();
|
||||
/// ```
|
||||
#[inline]
|
||||
fn new() -> Self {
|
||||
Default::default()
|
||||
}
|
||||
|
||||
/// Creates an empty `HashMap` with the specified capacity with AHash.
|
||||
///
|
||||
/// The hash map will be able to hold at least `capacity` elements without
|
||||
/// reallocating. If `capacity` is 0, the hash map will not allocate.
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
/// ```
|
||||
/// use bevy_utils::{HashMap, AHashExt};
|
||||
/// let mut map: HashMap<&str, i32> = HashMap::with_capacity(10);
|
||||
/// ```
|
||||
#[inline]
|
||||
fn with_capacity(capacity: usize) -> Self {
|
||||
HashMap::with_capacity_and_hasher(capacity, RandomState::default())
|
||||
}
|
||||
}
|
||||
|
||||
/// A std hash set 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.
|
||||
pub type HashSet<K> = std::collections::HashSet<K, RandomState>;
|
||||
|
||||
impl<K> AHashExt for HashSet<K> {
|
||||
/// Creates an empty `HashSet` with AHash.
|
||||
///
|
||||
/// The hash set is initially created with a capacity of 0, so it will not
|
||||
/// allocate until it is first inserted into.
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
/// ```
|
||||
/// use bevy_utils::{HashSet, AHashExt};
|
||||
/// let set: HashSet<i32> = HashSet::new();
|
||||
/// ```
|
||||
#[inline]
|
||||
fn new() -> Self {
|
||||
Default::default()
|
||||
}
|
||||
|
||||
/// Creates an empty `HashSet` with the specified capacity with AHash.
|
||||
///
|
||||
/// The hash set will be able to hold at least `capacity` elements without
|
||||
/// reallocating. If `capacity` is 0, the hash set will not allocate.
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
/// ```
|
||||
/// use bevy_utils::{HashSet, AHashExt};
|
||||
/// let set: HashSet<i32> = HashSet::with_capacity(10);
|
||||
/// assert!(set.capacity() >= 10);
|
||||
/// ```
|
||||
#[inline]
|
||||
fn with_capacity(capacity: usize) -> Self {
|
||||
HashSet::with_capacity_and_hasher(capacity, RandomState::default())
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Reference in a new issue