@chttp/cache 0.0.0-stage → 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Joaquin Terrasa & contributors
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,93 @@
-# Temporary Holding Version
+# @chttp/cache
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+Map-based LRU + TTL in-process memory cache with [lru-cache](https://github.com/isaacs/node-lru-cache)-parity semantics, authored inside the [scriptc](https://github.com/vercel-labs/scriptc) compilable subset — it compiles into a native ELF alongside a [chttp](https://github.com/sigilco/chttp) app with `scriptc build`, and runs under Node unchanged.
+
+```ts
+import { Cache } from "@chttp/cache";
+
+const sessions: Cache<string> = new Cache({ max: 10_000, ttl: 60_000 });
+
+sessions.set("sess-1", "uid:42");
+sessions.get("sess-1"); // "uid:42" — and bumps recency
+sessions.has("sess-1"); // true — no recency bump
+sessions.peek("sess-1"); // "uid:42" — no recency bump
+sessions.get("missing"); // null — misses are null, never undefined
+```
+
+- **`get` bumps recency; `peek`/`has` don't.** Recency decides which entry evicts when `size > max`.
+- **TTL is lazy.** Expired entries purge on access (`get`/`has`/`peek`), never on a timer. An expired entry nobody reads holds memory until evicted — `max` is the bound.
+- **`max` evicts least-recently-used.** Insertion-ordered `Map`; the first key out is the eviction victim.
+- **Misses are `null`, and `has()` disambiguates.** A stored `null` reads as `null` too — `has()` tells it apart from a miss.
+- **Per-entry TTL** overrides the constructor default: `set(key, value, { ttl: 5_000 })`.
+- **Config fails fast.** Non-positive `max` or `ttl` throws `E_BAD_CACHE_OPTIONS` at construction (and on `set` opts); nothing throws on the traffic path.
+
+## Surface
+
+```ts
+declare class Cache<V> {
+  constructor(opts?: { max?: number; ttl?: number }, now?: () => number);
+  get(key: string): V | null;
+  set(key: string, value: V, opts?: { ttl?: number }): this;
+  has(key: string): boolean;
+  peek(key: string): V | null;
+  delete(key: string): void;
+  clear(): void;
+  readonly size: number;
+}
+```
+
+`max` defaults to `Infinity` (unbounded); `ttl` defaults to no expiry. `now` is a constructor-only test seam for a fake clock — not part of the stable surface.
+
+## Divergences from lru-cache
+
+Deliberate, documented — every one is a subset constraint or a YAGNI call:
+
+| lru-cache                                                   | @chttp/cache                                                                         |
+| ----------------------------------------------------------- | ------------------------------------------------------------------------------------ |
+| `V \| undefined` misses                                     | `V \| null` misses; `has()` disambiguates                                            |
+| `new LRUCache<K, V>()` (typed keys + values)                | `Cache<V>` phantom-generic alias — keys are `string`, values narrow at the call site |
+| `ttlAutopurge`, internal timers                             | lazy purge on access only; `max` bounds memory                                       |
+| `dispose`/`fetch`/`sizeCalculation`, stale-while-revalidate | not shipped — follow-up tickets on demand                                            |
+| `mget`/`mset`                                               | loop `get`/`set`                                                                     |
+| `ttl: 0` = no expiry                                        | `ttl <= 0` throws `E_BAD_CACHE_OPTIONS`                                              |
+
+## Bigger than memory? Cache-aside, not a second module
+
+A single-ELF app has exactly one memory domain — that covers rate-limit windows, session memoization, upstream-response memoization and job dedup. When it doesn't (multi-replica coherence, persistence), layer a store _under_ this cache instead of swapping the API:
+
+```ts
+// Store seam — implement this plain shape against your backend
+// (Upstash REST over fetch, Redis over net.Socket, ...).
+interface CacheStore {
+  get(key: string): Promise<string | null>; // values JSON-encoded
+  set(key: string, value: string, ttlSeconds?: number): Promise<void>;
+  delete(key: string): Promise<void>;
+  deleteByPrefix?(prefix: string): Promise<void>;
+}
+```
+
+```ts
+const memory = new Cache({ max: 5_000, ttl: 30_000 });
+
+async function getUser(store: CacheStore, id: string): Promise<string | null> {
+  const hit = memory.get("user:" + id);
+  if (hit !== null) {
+    return hit;
+  }
+  const v = await store.get("user:" + id);
+  if (v !== null) {
+    memory.set("user:" + id, v);
+  }
+  return v;
+}
+```
+
+Backend clients live as greppable examples (an Upstash REST store is the recommended default; a RESP-over-`net.Socket` Redis store ships only on demand) — the package itself stays zero-dependency.
+
+## Tests
+
+`pnpm --filter @chttp/cache test` builds with tsc, runs the `node --test` suite (LRU order, TTL via the injected clock, value round-trips, a real `@chttp/router` handler chain over HTTP) and the ELF smoke (`test/elf.test.sh`: `scriptc build` + native run). `scripts/scriptc-gate.sh` keeps `gate.ts` at 100% static coverage.
+
+## License
+
+Apache-2.0

package/dist/esm/cache.d.ts

@@ -0,0 +1,27 @@
+export interface CacheOptions {
+    max?: number;
+    ttl?: number;
+}
+export interface CacheSetOptions {
+    ttl?: number;
+}
+export interface CacheEntry {
+    value: unknown;
+    expiresAt: number;
+}
+export declare class CacheCore {
+    _store: Map<string, CacheEntry>;
+    _max: number;
+    _ttl: number;
+    _now: () => number;
+    constructor(opts?: CacheOptions, now?: () => number);
+    _expired(entry: CacheEntry, now: number): boolean;
+    _evict(): void;
+    get(key: string): unknown | null;
+    set(key: string, value: unknown, opts?: CacheSetOptions): CacheCore;
+    has(key: string): boolean;
+    peek(key: string): unknown | null;
+    delete(key: string): void;
+    clear(): void;
+    get size(): number;
+}

package/dist/esm/cache.js

@@ -0,0 +1,122 @@
+// CacheCore — Map-based LRU+TTL memory cache authored inside the
+// scriptc-compilable subset (Map lifted by the 0.3.3 probe; see AGENTS.md).
+//
+// Semantics follow lru-cache's stable core:
+//   - get bumps recency (delete + reinsert); peek/has do not.
+//   - has/peek still purge an expired entry (lazy TTL only — no timers).
+//   - set on an existing key re-inserts at MRU position (Map preserves
+//     position on overwrite, so an explicit delete is required first).
+//   - Past `max`, the least-recently-used entry (the Map's first key,
+//     insertion-ordered) evicts until size <= max.
+//   - Misses return null (never undefined — SC3004); has() disambiguates
+//     a stored null-ish value from a miss.
+//
+// Subset notes: `| null` unions only; class fields concretely typed (values
+// live in a plain CacheEntry record, where `unknown` members are legal);
+// eviction reads the first key via one `for...of` over `entries()` +
+// immediate break — no iterator `.next()` games. Timestamps are Date.now()
+// (TTLs are seconds-scale; a monotonic clock is not worth the surface).
+export class CacheCore {
+    _store;
+    _max;
+    _ttl;
+    _now;
+    // `now` is a constructor-only test seam (fake clock), deliberately NOT a
+    // CacheOptions record member — function values inside records degrade
+    // instantiation under scriptc.
+    constructor(opts, now) {
+        const o = opts === undefined || opts === null ? {} : opts;
+        const max = o.max === undefined ? Infinity : o.max;
+        const ttl = o.ttl === undefined ? Infinity : o.ttl;
+        if (!(max > 0)) {
+            throw new Error("E_BAD_CACHE_OPTIONS: max must be a positive number");
+        }
+        if (!(ttl > 0)) {
+            throw new Error("E_BAD_CACHE_OPTIONS: ttl must be a positive number");
+        }
+        this._store = new Map();
+        this._max = max;
+        this._ttl = ttl;
+        this._now = now === undefined ? Date.now : now;
+    }
+    _expired(entry, now) {
+        return entry.expiresAt !== Infinity && now >= entry.expiresAt;
+    }
+    _evict() {
+        while (this._store.size > this._max) {
+            let oldest = null;
+            for (const e of this._store.entries()) {
+                oldest = e[0];
+                break;
+            }
+            if (oldest === null) {
+                break;
+            }
+            this._store.delete(oldest);
+        }
+    }
+    get(key) {
+        const entry = this._store.get(key);
+        if (entry === undefined) {
+            return null;
+        }
+        if (this._expired(entry, this._now())) {
+            this._store.delete(key);
+            return null;
+        }
+        // Recency bump: delete + reinsert moves the entry to MRU position.
+        this._store.delete(key);
+        this._store.set(key, entry);
+        return entry.value;
+    }
+    set(key, value, opts) {
+        let ttl = this._ttl;
+        if (opts !== undefined && opts !== null && opts.ttl !== undefined) {
+            ttl = opts.ttl;
+            if (!(ttl > 0)) {
+                throw new Error("E_BAD_CACHE_OPTIONS: ttl must be a positive number");
+            }
+        }
+        // Map preserves insertion position on overwrite — delete first so a
+        // re-set key lands at MRU, matching lru-cache.
+        this._store.delete(key);
+        const entry = {
+            value: value,
+            expiresAt: ttl === Infinity ? Infinity : this._now() + ttl,
+        };
+        this._store.set(key, entry);
+        this._evict();
+        return this;
+    }
+    has(key) {
+        const entry = this._store.get(key);
+        if (entry === undefined) {
+            return false;
+        }
+        if (this._expired(entry, this._now())) {
+            this._store.delete(key);
+            return false;
+        }
+        return true;
+    }
+    peek(key) {
+        const entry = this._store.get(key);
+        if (entry === undefined) {
+            return null;
+        }
+        if (this._expired(entry, this._now())) {
+            this._store.delete(key);
+            return null;
+        }
+        return entry.value;
+    }
+    delete(key) {
+        this._store.delete(key);
+    }
+    clear() {
+        this._store.clear();
+    }
+    get size() {
+        return this._store.size;
+    }
+}

package/dist/esm/index.d.ts

@@ -0,0 +1,7 @@
+import { CacheCore } from "./cache.ts";
+import type { CacheEntry, CacheOptions, CacheSetOptions } from "./cache.ts";
+export { CacheCore };
+export type { CacheEntry, CacheOptions, CacheSetOptions };
+export interface Cache<_V> extends CacheCore {
+}
+export declare const Cache: typeof CacheCore;

package/dist/esm/index.js

@@ -0,0 +1,13 @@
+// @chttp/cache — public surface.
+//
+// The runtime class is the non-generic CacheCore: generic CLASS
+// parameters degrade instances to methodless shells under scriptc
+// 0.3.x, so `Cache<V>` is a type-level alias over CacheCore — the same
+// pattern @chttp/router uses for Ctx<P>/ReqView<P>. `V` is a phantom
+// parameter documenting intended value type; get/peek still return
+// `unknown | null` (see the README divergence table). A narrowed
+// `get(key): V | null` interface member would itself refuse to lower,
+// so the typed surface cannot be carried on the class.
+import { CacheCore } from "./cache.js";
+export { CacheCore };
+export const Cache = CacheCore;

package/package.json

@@ -1,6 +1,53 @@
 {
   "name": "@chttp/cache",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
+  "version": "0.1.0",
+  "description": "Map-based LRU+TTL memory cache with lru-cache-parity semantics, authored inside the scriptc compilable subset",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/sigilco/cutils.git",
+    "directory": "packages/cache"
+  },
+  "files": [
+    "dist",
+    "src"
+  ],
+  "type": "module",
+  "main": "./dist/esm/index.js",
+  "types": "./dist/esm/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/esm/index.d.ts",
+      "import": "./dist/esm/index.js"
+    },
+    "./package.json": "./package.json"
+  },
+  "devDependencies": {
+    "@chttp/router": "^0.2.1",
+    "@types/node": "^24.0.0",
+    "typescript": "^5.9.0"
+  },
+  "engines": {
+    "node": ">=22"
+  },
+  "author": "Joaquin Terrasa & contributors",
+  "keywords": [
+    "cache",
+    "lru",
+    "ttl",
+    "memory-cache",
+    "lru-cache",
+    "scriptc",
+    "native"
+  ],
+  "homepage": "https://github.com/sigilco/cutils/tree/main/packages/cache#readme",
+  "bugs": {
+    "url": "https://github.com/sigilco/cutils/issues"
+  },
+  "sideEffects": false,
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "typecheck": "tsc -p tsconfig.json --noEmit",
+    "test": "npm run build && node --test test/*.test.js test/*.test.mjs && bash test/elf.test.sh"
+  }
 }

