@chriscdn/memoize 1.0.3 → 1.0.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md CHANGED
@@ -97,6 +97,33 @@ console.log(addCachedAsync.cache.size === 1);
97
97
  // true
98
98
  ```
99
99
 
100
+ Here is the revised version with a note about TypeScript compatibility:
101
+
102
+ ---
103
+
104
+ ## Class Methods
105
+
106
+ Class methods can also be memoized, though this requires overriding the method within the constructor. When doing so, it's important to bind the method to the instance to ensure it maintains the correct context.
107
+
108
+ Consider the following example, where the `add` method is memoized by reassigning it within the constructor after binding it to the current instance. This ensures the memoized version retains access to instance properties like `count` and keeps TypeScript happy by preserving the method's type signature.
109
+
110
+ ```ts
111
+ class AddClass {
112
+ count: number = 0;
113
+
114
+ constructor() {
115
+ this.add = Memoize(this.add.bind(this));
116
+ }
117
+
118
+ add(x: number, y: number) {
119
+ this.count += 1;
120
+ return x + y;
121
+ }
122
+ }
123
+ ```
124
+
125
+ Keep in mind that each instance of a class will maintain its own separate cache.
126
+
100
127
  ## Tests
101
128
 
102
129
  ```bash
@@ -1,4 +1,4 @@
1
- import { expect, test } from "vitest";
1
+ import { describe, expect, it } from "vitest";
2
2
  import { Memoize, MemoizeAsync } from "../src/index";
3
3
 
4
4
  let addSyncCount = 0;
@@ -14,44 +14,91 @@ const addAsync = async (x: number, y: number) => {
14
14
  return x + y;
15
15
  };
16
16
 
