From 187fa5baeddead1bfca73b2f37652ef01c7ee4d6 Mon Sep 17 00:00:00 2001
From: Sindre Sorhus <sindresorhus@gmail.com>
Date: Mon, 11 Sep 2023 16:03:25 +0700
Subject: [PATCH] Add `.maxSize` getter

Fixes #47
---
 index.d.ts | 5 +++++
 index.js   | 4 ++++
 readme.md  | 4 ++++
 test.js    | 6 ++++++
 4 files changed, 19 insertions(+)

diff --git a/index.d.ts b/index.d.ts
index 1b19e62..ab564fe 100644
--- a/index.d.ts
+++ b/index.d.ts
@@ -102,6 +102,11 @@ export default class QuickLRU<KeyType, ValueType> extends Map<KeyType, ValueType
 	*/
 	get size(): number;
 
+	/**
+	The set max size.
+	*/
+	get maxSize(): number;
+
 	/**
 	Iterable for all the keys.
 	*/
diff --git a/index.js b/index.js
index bb948de..aca797a 100644
--- a/index.js
+++ b/index.js
@@ -273,6 +273,10 @@ export default class QuickLRU extends Map {
 		return Math.min(this.#size + oldCacheSize, this.#maxSize);
 	}
 
+	get maxSize() {
+		return this.#maxSize;
+	}
+
 	entries() {
 		return this.entriesAscending();
 	}
diff --git a/readme.md b/readme.md
index 2ba1aea..00dbce4 100644
--- a/readme.md
+++ b/readme.md
@@ -140,6 +140,10 @@ Loop over entries calling the `callbackFunction` for each entry (ascending in re
 
 The stored item count.
 
+#### .maxSize *(getter)*
+
+The set max size.
+
 ## Related
 
 - [yocto-queue](https://github.com/sindresorhus/yocto-queue) - Tiny queue data structure
diff --git a/test.js b/test.js
index c475b82..cbe6e00 100644
--- a/test.js
+++ b/test.js
@@ -184,6 +184,12 @@ test('max size', t => {
 	t.is(lru.size, 3);
 });
 
+test('.maxSize', t => {
+	const maxSize = 100;
+	const lru = new QuickLRU({maxSize});
+	t.is(lru.maxSize, maxSize);
+});
+
 test('checks total cache size does not exceed `maxSize`', t => {
 	const lru = new QuickLRU({maxSize: 2});
 	lru.set('1', 1);