@fougere/container 0.9.2-alpha.0 → 0.9.3-alpha.0

package/dist/{container.d.ts → container/Container.d.ts}

@@ -12,10 +12,6 @@ export interface RegisterOptions {
      */
     deps?: string[];
 }
-/** Anything holding a resource can say so, and disposing the container says it back. */
-export interface Disposable {
-    dispose(): void | Promise<void>;
-}
 /** DI container interface — the only thing application code sees. */
 export interface Container {
     /** The container builds it: `register('UserService', UserService, { deps: ['UserRepository'] })`. */
@@ -33,4 +29,4 @@ export interface Container {
     /** Children first, then what this scope built, in reverse — refusals travel as one `AggregateError`. */
     dispose(): Promise<void>;
 }
-//# sourceMappingURL=container.d.ts.map
+//# sourceMappingURL=Container.d.ts.map

package/dist/container/Container.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Container.d.ts","sourceRoot":"","sources":["../../src/container/Container.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,WAAW,CAAC,CAAC,GAAG,OAAO,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AAEjE,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,QAAQ,CAAC,EAAE,WAAW,GAAG,WAAW,CAAC;IAErC;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,qEAAqE;AACrE,MAAM,WAAW,SAAS;IACxB,qGAAqG;IACrG,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,IAAI,CAAC;IAEjF,+GAA+G;IAC/G,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAE/C,yEAAyE;IACzE,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC;IAE5B,kEAAkE;IAClE,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAE3B,yEAAyE;IACzE,WAAW,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,GAAG,IAAI,CAAC;IAEvD,yEAAyE;IACzE,WAAW,IAAI,SAAS,CAAC;IAEzB,wGAAwG;IACxG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CAC1B"}

package/dist/container/Container.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=Container.js.map

package/dist/container/Container.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Container.js","sourceRoot":"","sources":["../../src/container/Container.ts"],"names":[],"mappings":""}

package/dist/container/Disposable.d.ts

@@ -0,0 +1,8 @@
+/** Anything holding a resource can say so, and disposing the container says it back. */
+export interface Disposable {
+    dispose(): void | Promise<void>;
+}
+export declare class Disposables {
+    static is(value: unknown): value is Disposable;
+}
+//# sourceMappingURL=Disposable.d.ts.map

package/dist/container/Disposable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Disposable.d.ts","sourceRoot":"","sources":["../../src/container/Disposable.ts"],"names":[],"mappings":"AAAA,wFAAwF;AACxF,MAAM,WAAW,UAAU;IACzB,OAAO,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACjC;AAED,qBAAa,WAAW;IACtB,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,UAAU,CAM7C;CACF"}

package/dist/container/Disposable.js

@@ -0,0 +1,8 @@
+export class Disposables {
+    static is(value) {
+        return (typeof value === 'object' &&
+            value !== null &&
+            typeof value.dispose === 'function');
+    }
+}
+//# sourceMappingURL=Disposable.js.map

package/dist/container/Disposable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Disposable.js","sourceRoot":"","sources":["../../src/container/Disposable.ts"],"names":[],"mappings":"AAKA,MAAM,OAAO,WAAW;IACtB,MAAM,CAAC,EAAE,CAAC,KAAc;QACtB,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,OAAQ,KAAoB,CAAC,OAAO,KAAK,UAAU,CACpD,CAAC;IACJ,CAAC;CACF"}

package/dist/container/ScopeContainer.d.ts

@@ -0,0 +1,3 @@
+import type { Container } from './Container.js';
+export declare function createContainer(): Container;
+//# sourceMappingURL=ScopeContainer.d.ts.map

package/dist/container/ScopeContainer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ScopeContainer.d.ts","sourceRoot":"","sources":["../../src/container/ScopeContainer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAgC,MAAM,gBAAgB,CAAC;AAwK9E,wBAAgB,eAAe,IAAI,SAAS,CAE3C"}

package/dist/container/ScopeContainer.js

@@ -0,0 +1,147 @@
+import { Disposables } from './Disposable.js';
+/** A scope reaches its parent and its children through members only a scope can read. */
+class ScopeContainer {
+    parent;
+    registry = new Map();
+    // In construction order: a thing built later may hold one built earlier, so disposal
+    // walks this backwards.
+    built = [];
+    // Closed by this container, and before `built` — a child may hold what this scope built,
+    // never the other way round.
+    children = [];
+    fallback;
+    // The names being built right now, shared by the whole tree: a miss here is answered by the
+    // parent and the descent continues there, so only one stack can name the path whole —
+    // `child.resolve('A')` reaching a parent's `B` that asks for `A` back reports `A → B → A`.
+    resolving;
+    constructor(parent) {
+        this.parent = parent;
+        this.resolving = parent?.resolving ?? [];
+    }
+    register(name, ctor, options) {
+        const lifetime = options?.lifetime ?? 'transient';
+        const deps = options?.deps ?? [];
+        this.registry.set(name, {
+            factory: (c) => new ctor(...deps.map((d) => c.resolve(d))),
+            lifetime,
+        });
+    }
+    registerValue(name, value) {
+        // A value the container did not build is not the container's to dispose.
+        this.registry.set(name, {
+            factory: () => value,
+            lifetime: 'singleton',
+            instance: value,
+        });
+    }
+    resolve(name) {
+        const entry = this.registry.get(name);
+        // Not found locally — the parent holds it, and holds its instance too.
+        if (!entry && this.parent?.entryOf(name)) {
+            return this.parent.resolve(name);
+        }
+        // Nobody holds it. A frond declared in `remotes` registers nothing here, so its
+        // façade is fabricated by the fallback rather than found.
+        if (!entry) {
+            const made = this.fallbackOf()?.(name);
+            if (made !== undefined) {
+                this.registry.set(name, {
+                    factory: () => made,
+                    lifetime: 'singleton',
+                    instance: made,
+                });
+                return made;
+            }
+            throw new Error(`[container] '${name}' is not registered${this.through(name)}`);
+        }
+        if (entry.instance !== undefined)
+            return entry.instance;
+        if (this.resolving.includes(name)) {
+            throw new Error(`[container] dependency cycle: ${[...this.resolving, name].join(' → ')}`);
+        }
+        // Popped in a finally, because a constructor that throws leaves the name on the stack
+        // otherwise and the next resolution of it reports a cycle that is not there.
+        this.resolving.push(name);
+        try {
+            const value = entry.factory(this);
+            // The container disposes what it KEEPS: a transient is handed over and forgotten,
+            // and its caller is the one who knows when it is done.
+            if (entry.lifetime === 'singleton') {
+                entry.instance = value;
+                this.remember(value);
+            }
+            return value;
+        }
+        finally {
+            this.resolving.pop();
+        }
+    }
+    has(name) {
+        return this.registry.has(name) || (this.parent?.has(name) ?? false);
+    }
+    createScope() {
+        const child = new ScopeContainer(this);
+        this.children.push(child);
+        return child;
+    }
+    async dispose() {
+        // Everything is told before anything throws, then the failures travel together.
+        // Dropped from the parent first: a scope that closes itself leaves a reference the
+        // parent would hold for the life of the process.
+        this.parent?.forget(this);
+        const failures = [];
+        // A copy: closing a child splices it out of `children`, so walking the array
+        // itself stepped over every second sibling.
+        for (const child of [...this.children].reverse()) {
+            try {
+                await child.dispose();
+            }
+            catch (error) {
+                failures.push(error);
+            }
+        }
+        this.children.length = 0;
+        for (const value of this.built.reverse()) {
+            try {
+                await value.dispose();
+            }
+            catch (error) {
+                failures.push(error);
+            }
+        }
+        this.built.length = 0;
+        this.registry.clear();
+        if (failures.length > 0) {
+            throw new AggregateError(failures, '[container] one or more disposals failed');
+        }
+    }
+    setFallback(resolve) {
+        this.fallback = resolve;
+    }
+    entryOf(name) {
+        return this.registry.get(name) ?? this.parent?.entryOf(name);
+    }
+    /** Set on the root, honoured from any scope — a scope inherits it by asking upward. */
+    fallbackOf() {
+        return this.fallback ?? this.parent?.fallbackOf();
+    }
+    forget(child) {
+        const at = this.children.indexOf(child);
+        if (at !== -1)
+            this.children.splice(at, 1);
+    }
+    through(name) {
+        return this.resolving.length > 0
+            ? ` (resolving: ${[...this.resolving, name].join(' → ')})`
+            : '';
+    }
+    remember(value) {
+        if (Disposables.is(value))
+            this.built.push(value);
+        return value;
+    }
+}
+export function createContainer() {
+    return new ScopeContainer();
+}
+//# sourceMappingURL=ScopeContainer.js.map

package/dist/container/ScopeContainer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ScopeContainer.js","sourceRoot":"","sources":["../../src/container/ScopeContainer.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAmB,MAAM,iBAAiB,CAAC;AAQ/D,yFAAyF;AACzF,MAAM,cAAc;IAcW,MAAM;IAblB,QAAQ,GAAG,IAAI,GAAG,EAAiB,CAAC;IACrD,qFAAqF;IACrF,wBAAwB;IACP,KAAK,GAAc,EAAE,CAAC;IACvC,yFAAyF;IACzF,6BAA6B;IACZ,QAAQ,GAAqB,EAAE,CAAC;IACzC,QAAQ,CAA0C;IAC1D,4FAA4F;IAC5F,sFAAsF;IACtF,2FAA2F;IAC1E,SAAS,CAAW;IAErC,YAA6B,MAAuB;sBAAvB,MAAM;QACjC,IAAI,CAAC,SAAS,GAAG,MAAM,EAAE,SAAS,IAAI,EAAE,CAAC;IAC3C,CAAC;IAED,QAAQ,CAAI,IAAY,EAAE,IAAoB,EAAE,OAAyB;QACvE,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,WAAW,CAAC;QAClD,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC;QACjC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE;YACtB,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,QAAQ;SACT,CAAC,CAAC;IACL,CAAC;IAED,aAAa,CAAI,IAAY,EAAE,KAAQ;QACrC,yEAAyE;QACzE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE;YACtB,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK;YACpB,QAAQ,EAAE,WAAW;YACrB,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,CAAI,IAAY;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEtC,uEAAuE;QACvE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAI,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,gFAAgF;QAChF,0DAA0D;QAC1D,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE;oBACtB,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;oBACnB,QAAQ,EAAE,WAAW;oBACrB,QAAQ,EAAE,IAAI;iBACf,CAAC,CAAC;gBAEH,OAAO,IAAS,CAAC;YACnB,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,gBAAgB,IAAI,sBAAsB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,QAAa,CAAC;QAE7D,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CACb,iCAAiC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CACzE,CAAC;QACJ,CAAC;QAED,sFAAsF;QACtF,6EAA6E;QAC7E,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAM,CAAC;YACvC,kFAAkF;YAClF,uDAAuD;YACvD,IAAI,KAAK,CAAC,QAAQ,KAAK,WAAW,EAAE,CAAC;gBACnC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC;gBACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;IAED,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IACtE,CAAC;IAED,WAAW;QACT,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE1B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,OAAO;QACX,gFAAgF;QAChF,mFAAmF;QACnF,iDAAiD;QACjD,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,6EAA6E;QAC7E,4CAA4C;QAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;YACjD,IAAI,CAAC;gBACH,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC;gBACH,MAAO,KAAoB,CAAC,OAAO,EAAE,CAAC;YACxC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,cAAc,CAAC,QAAQ,EAAE,0CAA0C,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAED,WAAW,CAAC,OAAkC;QAC5C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IAEO,OAAO,CAAC,IAAY;QAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED,uFAAuF;IAC/E,UAAU;QAChB,OAAO,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC;IACpD,CAAC;IAEO,MAAM,CAAC,KAAqB;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,EAAE,KAAK,CAAC,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IAEO,OAAO,CAAC,IAAY;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;YAC9B,CAAC,CAAC,gBAAgB,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;YAC1D,CAAC,CAAC,EAAE,CAAC;IACT,CAAC;IAEO,QAAQ,CAAI,KAAQ;QAC1B,IAAI,WAAW,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAElD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,MAAM,UAAU,eAAe;IAC7B,OAAO,IAAI,cAAc,EAAE,CAAC;AAC9B,CAAC"}

package/dist/index.d.ts

@@ -1,3 +1,3 @@
-export { type Container, type Constructor, } from './container.js';
-export { createContainer } from './create.js';
+export { type Container, type Constructor } from './container/Container.js';
+export { createContainer } from './container/ScopeContainer.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,SAAS,EACd,KAAK,WAAW,GACjB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,SAAS,EAAE,KAAK,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAE5E,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC"}

package/dist/index.js

@@ -1,2 +1,2 @@
-export { createContainer } from './create.js';
+export { createContainer } from './container/ScopeContainer.js';
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fougere/container",
-  "version": "0.9.2-alpha.0",
+  "version": "0.9.3-alpha.0",
   "description": "Fougere's DI container: resolution by type, wired from the AST scan. Zero dependencies.",
   "keywords": [
     "fougere",

package/src/{container.ts → container/Container.ts}

@@ -1,4 +1,3 @@
-// eslint-disable-next-line @typescript-eslint/no-explicit-any
 export type Constructor<T = unknown> = new (...args: any[]) => T;
 
 export interface RegisterOptions {
@@ -16,11 +15,6 @@ export interface RegisterOptions {
   deps?: string[];
 }
 
-/** Anything holding a resource can say so, and disposing the container says it back. */
-export interface Disposable {
-  dispose(): void | Promise<void>;
-}
-
 /** DI container interface — the only thing application code sees. */
 export interface Container {
   /** The container builds it: `register('UserService', UserService, { deps: ['UserRepository'] })`. */

package/src/container/Disposable.ts

@@ -0,0 +1,14 @@
+/** Anything holding a resource can say so, and disposing the container says it back. */
+export interface Disposable {
+  dispose(): void | Promise<void>;
+}
+
+export class Disposables {
+  static is(value: unknown): value is Disposable {
+    return (
+      typeof value === 'object' &&
+      value !== null &&
+      typeof (value as Disposable).dispose === 'function'
+    );
+  }
+}

package/src/container/ScopeContainer.ts

@@ -0,0 +1,171 @@
+import type { Container, Constructor, RegisterOptions } from './Container.js';
+import { Disposables, type Disposable } from './Disposable.js';
+
+interface Entry {
+  factory: (container: Container) => unknown;
+  lifetime: 'singleton' | 'transient';
+  instance?: unknown;
+}
+
+/** A scope reaches its parent and its children through members only a scope can read. */
+class ScopeContainer implements Container {
+  private readonly registry = new Map<string, Entry>();
+  // In construction order: a thing built later may hold one built earlier, so disposal
+  // walks this backwards.
+  private readonly built: unknown[] = [];
+  // Closed by this container, and before `built` — a child may hold what this scope built,
+  // never the other way round.
+  private readonly children: ScopeContainer[] = [];
+  private fallback: ((name: string) => unknown) | undefined;
+  // The names being built right now, shared by the whole tree: a miss here is answered by the
+  // parent and the descent continues there, so only one stack can name the path whole —
+  // `child.resolve('A')` reaching a parent's `B` that asks for `A` back reports `A → B → A`.
+  private readonly resolving: string[];
+
+  constructor(private readonly parent?: ScopeContainer) {
+    this.resolving = parent?.resolving ?? [];
+  }
+
+  register<T>(name: string, ctor: Constructor<T>, options?: RegisterOptions): void {
+    const lifetime = options?.lifetime ?? 'transient';
+    const deps = options?.deps ?? [];
+    this.registry.set(name, {
+      factory: (c) => new ctor(...deps.map((d) => c.resolve(d))),
+      lifetime,
+    });
+  }
+
+  registerValue<T>(name: string, value: T): void {
+    // A value the container did not build is not the container's to dispose.
+    this.registry.set(name, {
+      factory: () => value,
+      lifetime: 'singleton',
+      instance: value,
+    });
+  }
+
+  resolve<T>(name: string): T {
+    const entry = this.registry.get(name);
+
+    // Not found locally — the parent holds it, and holds its instance too.
+    if (!entry && this.parent?.entryOf(name)) {
+      return this.parent.resolve<T>(name);
+    }
+
+    // Nobody holds it. A frond declared in `remotes` registers nothing here, so its
+    // façade is fabricated by the fallback rather than found.
+    if (!entry) {
+      const made = this.fallbackOf()?.(name);
+      if (made !== undefined) {
+        this.registry.set(name, {
+          factory: () => made,
+          lifetime: 'singleton',
+          instance: made,
+        });
+
+        return made as T;
+      }
+      throw new Error(`[container] '${name}' is not registered${this.through(name)}`);
+    }
+
+    if (entry.instance !== undefined) return entry.instance as T;
+
+    if (this.resolving.includes(name)) {
+      throw new Error(
+        `[container] dependency cycle: ${[...this.resolving, name].join(' → ')}`,
+      );
+    }
+
+    // Popped in a finally, because a constructor that throws leaves the name on the stack
+    // otherwise and the next resolution of it reports a cycle that is not there.
+    this.resolving.push(name);
+    try {
+      const value = entry.factory(this) as T;
+      // The container disposes what it KEEPS: a transient is handed over and forgotten,
+      // and its caller is the one who knows when it is done.
+      if (entry.lifetime === 'singleton') {
+        entry.instance = value;
+        this.remember(value);
+      }
+
+      return value;
+    } finally {
+      this.resolving.pop();
+    }
+  }
+
+  has(name: string): boolean {
+    return this.registry.has(name) || (this.parent?.has(name) ?? false);
+  }
+
+  createScope(): Container {
+    const child = new ScopeContainer(this);
+    this.children.push(child);
+
+    return child;
+  }
+
+  async dispose(): Promise<void> {
+    // Everything is told before anything throws, then the failures travel together.
+    // Dropped from the parent first: a scope that closes itself leaves a reference the
+    // parent would hold for the life of the process.
+    this.parent?.forget(this);
+    const failures: unknown[] = [];
+    // A copy: closing a child splices it out of `children`, so walking the array
+    // itself stepped over every second sibling.
+    for (const child of [...this.children].reverse()) {
+      try {
+        await child.dispose();
+      } catch (error) {
+        failures.push(error);
+      }
+    }
+    this.children.length = 0;
+    for (const value of this.built.reverse()) {
+      try {
+        await (value as Disposable).dispose();
+      } catch (error) {
+        failures.push(error);
+      }
+    }
+    this.built.length = 0;
+    this.registry.clear();
+    if (failures.length > 0) {
+      throw new AggregateError(failures, '[container] one or more disposals failed');
+    }
+  }
+
+  setFallback(resolve: (name: string) => unknown): void {
+    this.fallback = resolve;
+  }
+
+  private entryOf(name: string): Entry | undefined {
+    return this.registry.get(name) ?? this.parent?.entryOf(name);
+  }
+
+  /** Set on the root, honoured from any scope — a scope inherits it by asking upward. */
+  private fallbackOf(): ((name: string) => unknown) | undefined {
+    return this.fallback ?? this.parent?.fallbackOf();
+  }
+
+  private forget(child: ScopeContainer): void {
+    const at = this.children.indexOf(child);
+    if (at !== -1) this.children.splice(at, 1);
+  }
+
+  private through(name: string): string {
+    return this.resolving.length > 0
+      ? ` (resolving: ${[...this.resolving, name].join(' → ')})`
+      : '';
+  }
+
+  private remember<T>(value: T): T {
+    if (Disposables.is(value)) this.built.push(value);
+
+    return value;
+  }
+}
+
+export function createContainer(): Container {
+  return new ScopeContainer();
+}

package/src/index.ts

@@ -1,6 +1,3 @@
-export {
-  type Container,
-  type Constructor,
-} from './container.js';
+export { type Container, type Constructor } from './container/Container.js';
 
-export { createContainer } from './create.js';
+export { createContainer } from './container/ScopeContainer.js';

package/dist/container.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"container.d.ts","sourceRoot":"","sources":["../src/container.ts"],"names":[],"mappings":"AACA,MAAM,MAAM,WAAW,CAAC,CAAC,GAAG,OAAO,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AAEjE,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,QAAQ,CAAC,EAAE,WAAW,GAAG,WAAW,CAAC;IAErC;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,wFAAwF;AACxF,MAAM,WAAW,UAAU;IACzB,OAAO,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACjC;AAED,qEAAqE;AACrE,MAAM,WAAW,SAAS;IACxB,qGAAqG;IACrG,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,IAAI,CAAC;IAEjF,+GAA+G;IAC/G,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAE/C,yEAAyE;IACzE,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC;IAE5B,kEAAkE;IAClE,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAE3B,yEAAyE;IACzE,WAAW,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,GAAG,IAAI,CAAC;IAEvD,yEAAyE;IACzE,WAAW,IAAI,SAAS,CAAC;IAEzB,wGAAwG;IACxG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CAC1B"}

package/dist/container.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=container.js.map

package/dist/container.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"container.js","sourceRoot":"","sources":["../src/container.ts"],"names":[],"mappings":""}

package/dist/create.d.ts

@@ -1,3 +0,0 @@
-import type { Container } from './container.js';
-export declare function createContainer(): Container;
-//# sourceMappingURL=create.d.ts.map

package/dist/create.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"create.d.ts","sourceRoot":"","sources":["../src/create.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAA4C,MAAM,gBAAgB,CAAC;AAqK1F,wBAAgB,eAAe,IAAI,SAAS,CAE3C"}

package/dist/create.js

@@ -1,136 +0,0 @@
-const isDisposable = (value) => typeof value === 'object' && value !== null &&
-    typeof value.dispose === 'function';
-function createScope(parent) {
-    const registry = new Map();
-    // In construction order: a thing built later may hold one built earlier, so disposal
-    // walks this backwards.
-    const built = [];
-    // Closed by this container, and before `built` — a child may hold what this scope built,
-    // never the other way round.
-    const children = [];
-    let fallback;
-    // The names being built right now, shared by the whole tree: a miss here is answered by the
-    // parent and the descent continues there, so only one stack can name the path whole —
-    // `child.resolve('A')` reaching a parent's `B` that asks for `A` back reports `A → B → A`.
-    const resolving = parent?._resolving() ?? [];
-    const through = (name) => resolving.length > 0 ? ` (resolving: ${[...resolving, name].join(' → ')})` : '';
-    const remember = (value) => {
-        if (isDisposable(value))
-            built.push(value);
-        return value;
-    };
-    const container = {
-        register(name, ctor, options) {
-            const lifetime = options?.lifetime ?? 'transient';
-            const deps = options?.deps ?? [];
-            registry.set(name, {
-                factory: (c) => new ctor(...deps.map((d) => c.resolve(d))),
-                lifetime,
-            });
-        },
-        registerValue(name, value) {
-            // A value the container did not build is not the container's to dispose.
-            registry.set(name, { factory: () => value, lifetime: 'singleton', instance: value });
-        },
-        resolve(name) {
-            let entry = registry.get(name);
-            // Not found locally — the parent holds it, and holds its instance too.
-            if (!entry && parent && parent._getEntry(name)) {
-                return parent.resolve(name);
-            }
-            // Nobody holds it. A frond declared in `remotes` registers nothing here, so its
-            // façade is fabricated by the fallback rather than found.
-            if (!entry) {
-                const made = container._getFallback()?.(name);
-                if (made !== undefined) {
-                    registry.set(name, { factory: () => made, lifetime: 'singleton', instance: made });
-                    return made;
-                }
-                throw new Error(`[container] '${name}' is not registered${through(name)}`);
-            }
-            if (entry.instance !== undefined)
-                return entry.instance;
-            if (resolving.includes(name)) {
-                throw new Error(`[container] dependency cycle: ${[...resolving, name].join(' → ')}`);
-            }
-            // Popped in a finally, because a constructor that throws leaves the name on the stack
-            // otherwise and the next resolution of it reports a cycle that is not there.
-            resolving.push(name);
-            try {
-                const value = entry.factory(container);
-                // The container disposes what it KEEPS: a transient is handed over and forgotten,
-                // and its caller is the one who knows when it is done.
-                if (entry.lifetime === 'singleton') {
-                    entry.instance = value;
-                    remember(value);
-                }
-                return value;
-            }
-            finally {
-                resolving.pop();
-            }
-        },
-        has(name) {
-            return registry.has(name) || (parent?.has(name) ?? false);
-        },
-        createScope() {
-            const child = createScope(container);
-            children.push(child);
-            return child;
-        },
-        async dispose() {
-            // Everything is told before anything throws, then the failures travel together.
-            // Dropped from the parent first: a scope that closes itself leaves a reference the
-            // parent would hold for the life of the process.
-            parent?._forget(container);
-            const failures = [];
-            // A copy: closing a child splices it out of `children`, so walking the array
-            // itself stepped over every second sibling.
-            for (const child of [...children].reverse()) {
-                try {
-                    await child.dispose();
-                }
-                catch (error) {
-                    failures.push(error);
-                }
-            }
-            children.length = 0;
-            for (const value of built.reverse()) {
-                try {
-                    await value.dispose();
-                }
-                catch (error) {
-                    failures.push(error);
-                }
-            }
-            built.length = 0;
-            registry.clear();
-            if (failures.length > 0) {
-                throw new AggregateError(failures, '[container] one or more disposals failed');
-            }
-        },
-        setFallback(resolve) {
-            fallback = resolve;
-        },
-        _getEntry(name) {
-            return registry.get(name) ?? parent?._getEntry(name);
-        },
-        _resolving() {
-            return resolving;
-        },
-        _forget(child) {
-            const at = children.indexOf(child);
-            if (at !== -1)
-                children.splice(at, 1);
-        },
-        /** Set on the root, honoured from any scope — a scope inherits it by asking upward. */
-        _getFallback() {
-            return fallback ?? parent?._getFallback();
-        },
-    };
-    return container;
-}
-export function createContainer() {
-    return createScope();
-}
-//# sourceMappingURL=create.js.map

package/dist/create.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"create.js","sourceRoot":"","sources":["../src/create.ts"],"names":[],"mappings":"AAeA,MAAM,YAAY,GAAG,CAAC,KAAc,EAAuB,EAAE,CAC3D,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;IAC3C,OAAQ,KAAoB,CAAC,OAAO,KAAK,UAAU,CAAC;AAEtD,SAAS,WAAW,CAAC,MAAuB;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC1C,qFAAqF;IACrF,wBAAwB;IACxB,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,yFAAyF;IACzF,6BAA6B;IAC7B,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,IAAI,QAAiD,CAAC;IACtD,4FAA4F;IAC5F,sFAAsF;IACtF,2FAA2F;IAC3F,MAAM,SAAS,GAAa,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;IAEvD,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAE,CAC/B,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAElF,MAAM,QAAQ,GAAG,CAAI,KAAQ,EAAK,EAAE;QAClC,IAAI,YAAY,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,MAAM,SAAS,GAAmB;QAChC,QAAQ,CAAI,IAAY,EAAE,IAAoB,EAAE,OAAyB;YACvE,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,WAAW,CAAC;YAClD,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC;YACjC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE;gBACjB,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1D,QAAQ;aACT,CAAC,CAAC;QACL,CAAC;QAED,aAAa,CAAI,IAAY,EAAE,KAAQ;YACrC,yEAAyE;YACzE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACvF,CAAC;QAED,OAAO,CAAI,IAAY;YACrB,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAE/B,uEAAuE;YACvE,IAAI,CAAC,KAAK,IAAI,MAAM,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/C,OAAO,MAAM,CAAC,OAAO,CAAI,IAAI,CAAC,CAAC;YACjC,CAAC;YAED,gFAAgF;YAChF,0DAA0D;YAC1D,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,GAAG,SAAS,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC9C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;oBACnF,OAAO,IAAS,CAAC;gBACnB,CAAC;gBACD,MAAM,IAAI,KAAK,CAAC,gBAAgB,IAAI,sBAAsB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7E,CAAC;YAED,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC,QAAa,CAAC;YAE7D,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACvF,CAAC;YAED,sFAAsF;YACtF,6EAA6E;YAC7E,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAM,CAAC;gBAC5C,kFAAkF;gBAClF,uDAAuD;gBACvD,IAAI,KAAK,CAAC,QAAQ,KAAK,WAAW,EAAE,CAAC;oBACnC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC;oBACvB,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAClB,CAAC;gBAED,OAAO,KAAK,CAAC;YACf,CAAC;oBAAS,CAAC;gBACT,SAAS,CAAC,GAAG,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;QAED,GAAG,CAAC,IAAY;YACd,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;QAC5D,CAAC;QAED,WAAW;YACT,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;YACrC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,KAAK,CAAC,OAAO;YACX,gFAAgF;YAChF,mFAAmF;YACnF,iDAAiD;YACjD,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,QAAQ,GAAc,EAAE,CAAC;YAC/B,6EAA6E;YAC7E,4CAA4C;YAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC5C,IAAI,CAAC;oBACH,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;gBACxB,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC;oBACH,MAAO,KAAoB,CAAC,OAAO,EAAE,CAAC;gBACxC,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YACjB,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,IAAI,cAAc,CAAC,QAAQ,EAAE,0CAA0C,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QAED,WAAW,CAAC,OAAkC;YAC5C,QAAQ,GAAG,OAAO,CAAC;QACrB,CAAC;QAED,SAAS,CAAC,IAAY;YACpB,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QAED,UAAU;YACR,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO,CAAC,KAAqB;YAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACnC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,uFAAuF;QACvF,YAAY;YACV,OAAO,QAAQ,IAAI,MAAM,EAAE,YAAY,EAAE,CAAC;QAC5C,CAAC;KACF,CAAC;IAEF,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,eAAe;IAC7B,OAAO,WAAW,EAAE,CAAC;AACvB,CAAC"}

package/src/create.ts

@@ -1,168 +0,0 @@
-import type { Container, RegisterOptions, Constructor, Disposable } from './container.js';
-
-interface Entry {
-  factory: (container: Container) => unknown;
-  lifetime: 'singleton' | 'transient';
-  instance?: unknown;
-}
-
-interface ScopeContainer extends Container {
-  _getEntry(name: string): Entry | undefined;
-  _getFallback(): ((name: string) => unknown) | undefined;
-  _forget(child: ScopeContainer): void;
-  _resolving(): string[];
-}
-
-const isDisposable = (value: unknown): value is Disposable =>
-  typeof value === 'object' && value !== null &&
-  typeof (value as Disposable).dispose === 'function';
-
-function createScope(parent?: ScopeContainer): ScopeContainer {
-  const registry = new Map<string, Entry>();
-  // In construction order: a thing built later may hold one built earlier, so disposal
-  // walks this backwards.
-  const built: unknown[] = [];
-  // Closed by this container, and before `built` — a child may hold what this scope built,
-  // never the other way round.
-  const children: ScopeContainer[] = [];
-  let fallback: ((name: string) => unknown) | undefined;
-  // The names being built right now, shared by the whole tree: a miss here is answered by the
-  // parent and the descent continues there, so only one stack can name the path whole —
-  // `child.resolve('A')` reaching a parent's `B` that asks for `A` back reports `A → B → A`.
-  const resolving: string[] = parent?._resolving() ?? [];
-
-  const through = (name: string) =>
-    resolving.length > 0 ? ` (resolving: ${[...resolving, name].join(' → ')})` : '';
-
-  const remember = <T>(value: T): T => {
-    if (isDisposable(value)) built.push(value);
-    return value;
-  };
-
-  const container: ScopeContainer = {
-    register<T>(name: string, ctor: Constructor<T>, options?: RegisterOptions) {
-      const lifetime = options?.lifetime ?? 'transient';
-      const deps = options?.deps ?? [];
-      registry.set(name, {
-        factory: (c) => new ctor(...deps.map((d) => c.resolve(d))),
-        lifetime,
-      });
-    },
-
-    registerValue<T>(name: string, value: T) {
-      // A value the container did not build is not the container's to dispose.
-      registry.set(name, { factory: () => value, lifetime: 'singleton', instance: value });
-    },
-
-    resolve<T>(name: string): T {
-      let entry = registry.get(name);
-
-      // Not found locally — the parent holds it, and holds its instance too.
-      if (!entry && parent && parent._getEntry(name)) {
-        return parent.resolve<T>(name);
-      }
-
-      // Nobody holds it. A frond declared in `remotes` registers nothing here, so its
-      // façade is fabricated by the fallback rather than found.
-      if (!entry) {
-        const made = container._getFallback()?.(name);
-        if (made !== undefined) {
-          registry.set(name, { factory: () => made, lifetime: 'singleton', instance: made });
-          return made as T;
-        }
-        throw new Error(`[container] '${name}' is not registered${through(name)}`);
-      }
-
-      if (entry.instance !== undefined) return entry.instance as T;
-
-      if (resolving.includes(name)) {
-        throw new Error(`[container] dependency cycle: ${[...resolving, name].join(' → ')}`);
-      }
-
-      // Popped in a finally, because a constructor that throws leaves the name on the stack
-      // otherwise and the next resolution of it reports a cycle that is not there.
-      resolving.push(name);
-      try {
-        const value = entry.factory(container) as T;
-        // The container disposes what it KEEPS: a transient is handed over and forgotten,
-        // and its caller is the one who knows when it is done.
-        if (entry.lifetime === 'singleton') {
-          entry.instance = value;
-          remember(value);
-        }
-
-        return value;
-      } finally {
-        resolving.pop();
-      }
-    },
-
-    has(name: string): boolean {
-      return registry.has(name) || (parent?.has(name) ?? false);
-    },
-
-    createScope(): Container {
-      const child = createScope(container);
-      children.push(child);
-      return child;
-    },
-
-    async dispose(): Promise<void> {
-      // Everything is told before anything throws, then the failures travel together.
-      // Dropped from the parent first: a scope that closes itself leaves a reference the
-      // parent would hold for the life of the process.
-      parent?._forget(container);
-      const failures: unknown[] = [];
-      // A copy: closing a child splices it out of `children`, so walking the array
-      // itself stepped over every second sibling.
-      for (const child of [...children].reverse()) {
-        try {
-          await child.dispose();
-        } catch (error) {
-          failures.push(error);
-        }
-      }
-      children.length = 0;
-      for (const value of built.reverse()) {
-        try {
-          await (value as Disposable).dispose();
-        } catch (error) {
-          failures.push(error);
-        }
-      }
-      built.length = 0;
-      registry.clear();
-      if (failures.length > 0) {
-        throw new AggregateError(failures, '[container] one or more disposals failed');
-      }
-    },
-
-    setFallback(resolve: (name: string) => unknown) {
-      fallback = resolve;
-    },
-
-    _getEntry(name: string): Entry | undefined {
-      return registry.get(name) ?? parent?._getEntry(name);
-    },
-
-    _resolving() {
-      return resolving;
-    },
-
-    _forget(child: ScopeContainer) {
-      const at = children.indexOf(child);
-      if (at !== -1) children.splice(at, 1);
-    },
-
-    /** Set on the root, honoured from any scope — a scope inherits it by asking upward. */
-    _getFallback() {
-      return fallback ?? parent?._getFallback();
-    },
-  };
-
-  return container;
-}
-
-export function createContainer(): Container {
-  return createScope();
-}