@rivetkit/workflow-engine 2.2.2-rc.1 → 2.3.0-rc.10

package/dist/tsup/testing.cjs

@@ -47,7 +47,7 @@
 
 
 
-var _chunk4SWXLWKLcjs = require('./chunk-4SWXLWKL.cjs');
+var _chunkSFJQFMCWcjs = require('./chunk-SFJQFMCW.cjs');
 
 // src/testing.ts
 var InMemoryWorkflowMessageDriver = class {
@@ -97,7 +97,7 @@ var InMemoryWorkflowMessageDriver = class {
   }
   async waitForMessages(messageNames, abortSignal) {
     if (abortSignal.aborted) {
-      throw new (0, _chunk4SWXLWKLcjs.EvictedError)();
+      throw new (0, _chunkSFJQFMCWcjs.EvictedError)();
     }
     const nameSet = messageNames.length > 0 ? new Set(messageNames) : void 0;
     if (this.#messages.some(
@@ -118,7 +118,7 @@ var InMemoryWorkflowMessageDriver = class {
         },
         abortSignal,
         onAbort: () => {
-          waiter.reject(new (0, _chunk4SWXLWKLcjs.EvictedError)());
+          waiter.reject(new (0, _chunkSFJQFMCWcjs.EvictedError)());
         }
       };
       abortSignal.addEventListener("abort", waiter.onAbort, {
@@ -158,56 +158,56 @@ var InMemoryDriver = (_class = class {constructor() { _class.prototype.__init.ca
   __init4() {this.workerPollInterval = 100}
   __init5() {this.messageDriver = this.#inMemoryMessageDriver}
   async get(key) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
-    const entry = this.kv.get(_chunk4SWXLWKLcjs.keyToHex.call(void 0, key));
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
+    const entry = this.kv.get(_chunkSFJQFMCWcjs.keyToHex.call(void 0, key));
     return _nullishCoalesce((entry == null ? void 0 : entry.value), () => ( null));
   }
   async set(key, value) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
-    this.kv.set(_chunk4SWXLWKLcjs.keyToHex.call(void 0, key), { key, value });
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
+    this.kv.set(_chunkSFJQFMCWcjs.keyToHex.call(void 0, key), { key, value });
   }
   async delete(key) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
-    this.kv.delete(_chunk4SWXLWKLcjs.keyToHex.call(void 0, key));
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
+    this.kv.delete(_chunkSFJQFMCWcjs.keyToHex.call(void 0, key));
   }
   async deletePrefix(prefix) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
     for (const [hexKey, entry] of this.kv) {
-      if (_chunk4SWXLWKLcjs.keyStartsWith.call(void 0, entry.key, prefix)) {
+      if (_chunkSFJQFMCWcjs.keyStartsWith.call(void 0, entry.key, prefix)) {
         this.kv.delete(hexKey);
       }
     }
   }
   async deleteRange(start, end) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
     for (const [hexKey, entry] of this.kv) {
-      if (_chunk4SWXLWKLcjs.compareKeys.call(void 0, entry.key, start) >= 0 && _chunk4SWXLWKLcjs.compareKeys.call(void 0, entry.key, end) < 0) {
+      if (_chunkSFJQFMCWcjs.compareKeys.call(void 0, entry.key, start) >= 0 && _chunkSFJQFMCWcjs.compareKeys.call(void 0, entry.key, end) < 0) {
         this.kv.delete(hexKey);
       }
     }
   }
   async list(prefix) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
     const results = [];
     for (const entry of this.kv.values()) {
-      if (_chunk4SWXLWKLcjs.keyStartsWith.call(void 0, entry.key, prefix)) {
+      if (_chunkSFJQFMCWcjs.keyStartsWith.call(void 0, entry.key, prefix)) {
         results.push({ key: entry.key, value: entry.value });
       }
     }
-    return results.sort((a, b) => _chunk4SWXLWKLcjs.compareKeys.call(void 0, a.key, b.key));
+    return results.sort((a, b) => _chunkSFJQFMCWcjs.compareKeys.call(void 0, a.key, b.key));
   }
   async batch(writes) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
     for (const { key, value } of writes) {
-      this.kv.set(_chunk4SWXLWKLcjs.keyToHex.call(void 0, key), { key, value });
+      this.kv.set(_chunkSFJQFMCWcjs.keyToHex.call(void 0, key), { key, value });
     }
   }
   async setAlarm(workflowId, wakeAt) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
     this.alarms.set(workflowId, wakeAt);
   }
   async clearAlarm(workflowId) {
-    await _chunk4SWXLWKLcjs.sleep.call(void 0, this.latency);
+    await _chunkSFJQFMCWcjs.sleep.call(void 0, this.latency);
     this.alarms.delete(workflowId);
   }
   async waitForMessages(messageNames, abortSignal) {
@@ -218,7 +218,7 @@ var InMemoryDriver = (_class = class {constructor() { _class.prototype.__init.ca
     }
     while (true) {
       if (abortSignal.aborted) {
-        throw new (0, _chunk4SWXLWKLcjs.EvictedError)();
+        throw new (0, _chunkSFJQFMCWcjs.EvictedError)();
       }
       const messages = await this.messageDriver.receiveMessages({
         names: messageNames.length > 0 ? messageNames : void 0,
@@ -228,7 +228,7 @@ var InMemoryDriver = (_class = class {constructor() { _class.prototype.__init.ca
       if (messages.length > 0) {
         return;
       }
-      await _chunk4SWXLWKLcjs.sleep.call(void 0, Math.max(1, this.latency));
+      await _chunkSFJQFMCWcjs.sleep.call(void 0, Math.max(1, this.latency));
     }
   }
   /**
@@ -324,5 +324,5 @@ var InMemoryDriver = (_class = class {constructor() { _class.prototype.__init.ca
 
 
 
-exports.CancelledError = _chunk4SWXLWKLcjs.CancelledError; exports.CriticalError = _chunk4SWXLWKLcjs.CriticalError; exports.DEFAULT_LOOP_HISTORY_PRUNE_INTERVAL = _chunk4SWXLWKLcjs.DEFAULT_LOOP_HISTORY_PRUNE_INTERVAL; exports.DEFAULT_MAX_RETRIES = _chunk4SWXLWKLcjs.DEFAULT_MAX_RETRIES; exports.DEFAULT_RETRY_BACKOFF_BASE = _chunk4SWXLWKLcjs.DEFAULT_RETRY_BACKOFF_BASE; exports.DEFAULT_RETRY_BACKOFF_MAX = _chunk4SWXLWKLcjs.DEFAULT_RETRY_BACKOFF_MAX; exports.DEFAULT_STEP_TIMEOUT = _chunk4SWXLWKLcjs.DEFAULT_STEP_TIMEOUT; exports.EntryInProgressError = _chunk4SWXLWKLcjs.EntryInProgressError; exports.EvictedError = _chunk4SWXLWKLcjs.EvictedError; exports.HistoryDivergedError = _chunk4SWXLWKLcjs.HistoryDivergedError; exports.InMemoryDriver = InMemoryDriver; exports.JoinError = _chunk4SWXLWKLcjs.JoinError; exports.Loop = _chunk4SWXLWKLcjs.Loop; exports.MessageWaitError = _chunk4SWXLWKLcjs.MessageWaitError; exports.RaceError = _chunk4SWXLWKLcjs.RaceError; exports.RollbackCheckpointError = _chunk4SWXLWKLcjs.RollbackCheckpointError; exports.RollbackError = _chunk4SWXLWKLcjs.RollbackError; exports.SleepError = _chunk4SWXLWKLcjs.SleepError; exports.StepExhaustedError = _chunk4SWXLWKLcjs.StepExhaustedError; exports.StepFailedError = _chunk4SWXLWKLcjs.StepFailedError; exports.WorkflowContextImpl = _chunk4SWXLWKLcjs.WorkflowContextImpl; exports.appendLoopIteration = _chunk4SWXLWKLcjs.appendLoopIteration; exports.appendName = _chunk4SWXLWKLcjs.appendName; exports.createEntry = _chunk4SWXLWKLcjs.createEntry; exports.createHistorySnapshot = _chunk4SWXLWKLcjs.createHistorySnapshot; exports.createStorage = _chunk4SWXLWKLcjs.createStorage; exports.deleteEntriesWithPrefix = _chunk4SWXLWKLcjs.deleteEntriesWithPrefix; exports.emptyLocation = _chunk4SWXLWKLcjs.emptyLocation; exports.extractErrorInfo = _chunk4SWXLWKLcjs.extractErrorInfo; exports.flush = _chunk4SWXLWKLcjs.flush; exports.generateId = _chunk4SWXLWKLcjs.generateId; exports.getEntry = _chunk4SWXLWKLcjs.getEntry; exports.getOrCreateMetadata = _chunk4SWXLWKLcjs.getOrCreateMetadata; exports.isLocationPrefix = _chunk4SWXLWKLcjs.isLocationPrefix; exports.isLoopIterationMarker = _chunk4SWXLWKLcjs.isLoopIterationMarker; exports.loadMetadata = _chunk4SWXLWKLcjs.loadMetadata; exports.loadStorage = _chunk4SWXLWKLcjs.loadStorage; exports.locationToKey = _chunk4SWXLWKLcjs.locationToKey; exports.locationsEqual = _chunk4SWXLWKLcjs.locationsEqual; exports.parentLocation = _chunk4SWXLWKLcjs.parentLocation; exports.registerName = _chunk4SWXLWKLcjs.registerName; exports.replayWorkflowFromStep = _chunk4SWXLWKLcjs.replayWorkflowFromStep; exports.resolveName = _chunk4SWXLWKLcjs.resolveName; exports.runWorkflow = _chunk4SWXLWKLcjs.runWorkflow; exports.setEntry = _chunk4SWXLWKLcjs.setEntry;
+exports.CancelledError = _chunkSFJQFMCWcjs.CancelledError; exports.CriticalError = _chunkSFJQFMCWcjs.CriticalError; exports.DEFAULT_LOOP_HISTORY_PRUNE_INTERVAL = _chunkSFJQFMCWcjs.DEFAULT_LOOP_HISTORY_PRUNE_INTERVAL; exports.DEFAULT_MAX_RETRIES = _chunkSFJQFMCWcjs.DEFAULT_MAX_RETRIES; exports.DEFAULT_RETRY_BACKOFF_BASE = _chunkSFJQFMCWcjs.DEFAULT_RETRY_BACKOFF_BASE; exports.DEFAULT_RETRY_BACKOFF_MAX = _chunkSFJQFMCWcjs.DEFAULT_RETRY_BACKOFF_MAX; exports.DEFAULT_STEP_TIMEOUT = _chunkSFJQFMCWcjs.DEFAULT_STEP_TIMEOUT; exports.EntryInProgressError = _chunkSFJQFMCWcjs.EntryInProgressError; exports.EvictedError = _chunkSFJQFMCWcjs.EvictedError; exports.HistoryDivergedError = _chunkSFJQFMCWcjs.HistoryDivergedError; exports.InMemoryDriver = InMemoryDriver; exports.JoinError = _chunkSFJQFMCWcjs.JoinError; exports.Loop = _chunkSFJQFMCWcjs.Loop; exports.MessageWaitError = _chunkSFJQFMCWcjs.MessageWaitError; exports.RaceError = _chunkSFJQFMCWcjs.RaceError; exports.RollbackCheckpointError = _chunkSFJQFMCWcjs.RollbackCheckpointError; exports.RollbackError = _chunkSFJQFMCWcjs.RollbackError; exports.SleepError = _chunkSFJQFMCWcjs.SleepError; exports.StepExhaustedError = _chunkSFJQFMCWcjs.StepExhaustedError; exports.StepFailedError = _chunkSFJQFMCWcjs.StepFailedError; exports.WorkflowContextImpl = _chunkSFJQFMCWcjs.WorkflowContextImpl; exports.appendLoopIteration = _chunkSFJQFMCWcjs.appendLoopIteration; exports.appendName = _chunkSFJQFMCWcjs.appendName; exports.createEntry = _chunkSFJQFMCWcjs.createEntry; exports.createHistorySnapshot = _chunkSFJQFMCWcjs.createHistorySnapshot; exports.createStorage = _chunkSFJQFMCWcjs.createStorage; exports.deleteEntriesWithPrefix = _chunkSFJQFMCWcjs.deleteEntriesWithPrefix; exports.emptyLocation = _chunkSFJQFMCWcjs.emptyLocation; exports.extractErrorInfo = _chunkSFJQFMCWcjs.extractErrorInfo; exports.flush = _chunkSFJQFMCWcjs.flush; exports.generateId = _chunkSFJQFMCWcjs.generateId; exports.getEntry = _chunkSFJQFMCWcjs.getEntry; exports.getOrCreateMetadata = _chunkSFJQFMCWcjs.getOrCreateMetadata; exports.isLocationPrefix = _chunkSFJQFMCWcjs.isLocationPrefix; exports.isLoopIterationMarker = _chunkSFJQFMCWcjs.isLoopIterationMarker; exports.loadMetadata = _chunkSFJQFMCWcjs.loadMetadata; exports.loadStorage = _chunkSFJQFMCWcjs.loadStorage; exports.locationToKey = _chunkSFJQFMCWcjs.locationToKey; exports.locationsEqual = _chunkSFJQFMCWcjs.locationsEqual; exports.parentLocation = _chunkSFJQFMCWcjs.parentLocation; exports.registerName = _chunkSFJQFMCWcjs.registerName; exports.replayWorkflowFromStep = _chunkSFJQFMCWcjs.replayWorkflowFromStep; exports.resolveName = _chunkSFJQFMCWcjs.resolveName; exports.runWorkflow = _chunkSFJQFMCWcjs.runWorkflow; exports.setEntry = _chunkSFJQFMCWcjs.setEntry;
 //# sourceMappingURL=testing.cjs.map

package/dist/tsup/testing.js

@@ -47,7 +47,7 @@ import {
   runWorkflow,
   setEntry,
   sleep
-} from "./chunk-UMFB2AR3.js";
+} from "./chunk-CIDHCIH7.js";
 
 // src/testing.ts
 var InMemoryWorkflowMessageDriver = class {

package/package.json

@@ -1,70 +1,70 @@
 {
-  "name": "@rivetkit/workflow-engine",
-  "version": "2.2.2-rc.1",
-  "description": "Durable workflow engine with reentrant execution",
-  "license": "Apache-2.0",
-  "keywords": [
-    "workflow",
-    "durable",
-    "reentrant",
-    "stateful"
-  ],
-  "files": [
-    "dist",
-    "src",
-    "schemas",
-    "package.json"
-  ],
-  "type": "module",
-  "exports": {
-    ".": {
-      "import": {
-        "types": "./dist/tsup/index.d.ts",
-        "default": "./dist/tsup/index.js"
-      },
-      "require": {
-        "types": "./dist/tsup/index.d.cts",
-        "default": "./dist/tsup/index.cjs"
-      }
-    },
-    "./testing": {
-      "import": {
-        "types": "./dist/tsup/testing.d.ts",
-        "default": "./dist/tsup/testing.js"
-      },
-      "require": {
-        "types": "./dist/tsup/testing.d.cts",
-        "default": "./dist/tsup/testing.cjs"
-      }
-    }
-  },
-  "engines": {
-    "node": ">=18.0.0"
-  },
-  "dependencies": {
-    "@rivetkit/bare-ts": "^0.6.2",
-    "cbor-x": "^1.6.0",
-    "fdb-tuple": "^1.0.0",
-    "pino": "^9.6.0",
-    "vbare": "^0.0.4"
-  },
-  "devDependencies": {
-    "@bare-ts/tools": "^0.13.0",
-    "commander": "^12.0.0",
-    "tsx": "^4.7.0",
-    "@biomejs/biome": "^2.2.3",
-    "@types/node": "^22.13.1",
-    "tsup": "^8.4.0",
-    "typescript": "^5.7.3",
-    "vitest": "^3.1.1"
-  },
-  "scripts": {
-    "build": "pnpm run compile:bare && tsup src/index.ts src/testing.ts",
-    "compile:bare": "tsx scripts/compile-bare.ts compile schemas/v1.bare -o dist/schemas/v1.ts",
-    "check-types": "tsc --noEmit",
-    "lint": "biome check .",
-    "lint:fix": "biome check --write .",
-    "test": "vitest run",
-    "test:watch": "vitest"
-  }
-}
+	"name": "@rivetkit/workflow-engine",
+	"version": "2.3.0-rc.10",
+	"description": "Durable workflow engine with reentrant execution",
+	"license": "Apache-2.0",
+	"keywords": [
+		"workflow",
+		"durable",
+		"reentrant",
+		"stateful"
+	],
+	"files": [
+		"dist",
+		"src",
+		"schemas",
+		"package.json"
+	],
+	"type": "module",
+	"exports": {
+		".": {
+			"import": {
+				"types": "./dist/tsup/index.d.ts",
+				"default": "./dist/tsup/index.js"
+			},
+			"require": {
+				"types": "./dist/tsup/index.d.cts",
+				"default": "./dist/tsup/index.cjs"
+			}
+		},
+		"./testing": {
+			"import": {
+				"types": "./dist/tsup/testing.d.ts",
+				"default": "./dist/tsup/testing.js"
+			},
+			"require": {
+				"types": "./dist/tsup/testing.d.cts",
+				"default": "./dist/tsup/testing.cjs"
+			}
+		}
+	},
+	"engines": {
+		"node": ">=18.0.0"
+	},
+	"scripts": {
+		"build": "pnpm run compile:bare && tsup src/index.ts src/testing.ts",
+		"compile:bare": "tsx scripts/compile-bare.ts compile schemas/v1.bare -o dist/schemas/v1.ts",
+		"check-types": "tsc --noEmit",
+		"lint": "biome check .",
+		"lint:fix": "biome check --write .",
+		"test": "vitest run",
+		"test:watch": "vitest"
+	},
+	"dependencies": {
+		"@rivetkit/bare-ts": "^0.6.2",
+		"cbor-x": "^1.6.0",
+		"fdb-tuple": "^1.0.0",
+		"pino": "^9.6.0",
+		"vbare": "^0.0.4"
+	},
+	"devDependencies": {
+		"@bare-ts/tools": "^0.13.0",
+		"commander": "^12.0.0",
+		"tsx": "^4.7.0",
+		"@biomejs/biome": "^2.2.3",
+		"@types/node": "^22.13.1",
+		"tsup": "^8.4.0",
+		"typescript": "^5.7.3",
+		"vitest": "^3.1.1"
+	}
+}

package/src/context.ts

@@ -954,15 +954,12 @@ export class WorkflowContextImpl implements WorkflowContextInterface {
 					willRetry: false,
 				});
 				throw markErrorReported(
-					attachTryStepFailure(
-						new CriticalError(error.message),
-						{
-							kind: "timeout",
-							stepName: config.name,
-							attempts: metadata.attempts,
-							error: extractErrorInfo(error),
-						},
-					),
+					attachTryStepFailure(new CriticalError(error.message), {
+						kind: "timeout",
+						stepName: config.name,
+						attempts: metadata.attempts,
+						error: extractErrorInfo(error),
+					}),
 				);
 			}
 
@@ -1224,8 +1221,12 @@ export class WorkflowContextImpl implements WorkflowContextInterface {
 		}
 
 		const historyPruneInterval =
-			config.historyPruneInterval ?? DEFAULT_LOOP_HISTORY_PRUNE_INTERVAL;
-		const historySize = config.historySize ?? historyPruneInterval;
+			config.historyPruneInterval ??
+			config.commitInterval ??
+			config.historyEvery ??
+			DEFAULT_LOOP_HISTORY_PRUNE_INTERVAL;
+		const historySize =
+			config.historySize ?? config.historyKeep ?? historyPruneInterval;
 
 		// Track the last iteration we pruned up to so we only delete
 		// newly-expired iterations instead of re-scanning from 0.

package/src/storage.ts

@@ -40,6 +40,9 @@ import type {
 	WorkflowHistorySnapshot,
 } from "./types.js";
 
+export const MAX_KV_BATCH_ENTRIES = 128;
+export const MAX_KV_BATCH_PAYLOAD_BYTES = 976 * 1024;
+
 /**
  * Create an empty storage instance.
  */
@@ -238,6 +241,8 @@ export async function flush(
 	pendingDeletions?: PendingDeletions,
 ): Promise<void> {
 	const writes: KVWrite[] = [];
+	const dirtyEntries: Entry[] = [];
+	const dirtyMetadata: EntryMetadata[] = [];
 	let historyUpdated = false;
 
 	// Flush only new names (those added since last flush)
@@ -263,7 +268,7 @@ export async function flush(
 				key: buildHistoryKey(entry.location),
 				value: serializeEntry(entry),
 			});
-			entry.dirty = false;
+			dirtyEntries.push(entry);
 			historyUpdated = true;
 		}
 	}
@@ -275,7 +280,7 @@ export async function flush(
 				key: buildEntryMetadataKey(id),
 				value: serializeEntryMetadata(metadata),
 			});
-			metadata.dirty = false;
+			dirtyMetadata.push(metadata);
 			historyUpdated = true;
 		}
 	}
@@ -313,7 +318,9 @@ export async function flush(
 	}
 
 	if (writes.length > 0) {
-		await driver.batch(writes);
+		for (const chunk of splitBatchWrites(writes)) {
+			await driver.batch(chunk);
+		}
 	}
 
 	// Apply pending deletions after the batch write. These are collected
@@ -336,6 +343,12 @@ export async function flush(
 	}
 
 	// Update flushed tracking after successful write
+	for (const entry of dirtyEntries) {
+		entry.dirty = false;
+	}
+	for (const metadata of dirtyMetadata) {
+		metadata.dirty = false;
+	}
 	storage.flushedNameCount = storage.nameRegistry.length;
 	storage.flushedState = storage.state;
 	storage.flushedOutput = storage.output;
@@ -346,6 +359,40 @@ export async function flush(
 	}
 }
 
+function splitBatchWrites(writes: KVWrite[]): KVWrite[][] {
+	const chunks: KVWrite[][] = [];
+	let chunk: KVWrite[] = [];
+	let chunkBytes = 0;
+
+	for (const write of writes) {
+		const writeBytes = write.key.byteLength + write.value.byteLength;
+		if (writeBytes > MAX_KV_BATCH_PAYLOAD_BYTES) {
+			throw new Error(
+				`KV batch write is ${writeBytes} bytes, exceeding the ${MAX_KV_BATCH_PAYLOAD_BYTES} byte limit`,
+			);
+		}
+
+		if (
+			chunk.length >= MAX_KV_BATCH_ENTRIES ||
+			(chunk.length > 0 &&
+				chunkBytes + writeBytes > MAX_KV_BATCH_PAYLOAD_BYTES)
+		) {
+			chunks.push(chunk);
+			chunk = [];
+			chunkBytes = 0;
+		}
+
+		chunk.push(write);
+		chunkBytes += writeBytes;
+	}
+
+	if (chunk.length > 0) {
+		chunks.push(chunk);
+	}
+
+	return chunks;
+}
+
 /**
  * Delete entries with a given location prefix (used for loop forgetting).
  * Also cleans up associated metadata from both memory and driver.

package/src/types.ts

@@ -422,11 +422,7 @@ export interface TryStepConfig<T> extends StepConfig<T> {
 	catch?: readonly TryStepCatchKind[];
 }
 
-export type TryBlockCatchKind =
-	| "step"
-	| "join"
-	| "race"
-	| "rollback";
+export type TryBlockCatchKind = "step" | "join" | "race" | "rollback";
 
 export interface TryBlockFailure {
 	source: "step" | "join" | "race" | "block";
@@ -473,6 +469,12 @@ export interface LoopConfig<S, T> {
 	historyPruneInterval?: number;
 	/** Number of past iterations to retain when pruning. Defaults to historyPruneInterval. */
 	historySize?: number;
+	/** @deprecated Use historyPruneInterval. */
+	commitInterval?: number;
+	/** @deprecated Use historyPruneInterval. */
+	historyEvery?: number;
+	/** @deprecated Use historySize. */
+	historyKeep?: number;
 }
 
 /**

package/LICENSE

@@ -1,203 +0,0 @@
-
-                                 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 2023 Rivet Gaming, Inc.
-
-   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.
-