@chronon-sim/engine 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 [yyyy] [name of copyright owner]
+
+   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

@@ -0,0 +1,19 @@
+# @chronon-sim/engine
+
+The simulation engine behind Chronon Sim. It runs in Node and in a Web Worker: no DOM or Node APIs and no runtime
+dependencies.
+
+```ts
+import { loadModel, runModel } from "@chronon-sim/engine";
+
+const loaded = loadModel(modelJson);          // validates; returns every error at once
+if (loaded.ok) {
+  const results = runModel(loaded.model);     // replications, confidence intervals, time series, assertions
+  console.log(results.outputs);
+}
+```
+
+Models are plain, versioned JSON; see the [model format](https://github.com/NiloyBhattacharjee/chronon-sim/blob/main/docs/model-format.md). To run models from the
+command line use [`@chronon-sim/cli`](https://www.npmjs.com/package/@chronon-sim/cli).
+
+Part of [Chronon Sim](https://github.com/NiloyBhattacharjee/chronon-sim). Apache-2.0.

package/dist/components/autoscaler.d.ts

@@ -0,0 +1,47 @@
+import { LinkedComponent, type ComponentInit, type SimContext } from "../model/index.js";
+import type { ComponentSchema } from "../schema/index.js";
+/** Something whose concurrency an {@link Autoscaler} can change (a WorkerPool). */
+export interface Scalable {
+    readonly concurrency: number;
+    setConcurrency(n: number): void;
+    /** Cumulative busy-worker-ticks since time 0, unaffected by the warm-up statistics reset. */
+    busyWorkerTicks(): number;
+}
+/**
+ * Target-tracking autoscaler for a WorkerPool (like AWS target tracking or a Kubernetes HPA).
+ *
+ * Every `evaluationInterval` seconds it measures the average number of busy workers over that
+ * interval and computes `desired = ceil(averageBusy / targetUtilisation)`, clamped to
+ * `[minConcurrency, maxConcurrency]`.
+ *
+ * - **Scale out** takes effect after `scaleUpDelay` seconds (provisioning time). While a scale-out is
+ *   pending, only a larger desired value schedules another.
+ * - **Scale in** is immediate but only allowed `scaleDownCooldown` seconds after the last scaling
+ *   change, so a brief lull does not shed capacity that a spike needs a minute later.
+ *
+ * Because saturation caps measured busy workers at the current limit, a saturated pool grows by
+ * a factor of `1 / targetUtilisation` per evaluation until demand is met.
+ */
+export declare class Autoscaler extends LinkedComponent {
+    static readonly schema: ComponentSchema<Autoscaler>;
+    private readonly targetUtilisation;
+    private readonly intervalTicks;
+    private readonly min;
+    private readonly max;
+    private readonly upDelayTicks;
+    private readonly cooldownTicks;
+    private pool;
+    private lastBusyTicks;
+    private lastEvalTick;
+    private lastChangeTick;
+    private pendingTarget;
+    private desired;
+    private scaleOuts;
+    private scaleIns;
+    constructor(ctx: SimContext, init: ComponentInit);
+    setLink(key: string, target: LinkedComponent): void;
+    start(): void;
+    private evaluate;
+    resetStatistics(): void;
+}
+//# sourceMappingURL=autoscaler.d.ts.map

package/dist/components/autoscaler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"autoscaler.d.ts","sourceRoot":"","sources":["../../src/components/autoscaler.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,KAAK,aAAa,EAAE,KAAK,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACzF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAE1D,mFAAmF;AACnF,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,6FAA6F;IAC7F,eAAe,IAAI,MAAM,CAAC;CAC3B;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,UAAW,SAAQ,eAAe;IAC7C,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC,UAAU,CAAC,CAkBjD;IAEF,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAS;IAC3C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IACvC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAS;IACtC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IACvC,OAAO,CAAC,IAAI,CAAyB;IACrC,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,cAAc,CAA4B;IAClD,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,QAAQ,CAAK;gBAET,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,aAAa;IAavC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,GAAG,IAAI;IAKnD,KAAK,IAAI,IAAI;IAQtB,OAAO,CAAC,QAAQ;IAiCP,eAAe,IAAI,IAAI;CAKjC"}

package/dist/components/autoscaler.js

@@ -0,0 +1,116 @@
+import { Priority } from "../kernel/index.js";
+import { LinkedComponent } from "../model/index.js";
+/**
+ * Target-tracking autoscaler for a WorkerPool (like AWS target tracking or a Kubernetes HPA).
+ *
+ * Every `evaluationInterval` seconds it measures the average number of busy workers over that
+ * interval and computes `desired = ceil(averageBusy / targetUtilisation)`, clamped to
+ * `[minConcurrency, maxConcurrency]`.
+ *
+ * - **Scale out** takes effect after `scaleUpDelay` seconds (provisioning time). While a scale-out is
+ *   pending, only a larger desired value schedules another.
+ * - **Scale in** is immediate but only allowed `scaleDownCooldown` seconds after the last scaling
+ *   change, so a brief lull does not shed capacity that a spike needs a minute later.
+ *
+ * Because saturation caps measured busy workers at the current limit, a saturated pool grows by
+ * a factor of `1 / targetUtilisation` per evaluation until demand is met.
+ */
+export class Autoscaler extends LinkedComponent {
+    static schema = {
+        type: "Autoscaler",
+        description: "Target-tracking autoscaler: resizes a WorkerPool's concurrency from its measured utilisation.",
+        roles: [],
+        inputs: [
+            { key: "targetUtilisation", type: "number", unit: "dimensionless", min: 0.05, max: 1, default: 0.6, required: false, description: "Busy workers / concurrency to aim for." },
+            { key: "evaluationInterval", type: "number", unit: "time", min: 0.000001, default: 60, required: false, description: "Seconds between scaling decisions (and the metric averaging window)." },
+            { key: "minConcurrency", type: "integer", unit: "dimensionless", min: 1, default: 1, required: false, description: "Never scale below this." },
+            { key: "maxConcurrency", type: "integer", unit: "dimensionless", min: 1, required: true, description: "Never scale above this." },
+            { key: "scaleUpDelay", type: "number", unit: "time", min: 0, default: 0, required: false, description: "Seconds before added capacity becomes available." },
+            { key: "scaleDownCooldown", type: "number", unit: "time", min: 0, default: 300, required: false, description: "Minimum seconds since the last scaling change before scaling in." },
+        ],
+        links: [{ key: "target", description: "The WorkerPool to scale.", required: true, accepts: "scalable" }],
+        outputs: [
+            { key: "ScaleOuts", unit: "dimensionless", description: "Scale-out decisions applied.", get: (a) => a.scaleOuts },
+            { key: "ScaleIns", unit: "dimensionless", description: "Scale-in decisions applied.", get: (a) => a.scaleIns },
+            { key: "DesiredConcurrency", unit: "dimensionless", series: true, description: "The most recent desired concurrency.", get: (a) => a.desired },
+        ],
+    };
+    targetUtilisation;
+    intervalTicks;
+    min;
+    max;
+    upDelayTicks;
+    cooldownTicks;
+    pool = null;
+    lastBusyTicks = 0;
+    lastEvalTick;
+    lastChangeTick = Number.NEGATIVE_INFINITY;
+    pendingTarget = 0;
+    desired = 0;
+    scaleOuts = 0;
+    scaleIns = 0;
+    constructor(ctx, init) {
+        super(ctx, init, "Idle");
+        const i = init.inputs;
+        const k = ctx.kernel;
+        this.targetUtilisation = i["targetUtilisation"];
+        this.intervalTicks = Math.max(1, k.secondsToTicks(i["evaluationInterval"]));
+        this.min = i["minConcurrency"];
+        this.max = Math.max(this.min, i["maxConcurrency"]);
+        this.upDelayTicks = k.secondsToTicks(i["scaleUpDelay"]);
+        this.cooldownTicks = k.secondsToTicks(i["scaleDownCooldown"]);
+        this.lastEvalTick = k.currentTick;
+    }
+    setLink(key, target) {
+        if (key === "target")
+            this.pool = target;
+        else
+            super.setLink(key, target);
+    }
+    start() {
+        if (this.pool === null)
+            return;
+        this.desired = this.pool.concurrency;
+        this.pendingTarget = this.pool.concurrency;
+        this.lastBusyTicks = this.pool.busyWorkerTicks();
+        this.ctx.kernel.schedule(this.intervalTicks, Priority.LOW, () => this.evaluate());
+    }
+    evaluate() {
+        const pool = this.pool;
+        const k = this.ctx.kernel;
+        const now = k.currentTick;
+        const busyTicks = pool.busyWorkerTicks();
+        const averageBusy = (busyTicks - this.lastBusyTicks) / Math.max(1, now - this.lastEvalTick);
+        this.lastBusyTicks = busyTicks;
+        this.lastEvalTick = now;
+        const desired = Math.min(this.max, Math.max(this.min, Math.ceil(averageBusy / this.targetUtilisation - 1e-9)));
+        this.desired = desired;
+        const current = pool.concurrency;
+        if (desired > Math.max(current, this.pendingTarget)) {
+            this.pendingTarget = desired;
+            this.setState("ScalingOut");
+            k.schedule(this.upDelayTicks, Priority.HIGH, () => {
+                if (desired > pool.concurrency) {
+                    pool.setConcurrency(desired);
+                    this.scaleOuts++;
+                    this.lastChangeTick = k.currentTick;
+                }
+                this.pendingTarget = pool.concurrency;
+                this.setState("Idle");
+            });
+        }
+        else if (desired < current && this.pendingTarget <= current && now - this.lastChangeTick >= this.cooldownTicks) {
+            pool.setConcurrency(desired);
+            this.pendingTarget = desired;
+            this.scaleIns++;
+            this.lastChangeTick = now;
+        }
+        k.schedule(this.intervalTicks, Priority.LOW, () => this.evaluate());
+    }
+    resetStatistics() {
+        super.resetStatistics();
+        this.scaleOuts = 0;
+        this.scaleIns = 0;
+    }
+}
+//# sourceMappingURL=autoscaler.js.map

package/dist/components/autoscaler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"autoscaler.js","sourceRoot":"","sources":["../../src/components/autoscaler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAuC,MAAM,mBAAmB,CAAC;AAWzF;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,UAAW,SAAQ,eAAe;IAC7C,MAAM,CAAU,MAAM,GAAgC;QACpD,IAAI,EAAE,YAAY;QAClB,WAAW,EAAE,+FAA+F;QAC5G,KAAK,EAAE,EAAE;QACT,MAAM,EAAE;YACN,EAAE,GAAG,EAAE,mBAAmB,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,eAAe,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,wCAAwC,EAAE;YAC5K,EAAE,GAAG,EAAE,oBAAoB,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,sEAAsE,EAAE;YAC7L,EAAE,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,yBAAyB,EAAE;YAC9I,EAAE,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,WAAW,EAAE,yBAAyB,EAAE;YACjI,EAAE,GAAG,EAAE,cAAc,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,kDAAkD,EAAE;YAC3J,EAAE,GAAG,EAAE,mBAAmB,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,kEAAkE,EAAE;SACnL;QACD,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,WAAW,EAAE,0BAA0B,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;QACxG,OAAO,EAAE;YACP,EAAE,GAAG,EAAE,WAAW,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,8BAA8B,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE;YACjH,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,6BAA6B,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE;YAC9G,EAAE,GAAG,EAAE,oBAAoB,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,sCAAsC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE;SAC/I;KACF,CAAC;IAEe,iBAAiB,CAAS;IAC1B,aAAa,CAAS;IACtB,GAAG,CAAS;IACZ,GAAG,CAAS;IACZ,YAAY,CAAS;IACrB,aAAa,CAAS;IAC/B,IAAI,GAAoB,IAAI,CAAC;IAC7B,aAAa,GAAG,CAAC,CAAC;IAClB,YAAY,CAAS;IACrB,cAAc,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC1C,aAAa,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,CAAC,CAAC;IACZ,SAAS,GAAG,CAAC,CAAC;IACd,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,GAAe,EAAE,IAAmB;QAC9C,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACrB,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,mBAAmB,CAAW,CAAC;QAC1D,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,oBAAoB,CAAW,CAAC,CAAC,CAAC;QACtF,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,gBAAgB,CAAW,CAAC;QACzC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,gBAAgB,CAAW,CAAC,CAAC;QAC7D,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,CAAW,CAAC,CAAC;QAClE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,mBAAmB,CAAW,CAAC,CAAC;QACxE,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,WAAW,CAAC;IACpC,CAAC;IAEQ,OAAO,CAAC,GAAW,EAAE,MAAuB;QACnD,IAAI,GAAG,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,GAAG,MAA6B,CAAC;;YAC3D,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAClC,CAAC;IAEQ,KAAK;QACZ,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,OAAO;QAC/B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;QACrC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;QAC3C,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;QACjD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACpF,CAAC;IAEO,QAAQ;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,IAAgB,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC;QAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACzC,MAAM,WAAW,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QAC5F,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;QAC/B,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;QAExB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/G,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAC5B,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE;gBAChD,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;oBAC/B,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;oBAC7B,IAAI,CAAC,SAAS,EAAE,CAAC;oBACjB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC,WAAW,CAAC;gBACtC,CAAC;gBACD,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC;gBACtC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,aAAa,IAAI,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACjH,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;YAC7B,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;YAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;QAC5B,CAAC;QACD,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACtE,CAAC;IAEQ,eAAe;QACtB,KAAK,CAAC,eAAe,EAAE,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC"}

package/dist/components/generator.d.ts

@@ -0,0 +1,32 @@
+import { LinkedComponent, type ComponentInit, type SimContext } from "../model/index.js";
+import { type ComponentSchema } from "../schema/index.js";
+/**
+ * Produces arrivals and sends them to `next`.
+ *
+ * - `interval` mode: the first arrival happens at `firstArrivalTime` (default 0), then one every
+ *   `interArrivalTime` samples.
+ * - `rateProfile` mode: a non-homogeneous Poisson process whose rate is piecewise constant.
+ *   Generated exactly per segment (memorylessness of the exponential). The process starts at
+ *   `firstArrivalTime`; before the first segment's start the rate is 0; the last segment
+ *   continues forever.
+ */
+export declare class EntityGenerator extends LinkedComponent {
+    static readonly schema: ComponentSchema<EntityGenerator>;
+    private readonly mode;
+    private readonly interArrival;
+    private readonly firstArrival;
+    private readonly profile;
+    private readonly unitExp;
+    private readonly maxNumber;
+    private profileSeconds;
+    private generated;
+    constructor(ctx: SimContext, init: ComponentInit);
+    start(): void;
+    private scheduleAtSeconds;
+    private finish;
+    private arrive;
+    private scheduleNextProfileArrival;
+    /** Time (seconds) of the next arrival strictly generated after `from`, or null if the rate is 0 forever. */
+    private nextProfileArrival;
+}
+//# sourceMappingURL=generator.d.ts.map

package/dist/components/generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generator.d.ts","sourceRoot":"","sources":["../../src/components/generator.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,eAAe,EAAE,KAAK,aAAa,EAAE,KAAK,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACzF,OAAO,EAA4B,KAAK,eAAe,EAAoB,MAAM,oBAAoB,CAAC;AAEtG;;;;;;;;;GASG;AACH,qBAAa,eAAgB,SAAQ,eAAe;IAClD,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC,eAAe,CAAC,CAetD;IAEF,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAC9B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAwB;IACrD,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAiB;IAC9C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgB;IACxC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAiB;IACzC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAqB;IAC/C,OAAO,CAAC,cAAc,CAAK;IAC3B,OAAO,CAAC,SAAS,CAAK;gBAEV,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,aAAa;IAWvC,KAAK,IAAI,IAAI;IAWtB,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,MAAM;IAed,OAAO,CAAC,0BAA0B;IAOlC,4GAA4G;IAC5G,OAAO,CAAC,kBAAkB;CAyB3B"}

package/dist/components/generator.js

@@ -0,0 +1,124 @@
+import { Priority } from "../kernel/index.js";
+import { ExponentialSampler } from "../rng/index.js";
+import { LinkedComponent } from "../model/index.js";
+import { asRateProfile, asSampler } from "../schema/index.js";
+/**
+ * Produces arrivals and sends them to `next`.
+ *
+ * - `interval` mode: the first arrival happens at `firstArrivalTime` (default 0), then one every
+ *   `interArrivalTime` samples.
+ * - `rateProfile` mode: a non-homogeneous Poisson process whose rate is piecewise constant.
+ *   Generated exactly per segment (memorylessness of the exponential). The process starts at
+ *   `firstArrivalTime`; before the first segment's start the rate is 0; the last segment
+ *   continues forever.
+ */
+export class EntityGenerator extends LinkedComponent {
+    static schema = {
+        type: "EntityGenerator",
+        description: "Generates arriving entities, either at sampled intervals or from a time-varying Poisson rate profile.",
+        roles: ["source"],
+        inputs: [
+            { key: "mode", type: "enum", unit: "dimensionless", options: ["interval", "rateProfile"], default: "interval", required: false, description: "Arrival mode." },
+            { key: "interArrivalTime", type: "sampler", unit: "time", min: 0, required: false, requiredWhen: { input: "mode", equals: "interval" }, description: "Time between arrivals (seconds). Interval mode." },
+            { key: "rateProfile", type: "rateProfile", unit: "rate", required: false, requiredWhen: { input: "mode", equals: "rateProfile" }, description: "Piecewise-constant Poisson rate: [[startSeconds, ratePerSecond], ...]. RateProfile mode." },
+            { key: "firstArrivalTime", type: "sampler", unit: "time", min: 0, default: 0, required: false, description: "Time of the first arrival (interval mode) or start of the process (rateProfile mode), in seconds." },
+            { key: "maxNumber", type: "integer", unit: "dimensionless", min: 0, required: false, description: "Stop after generating this many entities. Unlimited if omitted." },
+        ],
+        links: [{ key: "next", description: "Where generated entities are sent.", required: false, accepts: "receiver" }],
+        outputs: [
+            { key: "NumberGenerated", unit: "dimensionless", description: "Entities generated.", get: (c) => c.numberAdded },
+        ],
+    };
+    mode;
+    interArrival;
+    firstArrival;
+    profile;
+    unitExp;
+    maxNumber;
+    profileSeconds = 0;
+    generated = 0;
+    constructor(ctx, init) {
+        super(ctx, init, "Waiting");
+        const i = init.inputs;
+        this.mode = i["mode"];
+        this.interArrival = i["interArrivalTime"] !== undefined ? this.makeSampler(asSampler(i["interArrivalTime"]), "interArrivalTime") : null;
+        this.firstArrival = this.makeSampler(asSampler(i["firstArrivalTime"]), "firstArrivalTime");
+        this.profile = i["rateProfile"] !== undefined ? asRateProfile(i["rateProfile"]) : [];
+        this.unitExp = new ExponentialSampler(ctx.rng(`${this.stream}/arrivals`), 1);
+        this.maxNumber = i["maxNumber"];
+    }
+    start() {
+        if (this.maxNumber === 0)
+            return this.finish();
+        const first = Math.max(0, this.firstArrival.nextSample());
+        if (this.mode === "interval") {
+            this.scheduleAtSeconds(first);
+        }
+        else {
+            this.profileSeconds = first;
+            this.scheduleNextProfileArrival();
+        }
+    }
+    scheduleAtSeconds(seconds) {
+        const k = this.ctx.kernel;
+        const delay = Math.max(0, k.secondsToTicks(seconds) - k.currentTick);
+        k.schedule(delay, Priority.DEFAULT, () => this.arrive());
+    }
+    finish() {
+        this.setState("Done");
+    }
+    arrive() {
+        this.setState("Generating");
+        this.generated++;
+        this.noteAdded();
+        this.sendToNext(this.ctx.createEntity());
+        if (this.maxNumber !== undefined && this.generated >= this.maxNumber)
+            return this.finish();
+        if (this.mode === "interval") {
+            const gap = Math.max(0, this.interArrival.nextSample());
+            this.profileSeconds = this.ctx.kernel.currentSeconds + gap;
+            this.scheduleAtSeconds(this.profileSeconds);
+        }
+        else {
+            this.scheduleNextProfileArrival();
+        }
+    }
+    scheduleNextProfileArrival() {
+        const t = this.nextProfileArrival(this.profileSeconds);
+        if (t === null)
+            return this.finish();
+        this.profileSeconds = t;
+        this.scheduleAtSeconds(t);
+    }
+    /** Time (seconds) of the next arrival strictly generated after `from`, or null if the rate is 0 forever. */
+    nextProfileArrival(from) {
+        const segs = this.profile;
+        let t = from;
+        for (;;) {
+            let idx = -1;
+            for (let s = 0; s < segs.length; s++) {
+                if (segs[s][0] <= t)
+                    idx = s;
+                else
+                    break;
+            }
+            if (idx === -1) {
+                t = segs[0][0];
+                continue;
+            }
+            const rate = segs[idx][1];
+            const end = idx + 1 < segs.length ? segs[idx + 1][0] : Infinity;
+            if (rate <= 0) {
+                if (end === Infinity)
+                    return null;
+                t = end;
+                continue;
+            }
+            const candidate = t + this.unitExp.nextSample() / rate;
+            if (candidate < end)
+                return candidate;
+            t = end;
+        }
+    }
+}
+//# sourceMappingURL=generator.js.map

package/dist/components/generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generator.js","sourceRoot":"","sources":["../../src/components/generator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAuB,MAAM,iBAAiB,CAAC;AAC1E,OAAO,EAAE,eAAe,EAAuC,MAAM,mBAAmB,CAAC;AACzF,OAAO,EAAE,aAAa,EAAE,SAAS,EAA0C,MAAM,oBAAoB,CAAC;AAEtG;;;;;;;;;GASG;AACH,MAAM,OAAO,eAAgB,SAAQ,eAAe;IAClD,MAAM,CAAU,MAAM,GAAqC;QACzD,IAAI,EAAE,iBAAiB;QACvB,WAAW,EAAE,uGAAuG;QACpH,KAAK,EAAE,CAAC,QAAQ,CAAC;QACjB,MAAM,EAAE;YACN,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,UAAU,EAAE,aAAa,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE;YAC9J,EAAE,GAAG,EAAE,kBAAkB,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,WAAW,EAAE,iDAAiD,EAAE;YACxM,EAAE,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,0FAA0F,EAAE;YAC3O,EAAE,GAAG,EAAE,kBAAkB,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,mGAAmG,EAAE;YACjN,EAAE,GAAG,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,iEAAiE,EAAE;SACtK;QACD,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,oCAAoC,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;QACjH,OAAO,EAAE;YACP,EAAE,GAAG,EAAE,iBAAiB,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,qBAAqB,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE;SACjH;KACF,CAAC;IAEe,IAAI,CAAS;IACb,YAAY,CAAwB;IACpC,YAAY,CAAiB;IAC7B,OAAO,CAAgB;IACvB,OAAO,CAAiB;IACxB,SAAS,CAAqB;IACvC,cAAc,GAAG,CAAC,CAAC;IACnB,SAAS,GAAG,CAAC,CAAC;IAEtB,YAAY,GAAe,EAAE,IAAmB;QAC9C,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,MAAM,CAAW,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,kBAAkB,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxI,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAC3F,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACrF,IAAI,CAAC,OAAO,GAAG,IAAI,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,WAAW,CAAuB,CAAC;IACxD,CAAC;IAEQ,KAAK;QACZ,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC;QAC1D,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;YAC5B,IAAI,CAAC,0BAA0B,EAAE,CAAC;QACpC,CAAC;IACH,CAAC;IAEO,iBAAiB,CAAC,OAAe;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QACrE,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3D,CAAC;IAEO,MAAM;QACZ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;IAEO,MAAM;QACZ,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAC5B,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3F,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAG,IAAI,CAAC,YAA+B,CAAC,UAAU,EAAE,CAAC,CAAC;YAC5E,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,cAAc,GAAG,GAAG,CAAC;YAC3D,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,0BAA0B,EAAE,CAAC;QACpC,CAAC;IACH,CAAC;IAEO,0BAA0B;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,4GAA4G;IACpG,kBAAkB,CAAC,IAAY;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,CAAC,GAAG,IAAI,CAAC;QACb,SAAS,CAAC;YACR,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAK,IAAI,CAAC,CAAC,CAAiB,CAAC,CAAC,CAAC,IAAI,CAAC;oBAAE,GAAG,GAAG,CAAC,CAAC;;oBACzC,MAAM;YACb,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,CAAC,GAAI,IAAI,CAAC,CAAC,CAAiB,CAAC,CAAC,CAAC,CAAC;gBAChC,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAI,IAAI,CAAC,GAAG,CAAiB,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YACjF,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;gBACd,IAAI,GAAG,KAAK,QAAQ;oBAAE,OAAO,IAAI,CAAC;gBAClC,CAAC,GAAG,GAAG,CAAC;gBACR,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,IAAI,CAAC;YACvD,IAAI,SAAS,GAAG,GAAG;gBAAE,OAAO,SAAS,CAAC;YACtC,CAAC,GAAG,GAAG,CAAC;QACV,CAAC;IACH,CAAC"}

package/dist/components/index.d.ts

@@ -0,0 +1,14 @@
+export { EntityGenerator } from "./generator.js";
+export { Queue } from "./queue.js";
+export { MessageQueue } from "./message-queue.js";
+export type { Lease, PullSource, QueueWaiter } from "./pullable.js";
+export { Server } from "./server.js";
+export { WorkerPool } from "./worker-pool.js";
+export { RetryPolicy } from "./retry-policy.js";
+export { RateLimiter } from "./rate-limiter.js";
+export { Autoscaler } from "./autoscaler.js";
+export type { Scalable } from "./autoscaler.js";
+export { EntitySink } from "./sink.js";
+export { ComponentRegistry, createDefaultRegistry } from "./registry.js";
+export type { ComponentClass } from "./registry.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/components/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/components/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,YAAY,EAAE,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AACpE,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,YAAY,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC;AACzE,YAAY,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC"}

package/dist/components/index.js

@@ -0,0 +1,11 @@
+export { EntityGenerator } from "./generator.js";
+export { Queue } from "./queue.js";
+export { MessageQueue } from "./message-queue.js";
+export { Server } from "./server.js";
+export { WorkerPool } from "./worker-pool.js";
+export { RetryPolicy } from "./retry-policy.js";
+export { RateLimiter } from "./rate-limiter.js";
+export { Autoscaler } from "./autoscaler.js";
+export { EntitySink } from "./sink.js";
+export { ComponentRegistry, createDefaultRegistry } from "./registry.js";
+//# sourceMappingURL=index.js.map

package/dist/components/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/components/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC"}