textopt 0.0.0 → 0.1.0

package/dist/simba/index.d.mts

@@ -1,8 +1,8 @@
-import { n as Candidate, t as Adapter, u as TextModel } from "../types-CWv4IQFF.mjs";
+import { _ as TextModel, a as RunFinished, c as Adapter, i as Reporter, l as Candidate, n as OptimizerEvent, o as isCandidateAccepted, r as ReportableEvent, s as isRunFinished, t as CandidateAccepted, v as UsageTotals } from "../reporting-DQbAohc9.mjs";
 import { n as EvaluationCache, t as CachedScore } from "../cache-CuSo0NJ8.mjs";
 import { t as Rng } from "../rng-BR5MOedA.mjs";
-import { r as DemoRenderer } from "../demos-B0pVQjYC.mjs";
-import { n as OptimizerResult, r as OptimizerTask, s as EvaluationEvent, t as Optimizer } from "../optimizer-DqCoth_w.mjs";
+import { r as DemoRenderer } from "../demos-1b7JiUue.mjs";
+import { n as OptimizerResult, r as OptimizerTask, s as EvaluationEvent, t as Optimizer } from "../optimizer-Ck6-e_8o.mjs";
 import { t as BatchSampler } from "../sampling-DFo_7RNJ.mjs";
 //#region src/simba/advice.d.ts
 interface AdviceTrajectory<Output = unknown> {
@@ -13,6 +13,12 @@ interface AdviceTrajectory<Output = unknown> {
 interface AdvicePromptArgs<Datum = unknown, Output = unknown> {
   /** Components the advice is wanted for, named so each can be addressed. */
   components: readonly string[];
+  /**
+   * What each of those components currently says. Advice is appended to this
+   * text rather than replacing it, so a proposer that cannot see it writes
+   * blind: it restates what is already there, and cannot correct it.
+   */
+  current: Record<string, string>;
   input: Datum;
   /** The higher scoring run of this instance, when there is one to contrast. */
   better?: AdviceTrajectory<Output>;
@@ -56,6 +62,17 @@ interface SimbaConfig {
   minibatchSize?: number;
   /** Programs sampled per step, and candidates built from them. Default 6. */
   candidates?: number;
+  /**
+   * How many evaluations may be in flight at once. Default 1.
+   *
+   * Covers the two places a step's work is independent — scoring the
+   * candidates a step built, and sweeping the finalists at the end of the run
+   * — and nothing else. The trajectory samples and the mutations that read
+   * them are deliberately left in sequence: each of those reads state the one
+   * before it wrote, so overlapping them would make a seeded run depend on
+   * which call returned first.
+   */
+  concurrency?: number;
   /** Steps to run. Default 8. */
   maxSteps?: number;
   /** Demos a candidate may hold before the loop starts dropping them. Default 4. */
@@ -97,6 +114,8 @@ interface SimbaSnapshot {
   metricCalls: number;
   reflectionCalls: number;
   cacheHits: number;
+  /** Usage already spent, so a resumed run reports totals and honours ceilings. */
+  usage?: UsageTotals;
   rngState: number;
   sampler?: unknown;
   cache?: [string, CachedScore][];
@@ -121,7 +140,8 @@ interface SimbaTask<Datum, Trajectory = unknown, Output = unknown, K extends str
     index: number;
   }) => string;
   cache?: EvaluationCache | false;
-  onEvent?: (event: SimbaEvent<NoInfer<K>>) => void;
+  /** Observers of the run. Every one sees every event; none can fail it. */
+  reporters?: readonly Reporter<SimbaEvent<NoInfer<K>>>[];
   onCheckpoint?: (snapshot: SimbaSnapshot) => void | Promise<void>;
   resumeFrom?: SimbaSnapshot;
 }
@@ -143,17 +163,18 @@ type SimbaEvent<K extends string = string> = {
   /** The program it was mutated from; 0 is the seed. */
   sourceProgram: number;
   minibatchScore: number;
-} | {
+} | ({
+  type: "candidateAccepted";
+  /** The step whose winner this was. */
+  step: number;
+} & CandidateAccepted<K>) | {
   type: "error";
   step: number;
   err: unknown;
-} | {
+} | ({
   type: "finish";
   reason: SimbaStopReason;
-  bestScore: number;
-  metricCalls: number;
-  testScore?: number;
-};
+} & RunFinished);
 interface SimbaResult<K extends string = string, Output = unknown> extends OptimizerResult<K, SimbaStopReason, Output> {
   /** The seed's own validation score, so the lift the run bought is readable. */
   seedScore: number;
@@ -286,4 +307,4 @@ declare function evenlySpacedIndices(args: {
   count: number;
 }): number[];
 //#endregion
-export { type AdvicePromptArgs, type AdvicePromptBuilder, type AdviceTrajectory, type SimbaBucket, type SimbaConfig, type SimbaEvent, type SimbaFinalist, SimbaOptimizer, type SimbaResult, type SimbaRollout, type SimbaSample, type SimbaSnapshot, type SimbaStopReason, type SimbaStrategy, type SimbaTask, buildAdvicePrompt, buildBuckets, evenlySpacedIndices, parseAdvice, percentile, samplePoisson, softmaxWeights, topKPlusBaseline };
+export { type AdvicePromptArgs, type AdvicePromptBuilder, type AdviceTrajectory, type CandidateAccepted, type OptimizerEvent, type ReportableEvent, type Reporter, type RunFinished, type SimbaBucket, type SimbaConfig, type SimbaEvent, type SimbaFinalist, SimbaOptimizer, type SimbaResult, type SimbaRollout, type SimbaSample, type SimbaSnapshot, type SimbaStopReason, type SimbaStrategy, type SimbaTask, buildAdvicePrompt, buildBuckets, evenlySpacedIndices, isCandidateAccepted, isRunFinished, parseAdvice, percentile, samplePoisson, softmaxWeights, topKPlusBaseline };

package/dist/simba/index.mjs

@@ -1,5 +1,6 @@
-import { d as createMemoryCache, i as measuredMean, l as runFingerprint, n as costExhausted, o as createDeadline, p as createBudget, r as createEvaluator, s as assertResumable, t as BudgetExhausted, u as componentNames } from "../evaluation-BV0nSZVx.mjs";
-import { n as formatDemos, r as parseDemos } from "../demos-Degx6UmP.mjs";
+import { _ as createMemoryCache, a as isRunFinished, b as createBudget, c as createEvaluator, d as createDeadline, f as assertResumable, g as candidateHash, h as componentNames, i as isCandidateAccepted, l as measuredMean, m as runFingerprint, n as flushReporters, o as BudgetExhausted, r as instanceRow, s as costExhausted, t as createEmitter, v as defaultInstanceId } from "../reporting-DY-DC4HG.mjs";
+import { t as mapWithConcurrency } from "../concurrency-D58PWeSk.mjs";
+import { i as replaceDemos, r as parseDemos } from "../demos-DE2oxNWX.mjs";
 import { t as createSeededRng } from "../rng-Dtc5eZ_W.mjs";
 import { t as createEpochShuffledSampler } from "../sampling-CfHt7Gue.mjs";
 //#region src/simba/advice.ts
@@ -14,7 +15,7 @@ const ADVICE_BLOCK = /<advice\s+component="([^"]+)"\s*>([\s\S]*?)<\/advice>/g;
 * behaviour rather than to the instance being easier.
 */
 function buildAdvicePrompt(args) {
-	const { components, input, better, worse } = args;
+	const { components, current, input, better, worse } = args;
 	return [
 		"Two runs of the same system on the same input are shown below, with the reward each earned.",
 		"Your job is to write advice that would make the system behave like the higher scoring run the next time it sees a similar input.",
@@ -25,12 +26,18 @@ function buildAdvicePrompt(args) {
 		...worse === void 0 ? [] : trajectoryBlock("worse", worse),
 		...better === void 0 ? [] : trajectoryBlock("better", better),
 		"",
-		"Write advice for each of these components:",
+		"Write advice for each of these components, shown with what it says now:",
 		"",
 		"<components>",
-		components.join("\n"),
+		components.map((component) => [
+			`<component name="${component}">`,
+			current[component] ?? "",
+			"</component>"
+		].join("\n")).join("\n"),
 		"</components>",
 		"",
+		"Your advice is appended to what the component already says. Do not restate advice it already carries; add what is missing or correct what is wrong.",
+		"",
 		"The component will not have access to this example, so advice that only covers this input is wasted. State the general behaviour it should adopt, and be concrete about when it applies.",
 		"Address each component's own sub-task rather than the system as a whole.",
 		"Base the advice on what actually differed between the two runs. If nothing useful can be said for a component, leave it out.",
@@ -228,21 +235,28 @@ const DEMO_DROP_SCALE = 3;
 var SimbaOptimizer = class {
 	#config;
 	constructor(config = {}) {
+		assertSimbaConfig(config);
 		this.#config = config;
 	}
-	optimize(task) {
-		return run({
-			config: this.#config,
-			task
-		});
+	async optimize(task) {
+		try {
+			return await run({
+				config: this.#config,
+				task
+			});
+		} finally {
+			await flushReporters(task.reporters ?? []);
+		}
 	}
 };
 async function run(args) {
 	const { config, task } = args;
-	const { minibatchSize = DEFAULT_MINIBATCH_SIZE, candidates: candidateCount = DEFAULT_CANDIDATES, maxSteps = DEFAULT_MAX_STEPS, maxDemos = DEFAULT_MAX_DEMOS, samplingTemperature = DEFAULT_TEMPERATURE, candidateTemperature = DEFAULT_TEMPERATURE, strategies, maxReflectionCalls, seed = 0, trackBestOutputs = false, checkpointCache = true } = config;
-	const { seedCandidate, trainingSet, validationSet = trainingSet, testSet, adapter, reflect, demoComponents = [], instructionComponents, renderDemo, buildAdvicePrompt: buildPrompt = buildAdvicePrompt, sampler = createEpochShuffledSampler({ minibatchSize }), maxMetricCalls, cache, cacheNamespace, retry, maxCostUsd, maxWallClockMs, instanceId = defaultInstanceId, onEvent, onCheckpoint, resumeFrom, signal } = task;
+	const { minibatchSize = DEFAULT_MINIBATCH_SIZE, candidates: candidateCount = DEFAULT_CANDIDATES, concurrency = 1, maxSteps = DEFAULT_MAX_STEPS, maxDemos = DEFAULT_MAX_DEMOS, samplingTemperature = DEFAULT_TEMPERATURE, candidateTemperature = DEFAULT_TEMPERATURE, strategies, maxReflectionCalls, seed = 0, trackBestOutputs = false, checkpointCache = true } = config;
+	const { seedCandidate, trainingSet, validationSet = trainingSet, testSet, adapter, reflect, demoComponents = [], instructionComponents, renderDemo, buildAdvicePrompt: buildPrompt = buildAdvicePrompt, sampler = createEpochShuffledSampler({ minibatchSize }), maxMetricCalls, cache, cacheNamespace, retry, maxCostUsd, maxWallClockMs, instanceId = defaultInstanceId, reporters = [], onCheckpoint, resumeFrom, signal } = task;
+	const emit = createEmitter(reporters);
 	const components = componentNames(seedCandidate);
-	const ruleComponents = instructionComponents ?? components.filter((name) => !demoComponents.includes(name));
+	const nonDemo = components.filter((name) => !demoComponents.includes(name));
+	const ruleComponents = instructionComponents ?? (nonDemo.length > 0 ? nonDemo : components);
 	const enabled = strategies ?? (demoComponents.length > 0 ? ["appendDemo", "appendRule"] : ["appendRule"]);
 	if (trainingSet.length === 0) throw new Error("optimize requires a non-empty trainingSet");
 	if (validationSet.length === 0) throw new Error("optimize requires a non-empty validationSet");
@@ -251,6 +265,10 @@ async function run(args) {
 	if (enabled.includes("appendDemo") && demoComponents.length === 0) throw new Error("the appendDemo strategy requires at least one entry in demoComponents");
 	if (enabled.includes("appendRule") && ruleComponents.length === 0) throw new Error("the appendRule strategy requires at least one instruction component to write into");
 	if (testSet !== void 0 && testSet.length === 0) throw new Error("optimize requires a non-empty testSet when one is given; omit it to skip held-out evaluation");
+	const trainingIds = trainingSet.map((datum, index) => instanceId({
+		datum,
+		index
+	}));
 	const validationIds = validationSet.map((datum, index) => instanceId({
 		datum,
 		index
@@ -261,10 +279,7 @@ async function run(args) {
 	})) ?? [];
 	const fingerprint = runFingerprint({
 		seedCandidate,
-		trainingIds: trainingSet.map((datum, index) => instanceId({
-			datum,
-			index
-		})),
+		trainingIds,
 		validationIds,
 		seed,
 		...cacheNamespace === void 0 ? {} : { cacheNamespace }
@@ -288,8 +303,9 @@ async function run(args) {
 		...evaluationCache === void 0 ? {} : { cache: evaluationCache },
 		trackOutputs: true,
 		cacheHits: resumeFrom?.cacheHits ?? 0,
+		...resumeFrom?.usage === void 0 ? {} : { usage: resumeFrom.usage },
 		...signal === void 0 ? {} : { signal },
-		onEvaluation: (event) => onEvent?.({
+		onEvaluation: (event) => emit({
 			type: "evaluation",
 			...event
 		})
@@ -305,7 +321,7 @@ async function run(args) {
 	let step = resumeFrom?.step ?? 0;
 	let reflectionCalls = resumeFrom?.reflectionCalls ?? 0;
 	let stopReason = "maxSteps";
-	onEvent?.({
+	emit({
 		type: "start",
 		components,
 		validationSetSize: validationSet.length
@@ -340,16 +356,17 @@ async function run(args) {
 			scores: programs.map((_, index) => averageScore(index)),
 			k: candidateCount
 		});
-		onEvent?.({
+		emit({
 			type: "stepStart",
 			step,
 			poolSize: pool.length
 		});
-		const batch = sampler({
+		const batchIndices = sampler({
 			trainingSet,
 			iteration: step,
 			rng
-		}).map((index) => trainingSet[index]);
+		});
+		const batch = batchIndices.map((index) => trainingSet[index]);
 		const samples = [];
 		for (let slot = 0; slot < candidateCount; slot += 1) {
 			const programIndex = softmaxSample({
@@ -411,7 +428,7 @@ async function run(args) {
 					high
 				});
 			} catch (err) {
-				onEvent?.({
+				emit({
 					type: "error",
 					step,
 					err
@@ -426,36 +443,54 @@ async function run(args) {
 			});
 		}
 		let stepBest;
+		const batchIds = batchIndices.map((index) => trainingIds[index]);
+		const scheduled = [];
+		let owed = 0;
 		for (const entry of built) {
-			if (!budget.canAfford(batch.length)) {
+			if (!budget.canAfford(owed + batch.length)) {
 				stopReason = "budgetExhausted";
 				break;
 			}
-			let score;
-			try {
-				score = measuredMean(await evaluator.evaluate({
-					candidate: entry.candidate,
-					batch,
-					ids: batch.map((datum, index) => instanceId({
-						datum,
-						index
-					})),
-					split: "train",
-					phase: "minibatch",
-					candidateId: programs.length,
-					iteration: step
-				}));
-			} catch (err) {
-				if (err instanceof BudgetExhausted) {
-					stopReason = "budgetExhausted";
-					break;
+			owed += evaluator.countUncached({
+				candidate: entry.candidate,
+				ids: batchIds,
+				split: "train"
+			});
+			scheduled.push(entry);
+		}
+		const poolBase = programs.length;
+		const scored = await mapDistinct({
+			items: scheduled,
+			limit: concurrency,
+			key: (entry) => candidateHash(entry.candidate),
+			task: async (entry, index) => {
+				try {
+					return { score: measuredMean(await evaluator.evaluate({
+						candidate: entry.candidate,
+						batch,
+						ids: batchIds,
+						split: "train",
+						phase: "minibatch",
+						candidateId: poolBase + index,
+						iteration: step
+					})) };
+				} catch (err) {
+					if (err instanceof BudgetExhausted) return { stop: true };
+					throw err;
 				}
-				throw err;
 			}
+		});
+		for (const [index, outcome] of scored.entries()) {
+			if (outcome.stop === true) {
+				stopReason = "budgetExhausted";
+				break;
+			}
+			const { score } = outcome;
 			if (score === void 0) continue;
+			const entry = scheduled[index];
 			programs.push(entry.candidate);
 			programScores.push([score]);
-			onEvent?.({
+			emit({
 				type: "candidate",
 				step,
 				strategy: entry.strategy,
@@ -478,38 +513,78 @@ async function run(args) {
 		}
 	}
 	if (signal?.aborted) stopReason = "aborted";
-	const finalists = [];
+	const contenders = [];
+	let owedForFinalists = 0;
 	for (const index of evenlySpacedIndices({
 		length: winners.length,
 		count: candidateCount + 1
 	})) {
 		const winner = winners[index];
-		if (!budget.canAfford(evaluator.countUncached({
+		const uncached = evaluator.countUncached({
 			candidate: winner.candidate,
 			ids: validationIds,
 			split: "val"
-		}))) break;
-		let score;
-		try {
-			score = measuredMean(await evaluator.evaluate({
-				candidate: winner.candidate,
-				batch: validationSet,
-				ids: validationIds,
-				split: "val",
-				phase: index === 0 ? "seed" : "validation",
-				candidateId: index,
-				iteration: step
-			}));
-		} catch (err) {
-			if (err instanceof BudgetExhausted || signal?.aborted) break;
-			throw err;
-		}
-		if (score !== void 0) finalists.push({
+		});
+		if (!budget.canAfford(owedForFinalists + uncached)) break;
+		owedForFinalists += uncached;
+		contenders.push({
+			index,
 			candidate: winner.candidate,
-			score,
 			step: winner.step
 		});
 	}
+	const sweeps = await mapDistinct({
+		items: contenders,
+		limit: concurrency,
+		key: (contender) => candidateHash(contender.candidate),
+		task: async (contender) => {
+			if (signal?.aborted) return { stop: true };
+			try {
+				const evaluation = await evaluator.evaluate({
+					candidate: contender.candidate,
+					batch: validationSet,
+					ids: validationIds,
+					split: "val",
+					phase: contender.index === 0 ? "seed" : "validation",
+					candidateId: contender.index,
+					iteration: step
+				});
+				return {
+					score: measuredMean(evaluation),
+					evaluation
+				};
+			} catch (err) {
+				if (err instanceof BudgetExhausted || signal?.aborted) return { stop: true };
+				throw err;
+			}
+		}
+	});
+	const finalists = [];
+	let acceptedCandidates = -1;
+	let acceptedScore = Number.NEGATIVE_INFINITY;
+	for (const [position, outcome] of sweeps.entries()) {
+		if (outcome.stop === true) break;
+		if (outcome.score === void 0) continue;
+		const contender = contenders[position];
+		finalists.push({
+			candidate: contender.candidate,
+			score: outcome.score,
+			step: contender.step
+		});
+		if (outcome.score > acceptedScore) {
+			acceptedScore = outcome.score;
+			acceptedCandidates += 1;
+			emit({
+				type: "candidateAccepted",
+				step: contender.step,
+				candidateId: acceptedCandidates,
+				candidate: contender.candidate,
+				aggregateScore: outcome.score,
+				instanceScores: instanceRow(outcome.evaluation),
+				...trackBestOutputs ? { outputs: outcome.evaluation.outputs } : {}
+			});
+		}
+	}
 	const seedScore = finalists[0]?.score ?? 0;
 	finalists.sort((a, b) => b.score - a.score);
 	const best = finalists[0] ?? {
@@ -525,7 +600,7 @@ async function run(args) {
 		candidateId: null,
 		iteration: step
 	}))?.outputs;
-	const testScore = testSet === void 0 ? void 0 : measuredMean(await evaluator.evaluate({
+	const heldOut = testSet === void 0 ? void 0 : await evaluator.evaluate({
 		candidate: best.candidate,
 		batch: testSet,
 		ids: testIds,
@@ -534,13 +609,17 @@ async function run(args) {
 		candidateId: null,
 		iteration: step,
 		charge: false
-	}));
-	onEvent?.({
+	});
+	const testScore = heldOut === void 0 ? void 0 : measuredMean(heldOut);
+	emit({
 		type: "finish",
 		reason: stopReason,
+		bestCandidateId: acceptedCandidates,
 		bestScore: best.score,
 		metricCalls: budget.spent(),
-		...testScore === void 0 ? {} : { testScore }
+		...testScore === void 0 ? {} : { testScore },
+		...heldOut === void 0 ? {} : { testInstanceScores: instanceRow(heldOut) },
+		...heldOut === void 0 || !trackBestOutputs ? {} : { testOutputs: heldOut.outputs }
 	});
 	return {
 		bestCandidate: best.candidate,
@@ -556,7 +635,8 @@ async function run(args) {
 		...bestOutputs === void 0 ? {} : { bestOutputs },
 		...testScore === void 0 ? {} : {
 			testScore,
-			testMetricCalls: testSet?.length ?? 0
+			testMetricCalls: evaluator.unchargedCalls(),
+			testUsage: evaluator.unchargedUsage()
 		},
 		stopReason
 	};
@@ -593,7 +673,11 @@ async function run(args) {
 		const drops = /* @__PURE__ */ new Set();
 		for (let draw = 0; draw < Math.min(wanted, held); draw += 1) drops.add(rng.nextInt(held));
 		const next = { ...candidate };
-		for (const [name, demos] of blocks) next[name] = formatDemos(demos.filter((_, index) => !drops.has(index)), renderDemo === void 0 ? {} : { render: renderDemo });
+		for (const [name, demos] of blocks) next[name] = replaceDemos({
+			text: next[name] ?? "",
+			demos: demos.filter((_, index) => !drops.has(index)),
+			...renderDemo === void 0 ? {} : { render: renderDemo }
+		});
 		return next;
 	}
 	/**
@@ -614,8 +698,12 @@ async function run(args) {
 		};
 		const next = { ...candidate };
 		for (const name of demoComponents) {
-			const kept = parseDemos(next[name] ?? "");
-			next[name] = formatDemos([...kept, demo], renderDemo === void 0 ? {} : { render: renderDemo });
+			const text = next[name] ?? "";
+			next[name] = replaceDemos({
+				text,
+				demos: [...parseDemos(text), demo],
+				...renderDemo === void 0 ? {} : { render: renderDemo }
+			});
 		}
 		return next;
 	}
@@ -643,6 +731,7 @@ async function run(args) {
 		const response = await reflect({
 			prompt: buildPrompt({
 				components: ruleComponents,
+				current: Object.fromEntries(ruleComponents.map((name) => [name, candidate[name] ?? ""])),
 				input: bucket.datum,
 				...better === void 0 ? {} : { better },
 				...worse === void 0 ? {} : { worse }
@@ -683,6 +772,7 @@ async function run(args) {
 			metricCalls: budget.spent(),
 			reflectionCalls,
 			cacheHits: evaluator.cacheHits(),
+			usage: evaluator.usage(),
 			rngState: rng.state(),
 			...sampler.state === void 0 ? {} : { sampler: sampler.state() },
 			...cached === void 0 ? {} : { cache: cached }
@@ -693,8 +783,43 @@ async function run(args) {
 		await onCheckpoint(takeSnapshot(completed));
 	}
 }
-function defaultInstanceId(args) {
-	return String(args.index);
+/**
+* Runs `items` concurrently, except that items sharing a key run one after the
+* other.
+*
+* Two identical candidates cost one evaluation and one cache hit when they are
+* scored in sequence, and two evaluations when they overlap: the cache is only
+* written once a rollout returns. Serializing the duplicates is what keeps a
+* fan-out from buying a second copy of a score the run has already paid for.
+*/
+async function mapDistinct(args) {
+	const { items, limit, key, task } = args;
+	const groups = /* @__PURE__ */ new Map();
+	items.forEach((item, index) => {
+		const group = groups.get(key(item));
+		if (group === void 0) {
+			groups.set(key(item), [index]);
+			return;
+		}
+		group.push(index);
+	});
+	const results = new Array(items.length);
+	await mapWithConcurrency({
+		items: [...groups.values()],
+		limit,
+		task: async (indices) => {
+			for (const index of indices) results[index] = await task(items[index], index);
+		}
+	});
+	return results;
+}
+/**
+* Range checks on the search knobs, run at construction so a configuration
+* that could never terminate is refused before a task is ever handed to it.
+*/
+function assertSimbaConfig(config) {
+	const { concurrency = 1 } = config;
+	if (!Number.isInteger(concurrency) || concurrency < 1) throw new Error(`concurrency must be a positive integer, received ${concurrency}`);
 }
 //#endregion
-export { SimbaOptimizer, buildAdvicePrompt, buildBuckets, evenlySpacedIndices, parseAdvice, percentile, samplePoisson, softmaxWeights, topKPlusBaseline };
+export { SimbaOptimizer, buildAdvicePrompt, buildBuckets, evenlySpacedIndices, isCandidateAccepted, isRunFinished, parseAdvice, percentile, samplePoisson, softmaxWeights, topKPlusBaseline };

package/dist/testing.cjs

@@ -147,6 +147,7 @@ function extractMissingTerms(prompt) {
 }
 //#endregion
 exports.KEYWORD_EXAMPLES = KEYWORD_EXAMPLES;
+exports.SAMPLING_POOL = SAMPLING_POOL;
 exports.buildReflectionPrompt = require_reflection.buildReflectionPrompt;
 exports.createDegradingReflector = createDegradingReflector;
 exports.createHillClimbingReflector = createHillClimbingReflector;

package/dist/testing.d.cts

@@ -1,5 +1,5 @@
-import { u as TextModel } from "./types-CWv4IQFF.cjs";
-import { i as buildReflectionPrompt, m as GepaAdapter } from "./reflection-CQToe-5B.cjs";
+import { _ as TextModel } from "./reporting-DQbAohc9.cjs";
+import { i as buildReflectionPrompt, m as GepaAdapter } from "./reflection-Dt3QrXhM.cjs";
 //#region src/testing.d.ts
 /**
  * A deterministic, LLM-free system under optimization.
@@ -20,6 +20,8 @@ interface KeywordTrajectory {
   missing: string[];
 }
 declare const KEYWORD_EXAMPLES: KeywordExample[];
+/** Terms the keyword metric rewards, interleaved with terms it ignores. */
+declare const SAMPLING_POOL: string[];
 declare function createKeywordAdapter(): GepaAdapter<KeywordExample, KeywordTrajectory, string>;
 /**
  * A deterministic stand-in for a reflection model: it reads the feedback in the
@@ -50,4 +52,4 @@ declare function createHillClimbingReflector(args?: {
 /** A reflection model that always proposes something strictly worse. */
 declare function createDegradingReflector(): TextModel;
 //#endregion
-export { KEYWORD_EXAMPLES, KeywordExample, KeywordTrajectory, buildReflectionPrompt, createDegradingReflector, createHillClimbingReflector, createKeywordAdapter, createKeywordReflector, createSamplingReflector };
+export { KEYWORD_EXAMPLES, KeywordExample, KeywordTrajectory, SAMPLING_POOL, buildReflectionPrompt, createDegradingReflector, createHillClimbingReflector, createKeywordAdapter, createKeywordReflector, createSamplingReflector };

package/dist/testing.d.mts

@@ -1,5 +1,5 @@
-import { u as TextModel } from "./types-CWv4IQFF.mjs";
-import { i as buildReflectionPrompt, m as GepaAdapter } from "./reflection-Cr_upzU0.mjs";
+import { _ as TextModel } from "./reporting-DQbAohc9.mjs";
+import { i as buildReflectionPrompt, m as GepaAdapter } from "./reflection-LRaAZP4e.mjs";
 //#region src/testing.d.ts
 /**
  * A deterministic, LLM-free system under optimization.
@@ -20,6 +20,8 @@ interface KeywordTrajectory {
   missing: string[];
 }
 declare const KEYWORD_EXAMPLES: KeywordExample[];
+/** Terms the keyword metric rewards, interleaved with terms it ignores. */
+declare const SAMPLING_POOL: string[];
 declare function createKeywordAdapter(): GepaAdapter<KeywordExample, KeywordTrajectory, string>;
 /**
  * A deterministic stand-in for a reflection model: it reads the feedback in the
@@ -50,4 +52,4 @@ declare function createHillClimbingReflector(args?: {
 /** A reflection model that always proposes something strictly worse. */
 declare function createDegradingReflector(): TextModel;
 //#endregion
-export { KEYWORD_EXAMPLES, KeywordExample, KeywordTrajectory, buildReflectionPrompt, createDegradingReflector, createHillClimbingReflector, createKeywordAdapter, createKeywordReflector, createSamplingReflector };
+export { KEYWORD_EXAMPLES, KeywordExample, KeywordTrajectory, SAMPLING_POOL, buildReflectionPrompt, createDegradingReflector, createHillClimbingReflector, createKeywordAdapter, createKeywordReflector, createSamplingReflector };

package/dist/testing.mjs

@@ -145,4 +145,4 @@ function extractMissingTerms(prompt) {
 	return [...terms];
 }
 //#endregion
-export { KEYWORD_EXAMPLES, buildReflectionPrompt, createDegradingReflector, createHillClimbingReflector, createKeywordAdapter, createKeywordReflector, createSamplingReflector };
+export { KEYWORD_EXAMPLES, SAMPLING_POOL, buildReflectionPrompt, createDegradingReflector, createHillClimbingReflector, createKeywordAdapter, createKeywordReflector, createSamplingReflector };

package/package.json

@@ -1,10 +1,11 @@
 {
   "name": "textopt",
-  "version": "0.0.0",
-  "description": "Prompt optimization for TypeScript, with GEPA, OPRO, MIPRO, and random search behind a shared interface",
+  "version": "0.1.0",
+  "description": "Prompt optimization for TypeScript, with GEPA, SIMBA, OPRO, MIPRO, bootstrapped few-shot search, and random search behind a shared interface",
   "keywords": [
     "prompt-optimization",
     "gepa",
+    "simba",
     "mipro",
     "opro",
     "llm",
@@ -25,7 +26,7 @@
   "type": "module",
   "sideEffects": false,
   "engines": {
-    "node": ">=20"
+    "node": ">=22"
   },
   "publishConfig": {
     "access": "public"