feat: expose set max age

index.d.ts

@@ -123,6 +123,11 @@ export default class QuickLRU<KeyType, ValueType> extends Map<KeyType, ValueType
 	*/
 	get maxSize(): number;
 
+	/**
+	The set max age.
+	*/
+	get maxAge(): number;
+
 	/**
 	Iterable for all the keys.
 	*/

index.js

@@ -301,6 +301,10 @@ export default class QuickLRU extends Map {
 		return this.#maxSize;
 	}
 
+	get maxAge() {
+		return this.#maxAge;
+	}
+
 	entries() {
 		return this.entriesAscending();
 	}

index.test-d.ts

@@ -10,6 +10,7 @@ expectType<number | undefined>(lru.peek('🦄'));
 expectType<number | undefined>(lru.expiresIn('🦄'));
 expectType<boolean>(lru.delete('🦄'));
 expectType<number>(lru.size);
+expectType<number>(lru.maxAge);
 
 for (const [key, value] of lru) {
 	expectType<string>(key);

readme.md

@@ -185,6 +185,10 @@ The stored item count.
 
 The set max size.
 
+#### .maxAge *(getter)*
+
+The set max age.
+
 ## Algorithm
 
 This library implements a variant of the [hashlru algorithm](https://github.com/dominictarr/hashlru#algorithm) using JavaScript's `Map` for broader key type support.

test.js

@@ -218,6 +218,11 @@ test('.maxSize', t => {
 	t.is(lru.maxSize, maxSize);
 });
 
+test('.maxAge', t => {
+	const lru = new QuickLRU({maxSize: 1});
+	t.is(lru.maxAge, Number.POSITIVE_INFINITY);
+});
+
 test('checks total cache size does not exceed `maxSize`', t => {
 	const lru = new QuickLRU({maxSize: 2});
 	lru.set('1', 1);
@@ -293,6 +298,12 @@ test('set(maxAge): setting the same key refreshes expiration', async t => {
 	t.true(lru.has('1'));
 });
 
+test('set(maxAge): is returned by getter', t => {
+	const maxAge = 100;
+	const lru = new QuickLRU({maxSize: 1, maxAge});
+	t.is(lru.maxAge, maxAge);
+});
+
 test('maxAge: get() removes an expired item', async t => {
 	const lru = new QuickLRU({maxSize: 10, maxAge: 90});
 	lru.set('1', 'test');