docs: fix examples (#31)

wellwelwel · Aug 27, 2024 · ba5b775 · ba5b775
1 parent d716377
commit ba5b775
Show file tree

Hide file tree

Showing 3 changed files with 5 additions and 5 deletions.
diff --git a/README.md b/README.md
@@ -198,7 +198,7 @@ const entries = [...LRU.entries()];
 Iterates over each key-value pair in the cache, from most recent to least recent.
 
 ```ts
-LRU.forEach((key, value) => {
+LRU.forEach((value, key) => {
   // do something
 });
 ```
@@ -224,7 +224,7 @@ The benchmark is performed by comparing `1,000,000` runs through a maximum cache
   quick-lru:  401318.80µs
 ```
 
-- See detailed results and how the tests are run and compared in the [benchmark](https://github.com/wellwelwel/lru.min/tree/main/benchmark) directory.
+- See detailed results and how the tests are run and compared in the [**benchmark**](https://github.com/wellwelwel/lru.min/tree/main/benchmark) directory.
 
 ---
 

diff --git a/package-lock.json b/package-lock.json
diff --git a/package.json b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "lru.min",
-  "version": "0.3.1",
+  "version": "0.3.2",
   "description": "🔥 An extremely fast and efficient LRU cache for JavaScript (Browser compatible) — 6.7KB.",
   "main": "./lib/index.js",
   "module": "./lib/index.mjs",