package/src/cache.ts

@@ -0,0 +1,150 @@
+// CacheCore — Map-based LRU+TTL memory cache authored inside the
+// scriptc-compilable subset (Map lifted by the 0.3.3 probe; see AGENTS.md).
+//
+// Semantics follow lru-cache's stable core:
+//   - get bumps recency (delete + reinsert); peek/has do not.
+//   - has/peek still purge an expired entry (lazy TTL only — no timers).
+//   - set on an existing key re-inserts at MRU position (Map preserves
+//     position on overwrite, so an explicit delete is required first).
+//   - Past `max`, the least-recently-used entry (the Map's first key,
+//     insertion-ordered) evicts until size <= max.
+//   - Misses return null (never undefined — SC3004); has() disambiguates
+//     a stored null-ish value from a miss.
+//
+// Subset notes: `| null` unions only; class fields concretely typed (values
+// live in a plain CacheEntry record, where `unknown` members are legal);
+// eviction reads the first key via one `for...of` over `entries()` +
+// immediate break — no iterator `.next()` games. Timestamps are Date.now()
+// (TTLs are seconds-scale; a monotonic clock is not worth the surface).
+
+export interface CacheOptions {
+  max?: number; // default Infinity; LRU evicts past this
+  ttl?: number; // default: no expiry; ms; per-entry override on set()
+}
+
+export interface CacheSetOptions {
+  ttl?: number; // per-entry TTL in ms; overrides the constructor default
+}
+
+// Internal record shape for stored values. `value` is `unknown`, which is
+// legal inside a plain record (only class fields must be concrete). The
+// public type-level `Cache<V>` alias in index.ts narrows it per consumer.
+export interface CacheEntry {
+  value: unknown;
+  expiresAt: number; // epoch ms; Infinity = never expires
+}
+
+export class CacheCore {
+  _store: Map<string, CacheEntry>;
+  _max: number;
+  _ttl: number;
+  _now: () => number;
+
+  // `now` is a constructor-only test seam (fake clock), deliberately NOT a
+  // CacheOptions record member — function values inside records degrade
+  // instantiation under scriptc.
+  constructor(opts?: CacheOptions, now?: () => number) {
+    const o: CacheOptions = opts === undefined || opts === null ? {} : opts;
+    const max: number = o.max === undefined ? Infinity : o.max;
+    const ttl: number = o.ttl === undefined ? Infinity : o.ttl;
+    if (!(max > 0)) {
+      throw new Error("E_BAD_CACHE_OPTIONS: max must be a positive number");
+    }
+    if (!(ttl > 0)) {
+      throw new Error("E_BAD_CACHE_OPTIONS: ttl must be a positive number");
+    }
+    this._store = new Map<string, CacheEntry>();
+    this._max = max;
+    this._ttl = ttl;
+    this._now = now === undefined ? Date.now : now;
+  }
+
+  _expired(entry: CacheEntry, now: number): boolean {
+    return entry.expiresAt !== Infinity && now >= entry.expiresAt;
+  }
+
+  _evict(): void {
+    while (this._store.size > this._max) {
+      let oldest: string | null = null;
+      for (const e of this._store.entries()) {
+        oldest = e[0];
+        break;
+      }
+      if (oldest === null) {
+        break;
+      }
+      this._store.delete(oldest);
+    }
+  }
+
+  get(key: string): unknown | null {
+    const entry = this._store.get(key);
+    if (entry === undefined) {
+      return null;
+    }
+    if (this._expired(entry, this._now())) {
+      this._store.delete(key);
+      return null;
+    }
+    // Recency bump: delete + reinsert moves the entry to MRU position.
+    this._store.delete(key);
+    this._store.set(key, entry);
+    return entry.value;
+  }
+
+  set(key: string, value: unknown, opts?: CacheSetOptions): CacheCore {
+    let ttl = this._ttl;
+    if (opts !== undefined && opts !== null && opts.ttl !== undefined) {
+      ttl = opts.ttl;
+      if (!(ttl > 0)) {
+        throw new Error("E_BAD_CACHE_OPTIONS: ttl must be a positive number");
+      }
+    }
+    // Map preserves insertion position on overwrite — delete first so a
+    // re-set key lands at MRU, matching lru-cache.
+    this._store.delete(key);
+    const entry: CacheEntry = {
+      value: value,
+      expiresAt: ttl === Infinity ? Infinity : this._now() + ttl,
+    };
+    this._store.set(key, entry);
+    this._evict();
+    return this;
+  }
+
+  has(key: string): boolean {
+    const entry = this._store.get(key);
+    if (entry === undefined) {
+      return false;
+    }
+    if (this._expired(entry, this._now())) {
+      this._store.delete(key);
+      return false;
+    }
+    return true;
+  }
+
+  peek(key: string): unknown | null {
+    const entry = this._store.get(key);
+    if (entry === undefined) {
+      return null;
+    }
+    if (this._expired(entry, this._now())) {
+      this._store.delete(key);
+      return null;
+    }
+    return entry.value;
+  }
+
+  delete(key: string): void {
+    this._store.delete(key);
+  }
+
+  clear(): void {
+    this._store.clear();
+  }
+
+  get size(): number {
+    return this._store.size;
+  }
+}

package/src/index.ts

@@ -0,0 +1,19 @@
+// @chttp/cache — public surface.
+//
+// The runtime class is the non-generic CacheCore: generic CLASS
+// parameters degrade instances to methodless shells under scriptc
+// 0.3.x, so `Cache<V>` is a type-level alias over CacheCore — the same
+// pattern @chttp/router uses for Ctx<P>/ReqView<P>. `V` is a phantom
+// parameter documenting intended value type; get/peek still return
+// `unknown | null` (see the README divergence table). A narrowed
+// `get(key): V | null` interface member would itself refuse to lower,
+// so the typed surface cannot be carried on the class.
+
+import { CacheCore } from "./cache.ts";
+import type { CacheEntry, CacheOptions, CacheSetOptions } from "./cache.ts";
+
+export { CacheCore };
+export type { CacheEntry, CacheOptions, CacheSetOptions };
+
+export interface Cache<_V> extends CacheCore {}
+export const Cache = CacheCore;