Create internal hashmap with specified capacity

jeromefroe · Jan 2, 2017 · b1dae7a · b1dae7a
1 parent 1c1e2b9
commit b1dae7a
Show file tree

Hide file tree

Showing 3 changed files with 6 additions and 2 deletions.
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -1,5 +1,9 @@
 # Changelog
 
+## [v0.1.3](https://github.com/jeromefroe/lru-rs/tree/0.1.2) - 2017-01-02
+
+* Create internal hashmap with specified capacity.
+
 ## [v0.1.2](https://github.com/jeromefroe/lru-rs/tree/0.1.2) - 2017-01-02
 
 * Add `peek` and `contains` functions.

diff --git a/Cargo.toml b/Cargo.toml
@@ -1,6 +1,6 @@
 [package]
 name = "lru"
-version = "0.1.2"
+version = "0.1.3"
 authors = ["Jerome Froelich <jeromefroelic@hotmail.com>"]
 description = "A LRU cache implementation"
 homepage = "https://github.com/jeromefroe/lru-rs"

diff --git a/src/lib.rs b/src/lib.rs
@@ -115,7 +115,7 @@ impl<K: Hash + Eq, V> LruCache<K, V> {
     /// ```
     pub fn new(cap: usize) -> LruCache<K, V> {
         let mut cache = LruCache {
-            map: HashMap::new(),
+            map: HashMap::with_capacity(cap),
             cap: cap,
             head: unsafe { Box::into_raw(Box::new(mem::uninitialized::<LruEntry<K, V>>())) },
             tail: unsafe { Box::into_raw(Box::new(mem::uninitialized::<LruEntry<K, V>>())) },