2024-08-08 16:12:24 +00:00
|
|
|
// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
|
|
|
|
// This module is browser compatible.
|
|
|
|
|
|
|
|
/**
|
|
|
|
* In-memory cache utilities, such as memoization and caches with different
|
|
|
|
* expiration policies.
|
|
|
|
*
|
|
|
|
* ```ts
|
|
|
|
* import { memoize, LruCache } from "@std/cache";
|
|
|
|
* import { assertEquals } from "@std/assert";
|
|
|
|
*
|
|
|
|
* const cache = new LruCache<unknown, bigint>(1000);
|
|
|
|
*
|
|
|
|
* // fibonacci function, which is very slow for n > ~30 if not memoized
|
|
|
|
* const fib = memoize((n: bigint): bigint => {
|
|
|
|
* return n <= 2n ? 1n : fib(n - 1n) + fib(n - 2n);
|
|
|
|
* }, { cache });
|
|
|
|
*
|
|
|
|
* assertEquals(fib(100n), 354224848179261915075n);
|
|
|
|
* ```
|
|
|
|
*
|
|
|
|
* @module
|
|
|
|
*/
|
|
|
|
|
|
|
|
export * from "./lru_cache.ts";
|
2024-08-21 10:45:16 +00:00
|
|
|
export * from "./memoize.ts";
|
|
|
|
export * from "./ttl_cache.ts";
|