17
- test("sync", async () => {
18
- const addCached = Memoize(add);
19
-
20
- expect(addCached(1, 2)).toBe(3);
21
- expect(addCached(1, 2)).toBe(3);
22
- expect(addCached(1, 2)).toBe(3);
23
- expect(addCached(1, 2)).toBe(3);
24
- expect(addCached(1, 2)).toBe(3);
17
+ const _asyncThrowError = MemoizeAsync(async (x: number, y: number) => {
18
+ addAsyncCount += 1;
19
+ throw new Error("Boom!");
20
+ return x + y;
21
+ });
25
22
 
26
- // different key here
27
- expect(addCached(2, 1)).toBe(3);
28
- expect(addSyncCount).toBe(2);
23
+ const asyncThrowError = MemoizeAsync(async (x: number, y: number) => {
24
+ try {
25
+ await _asyncThrowError(x, y);
26
+ } catch {
27
+ return -1;
28
+ }
29
29
  });
30
30
 
31
- test("async", async () => {
32
- const addCachedAsync = MemoizeAsync(addAsync);
31
+ describe("Memoization", () => {
32
+ it("sync", async () => {
33
+ const addCached = Memoize(add);
33
34
 
34
- await Promise.all([
35
- addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
36
- addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
37
- addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
38
- addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
35
+ expect(addCached(1, 2)).toBe(3);
36
+ expect(addCached(1, 2)).toBe(3);
37
+ expect(addCached(1, 2)).toBe(3);
38
+ expect(addCached(1, 2)).toBe(3);
39
+ expect(addCached(1, 2)).toBe(3);
39
40
 
40
41
  // different key here
41
- addCachedAsync(2, 1).then((value) => expect(value).toBe(3)),
42
- ]);
42
+ expect(addCached(2, 1)).toBe(3);
43
+ expect(addSyncCount).toBe(2);
44
+ });
45
+
46
+ it("async", async () => {
47
+ const addCachedAsync = MemoizeAsync(addAsync);
48
+
49
+ await Promise.all([
50
+ addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
51
+ addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
52
+ addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
53
+ addCachedAsync(1, 2).then((value) => expect(value).toBe(3)),
54
+
55
+ // different key here
56
+ addCachedAsync(2, 1).then((value) => expect(value).toBe(3)),
57
+ ]);
43
58
 
44
- expect(addAsyncCount).toBe(2);
45
- expect(addCachedAsync.cache.size).toBe(2);
59
+ expect(addAsyncCount).toBe(2);
60
+ expect(addCachedAsync.cache.size).toBe(2);
61
+ });
62
+
63
+ it("resolver", () => {
64
+ // This its the resolver function to ensure the same value is returned for
65
+ // the same key.
66
+
67
+ const addCachedSameKey = Memoize(add, { resolver: (x, y) => "key" });
68
+
69
+ expect(addCachedSameKey(5, 7)).toBe(12);
70
+ expect(addCachedSameKey(1, 1)).toBe(12);
71
+ expect(addCachedSameKey(5, 1)).toBe(12);
72
+ });
73
+
74
+ it("async error", async () => {
75
+ expect(await asyncThrowError(4, 3)).toBe(-1);
76
+ });
46
77
  });
47
78
 
48
- test("resolver", () => {
49
- // This tests the resolver function to ensure the same value is returned for
50
- // the same key.
79
+ describe("Memoization of Class methods", () => {
80
+ class AddClass {
81
+ count: number = 0;
82
+
83
+ constructor() {
84
+ this.add = Memoize(this.add.bind(this));
85
+ }
86
+
87
+ add(x: number, y: number) {
88
+ this.count += 1;
89
+ return x + y;
90
+ }
91
+ }
51
92
 
52
- const addCachedSameKey = Memoize(add, { resolver: (x, y) => "key" });
93
+ it("Test1", () => {
94
+ const obj = new AddClass();
53
95
 
54
- expect(addCachedSameKey(5, 7)).toBe(12);
55
- expect(addCachedSameKey(1, 1)).toBe(12);
56
- expect(addCachedSameKey(5, 1)).toBe(12);
96
+ expect(obj.count).toBe(0);
97
+ expect(obj.add(1, 2)).toBe(3);
98
+ expect(obj.count).toBe(1);
99
+ expect(obj.add(1, 2)).toBe(3);
100
+ expect(obj.count).toBe(1);
101
+ expect(obj.add(5, 2)).toBe(7);
102
+ expect(obj.count).toBe(2);
103
+ });
57
104
  });
package/lib/index.d.ts CHANGED
@@ -14,7 +14,7 @@ declare const Memoize: <Args extends unknown[], Return>(cb: (...args: Args) => R
14
14
  /**
15
15
  * Memoize an asynchronous function.
16
16
  *
17
- * This differs from the sychronous case by ensuring multiple calls with the
17
+ * This differs from the synchronous case by ensuring multiple calls with the
18
18
  * same arguments is only evaluated once. This is controlled by using a
19
19
  * semaphore, which forces redundant calls to wait until the first call
20
20
  * completes.
@@ -1 +1 @@
1
- {"version":3,"file":"memoize.cjs","sources":["../src/index.ts"],"sourcesContent":["import Semaphore from \"@chriscdn/promise-semaphore\";\nimport QuickLRU from \"quick-lru\";\n\nconst kDefaultMaxSize = 1000;\n\ntype Options<T extends any[]> = {\n maxSize: number;\n maxAge?: number;\n resolver: (...args: T) => string;\n};\n\n/**\n * Memoize a synchronous function.\n */\nconst Memoize = <Args extends unknown[], Return>(\n cb: (...args: Args) => Return,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver = options.resolver ??\n ((...args: Args) => JSON.stringify(args));\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = (...args: Args): Return => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\n/**\n * Memoize an asynchronous function.\n *\n * This differs from the sychronous case by ensuring multiple calls with the\n * same arguments is only evaluated once. This is controlled by using a\n * semaphore, which forces redundant calls to wait until the first call\n * completes.\n */\nconst MemoizeAsync = <Args extends unknown[], Return>(\n cb: (...args: Args) => Promise<Return>,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver = options.resolver ??\n ((...args: Args) => JSON.stringify(args));\n\n const semaphore = new Semaphore();\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = async (...args: Args): Promise<Return> => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key)!;\n } else {\n try {\n await semaphore.acquire(key);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = await cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n } finally {\n semaphore.release(key);\n }\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\nexport { Memoize, MemoizeAsync };\n"],"names":["cb","options","_options$maxSize","_options$resolver","maxSize","resolver","JSON","stringify","slice","call","arguments","cache","QuickLRU","maxAge","memoizedFunction","args","key","apply","has","get","returnValue","set","_options$maxSize2","_options$resolver2","semaphore","Semaphore","_arguments","Promise","resolve","acquire","then","_finallyRethrows","_wasThrown","_result","release","e","reject"],"mappings":"wMAcgB,SACZA,EACAC,GACAC,IAAAA,EAAAC,OADAF,IAAAA,IAAAA,EAAkC,CAAA,GAElC,IACMG,EAAyB,OAAlBF,EAAGD,EAAQG,SAAOF,EAhBX,IAkBdG,EAA2B,OAAnBF,EAAGF,EAAQI,UAAQF,EAC5B,WAAmB,OAAAG,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAEtCC,EAAQ,IAAIC,EAAAA,QAAyB,CACvCC,OAP+BZ,EAAQY,OAQvCT,QAAAA,IAGEU,EAAmB,WAAI,IAAAC,EAAUP,GAAAA,MAAAC,KAAAC,WAC7BM,EAAMX,EAAQY,WAAIF,EAAAA,GAExB,GAAIJ,EAAMO,IAAIF,GACV,OAAOL,EAAMQ,IAAIH,GAEjB,IAAMI,EAAcpB,EAAEiB,WAAIF,EAAAA,GAE1B,OADAJ,EAAMU,IAAIL,EAAKI,GACRA,CAEf,EAIA,OAFAN,EAAiBH,MAAQA,EAElBG,CACX,uBAUqB,SACjBd,EACAC,GACAqB,IAAAA,EAAAC,OADAtB,IAAAA,IAAAA,EAAkC,CAAE,GAEpC,IAAMY,EAA6BZ,EAAQY,OACrCT,EAAyBkB,OAAlBA,EAAGrB,EAAQG,SAAOkB,EAxDX,IA0DdjB,EAA2BkB,OAAnBA,EAAGtB,EAAQI,UAAQkB,EAC5B,WAAmB,OAAAjB,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAEtCc,EAAY,IAAIC,EAAW,QAE3Bd,EAAQ,IAAIC,EAAAA,QAAyB,CACvCC,OAAAA,EACAT,QAAAA,IAGEU,EAAA,eAA4DY,IAA/BX,EAAU,GAAAP,MAAAC,KAAqBC,WACxDM,EAAMX,EAAQY,WAAIF,EAAAA,GAAM,OAAAY,QAAAC,QAE1BjB,EAAMO,IAAIF,GACHL,EAAMQ,IAAIH,2BAEbW,QAAAC,QACMJ,EAAUK,QAAQb,IAAIc,KAAA,WAAA,OAExBnB,EAAMO,IAAIF,GACHL,EAAMQ,IAAIH,GAAKW,QAAAC,QAEI5B,EAAEiB,WAAIF,EAAAA,IAAKe,KAAA,SAA/BV,GAEN,OADAT,EAAMU,IAAIL,EAAKI,GACRA,CAAY,EAE1B,4FAZsBW,CAEnB,EAUHC,SAAAA,EAAAC,GAC0B,GAAvBT,EAAUU,QAAQlB,GAAKgB,EAAA,MAAAC,EAAA,OAAAA,CAAA,GAGnC,CAAC,MAAAE,GAAA,OAAAR,QAAAS,OAAAD,EAEDrB,CAAAA,EAEA,OAFAA,EAAiBH,MAAQA,EAElBG,CACX"}
1
+ {"version":3,"file":"memoize.cjs","sources":["../src/index.ts"],"sourcesContent":["import Semaphore from \"@chriscdn/promise-semaphore\";\nimport QuickLRU from \"quick-lru\";\n\nconst kDefaultMaxSize = 1000;\n\ntype Options<T extends any[]> = {\n maxSize: number;\n maxAge?: number;\n resolver: (...args: T) => string;\n};\n\n/**\n * Memoize a synchronous function.\n */\nconst Memoize = <Args extends unknown[], Return>(\n cb: (...args: Args) => Return,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver =\n options.resolver ?? ((...args: Args) => JSON.stringify(args));\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = (...args: Args): Return => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\n/**\n * Memoize an asynchronous function.\n *\n * This differs from the synchronous case by ensuring multiple calls with the\n * same arguments is only evaluated once. This is controlled by using a\n * semaphore, which forces redundant calls to wait until the first call\n * completes.\n */\nconst MemoizeAsync = <Args extends unknown[], Return>(\n cb: (...args: Args) => Promise<Return>,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver =\n options.resolver ?? ((...args: Args) => JSON.stringify(args));\n\n const semaphore = new Semaphore();\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = async (...args: Args): Promise<Return> => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key)!;\n } else {\n try {\n await semaphore.acquire(key);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = await cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n } finally {\n semaphore.release(key);\n }\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\nexport { Memoize, MemoizeAsync };\n"],"names":["cb","options","_options$maxSize","_options$resolver","maxSize","resolver","JSON","stringify","slice","call","arguments","cache","QuickLRU","maxAge","memoizedFunction","args","key","apply","has","get","returnValue","set","_options$maxSize2","_options$resolver2","semaphore","Semaphore","_arguments","Promise","resolve","acquire","then","_finallyRethrows","_wasThrown","_result","release","e","reject"],"mappings":"wMAcgB,SACdA,EACAC,GACEC,IAAAA,EAAAC,OADFF,IAAAA,IAAAA,EAAkC,CAAA,GAElC,IACMG,EAAyB,OAAlBF,EAAGD,EAAQG,SAAOF,EAhBT,IAkBhBG,EACY,OADJF,EACZF,EAAQI,UAAQF,EAAK,WAAmB,OAAAG,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAExDC,EAAQ,IAAIC,EAAAA,QAAyB,CACzCC,OAPiCZ,EAAQY,OAQzCT,QAAAA,IAGIU,EAAmB,WAAI,IAAAC,EAAUP,GAAAA,MAAAC,KAAAC,WAC/BM,EAAMX,EAAQY,WAAIF,EAAAA,GAExB,GAAIJ,EAAMO,IAAIF,GACZ,OAAOL,EAAMQ,IAAIH,GAEjB,IAAMI,EAAcpB,EAAEiB,WAAIF,EAAAA,GAE1B,OADAJ,EAAMU,IAAIL,EAAKI,GACRA,CAEX,EAIA,OAFAN,EAAiBH,MAAQA,EAElBG,CACT,uBAUqB,SACnBd,EACAC,GACEqB,IAAAA,EAAAC,OADFtB,IAAAA,IAAAA,EAAkC,CAAE,GAEpC,IAAMY,EAA6BZ,EAAQY,OACrCT,EAAyBkB,OAAlBA,EAAGrB,EAAQG,SAAOkB,EAxDT,IA0DhBjB,EACYkB,OADJA,EACZtB,EAAQI,UAAQkB,EAAK,WAAmB,OAAAjB,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAExDc,EAAY,IAAIC,EAAW,QAE3Bd,EAAQ,IAAIC,EAAAA,QAAyB,CACzCC,OAAAA,EACAT,QAAAA,IAGIU,EAAA,eAA4DY,IAA/BX,EAAU,GAAAP,MAAAC,KAAqBC,WAC1DM,EAAMX,EAAQY,WAAIF,EAAAA,GAAM,OAAAY,QAAAC,QAE1BjB,EAAMO,IAAIF,GACLL,EAAMQ,IAAIH,2BAEbW,QAAAC,QACIJ,EAAUK,QAAQb,IAAIc,KAAA,WAAA,OAExBnB,EAAMO,IAAIF,GACLL,EAAMQ,IAAIH,GAAKW,QAAAC,QAEI5B,EAAEiB,WAAIF,EAAAA,IAAKe,KAAA,SAA/BV,GAEN,OADAT,EAAMU,IAAIL,EAAKI,GACRA,CAAY,EAEtB,4FAZsBW,CAEnB,EAUHC,SAAAA,EAAAC,GACwB,GAAvBT,EAAUU,QAAQlB,GAAKgB,EAAA,MAAAC,EAAA,OAAAA,CAAA,GAG7B,CAAC,MAAAE,GAAA,OAAAR,QAAAS,OAAAD,EAEDrB,CAAAA,EAEA,OAFAA,EAAiBH,MAAQA,EAElBG,CACT"}
@@ -1 +1 @@
1
- {"version":3,"file":"memoize.modern.js","sources":["../src/index.ts"],"sourcesContent":["import Semaphore from \"@chriscdn/promise-semaphore\";\nimport QuickLRU from \"quick-lru\";\n\nconst kDefaultMaxSize = 1000;\n\ntype Options<T extends any[]> = {\n maxSize: number;\n maxAge?: number;\n resolver: (...args: T) => string;\n};\n\n/**\n * Memoize a synchronous function.\n */\nconst Memoize = <Args extends unknown[], Return>(\n cb: (...args: Args) => Return,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver = options.resolver ??\n ((...args: Args) => JSON.stringify(args));\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = (...args: Args): Return => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\n/**\n * Memoize an asynchronous function.\n *\n * This differs from the sychronous case by ensuring multiple calls with the\n * same arguments is only evaluated once. This is controlled by using a\n * semaphore, which forces redundant calls to wait until the first call\n * completes.\n */\nconst MemoizeAsync = <Args extends unknown[], Return>(\n cb: (...args: Args) => Promise<Return>,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver = options.resolver ??\n ((...args: Args) => JSON.stringify(args));\n\n const semaphore = new Semaphore();\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = async (...args: Args): Promise<Return> => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key)!;\n } else {\n try {\n await semaphore.acquire(key);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = await cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n } finally {\n semaphore.release(key);\n }\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\nexport { Memoize, MemoizeAsync };\n"],"names":["Memoize","cb","options","_options$maxSize","_options$resolver","maxSize","resolver","args","JSON","stringify","cache","QuickLRU","maxAge","memoizedFunction","key","has","get","returnValue","set","MemoizeAsync","_options$maxSize2","_options$resolver2","semaphore","Semaphore","async","acquire","release"],"mappings":"oEAGA,MAWMA,EAAUA,CACZC,EACAC,EAAkC,CAAA,KAClC,IAAAC,EAAAC,EACA,MACMC,SAAOF,EAAGD,EAAQG,SAAOF,EAhBX,IAkBdG,EAA2B,OAAnBF,EAAGF,EAAQI,UAAQF,EAC5B,IAAIG,IAAeC,KAAKC,UAAUF,GAEjCG,EAAQ,IAAIC,EAAyB,CACvCC,OAP+BV,EAAQU,OAQvCP,YAGEQ,EAAmBA,IAAIN,KACzB,MAAMO,EAAMR,KAAYC,GAExB,GAAIG,EAAMK,IAAID,GACV,OAAOJ,EAAMM,IAAIF,GACd,CACH,MAAMG,EAAchB,KAAMM,GAE1B,OADAG,EAAMQ,IAAIJ,EAAKG,GACRA,CACV,GAKL,OAFAJ,EAAiBH,MAAQA,EAElBG,GAWLM,EAAeA,CACjBlB,EACAC,EAAkC,CAAA,KAClC,IAAAkB,EAAAC,EACA,MAAMT,EAA6BV,EAAQU,OACrCP,EAAyBe,OAAlBA,EAAGlB,EAAQG,SAAOe,EAxDX,IA0Ddd,SAAQe,EAAGnB,EAAQI,UAAQe,EAC5B,IAAId,IAAeC,KAAKC,UAAUF,GAEjCe,EAAY,IAAIC,EAEhBb,EAAQ,IAAIC,EAAyB,CACvCC,SACAP,YAGEQ,EAAmBW,SAAUjB,KAC/B,MAAMO,EAAMR,KAAYC,GAExB,GAAIG,EAAMK,IAAID,GACV,OAAOJ,EAAMM,IAAIF,GAEjB,IAGI,SAFMQ,EAAUG,QAAQX,GAEpBJ,EAAMK,IAAID,GACV,OAAOJ,EAAMM,IAAIF,GACd,CACH,MAAMG,QAAoBhB,KAAMM,GAEhC,OADAG,EAAMQ,IAAIJ,EAAKG,GACRA,CACV,CACJ,CAAA,QACGK,EAAUI,QAAQZ,EACrB,CACJ,EAKL,OAFAD,EAAiBH,MAAQA,EAElBG"}
1
+ {"version":3,"file":"memoize.modern.js","sources":["../src/index.ts"],"sourcesContent":["import Semaphore from \"@chriscdn/promise-semaphore\";\nimport QuickLRU from \"quick-lru\";\n\nconst kDefaultMaxSize = 1000;\n\ntype Options<T extends any[]> = {\n maxSize: number;\n maxAge?: number;\n resolver: (...args: T) => string;\n};\n\n/**\n * Memoize a synchronous function.\n */\nconst Memoize = <Args extends unknown[], Return>(\n cb: (...args: Args) => Return,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver =\n options.resolver ?? ((...args: Args) => JSON.stringify(args));\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = (...args: Args): Return => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\n/**\n * Memoize an asynchronous function.\n *\n * This differs from the synchronous case by ensuring multiple calls with the\n * same arguments is only evaluated once. This is controlled by using a\n * semaphore, which forces redundant calls to wait until the first call\n * completes.\n */\nconst MemoizeAsync = <Args extends unknown[], Return>(\n cb: (...args: Args) => Promise<Return>,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver =\n options.resolver ?? ((...args: Args) => JSON.stringify(args));\n\n const semaphore = new Semaphore();\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = async (...args: Args): Promise<Return> => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key)!;\n } else {\n try {\n await semaphore.acquire(key);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = await cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n } finally {\n semaphore.release(key);\n }\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\nexport { Memoize, MemoizeAsync };\n"],"names":["Memoize","cb","options","_options$maxSize","_options$resolver","maxSize","resolver","args","JSON","stringify","cache","QuickLRU","maxAge","memoizedFunction","key","has","get","returnValue","set","MemoizeAsync","_options$maxSize2","_options$resolver2","semaphore","Semaphore","async","acquire","release"],"mappings":"oEAGA,MAWMA,EAAUA,CACdC,EACAC,EAAkC,CAAA,KAChC,IAAAC,EAAAC,EACF,MACMC,SAAOF,EAAGD,EAAQG,SAAOF,EAhBT,IAkBhBG,EACY,OADJF,EACZF,EAAQI,UAAQF,EAAK,IAAIG,IAAeC,KAAKC,UAAUF,GAEnDG,EAAQ,IAAIC,EAAyB,CACzCC,OAPiCV,EAAQU,OAQzCP,YAGIQ,EAAmBA,IAAIN,KAC3B,MAAMO,EAAMR,KAAYC,GAExB,GAAIG,EAAMK,IAAID,GACZ,OAAOJ,EAAMM,IAAIF,GACZ,CACL,MAAMG,EAAchB,KAAMM,GAE1B,OADAG,EAAMQ,IAAIJ,EAAKG,GACRA,CACR,GAKH,OAFAJ,EAAiBH,MAAQA,EAElBG,GAWHM,EAAeA,CACnBlB,EACAC,EAAkC,CAAA,KAChC,IAAAkB,EAAAC,EACF,MAAMT,EAA6BV,EAAQU,OACrCP,EAAyBe,OAAlBA,EAAGlB,EAAQG,SAAOe,EAxDT,IA0DhBd,SAAQe,EACZnB,EAAQI,UAAQe,EAAK,IAAId,IAAeC,KAAKC,UAAUF,GAEnDe,EAAY,IAAIC,EAEhBb,EAAQ,IAAIC,EAAyB,CACzCC,SACAP,YAGIQ,EAAmBW,SAAUjB,KACjC,MAAMO,EAAMR,KAAYC,GAExB,GAAIG,EAAMK,IAAID,GACZ,OAAOJ,EAAMM,IAAIF,GAEjB,IAGE,SAFMQ,EAAUG,QAAQX,GAEpBJ,EAAMK,IAAID,GACZ,OAAOJ,EAAMM,IAAIF,GACZ,CACL,MAAMG,QAAoBhB,KAAMM,GAEhC,OADAG,EAAMQ,IAAIJ,EAAKG,GACRA,CACR,CACF,CAAA,QACCK,EAAUI,QAAQZ,EACnB,CACF,EAKH,OAFAD,EAAiBH,MAAQA,EAElBG"}
@@ -1 +1 @@
1
- {"version":3,"file":"memoize.module.js","sources":["../src/index.ts"],"sourcesContent":["import Semaphore from \"@chriscdn/promise-semaphore\";\nimport QuickLRU from \"quick-lru\";\n\nconst kDefaultMaxSize = 1000;\n\ntype Options<T extends any[]> = {\n maxSize: number;\n maxAge?: number;\n resolver: (...args: T) => string;\n};\n\n/**\n * Memoize a synchronous function.\n */\nconst Memoize = <Args extends unknown[], Return>(\n cb: (...args: Args) => Return,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver = options.resolver ??\n ((...args: Args) => JSON.stringify(args));\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = (...args: Args): Return => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\n/**\n * Memoize an asynchronous function.\n *\n * This differs from the sychronous case by ensuring multiple calls with the\n * same arguments is only evaluated once. This is controlled by using a\n * semaphore, which forces redundant calls to wait until the first call\n * completes.\n */\nconst MemoizeAsync = <Args extends unknown[], Return>(\n cb: (...args: Args) => Promise<Return>,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver = options.resolver ??\n ((...args: Args) => JSON.stringify(args));\n\n const semaphore = new Semaphore();\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = async (...args: Args): Promise<Return> => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key)!;\n } else {\n try {\n await semaphore.acquire(key);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = await cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n } finally {\n semaphore.release(key);\n }\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\nexport { Memoize, MemoizeAsync };\n"],"names":["Memoize","cb","options","_options$maxSize","_options$resolver","maxSize","resolver","JSON","stringify","slice","call","arguments","cache","QuickLRU","maxAge","memoizedFunction","args","key","apply","has","get","returnValue","set","MemoizeAsync","_options$maxSize2","_options$resolver2","semaphore","Semaphore","_arguments","Promise","resolve","acquire","then","_finallyRethrows","_wasThrown","_result","release","e","reject"],"mappings":"oEAGA,IAWMA,EAAU,SACZC,EACAC,GACAC,IAAAA,EAAAC,OADAF,IAAAA,IAAAA,EAAkC,CAAA,GAElC,IACMG,EAAyB,OAAlBF,EAAGD,EAAQG,SAAOF,EAhBX,IAkBdG,EAA2B,OAAnBF,EAAGF,EAAQI,UAAQF,EAC5B,WAAmB,OAAAG,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAEtCC,EAAQ,IAAIC,EAAyB,CACvCC,OAP+BZ,EAAQY,OAQvCT,QAAAA,IAGEU,EAAmB,WAAI,IAAAC,EAAUP,GAAAA,MAAAC,KAAAC,WAC7BM,EAAMX,EAAQY,WAAIF,EAAAA,GAExB,GAAIJ,EAAMO,IAAIF,GACV,OAAOL,EAAMQ,IAAIH,GAEjB,IAAMI,EAAcpB,EAAEiB,WAAIF,EAAAA,GAE1B,OADAJ,EAAMU,IAAIL,EAAKI,GACRA,CAEf,EAIA,OAFAN,EAAiBH,MAAQA,EAElBG,CACX,EAUMQ,EAAe,SACjBtB,EACAC,GACAsB,IAAAA,EAAAC,OADAvB,IAAAA,IAAAA,EAAkC,CAAE,GAEpC,IAAMY,EAA6BZ,EAAQY,OACrCT,EAAyBmB,OAAlBA,EAAGtB,EAAQG,SAAOmB,EAxDX,IA0DdlB,EAA2BmB,OAAnBA,EAAGvB,EAAQI,UAAQmB,EAC5B,WAAmB,OAAAlB,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAEtCe,EAAY,IAAIC,EAEhBf,EAAQ,IAAIC,EAAyB,CACvCC,OAAAA,EACAT,QAAAA,IAGEU,EAAA,eAA4Da,IAA/BZ,EAAU,GAAAP,MAAAC,KAAqBC,WACxDM,EAAMX,EAAQY,WAAIF,EAAAA,GAAM,OAAAa,QAAAC,QAE1BlB,EAAMO,IAAIF,GACHL,EAAMQ,IAAIH,2BAEbY,QAAAC,QACMJ,EAAUK,QAAQd,IAAIe,KAAA,WAAA,OAExBpB,EAAMO,IAAIF,GACHL,EAAMQ,IAAIH,GAAKY,QAAAC,QAEI7B,EAAEiB,WAAIF,EAAAA,IAAKgB,KAAA,SAA/BX,GAEN,OADAT,EAAMU,IAAIL,EAAKI,GACRA,CAAY,EAE1B,4FAZsBY,CAEnB,EAUHC,SAAAA,EAAAC,GAC0B,GAAvBT,EAAUU,QAAQnB,GAAKiB,EAAA,MAAAC,EAAA,OAAAA,CAAA,GAGnC,CAAC,MAAAE,GAAA,OAAAR,QAAAS,OAAAD,EAEDtB,CAAAA,EAEA,OAFAA,EAAiBH,MAAQA,EAElBG,CACX"}
1
+ {"version":3,"file":"memoize.module.js","sources":["../src/index.ts"],"sourcesContent":["import Semaphore from \"@chriscdn/promise-semaphore\";\nimport QuickLRU from \"quick-lru\";\n\nconst kDefaultMaxSize = 1000;\n\ntype Options<T extends any[]> = {\n maxSize: number;\n maxAge?: number;\n resolver: (...args: T) => string;\n};\n\n/**\n * Memoize a synchronous function.\n */\nconst Memoize = <Args extends unknown[], Return>(\n cb: (...args: Args) => Return,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver =\n options.resolver ?? ((...args: Args) => JSON.stringify(args));\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = (...args: Args): Return => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\n/**\n * Memoize an asynchronous function.\n *\n * This differs from the synchronous case by ensuring multiple calls with the\n * same arguments is only evaluated once. This is controlled by using a\n * semaphore, which forces redundant calls to wait until the first call\n * completes.\n */\nconst MemoizeAsync = <Args extends unknown[], Return>(\n cb: (...args: Args) => Promise<Return>,\n options: Partial<Options<Args>> = {},\n) => {\n const maxAge: number | undefined = options.maxAge;\n const maxSize = options.maxSize ?? kDefaultMaxSize;\n\n const resolver =\n options.resolver ?? ((...args: Args) => JSON.stringify(args));\n\n const semaphore = new Semaphore();\n\n const cache = new QuickLRU<string, Return>({\n maxAge,\n maxSize,\n });\n\n const memoizedFunction = async (...args: Args): Promise<Return> => {\n const key = resolver(...args);\n\n if (cache.has(key)) {\n return cache.get(key)!;\n } else {\n try {\n await semaphore.acquire(key);\n\n if (cache.has(key)) {\n return cache.get(key);\n } else {\n const returnValue = await cb(...args);\n cache.set(key, returnValue);\n return returnValue;\n }\n } finally {\n semaphore.release(key);\n }\n }\n };\n\n memoizedFunction.cache = cache;\n\n return memoizedFunction;\n};\n\nexport { Memoize, MemoizeAsync };\n"],"names":["Memoize","cb","options","_options$maxSize","_options$resolver","maxSize","resolver","JSON","stringify","slice","call","arguments","cache","QuickLRU","maxAge","memoizedFunction","args","key","apply","has","get","returnValue","set","MemoizeAsync","_options$maxSize2","_options$resolver2","semaphore","Semaphore","_arguments","Promise","resolve","acquire","then","_finallyRethrows","_wasThrown","_result","release","e","reject"],"mappings":"oEAGA,IAWMA,EAAU,SACdC,EACAC,GACEC,IAAAA,EAAAC,OADFF,IAAAA,IAAAA,EAAkC,CAAA,GAElC,IACMG,EAAyB,OAAlBF,EAAGD,EAAQG,SAAOF,EAhBT,IAkBhBG,EACY,OADJF,EACZF,EAAQI,UAAQF,EAAK,WAAmB,OAAAG,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAExDC,EAAQ,IAAIC,EAAyB,CACzCC,OAPiCZ,EAAQY,OAQzCT,QAAAA,IAGIU,EAAmB,WAAI,IAAAC,EAAUP,GAAAA,MAAAC,KAAAC,WAC/BM,EAAMX,EAAQY,WAAIF,EAAAA,GAExB,GAAIJ,EAAMO,IAAIF,GACZ,OAAOL,EAAMQ,IAAIH,GAEjB,IAAMI,EAAcpB,EAAEiB,WAAIF,EAAAA,GAE1B,OADAJ,EAAMU,IAAIL,EAAKI,GACRA,CAEX,EAIA,OAFAN,EAAiBH,MAAQA,EAElBG,CACT,EAUMQ,EAAe,SACnBtB,EACAC,GACEsB,IAAAA,EAAAC,OADFvB,IAAAA,IAAAA,EAAkC,CAAE,GAEpC,IAAMY,EAA6BZ,EAAQY,OACrCT,EAAyBmB,OAAlBA,EAAGtB,EAAQG,SAAOmB,EAxDT,IA0DhBlB,EACYmB,OADJA,EACZvB,EAAQI,UAAQmB,EAAK,WAAmB,OAAAlB,KAAKC,UAAS,GAAAC,MAAAC,KAAAC,WAAM,EAExDe,EAAY,IAAIC,EAEhBf,EAAQ,IAAIC,EAAyB,CACzCC,OAAAA,EACAT,QAAAA,IAGIU,EAAA,eAA4Da,IAA/BZ,EAAU,GAAAP,MAAAC,KAAqBC,WAC1DM,EAAMX,EAAQY,WAAIF,EAAAA,GAAM,OAAAa,QAAAC,QAE1BlB,EAAMO,IAAIF,GACLL,EAAMQ,IAAIH,2BAEbY,QAAAC,QACIJ,EAAUK,QAAQd,IAAIe,KAAA,WAAA,OAExBpB,EAAMO,IAAIF,GACLL,EAAMQ,IAAIH,GAAKY,QAAAC,QAEI7B,EAAEiB,WAAIF,EAAAA,IAAKgB,KAAA,SAA/BX,GAEN,OADAT,EAAMU,IAAIL,EAAKI,GACRA,CAAY,EAEtB,4FAZsBY,CAEnB,EAUHC,SAAAA,EAAAC,GACwB,GAAvBT,EAAUU,QAAQnB,GAAKiB,EAAA,MAAAC,EAAA,OAAAA,CAAA,GAG7B,CAAC,MAAAE,GAAA,OAAAR,QAAAS,OAAAD,EAEDtB,CAAAA,EAEA,OAFAA,EAAiBH,MAAQA,EAElBG,CACT"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@chriscdn/memoize",
3
- "version": "1.0.3",
3
+ "version": "1.0.4",
4
4
  "description": "Memoize a synchronous or asynchronous function.",
5
5
  "repository": "https://github.com/chriscdn/memoize",
6
6
  "author": "Christopher Meyer <chris@schwiiz.org>",
@@ -22,11 +22,11 @@
22
22
  "test": "vitest"
23
23
  },
24
24
  "dependencies": {
25
- "@chriscdn/promise-semaphore": "^2.0.9",
25
+ "@chriscdn/promise-semaphore": "^2.0.10",
26
26
  "quick-lru": "^7.0.0"
27
27
  },
28
28
  "devDependencies": {
29
29
  "microbundle": "^0.15.1",
30
- "vitest": "^2.1.8"
30
+ "vitest": "^3.0.7"
31
31
  }
32
32
  }
package/src/index.ts CHANGED
@@ -4,96 +4,96 @@ import QuickLRU from "quick-lru";
4
4
  const kDefaultMaxSize = 1000;
5
5
 
6
6
  type Options<T extends any[]> = {
7
- maxSize: number;
8
- maxAge?: number;
9
- resolver: (...args: T) => string;
7
+ maxSize: number;
8
+ maxAge?: number;
9
+ resolver: (...args: T) => string;
10
10
  };
11
11
 
12
12
  /**
13
13
  * Memoize a synchronous function.
14
14
  */
15
15
  const Memoize = <Args extends unknown[], Return>(
16
- cb: (...args: Args) => Return,
17
- options: Partial<Options<Args>> = {},
16
+ cb: (...args: Args) => Return,
17
+ options: Partial<Options<Args>> = {},
18
18
  ) => {
19
- const maxAge: number | undefined = options.maxAge;
20
- const maxSize = options.maxSize ?? kDefaultMaxSize;
19
+ const maxAge: number | undefined = options.maxAge;
20
+ const maxSize = options.maxSize ?? kDefaultMaxSize;
21
21
 
22
- const resolver = options.resolver ??
23
- ((...args: Args) => JSON.stringify(args));
22
+ const resolver =
23
+ options.resolver ?? ((...args: Args) => JSON.stringify(args));
24
24
 
25
- const cache = new QuickLRU<string, Return>({
26
- maxAge,
27
- maxSize,
28
- });
25
+ const cache = new QuickLRU<string, Return>({
26
+ maxAge,
27
+ maxSize,
28
+ });
29
29
 
30
- const memoizedFunction = (...args: Args): Return => {
31
- const key = resolver(...args);
30
+ const memoizedFunction = (...args: Args): Return => {
31
+ const key = resolver(...args);
32
32
 
33
- if (cache.has(key)) {
34
- return cache.get(key);
35
- } else {
36
- const returnValue = cb(...args);
37
- cache.set(key, returnValue);
38
- return returnValue;
39
- }
40
- };
33
+ if (cache.has(key)) {
34
+ return cache.get(key);
35
+ } else {
36
+ const returnValue = cb(...args);
37
+ cache.set(key, returnValue);
38
+ return returnValue;
39
+ }
40
+ };
41
41
 
42
- memoizedFunction.cache = cache;
42
+ memoizedFunction.cache = cache;
43
43
 
44
- return memoizedFunction;
44
+ return memoizedFunction;
45
45
  };
46
46
 
47
47
  /**
48
48
  * Memoize an asynchronous function.
49
49
  *
50
- * This differs from the sychronous case by ensuring multiple calls with the
50
+ * This differs from the synchronous case by ensuring multiple calls with the
51
51
  * same arguments is only evaluated once. This is controlled by using a
52
52
  * semaphore, which forces redundant calls to wait until the first call
53
53
  * completes.
54
54
  */
55
55
  const MemoizeAsync = <Args extends unknown[], Return>(
56
- cb: (...args: Args) => Promise<Return>,
57
- options: Partial<Options<Args>> = {},
56
+ cb: (...args: Args) => Promise<Return>,
57
+ options: Partial<Options<Args>> = {},
58
58
  ) => {
59
- const maxAge: number | undefined = options.maxAge;
60
- const maxSize = options.maxSize ?? kDefaultMaxSize;
59
+ const maxAge: number | undefined = options.maxAge;
60
+ const maxSize = options.maxSize ?? kDefaultMaxSize;
61
+
62
+ const resolver =
63
+ options.resolver ?? ((...args: Args) => JSON.stringify(args));
61
64
 
62
- const resolver = options.resolver ??
63
- ((...args: Args) => JSON.stringify(args));
65
+ const semaphore = new Semaphore();
64
66
 
65
- const semaphore = new Semaphore();
67
+ const cache = new QuickLRU<string, Return>({
68
+ maxAge,
69
+ maxSize,
70
+ });
66
71
 
67
- const cache = new QuickLRU<string, Return>({
68
- maxAge,
69
- maxSize,
70
- });
72
+ const memoizedFunction = async (...args: Args): Promise<Return> => {
73
+ const key = resolver(...args);
71
74
 
72
- const memoizedFunction = async (...args: Args): Promise<Return> => {
73
- const key = resolver(...args);
75
+ if (cache.has(key)) {
76
+ return cache.get(key)!;
77
+ } else {
78
+ try {
79
+ await semaphore.acquire(key);
74
80
 
75
81
  if (cache.has(key)) {
76
- return cache.get(key)!;
82
+ return cache.get(key);
77
83
  } else {
78
- try {
79
- await semaphore.acquire(key);
80
-
81
- if (cache.has(key)) {
82
- return cache.get(key);
83
- } else {
84
- const returnValue = await cb(...args);
85
- cache.set(key, returnValue);
86
- return returnValue;
87
- }
88
- } finally {
89
- semaphore.release(key);
90
- }
84
+ const returnValue = await cb(...args);
85
+ cache.set(key, returnValue);
86
+ return returnValue;
91
87
  }
92
- };
88
+ } finally {
89
+ semaphore.release(key);
90
+ }
91
+ }
92
+ };
93
93
 
94
- memoizedFunction.cache = cache;
94
+ memoizedFunction.cache = cache;
95
95
 
96
- return memoizedFunction;
96
+ return memoizedFunction;
97
97
  };
98
98
 
99
99
  export { Memoize, MemoizeAsync };