@synode/core 1.0.0

package/dist/engine-CgLY6SKJ.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine-CgLY6SKJ.cjs","names":["lines: string[]","bestMatch: string | undefined","parts: string[]","defaultIdGenerator: IdGenerator","idGenerator: IdGenerator","allLocales","Faker","keysToDelete: string[]","dataset: Dataset<TRow>","attributes: Record<string, unknown>","rows: DatasetRow[]","row: DatasetRow","journey: Journey","events: Event[]"],"sources":["../src/errors.ts","../src/state/ids.ts","../src/state/context.ts","../src/generators/persona.ts","../src/generators/dataset.ts","../src/monitoring/timing.ts","../src/execution/engine.ts"],"sourcesContent":["/**\n * Error codes for all Synode validation and runtime errors.\n */\nexport type ErrorCode =\n  | 'INVALID_BOUNCE_CHANCE'\n  | 'INVALID_TIME_SPAN'\n  | 'INVALID_SUPPRESSION_PERIOD'\n  | 'UNKNOWN_JOURNEY_REF'\n  | 'CIRCULAR_DEPENDENCY'\n  | 'DUPLICATE_ID'\n  | 'DATASET_NOT_FOUND'\n  | 'DATASET_EMPTY'\n  | 'HANDLER_ERROR'\n  | 'ADAPTER_WRITE_ERROR'\n  | 'INVALID_HANDLER_RETURN'\n  | 'TYPO_DETECTED'\n  | 'INVALID_DATASET_COUNT';\n\n/**\n * Options for constructing a SynodeError.\n *\n * @param code - The structured error code identifying the error type\n * @param message - The human-readable error message\n * @param path - Hierarchical path segments (journey, adventure, action, step)\n * @param suggestion - Optional suggestion for fixing the error\n * @param expected - Optional description of the expected value\n * @param received - Optional description of the actual value received\n * @param cause - Optional underlying error that caused this one\n */\nexport interface SynodeErrorOptions {\n  code: ErrorCode;\n  message: string;\n  path: string[];\n  suggestion?: string;\n  expected?: string;\n  received?: string;\n  cause?: unknown;\n}\n\nconst PATH_LABELS = ['Journey', 'Adventure', 'Action', 'Step'] as const;\n\n/**\n * Formats an error message with a hierarchical path prefix and optional suggestion.\n *\n * @param message - The base error message\n * @param path - Hierarchical path segments labeled Journey/Adventure/Action/Step\n * @param suggestion - Optional suggestion appended on a new line\n * @returns The formatted message string\n */\nexport function formatErrorMessage(message: string, path: string[], suggestion?: string): string {\n  let formatted = message;\n\n  if (path.length > 0) {\n    const segments = path.map(\n      (segment, i) => `${PATH_LABELS[Math.min(i, PATH_LABELS.length - 1)]} \"${segment}\"`,\n    );\n    formatted = `[${segments.join(' > ')}] ${message}`;\n  }\n\n  if (suggestion) {\n    formatted += `\\n${suggestion}`;\n  }\n\n  return formatted;\n}\n\n/**\n * Structured error class for all Synode validation and runtime errors.\n *\n * @example\n * ```typescript\n * throw new SynodeError({\n *   code: 'INVALID_BOUNCE_CHANCE',\n *   message: 'Bounce chance must be between 0 and 1',\n *   path: ['Purchase Flow', 'Checkout', 'Submit Order'],\n *   expected: 'number between 0 and 1',\n *   received: '1.5',\n * });\n * ```\n */\nexport class SynodeError extends Error {\n  /** Structured error code identifying the error type. */\n  readonly code: ErrorCode;\n\n  /** Hierarchical path where the error occurred. */\n  readonly path: string[];\n\n  /** Optional suggestion for fixing the error. */\n  readonly suggestion: string | undefined;\n\n  /** The original unformatted error message. */\n  readonly rawMessage: string;\n\n  /** Optional description of the expected value. */\n  readonly expected: string | undefined;\n\n  /** Optional description of the actual value received. */\n  readonly received: string | undefined;\n\n  constructor(options: SynodeErrorOptions) {\n    const formatted = formatErrorMessage(options.message, options.path, options.suggestion);\n    super(formatted, { cause: options.cause });\n    this.name = 'SynodeError';\n    this.code = options.code;\n    this.path = options.path;\n    this.suggestion = options.suggestion;\n    this.rawMessage = options.message;\n    this.expected = options.expected;\n    this.received = options.received;\n  }\n\n  /**\n   * Produces a structured multi-line representation of the error for human-readable output.\n   *\n   * Format:\n   * ```\n   * [ERROR_CODE] rawMessage\n   *   Path: Journey 'x' > Adventure 'y' > Action 'z'\n   *   Expected: what was expected\n   *   Received: what was provided\n   *   Fix: suggestion\n   * ```\n   *\n   * Path is omitted when path is empty. Expected/Received are omitted when not provided.\n   * Fix is omitted when there is no suggestion.\n   *\n   * @returns A formatted string representation of the error.\n   */\n  format(): string {\n    const lines: string[] = [`[${this.code}] ${this.rawMessage}`];\n\n    if (this.path.length > 0) {\n      const segments = this.path.map(\n        (segment, i) => `${PATH_LABELS[Math.min(i, PATH_LABELS.length - 1)]} '${segment}'`,\n      );\n      lines.push(`  Path: ${segments.join(' > ')}`);\n    }\n\n    if (this.expected !== undefined) {\n      lines.push(`  Expected: ${this.expected}`);\n    }\n\n    if (this.received !== undefined) {\n      lines.push(`  Received: ${this.received}`);\n    }\n\n    if (this.suggestion) {\n      lines.push(`  Fix: ${this.suggestion}`);\n    }\n\n    return lines.join('\\n');\n  }\n}\n\n/**\n * Computes the Levenshtein edit distance between two strings using a space-efficient\n * two-row approach.\n *\n * @param a - First string\n * @param b - Second string\n * @returns The minimum number of single-character edits (insertions, deletions, substitutions)\n */\nexport function levenshtein(a: string, b: string): number {\n  if (a === b) return 0;\n  if (a.length === 0) return b.length;\n  if (b.length === 0) return a.length;\n\n  // Two-row approach: only keep previous and current rows\n  let prev = new Array<number>(b.length + 1);\n  let curr = new Array<number>(b.length + 1);\n\n  for (let j = 0; j <= b.length; j++) {\n    prev[j] = j;\n  }\n\n  for (let i = 1; i <= a.length; i++) {\n    curr[0] = i;\n    for (let j = 1; j <= b.length; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      curr[j] = Math.min(\n        prev[j] + 1, // deletion\n        curr[j - 1] + 1, // insertion\n        prev[j - 1] + cost, // substitution\n      );\n    }\n    [prev, curr] = [curr, prev];\n  }\n\n  return prev[b.length];\n}\n\n/**\n * Finds the closest matching string from a list of candidates using Levenshtein distance.\n * Returns undefined if no candidate is within the dynamic threshold.\n *\n * The threshold is `max(3, floor(maxLen * 0.4))` where maxLen is the longer of the\n * input and candidate strings.\n *\n * @param input - The string to match against candidates\n * @param candidates - List of valid strings to compare against\n * @returns The closest matching candidate, or undefined if none is close enough\n */\nexport function suggestClosest(input: string, candidates: string[]): string | undefined {\n  if (candidates.length === 0) return undefined;\n\n  let bestMatch: string | undefined;\n  let bestDistance = Infinity;\n\n  for (const candidate of candidates) {\n    const distance = levenshtein(input, candidate);\n    const maxLen = Math.max(input.length, candidate.length);\n    const threshold = Math.max(3, Math.floor(maxLen * 0.4));\n\n    if (distance <= threshold && distance < bestDistance) {\n      bestDistance = distance;\n      bestMatch = candidate;\n    }\n  }\n\n  return bestMatch;\n}\n\n/**\n * Builds a human-readable suggestion string for a not-found error, including\n * the closest match (if any) and the full list of available options.\n *\n * @param kind - The kind of entity (e.g., \"dataset\", \"journey\")\n * @param requested - The name that was requested but not found\n * @param available - List of valid names\n * @returns A suggestion string with \"Did you mean...\" and/or available options\n */\nexport function buildNotFoundSuggestion(\n  kind: string,\n  requested: string,\n  available: string[],\n): string {\n  const closest = suggestClosest(requested, available);\n  const parts: string[] = [];\n\n  if (closest) {\n    parts.push(`Did you mean '${closest}'?`);\n  }\n\n  parts.push(`Available ${kind}s: [${available.join(', ')}]`);\n\n  return parts.join(' ');\n}\n","/**\n * Interface for ID generation strategies.\n */\nexport interface IdGenerator {\n  generate(prefix?: string): string;\n}\n\n/**\n * Default ID generator using crypto.randomUUID.\n */\nexport const defaultIdGenerator: IdGenerator = {\n  generate(prefix?: string) {\n    const uuid = crypto.randomUUID();\n    return prefix ? `${prefix}_${uuid}` : uuid;\n  },\n};\n","import { Faker, allLocales } from '@faker-js/faker';\nimport {\n  Context,\n  Dataset,\n  DatasetHandle,\n  DatasetRow,\n  ContextScope,\n  ContextSetOptions,\n} from '../types.js';\nimport { SynodeError, buildNotFoundSuggestion } from '../errors.js';\nimport { IdGenerator, defaultIdGenerator } from './ids.js';\n\n/**\n * Internal metadata for scoped context fields.\n */\ninterface FieldMetadata {\n  scope?: ContextScope;\n}\n\nexport class SynodeContext implements Context {\n  private state = new Map<string, unknown>();\n  private fieldMetadata = new Map<string, FieldMetadata>();\n  private currentTime: Date;\n  private _userId: string;\n  private _sessionId: string;\n  private _faker: Faker;\n  private completedJourneys = new Set<string>();\n  private datasets = new Map<string, Dataset>();\n\n  constructor(\n    startTime: Date = new Date(),\n    private idGenerator: IdGenerator = defaultIdGenerator,\n    public readonly locale = 'en',\n  ) {\n    this.currentTime = new Date(startTime);\n    this._userId = idGenerator.generate('user');\n    this._sessionId = idGenerator.generate('session');\n\n    // Initialize localized faker\n    const localeDef = allLocales[locale as keyof typeof allLocales];\n    this._faker = new Faker({ locale: localeDef });\n  }\n\n  get faker(): Faker {\n    return this._faker;\n  }\n\n  get userId(): string {\n    return this._userId;\n  }\n\n  get sessionId(): string {\n    return this._sessionId;\n  }\n\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-parameters\n  get<T>(key: string): T | undefined {\n    return this.state.get(key) as T | undefined;\n  }\n\n  /**\n   * Set a context field value with optional scope for automatic cleanup.\n   *\n   * @param key - The field name\n   * @param value - The field value\n   * @param options - Optional settings including lifecycle scope\n   *\n   * @remarks\n   * When calling `set()` multiple times on the same field with different scopes,\n   * the most recent scope setting will be used. For example, if a field is first\n   * set with `scope: 'adventure'` and later set again with `scope: 'action'`,\n   * it will be cleared at the end of the action rather than the adventure.\n   *\n   * @example\n   * ```typescript\n   * ctx.set('cartItems', [], { scope: 'adventure' });\n   * // Later in the same adventure...\n   * ctx.set('cartItems', ['item1'], { scope: 'action' }); // Now scoped to action\n   * ```\n   */\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-parameters\n  set<T>(key: string, value: T, options?: ContextSetOptions): void {\n    this.state.set(key, value);\n    if (options?.scope) {\n      this.fieldMetadata.set(key, { scope: options.scope });\n    } else {\n      // If no scope is set, remove any existing metadata\n      this.fieldMetadata.delete(key);\n    }\n  }\n\n  now(): Date {\n    return new Date(this.currentTime);\n  }\n\n  generateId(prefix?: string): string {\n    return this.idGenerator.generate(prefix);\n  }\n\n  hasCompletedJourney(journeyId: string): boolean {\n    return this.completedJourneys.has(journeyId);\n  }\n\n  markJourneyComplete(journeyId: string): void {\n    this.completedJourneys.add(journeyId);\n  }\n\n  dataset(id: string): DatasetHandle {\n    const ds = this.datasets.get(id);\n    if (!ds) {\n      const available = [...this.datasets.keys()];\n      const suggestion =\n        available.length > 0 ? buildNotFoundSuggestion('dataset', id, available) : undefined;\n      throw new SynodeError({\n        code: 'DATASET_NOT_FOUND',\n        message: `Dataset '${id}' not found in context`,\n        path: [],\n        suggestion,\n      });\n    }\n    return new DatasetHandleImpl(ds);\n  }\n\n  typedDataset<TRow extends DatasetRow>(id: string): DatasetHandle<TRow> {\n    const ds = this.datasets.get(id);\n    if (!ds) {\n      const available = [...this.datasets.keys()];\n      const suggestion =\n        available.length > 0 ? buildNotFoundSuggestion('dataset', id, available) : undefined;\n      throw new SynodeError({\n        code: 'DATASET_NOT_FOUND',\n        message: `Dataset '${id}' not found in context`,\n        path: [],\n        suggestion,\n      });\n    }\n    return new DatasetHandleImpl<TRow>(ds as Dataset<TRow>);\n  }\n\n  /**\n   * Internal: Register a dataset for use in this context.\n   */\n  registerDataset(dataset: Dataset): void {\n    this.datasets.set(dataset.id, dataset);\n  }\n\n  /**\n   * Internal: Advance the simulation time.\n   */\n  advanceTime(ms: number): void {\n    this.currentTime = new Date(this.currentTime.getTime() + ms);\n  }\n\n  /**\n   * Internal: Rotate the session ID.\n   */\n  rotateSession(): void {\n    this._sessionId = this.idGenerator.generate('session');\n  }\n\n  /**\n   * Internal: Clear all fields with the specified scope.\n   * Called by the engine when a scope ends.\n   */\n  clearScope(scope: ContextScope): void {\n    const keysToDelete: string[] = [];\n    for (const [key, metadata] of this.fieldMetadata.entries()) {\n      if (metadata.scope === scope) {\n        keysToDelete.push(key);\n      }\n    }\n    for (const key of keysToDelete) {\n      this.state.delete(key);\n      this.fieldMetadata.delete(key);\n    }\n  }\n}\n\n/**\n * Internal implementation of DatasetHandle.\n */\nclass DatasetHandleImpl<TRow extends DatasetRow = DatasetRow> implements DatasetHandle<TRow> {\n  constructor(private dataset: Dataset<TRow>) {}\n\n  randomRow(): TRow {\n    if (this.dataset.rows.length === 0) {\n      throw new Error(`Dataset '${this.dataset.id}' is empty.`);\n    }\n    const index = Math.floor(Math.random() * this.dataset.rows.length);\n    return this.dataset.rows[index];\n  }\n\n  getRowById(id: string | number): TRow | undefined {\n    // Find row by searching all fields for a matching value\n    return this.dataset.rows.find((row) => {\n      for (const key of Object.keys(row)) {\n        if ((row as Record<string, unknown>)[key] === id) {\n          return true;\n        }\n      }\n      return false;\n    });\n  }\n\n  getRowByIndex(index: number): TRow | undefined {\n    return this.dataset.rows[index];\n  }\n\n  getAllRows(): TRow[] {\n    return [...this.dataset.rows];\n  }\n\n  size(): number {\n    return this.dataset.rows.length;\n  }\n}\n","import { Context, FieldGenerator } from '../types.js';\n\n/**\n * Configuration for a user persona.\n */\nexport interface PersonaDefinition {\n  id: string;\n  name: string;\n  /**\n   * Attributes to initialize in the user's context.\n   * Can include 'locale' to set the faker locale.\n   */\n  attributes: Record<string, FieldGenerator>;\n}\n\n/**\n * Represents an instantiated persona.\n */\nexport interface Persona {\n  id: string;\n  name: string;\n  attributes: Record<string, unknown>;\n}\n\n/**\n * Defines a new persona.\n */\nexport function definePersona(config: PersonaDefinition): PersonaDefinition {\n  return config;\n}\n\n/**\n * Generates a concrete persona instance from a definition.\n * This resolves all dynamic fields and weighted distributions.\n */\nexport async function generatePersona(\n  definition: PersonaDefinition,\n  baseContext: Context,\n): Promise<Persona> {\n  const attributes: Record<string, unknown> = {};\n\n  for (const [key, generator] of Object.entries(definition.attributes)) {\n    if (typeof generator === 'function') {\n      // Execute generator with base context (which might have default locale)\n      const genFn = generator as (\n        context: Context,\n        payload: Record<string, unknown>,\n      ) => Promise<unknown>;\n      attributes[key] = await genFn(baseContext, attributes);\n    } else {\n      attributes[key] = generator;\n    }\n  }\n\n  return {\n    id: definition.id,\n    name: definition.name,\n    attributes,\n  };\n}\n","import { Dataset, DatasetDefinition, DatasetRow, Context } from '../types.js';\n\n/**\n * Defines a new dataset with type inference support.\n *\n * @example\n * ```typescript\n * const products = defineDataset({\n *   id: 'products',\n *   name: 'Products',\n *   count: 100,\n *   fields: {\n *     id: (ctx, row) => `prod-${row.index}`,\n *     name: (ctx) => ctx.faker.commerce.productName(),\n *     price: (ctx) => ctx.faker.number.float({ min: 10, max: 500 }),\n *   },\n * });\n *\n * // Type inference works automatically\n * type Product = InferDatasetRow<typeof products>;\n * ```\n */\nexport function defineDataset<TFields extends Record<string, unknown>>(\n  config: DatasetDefinition<TFields>,\n): DatasetDefinition<TFields> {\n  return config;\n}\n\n/**\n * Generates a concrete dataset from a definition.\n * @param definition The dataset definition.\n * @param context Context providing access to faker, other datasets, and user data.\n */\nexport async function generateDataset<TFields extends Record<string, unknown>>(\n  definition: DatasetDefinition<TFields>,\n  context: Context,\n): Promise<Dataset> {\n  if (!Number.isFinite(definition.count) || definition.count < 0 || definition.count > 10_000_000) {\n    throw new Error(\n      `Dataset '${definition.id}' count must be a finite number between 0 and 10,000,000, got ${String(definition.count)}`,\n    );\n  }\n\n  const rows: DatasetRow[] = [];\n\n  for (let index = 0; index < definition.count; index++) {\n    const row: DatasetRow = {};\n\n    for (const [key, generator] of Object.entries(definition.fields)) {\n      if (typeof generator === 'function') {\n        // Execute generator with context and row metadata\n        const genFn = generator as (\n          context: Context,\n          rowMeta: { index: number; data: DatasetRow },\n        ) => Promise<unknown>;\n        row[key] = await genFn(context, { index, data: row });\n      } else {\n        // Use static value\n        row[key] = generator;\n      }\n    }\n\n    rows.push(row);\n  }\n\n  return {\n    id: definition.id,\n    name: definition.name,\n    rows,\n  };\n}\n","import { TimeSpan } from '../types.js';\n\n/**\n * Generates a delay in milliseconds based on a time span configuration.\n */\nexport function generateDelay(timeSpan: TimeSpan): number {\n  const { min, max, distribution = 'uniform' } = timeSpan;\n\n  switch (distribution) {\n    case 'uniform':\n      return min + Math.random() * (max - min);\n\n    case 'gaussian': {\n      // Box-Muller transform for Gaussian distribution\n      const mean = (min + max) / 2;\n      const stdDev = (max - min) / 6; // 99.7% within range\n      const u1 = Math.random();\n      const u2 = Math.random();\n      const z0 = Math.sqrt(-2.0 * Math.log(u1)) * Math.cos(2.0 * Math.PI * u2);\n      const value = mean + z0 * stdDev;\n      // Clamp to min/max\n      return Math.max(min, Math.min(max, value));\n    }\n\n    case 'exponential': {\n      // Exponential distribution (more shorter delays, fewer long delays)\n      const lambda = 1 / (max - min);\n      const value = min - Math.log(1 - Math.random()) / lambda;\n      return Math.min(max, value);\n    }\n\n    default:\n      return min + Math.random() * (max - min);\n  }\n}\n\n/**\n * Checks if a bounce should occur based on probability.\n */\nexport function shouldBounce(bounceChance?: number): boolean {\n  if (!bounceChance) return false;\n  return Math.random() < bounceChance;\n}\n","import { Journey, Event } from '../types.js';\nimport { SynodeContext } from '../state/context.js';\nimport { SynodeError } from '../errors.js';\nimport { generateDelay, shouldBounce } from '../monitoring/timing.js';\n\nexport class Engine {\n  constructor(private journey: Journey) {}\n\n  /**\n   * Executes the journey and yields events.\n   * @param context Optional context to use. If not provided, a new one is created.\n   */\n  async *run(context?: SynodeContext): AsyncGenerator<Event> {\n    // Initialize context for this run (user) if not provided\n    const ctx = context ?? new SynodeContext();\n\n    // Rotate session ID for this journey run\n    ctx.rotateSession();\n\n    // Check journey prerequisites\n    if (this.journey.requires) {\n      for (const requiredJourneyId of this.journey.requires) {\n        if (!ctx.hasCompletedJourney(requiredJourneyId)) {\n          // Prerequisites not met, skip this journey\n          return;\n        }\n      }\n    }\n\n    // Check if journey should bounce before starting\n    if (shouldBounce(this.journey.bounceChance)) {\n      // Apply suppression period and return without generating events\n      if (this.journey.suppressionPeriod) {\n        const suppressionDelay = generateDelay(this.journey.suppressionPeriod);\n        ctx.advanceTime(suppressionDelay);\n      }\n      return;\n    }\n\n    // Execute adventures in sequence\n    for (const adventure of this.journey.adventures) {\n      // Check adventure bounce\n      if (shouldBounce(adventure.bounceChance)) {\n        if (adventure.onBounce === 'skip') {\n          // Clear adventure-scoped fields before skipping\n          ctx.clearScope('adventure');\n          // Skip to next adventure\n          continue;\n        } else {\n          // Clear adventure-scoped fields before stopping\n          ctx.clearScope('adventure');\n          // Stop the entire journey\n          break;\n        }\n      }\n\n      // Execute actions in sequence\n      for (const action of adventure.actions) {\n        // Check action bounce\n        if (shouldBounce(action.bounceChance)) {\n          // Clear action-scoped fields before breaking\n          ctx.clearScope('action');\n          break; // Stop this adventure\n        }\n\n        // Apply delay before action (from adventure's timeSpan)\n        if (adventure.timeSpan) {\n          const delay = generateDelay(adventure.timeSpan);\n          ctx.advanceTime(delay);\n        }\n\n        // Execute the action handler to get events\n        const actionPath = [this.journey.id, adventure.id, action.id];\n        let events: Event[];\n        try {\n          events = await action.handler(ctx);\n        } catch (err) {\n          if (err instanceof SynodeError) {\n            throw err;\n          }\n          const errorName = err instanceof Error ? err.constructor.name : 'UnknownError';\n          const errorMessage = err instanceof Error ? err.message : String(err);\n          throw new SynodeError({\n            code: 'HANDLER_ERROR',\n            message: `${errorName}: ${errorMessage} (userId: ${ctx.userId}, sessionId: ${ctx.sessionId})`,\n            path: actionPath,\n            cause: err,\n          });\n        }\n\n        if (!Array.isArray(events)) {\n          throw new SynodeError({\n            code: 'INVALID_HANDLER_RETURN',\n            message: `Action handler must return an array of Events, got ${typeof events}`,\n            path: actionPath,\n          });\n        }\n\n        // Yield events with timing between them\n        for (let i = 0; i < events.length; i++) {\n          if (i > 0 && action.timeSpan) {\n            // Apply delay between events within the same action\n            const delay = generateDelay(action.timeSpan);\n            ctx.advanceTime(delay);\n            // Update event timestamp\n            events[i].timestamp = ctx.now();\n          }\n          yield events[i];\n        }\n\n        // Clear action-scoped fields after action completes\n        ctx.clearScope('action');\n      }\n\n      // Clear adventure-scoped fields after adventure completes\n      ctx.clearScope('adventure');\n    }\n\n    // Mark journey as complete\n    ctx.markJourneyComplete(this.journey.id);\n\n    // Clear journey-scoped fields after journey completes\n    ctx.clearScope('journey');\n\n    // Apply suppression period after completion\n    if (this.journey.suppressionPeriod) {\n      const suppressionDelay = generateDelay(this.journey.suppressionPeriod);\n      ctx.advanceTime(suppressionDelay);\n    }\n  }\n}\n"],"mappings":";;;;AAuCA,MAAM,cAAc;CAAC;CAAW;CAAa;CAAU;CAAO;;;;;;;;;AAU9D,SAAgB,mBAAmB,SAAiB,MAAgB,YAA6B;CAC/F,IAAI,YAAY;AAEhB,KAAI,KAAK,SAAS,EAIhB,aAAY,IAHK,KAAK,KACnB,SAAS,MAAM,GAAG,YAAY,KAAK,IAAI,GAAG,YAAY,SAAS,EAAE,EAAE,IAAI,QAAQ,GACjF,CACwB,KAAK,MAAM,CAAC,IAAI;AAG3C,KAAI,WACF,cAAa,KAAK;AAGpB,QAAO;;;;;;;;;;;;;;;;AAiBT,IAAa,cAAb,cAAiC,MAAM;;CAErC,AAAS;;CAGT,AAAS;;CAGT,AAAS;;CAGT,AAAS;;CAGT,AAAS;;CAGT,AAAS;CAET,YAAY,SAA6B;EACvC,MAAM,YAAY,mBAAmB,QAAQ,SAAS,QAAQ,MAAM,QAAQ,WAAW;AACvF,QAAM,WAAW,EAAE,OAAO,QAAQ,OAAO,CAAC;AAC1C,OAAK,OAAO;AACZ,OAAK,OAAO,QAAQ;AACpB,OAAK,OAAO,QAAQ;AACpB,OAAK,aAAa,QAAQ;AAC1B,OAAK,aAAa,QAAQ;AAC1B,OAAK,WAAW,QAAQ;AACxB,OAAK,WAAW,QAAQ;;;;;;;;;;;;;;;;;;;CAoB1B,SAAiB;EACf,MAAMA,QAAkB,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,aAAa;AAE7D,MAAI,KAAK,KAAK,SAAS,GAAG;GACxB,MAAM,WAAW,KAAK,KAAK,KACxB,SAAS,MAAM,GAAG,YAAY,KAAK,IAAI,GAAG,YAAY,SAAS,EAAE,EAAE,IAAI,QAAQ,GACjF;AACD,SAAM,KAAK,WAAW,SAAS,KAAK,MAAM,GAAG;;AAG/C,MAAI,KAAK,aAAa,OACpB,OAAM,KAAK,eAAe,KAAK,WAAW;AAG5C,MAAI,KAAK,aAAa,OACpB,OAAM,KAAK,eAAe,KAAK,WAAW;AAG5C,MAAI,KAAK,WACP,OAAM,KAAK,UAAU,KAAK,aAAa;AAGzC,SAAO,MAAM,KAAK,KAAK;;;;;;;;;;;AAY3B,SAAgB,YAAY,GAAW,GAAmB;AACxD,KAAI,MAAM,EAAG,QAAO;AACpB,KAAI,EAAE,WAAW,EAAG,QAAO,EAAE;AAC7B,KAAI,EAAE,WAAW,EAAG,QAAO,EAAE;CAG7B,IAAI,OAAO,IAAI,MAAc,EAAE,SAAS,EAAE;CAC1C,IAAI,OAAO,IAAI,MAAc,EAAE,SAAS,EAAE;AAE1C,MAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC7B,MAAK,KAAK;AAGZ,MAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,KAAK;AAClC,OAAK,KAAK;AACV,OAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,KAAK;GAClC,MAAM,OAAO,EAAE,IAAI,OAAO,EAAE,IAAI,KAAK,IAAI;AACzC,QAAK,KAAK,KAAK,IACb,KAAK,KAAK,GACV,KAAK,IAAI,KAAK,GACd,KAAK,IAAI,KAAK,KACf;;AAEH,GAAC,MAAM,QAAQ,CAAC,MAAM,KAAK;;AAG7B,QAAO,KAAK,EAAE;;;;;;;;;;;;;AAchB,SAAgB,eAAe,OAAe,YAA0C;AACtF,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,IAAIC;CACJ,IAAI,eAAe;AAEnB,MAAK,MAAM,aAAa,YAAY;EAClC,MAAM,WAAW,YAAY,OAAO,UAAU;EAC9C,MAAM,SAAS,KAAK,IAAI,MAAM,QAAQ,UAAU,OAAO;AAGvD,MAAI,YAFc,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,GAAI,CAAC,IAE1B,WAAW,cAAc;AACpD,kBAAe;AACf,eAAY;;;AAIhB,QAAO;;;;;;;;;;;AAYT,SAAgB,wBACd,MACA,WACA,WACQ;CACR,MAAM,UAAU,eAAe,WAAW,UAAU;CACpD,MAAMC,QAAkB,EAAE;AAE1B,KAAI,QACF,OAAM,KAAK,iBAAiB,QAAQ,IAAI;AAG1C,OAAM,KAAK,aAAa,KAAK,MAAM,UAAU,KAAK,KAAK,CAAC,GAAG;AAE3D,QAAO,MAAM,KAAK,IAAI;;;;;;;;AC3OxB,MAAaC,qBAAkC,EAC7C,SAAS,QAAiB;CACxB,MAAM,OAAO,OAAO,YAAY;AAChC,QAAO,SAAS,GAAG,OAAO,GAAG,SAAS;GAEzC;;;;ACID,IAAa,gBAAb,MAA8C;CAC5C,AAAQ,wBAAQ,IAAI,KAAsB;CAC1C,AAAQ,gCAAgB,IAAI,KAA4B;CACxD,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ,oCAAoB,IAAI,KAAa;CAC7C,AAAQ,2BAAW,IAAI,KAAsB;CAE7C,YACE,4BAAkB,IAAI,MAAM,EAC5B,AAAQC,cAA2B,oBACnC,AAAgB,SAAS,MACzB;EAFQ;EACQ;AAEhB,OAAK,cAAc,IAAI,KAAK,UAAU;AACtC,OAAK,UAAU,YAAY,SAAS,OAAO;AAC3C,OAAK,aAAa,YAAY,SAAS,UAAU;EAGjD,MAAM,YAAYC,4BAAW;AAC7B,OAAK,SAAS,IAAIC,uBAAM,EAAE,QAAQ,WAAW,CAAC;;CAGhD,IAAI,QAAe;AACjB,SAAO,KAAK;;CAGd,IAAI,SAAiB;AACnB,SAAO,KAAK;;CAGd,IAAI,YAAoB;AACtB,SAAO,KAAK;;CAId,IAAO,KAA4B;AACjC,SAAO,KAAK,MAAM,IAAI,IAAI;;;;;;;;;;;;;;;;;;;;;;CAwB5B,IAAO,KAAa,OAAU,SAAmC;AAC/D,OAAK,MAAM,IAAI,KAAK,MAAM;AAC1B,MAAI,SAAS,MACX,MAAK,cAAc,IAAI,KAAK,EAAE,OAAO,QAAQ,OAAO,CAAC;MAGrD,MAAK,cAAc,OAAO,IAAI;;CAIlC,MAAY;AACV,SAAO,IAAI,KAAK,KAAK,YAAY;;CAGnC,WAAW,QAAyB;AAClC,SAAO,KAAK,YAAY,SAAS,OAAO;;CAG1C,oBAAoB,WAA4B;AAC9C,SAAO,KAAK,kBAAkB,IAAI,UAAU;;CAG9C,oBAAoB,WAAyB;AAC3C,OAAK,kBAAkB,IAAI,UAAU;;CAGvC,QAAQ,IAA2B;EACjC,MAAM,KAAK,KAAK,SAAS,IAAI,GAAG;AAChC,MAAI,CAAC,IAAI;GACP,MAAM,YAAY,CAAC,GAAG,KAAK,SAAS,MAAM,CAAC;GAC3C,MAAM,aACJ,UAAU,SAAS,IAAI,wBAAwB,WAAW,IAAI,UAAU,GAAG;AAC7E,SAAM,IAAI,YAAY;IACpB,MAAM;IACN,SAAS,YAAY,GAAG;IACxB,MAAM,EAAE;IACR;IACD,CAAC;;AAEJ,SAAO,IAAI,kBAAkB,GAAG;;CAGlC,aAAsC,IAAiC;EACrE,MAAM,KAAK,KAAK,SAAS,IAAI,GAAG;AAChC,MAAI,CAAC,IAAI;GACP,MAAM,YAAY,CAAC,GAAG,KAAK,SAAS,MAAM,CAAC;GAC3C,MAAM,aACJ,UAAU,SAAS,IAAI,wBAAwB,WAAW,IAAI,UAAU,GAAG;AAC7E,SAAM,IAAI,YAAY;IACpB,MAAM;IACN,SAAS,YAAY,GAAG;IACxB,MAAM,EAAE;IACR;IACD,CAAC;;AAEJ,SAAO,IAAI,kBAAwB,GAAoB;;;;;CAMzD,gBAAgB,SAAwB;AACtC,OAAK,SAAS,IAAI,QAAQ,IAAI,QAAQ;;;;;CAMxC,YAAY,IAAkB;AAC5B,OAAK,cAAc,IAAI,KAAK,KAAK,YAAY,SAAS,GAAG,GAAG;;;;;CAM9D,gBAAsB;AACpB,OAAK,aAAa,KAAK,YAAY,SAAS,UAAU;;;;;;CAOxD,WAAW,OAA2B;EACpC,MAAMC,eAAyB,EAAE;AACjC,OAAK,MAAM,CAAC,KAAK,aAAa,KAAK,cAAc,SAAS,CACxD,KAAI,SAAS,UAAU,MACrB,cAAa,KAAK,IAAI;AAG1B,OAAK,MAAM,OAAO,cAAc;AAC9B,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,cAAc,OAAO,IAAI;;;;;;;AAQpC,IAAM,oBAAN,MAA6F;CAC3F,YAAY,AAAQC,SAAwB;EAAxB;;CAEpB,YAAkB;AAChB,MAAI,KAAK,QAAQ,KAAK,WAAW,EAC/B,OAAM,IAAI,MAAM,YAAY,KAAK,QAAQ,GAAG,aAAa;EAE3D,MAAM,QAAQ,KAAK,MAAM,KAAK,QAAQ,GAAG,KAAK,QAAQ,KAAK,OAAO;AAClE,SAAO,KAAK,QAAQ,KAAK;;CAG3B,WAAW,IAAuC;AAEhD,SAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ;AACrC,QAAK,MAAM,OAAO,OAAO,KAAK,IAAI,CAChC,KAAK,IAAgC,SAAS,GAC5C,QAAO;AAGX,UAAO;IACP;;CAGJ,cAAc,OAAiC;AAC7C,SAAO,KAAK,QAAQ,KAAK;;CAG3B,aAAqB;AACnB,SAAO,CAAC,GAAG,KAAK,QAAQ,KAAK;;CAG/B,OAAe;AACb,SAAO,KAAK,QAAQ,KAAK;;;;;;;;;AC1L7B,SAAgB,cAAc,QAA8C;AAC1E,QAAO;;;;;;AAOT,eAAsB,gBACpB,YACA,aACkB;CAClB,MAAMC,aAAsC,EAAE;AAE9C,MAAK,MAAM,CAAC,KAAK,cAAc,OAAO,QAAQ,WAAW,WAAW,CAClE,KAAI,OAAO,cAAc,WAMvB,YAAW,OAAO,MAJJ,UAIgB,aAAa,WAAW;KAEtD,YAAW,OAAO;AAItB,QAAO;EACL,IAAI,WAAW;EACf,MAAM,WAAW;EACjB;EACD;;;;;;;;;;;;;;;;;;;;;;;;;ACpCH,SAAgB,cACd,QAC4B;AAC5B,QAAO;;;;;;;AAQT,eAAsB,gBACpB,YACA,SACkB;AAClB,KAAI,CAAC,OAAO,SAAS,WAAW,MAAM,IAAI,WAAW,QAAQ,KAAK,WAAW,QAAQ,IACnF,OAAM,IAAI,MACR,YAAY,WAAW,GAAG,gEAAgE,OAAO,WAAW,MAAM,GACnH;CAGH,MAAMC,OAAqB,EAAE;AAE7B,MAAK,IAAI,QAAQ,GAAG,QAAQ,WAAW,OAAO,SAAS;EACrD,MAAMC,MAAkB,EAAE;AAE1B,OAAK,MAAM,CAAC,KAAK,cAAc,OAAO,QAAQ,WAAW,OAAO,CAC9D,KAAI,OAAO,cAAc,WAMvB,KAAI,OAAO,MAJG,UAIS,SAAS;GAAE;GAAO,MAAM;GAAK,CAAC;MAGrD,KAAI,OAAO;AAIf,OAAK,KAAK,IAAI;;AAGhB,QAAO;EACL,IAAI,WAAW;EACf,MAAM,WAAW;EACjB;EACD;;;;;;;;AChEH,SAAgB,cAAc,UAA4B;CACxD,MAAM,EAAE,KAAK,KAAK,eAAe,cAAc;AAE/C,SAAQ,cAAR;EACE,KAAK,UACH,QAAO,MAAM,KAAK,QAAQ,IAAI,MAAM;EAEtC,KAAK,YAAY;GAEf,MAAM,QAAQ,MAAM,OAAO;GAC3B,MAAM,UAAU,MAAM,OAAO;GAC7B,MAAM,KAAK,KAAK,QAAQ;GACxB,MAAM,KAAK,KAAK,QAAQ;GAExB,MAAM,QAAQ,OADH,KAAK,KAAK,KAAO,KAAK,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAM,KAAK,KAAK,GAAG,GAC9C;AAE1B,UAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,CAAC;;EAG5C,KAAK,eAAe;GAElB,MAAM,SAAS,KAAK,MAAM;GAC1B,MAAM,QAAQ,MAAM,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,GAAG;AAClD,UAAO,KAAK,IAAI,KAAK,MAAM;;EAG7B,QACE,QAAO,MAAM,KAAK,QAAQ,IAAI,MAAM;;;;;;AAO1C,SAAgB,aAAa,cAAgC;AAC3D,KAAI,CAAC,aAAc,QAAO;AAC1B,QAAO,KAAK,QAAQ,GAAG;;;;;ACpCzB,IAAa,SAAb,MAAoB;CAClB,YAAY,AAAQC,SAAkB;EAAlB;;;;;;CAMpB,OAAO,IAAI,SAAgD;EAEzD,MAAM,MAAM,WAAW,IAAI,eAAe;AAG1C,MAAI,eAAe;AAGnB,MAAI,KAAK,QAAQ,UACf;QAAK,MAAM,qBAAqB,KAAK,QAAQ,SAC3C,KAAI,CAAC,IAAI,oBAAoB,kBAAkB,CAE7C;;AAMN,MAAI,aAAa,KAAK,QAAQ,aAAa,EAAE;AAE3C,OAAI,KAAK,QAAQ,mBAAmB;IAClC,MAAM,mBAAmB,cAAc,KAAK,QAAQ,kBAAkB;AACtE,QAAI,YAAY,iBAAiB;;AAEnC;;AAIF,OAAK,MAAM,aAAa,KAAK,QAAQ,YAAY;AAE/C,OAAI,aAAa,UAAU,aAAa,CACtC,KAAI,UAAU,aAAa,QAAQ;AAEjC,QAAI,WAAW,YAAY;AAE3B;UACK;AAEL,QAAI,WAAW,YAAY;AAE3B;;AAKJ,QAAK,MAAM,UAAU,UAAU,SAAS;AAEtC,QAAI,aAAa,OAAO,aAAa,EAAE;AAErC,SAAI,WAAW,SAAS;AACxB;;AAIF,QAAI,UAAU,UAAU;KACtB,MAAM,QAAQ,cAAc,UAAU,SAAS;AAC/C,SAAI,YAAY,MAAM;;IAIxB,MAAM,aAAa;KAAC,KAAK,QAAQ;KAAI,UAAU;KAAI,OAAO;KAAG;IAC7D,IAAIC;AACJ,QAAI;AACF,cAAS,MAAM,OAAO,QAAQ,IAAI;aAC3B,KAAK;AACZ,SAAI,eAAe,YACjB,OAAM;AAIR,WAAM,IAAI,YAAY;MACpB,MAAM;MACN,SAAS,GAJO,eAAe,QAAQ,IAAI,YAAY,OAAO,eAIxC,IAHH,eAAe,QAAQ,IAAI,UAAU,OAAO,IAAI,CAG5B,YAAY,IAAI,OAAO,eAAe,IAAI,UAAU;MAC3F,MAAM;MACN,OAAO;MACR,CAAC;;AAGJ,QAAI,CAAC,MAAM,QAAQ,OAAO,CACxB,OAAM,IAAI,YAAY;KACpB,MAAM;KACN,SAAS,sDAAsD,OAAO;KACtE,MAAM;KACP,CAAC;AAIJ,SAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,SAAI,IAAI,KAAK,OAAO,UAAU;MAE5B,MAAM,QAAQ,cAAc,OAAO,SAAS;AAC5C,UAAI,YAAY,MAAM;AAEtB,aAAO,GAAG,YAAY,IAAI,KAAK;;AAEjC,WAAM,OAAO;;AAIf,QAAI,WAAW,SAAS;;AAI1B,OAAI,WAAW,YAAY;;AAI7B,MAAI,oBAAoB,KAAK,QAAQ,GAAG;AAGxC,MAAI,WAAW,UAAU;AAGzB,MAAI,KAAK,QAAQ,mBAAmB;GAClC,MAAM,mBAAmB,cAAc,KAAK,QAAQ,kBAAkB;AACtE,OAAI,YAAY,iBAAiB"}

package/dist/engine-SRByMZvP.mjs

@@ -0,0 +1,515 @@
+import { Faker, allLocales } from "@faker-js/faker";
+
+//#region src/errors.ts
+const PATH_LABELS = [
+	"Journey",
+	"Adventure",
+	"Action",
+	"Step"
+];
+/**
+* Formats an error message with a hierarchical path prefix and optional suggestion.
+*
+* @param message - The base error message
+* @param path - Hierarchical path segments labeled Journey/Adventure/Action/Step
+* @param suggestion - Optional suggestion appended on a new line
+* @returns The formatted message string
+*/
+function formatErrorMessage(message, path, suggestion) {
+	let formatted = message;
+	if (path.length > 0) formatted = `[${path.map((segment, i) => `${PATH_LABELS[Math.min(i, PATH_LABELS.length - 1)]} "${segment}"`).join(" > ")}] ${message}`;
+	if (suggestion) formatted += `\n${suggestion}`;
+	return formatted;
+}
+/**
+* Structured error class for all Synode validation and runtime errors.
+*
+* @example
+* ```typescript
+* throw new SynodeError({
+*   code: 'INVALID_BOUNCE_CHANCE',
+*   message: 'Bounce chance must be between 0 and 1',
+*   path: ['Purchase Flow', 'Checkout', 'Submit Order'],
+*   expected: 'number between 0 and 1',
+*   received: '1.5',
+* });
+* ```
+*/
+var SynodeError = class extends Error {
+	/** Structured error code identifying the error type. */
+	code;
+	/** Hierarchical path where the error occurred. */
+	path;
+	/** Optional suggestion for fixing the error. */
+	suggestion;
+	/** The original unformatted error message. */
+	rawMessage;
+	/** Optional description of the expected value. */
+	expected;
+	/** Optional description of the actual value received. */
+	received;
+	constructor(options) {
+		const formatted = formatErrorMessage(options.message, options.path, options.suggestion);
+		super(formatted, { cause: options.cause });
+		this.name = "SynodeError";
+		this.code = options.code;
+		this.path = options.path;
+		this.suggestion = options.suggestion;
+		this.rawMessage = options.message;
+		this.expected = options.expected;
+		this.received = options.received;
+	}
+	/**
+	* Produces a structured multi-line representation of the error for human-readable output.
+	*
+	* Format:
+	* ```
+	* [ERROR_CODE] rawMessage
+	*   Path: Journey 'x' > Adventure 'y' > Action 'z'
+	*   Expected: what was expected
+	*   Received: what was provided
+	*   Fix: suggestion
+	* ```
+	*
+	* Path is omitted when path is empty. Expected/Received are omitted when not provided.
+	* Fix is omitted when there is no suggestion.
+	*
+	* @returns A formatted string representation of the error.
+	*/
+	format() {
+		const lines = [`[${this.code}] ${this.rawMessage}`];
+		if (this.path.length > 0) {
+			const segments = this.path.map((segment, i) => `${PATH_LABELS[Math.min(i, PATH_LABELS.length - 1)]} '${segment}'`);
+			lines.push(`  Path: ${segments.join(" > ")}`);
+		}
+		if (this.expected !== void 0) lines.push(`  Expected: ${this.expected}`);
+		if (this.received !== void 0) lines.push(`  Received: ${this.received}`);
+		if (this.suggestion) lines.push(`  Fix: ${this.suggestion}`);
+		return lines.join("\n");
+	}
+};
+/**
+* Computes the Levenshtein edit distance between two strings using a space-efficient
+* two-row approach.
+*
+* @param a - First string
+* @param b - Second string
+* @returns The minimum number of single-character edits (insertions, deletions, substitutions)
+*/
+function levenshtein(a, b) {
+	if (a === b) return 0;
+	if (a.length === 0) return b.length;
+	if (b.length === 0) return a.length;
+	let prev = new Array(b.length + 1);
+	let curr = new Array(b.length + 1);
+	for (let j = 0; j <= b.length; j++) prev[j] = j;
+	for (let i = 1; i <= a.length; i++) {
+		curr[0] = i;
+		for (let j = 1; j <= b.length; j++) {
+			const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+			curr[j] = Math.min(prev[j] + 1, curr[j - 1] + 1, prev[j - 1] + cost);
+		}
+		[prev, curr] = [curr, prev];
+	}
+	return prev[b.length];
+}
+/**
+* Finds the closest matching string from a list of candidates using Levenshtein distance.
+* Returns undefined if no candidate is within the dynamic threshold.
+*
+* The threshold is `max(3, floor(maxLen * 0.4))` where maxLen is the longer of the
+* input and candidate strings.
+*
+* @param input - The string to match against candidates
+* @param candidates - List of valid strings to compare against
+* @returns The closest matching candidate, or undefined if none is close enough
+*/
+function suggestClosest(input, candidates) {
+	if (candidates.length === 0) return void 0;
+	let bestMatch;
+	let bestDistance = Infinity;
+	for (const candidate of candidates) {
+		const distance = levenshtein(input, candidate);
+		const maxLen = Math.max(input.length, candidate.length);
+		if (distance <= Math.max(3, Math.floor(maxLen * .4)) && distance < bestDistance) {
+			bestDistance = distance;
+			bestMatch = candidate;
+		}
+	}
+	return bestMatch;
+}
+/**
+* Builds a human-readable suggestion string for a not-found error, including
+* the closest match (if any) and the full list of available options.
+*
+* @param kind - The kind of entity (e.g., "dataset", "journey")
+* @param requested - The name that was requested but not found
+* @param available - List of valid names
+* @returns A suggestion string with "Did you mean..." and/or available options
+*/
+function buildNotFoundSuggestion(kind, requested, available) {
+	const closest = suggestClosest(requested, available);
+	const parts = [];
+	if (closest) parts.push(`Did you mean '${closest}'?`);
+	parts.push(`Available ${kind}s: [${available.join(", ")}]`);
+	return parts.join(" ");
+}
+
+//#endregion
+//#region src/state/ids.ts
+/**
+* Default ID generator using crypto.randomUUID.
+*/
+const defaultIdGenerator = { generate(prefix) {
+	const uuid = crypto.randomUUID();
+	return prefix ? `${prefix}_${uuid}` : uuid;
+} };
+
+//#endregion
+//#region src/state/context.ts
+var SynodeContext = class {
+	state = /* @__PURE__ */ new Map();
+	fieldMetadata = /* @__PURE__ */ new Map();
+	currentTime;
+	_userId;
+	_sessionId;
+	_faker;
+	completedJourneys = /* @__PURE__ */ new Set();
+	datasets = /* @__PURE__ */ new Map();
+	constructor(startTime = /* @__PURE__ */ new Date(), idGenerator = defaultIdGenerator, locale = "en") {
+		this.idGenerator = idGenerator;
+		this.locale = locale;
+		this.currentTime = new Date(startTime);
+		this._userId = idGenerator.generate("user");
+		this._sessionId = idGenerator.generate("session");
+		const localeDef = allLocales[locale];
+		this._faker = new Faker({ locale: localeDef });
+	}
+	get faker() {
+		return this._faker;
+	}
+	get userId() {
+		return this._userId;
+	}
+	get sessionId() {
+		return this._sessionId;
+	}
+	get(key) {
+		return this.state.get(key);
+	}
+	/**
+	* Set a context field value with optional scope for automatic cleanup.
+	*
+	* @param key - The field name
+	* @param value - The field value
+	* @param options - Optional settings including lifecycle scope
+	*
+	* @remarks
+	* When calling `set()` multiple times on the same field with different scopes,
+	* the most recent scope setting will be used. For example, if a field is first
+	* set with `scope: 'adventure'` and later set again with `scope: 'action'`,
+	* it will be cleared at the end of the action rather than the adventure.
+	*
+	* @example
+	* ```typescript
+	* ctx.set('cartItems', [], { scope: 'adventure' });
+	* // Later in the same adventure...
+	* ctx.set('cartItems', ['item1'], { scope: 'action' }); // Now scoped to action
+	* ```
+	*/
+	set(key, value, options) {
+		this.state.set(key, value);
+		if (options?.scope) this.fieldMetadata.set(key, { scope: options.scope });
+		else this.fieldMetadata.delete(key);
+	}
+	now() {
+		return new Date(this.currentTime);
+	}
+	generateId(prefix) {
+		return this.idGenerator.generate(prefix);
+	}
+	hasCompletedJourney(journeyId) {
+		return this.completedJourneys.has(journeyId);
+	}
+	markJourneyComplete(journeyId) {
+		this.completedJourneys.add(journeyId);
+	}
+	dataset(id) {
+		const ds = this.datasets.get(id);
+		if (!ds) {
+			const available = [...this.datasets.keys()];
+			const suggestion = available.length > 0 ? buildNotFoundSuggestion("dataset", id, available) : void 0;
+			throw new SynodeError({
+				code: "DATASET_NOT_FOUND",
+				message: `Dataset '${id}' not found in context`,
+				path: [],
+				suggestion
+			});
+		}
+		return new DatasetHandleImpl(ds);
+	}
+	typedDataset(id) {
+		const ds = this.datasets.get(id);
+		if (!ds) {
+			const available = [...this.datasets.keys()];
+			const suggestion = available.length > 0 ? buildNotFoundSuggestion("dataset", id, available) : void 0;
+			throw new SynodeError({
+				code: "DATASET_NOT_FOUND",
+				message: `Dataset '${id}' not found in context`,
+				path: [],
+				suggestion
+			});
+		}
+		return new DatasetHandleImpl(ds);
+	}
+	/**
+	* Internal: Register a dataset for use in this context.
+	*/
+	registerDataset(dataset) {
+		this.datasets.set(dataset.id, dataset);
+	}
+	/**
+	* Internal: Advance the simulation time.
+	*/
+	advanceTime(ms) {
+		this.currentTime = new Date(this.currentTime.getTime() + ms);
+	}
+	/**
+	* Internal: Rotate the session ID.
+	*/
+	rotateSession() {
+		this._sessionId = this.idGenerator.generate("session");
+	}
+	/**
+	* Internal: Clear all fields with the specified scope.
+	* Called by the engine when a scope ends.
+	*/
+	clearScope(scope) {
+		const keysToDelete = [];
+		for (const [key, metadata] of this.fieldMetadata.entries()) if (metadata.scope === scope) keysToDelete.push(key);
+		for (const key of keysToDelete) {
+			this.state.delete(key);
+			this.fieldMetadata.delete(key);
+		}
+	}
+};
+/**
+* Internal implementation of DatasetHandle.
+*/
+var DatasetHandleImpl = class {
+	constructor(dataset) {
+		this.dataset = dataset;
+	}
+	randomRow() {
+		if (this.dataset.rows.length === 0) throw new Error(`Dataset '${this.dataset.id}' is empty.`);
+		const index = Math.floor(Math.random() * this.dataset.rows.length);
+		return this.dataset.rows[index];
+	}
+	getRowById(id) {
+		return this.dataset.rows.find((row) => {
+			for (const key of Object.keys(row)) if (row[key] === id) return true;
+			return false;
+		});
+	}
+	getRowByIndex(index) {
+		return this.dataset.rows[index];
+	}
+	getAllRows() {
+		return [...this.dataset.rows];
+	}
+	size() {
+		return this.dataset.rows.length;
+	}
+};
+
+//#endregion
+//#region src/generators/persona.ts
+/**
+* Defines a new persona.
+*/
+function definePersona(config) {
+	return config;
+}
+/**
+* Generates a concrete persona instance from a definition.
+* This resolves all dynamic fields and weighted distributions.
+*/
+async function generatePersona(definition, baseContext) {
+	const attributes = {};
+	for (const [key, generator] of Object.entries(definition.attributes)) if (typeof generator === "function") attributes[key] = await generator(baseContext, attributes);
+	else attributes[key] = generator;
+	return {
+		id: definition.id,
+		name: definition.name,
+		attributes
+	};
+}
+
+//#endregion
+//#region src/generators/dataset.ts
+/**
+* Defines a new dataset with type inference support.
+*
+* @example
+* ```typescript
+* const products = defineDataset({
+*   id: 'products',
+*   name: 'Products',
+*   count: 100,
+*   fields: {
+*     id: (ctx, row) => `prod-${row.index}`,
+*     name: (ctx) => ctx.faker.commerce.productName(),
+*     price: (ctx) => ctx.faker.number.float({ min: 10, max: 500 }),
+*   },
+* });
+*
+* // Type inference works automatically
+* type Product = InferDatasetRow<typeof products>;
+* ```
+*/
+function defineDataset(config) {
+	return config;
+}
+/**
+* Generates a concrete dataset from a definition.
+* @param definition The dataset definition.
+* @param context Context providing access to faker, other datasets, and user data.
+*/
+async function generateDataset(definition, context) {
+	if (!Number.isFinite(definition.count) || definition.count < 0 || definition.count > 1e7) throw new Error(`Dataset '${definition.id}' count must be a finite number between 0 and 10,000,000, got ${String(definition.count)}`);
+	const rows = [];
+	for (let index = 0; index < definition.count; index++) {
+		const row = {};
+		for (const [key, generator] of Object.entries(definition.fields)) if (typeof generator === "function") row[key] = await generator(context, {
+			index,
+			data: row
+		});
+		else row[key] = generator;
+		rows.push(row);
+	}
+	return {
+		id: definition.id,
+		name: definition.name,
+		rows
+	};
+}
+
+//#endregion
+//#region src/monitoring/timing.ts
+/**
+* Generates a delay in milliseconds based on a time span configuration.
+*/
+function generateDelay(timeSpan) {
+	const { min, max, distribution = "uniform" } = timeSpan;
+	switch (distribution) {
+		case "uniform": return min + Math.random() * (max - min);
+		case "gaussian": {
+			const mean = (min + max) / 2;
+			const stdDev = (max - min) / 6;
+			const u1 = Math.random();
+			const u2 = Math.random();
+			const value = mean + Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2) * stdDev;
+			return Math.max(min, Math.min(max, value));
+		}
+		case "exponential": {
+			const lambda = 1 / (max - min);
+			const value = min - Math.log(1 - Math.random()) / lambda;
+			return Math.min(max, value);
+		}
+		default: return min + Math.random() * (max - min);
+	}
+}
+/**
+* Checks if a bounce should occur based on probability.
+*/
+function shouldBounce(bounceChance) {
+	if (!bounceChance) return false;
+	return Math.random() < bounceChance;
+}
+
+//#endregion
+//#region src/execution/engine.ts
+var Engine = class {
+	constructor(journey) {
+		this.journey = journey;
+	}
+	/**
+	* Executes the journey and yields events.
+	* @param context Optional context to use. If not provided, a new one is created.
+	*/
+	async *run(context) {
+		const ctx = context ?? new SynodeContext();
+		ctx.rotateSession();
+		if (this.journey.requires) {
+			for (const requiredJourneyId of this.journey.requires) if (!ctx.hasCompletedJourney(requiredJourneyId)) return;
+		}
+		if (shouldBounce(this.journey.bounceChance)) {
+			if (this.journey.suppressionPeriod) {
+				const suppressionDelay = generateDelay(this.journey.suppressionPeriod);
+				ctx.advanceTime(suppressionDelay);
+			}
+			return;
+		}
+		for (const adventure of this.journey.adventures) {
+			if (shouldBounce(adventure.bounceChance)) if (adventure.onBounce === "skip") {
+				ctx.clearScope("adventure");
+				continue;
+			} else {
+				ctx.clearScope("adventure");
+				break;
+			}
+			for (const action of adventure.actions) {
+				if (shouldBounce(action.bounceChance)) {
+					ctx.clearScope("action");
+					break;
+				}
+				if (adventure.timeSpan) {
+					const delay = generateDelay(adventure.timeSpan);
+					ctx.advanceTime(delay);
+				}
+				const actionPath = [
+					this.journey.id,
+					adventure.id,
+					action.id
+				];
+				let events;
+				try {
+					events = await action.handler(ctx);
+				} catch (err) {
+					if (err instanceof SynodeError) throw err;
+					throw new SynodeError({
+						code: "HANDLER_ERROR",
+						message: `${err instanceof Error ? err.constructor.name : "UnknownError"}: ${err instanceof Error ? err.message : String(err)} (userId: ${ctx.userId}, sessionId: ${ctx.sessionId})`,
+						path: actionPath,
+						cause: err
+					});
+				}
+				if (!Array.isArray(events)) throw new SynodeError({
+					code: "INVALID_HANDLER_RETURN",
+					message: `Action handler must return an array of Events, got ${typeof events}`,
+					path: actionPath
+				});
+				for (let i = 0; i < events.length; i++) {
+					if (i > 0 && action.timeSpan) {
+						const delay = generateDelay(action.timeSpan);
+						ctx.advanceTime(delay);
+						events[i].timestamp = ctx.now();
+					}
+					yield events[i];
+				}
+				ctx.clearScope("action");
+			}
+			ctx.clearScope("adventure");
+		}
+		ctx.markJourneyComplete(this.journey.id);
+		ctx.clearScope("journey");
+		if (this.journey.suppressionPeriod) {
+			const suppressionDelay = generateDelay(this.journey.suppressionPeriod);
+			ctx.advanceTime(suppressionDelay);
+		}
+	}
+};
+
+//#endregion
+export { generateDataset as a, SynodeContext as c, formatErrorMessage as d, levenshtein as f, defineDataset as i, SynodeError as l, generateDelay as n, definePersona as o, suggestClosest as p, shouldBounce as r, generatePersona as s, Engine as t, buildNotFoundSuggestion as u };
+//# sourceMappingURL=engine-SRByMZvP.mjs.map

package/dist/engine-SRByMZvP.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine-SRByMZvP.mjs","names":["lines: string[]","bestMatch: string | undefined","parts: string[]","defaultIdGenerator: IdGenerator","idGenerator: IdGenerator","keysToDelete: string[]","dataset: Dataset<TRow>","attributes: Record<string, unknown>","rows: DatasetRow[]","row: DatasetRow","journey: Journey","events: Event[]"],"sources":["../src/errors.ts","../src/state/ids.ts","../src/state/context.ts","../src/generators/persona.ts","../src/generators/dataset.ts","../src/monitoring/timing.ts","../src/execution/engine.ts"],"sourcesContent":["/**\n * Error codes for all Synode validation and runtime errors.\n */\nexport type ErrorCode =\n  | 'INVALID_BOUNCE_CHANCE'\n  | 'INVALID_TIME_SPAN'\n  | 'INVALID_SUPPRESSION_PERIOD'\n  | 'UNKNOWN_JOURNEY_REF'\n  | 'CIRCULAR_DEPENDENCY'\n  | 'DUPLICATE_ID'\n  | 'DATASET_NOT_FOUND'\n  | 'DATASET_EMPTY'\n  | 'HANDLER_ERROR'\n  | 'ADAPTER_WRITE_ERROR'\n  | 'INVALID_HANDLER_RETURN'\n  | 'TYPO_DETECTED'\n  | 'INVALID_DATASET_COUNT';\n\n/**\n * Options for constructing a SynodeError.\n *\n * @param code - The structured error code identifying the error type\n * @param message - The human-readable error message\n * @param path - Hierarchical path segments (journey, adventure, action, step)\n * @param suggestion - Optional suggestion for fixing the error\n * @param expected - Optional description of the expected value\n * @param received - Optional description of the actual value received\n * @param cause - Optional underlying error that caused this one\n */\nexport interface SynodeErrorOptions {\n  code: ErrorCode;\n  message: string;\n  path: string[];\n  suggestion?: string;\n  expected?: string;\n  received?: string;\n  cause?: unknown;\n}\n\nconst PATH_LABELS = ['Journey', 'Adventure', 'Action', 'Step'] as const;\n\n/**\n * Formats an error message with a hierarchical path prefix and optional suggestion.\n *\n * @param message - The base error message\n * @param path - Hierarchical path segments labeled Journey/Adventure/Action/Step\n * @param suggestion - Optional suggestion appended on a new line\n * @returns The formatted message string\n */\nexport function formatErrorMessage(message: string, path: string[], suggestion?: string): string {\n  let formatted = message;\n\n  if (path.length > 0) {\n    const segments = path.map(\n      (segment, i) => `${PATH_LABELS[Math.min(i, PATH_LABELS.length - 1)]} \"${segment}\"`,\n    );\n    formatted = `[${segments.join(' > ')}] ${message}`;\n  }\n\n  if (suggestion) {\n    formatted += `\\n${suggestion}`;\n  }\n\n  return formatted;\n}\n\n/**\n * Structured error class for all Synode validation and runtime errors.\n *\n * @example\n * ```typescript\n * throw new SynodeError({\n *   code: 'INVALID_BOUNCE_CHANCE',\n *   message: 'Bounce chance must be between 0 and 1',\n *   path: ['Purchase Flow', 'Checkout', 'Submit Order'],\n *   expected: 'number between 0 and 1',\n *   received: '1.5',\n * });\n * ```\n */\nexport class SynodeError extends Error {\n  /** Structured error code identifying the error type. */\n  readonly code: ErrorCode;\n\n  /** Hierarchical path where the error occurred. */\n  readonly path: string[];\n\n  /** Optional suggestion for fixing the error. */\n  readonly suggestion: string | undefined;\n\n  /** The original unformatted error message. */\n  readonly rawMessage: string;\n\n  /** Optional description of the expected value. */\n  readonly expected: string | undefined;\n\n  /** Optional description of the actual value received. */\n  readonly received: string | undefined;\n\n  constructor(options: SynodeErrorOptions) {\n    const formatted = formatErrorMessage(options.message, options.path, options.suggestion);\n    super(formatted, { cause: options.cause });\n    this.name = 'SynodeError';\n    this.code = options.code;\n    this.path = options.path;\n    this.suggestion = options.suggestion;\n    this.rawMessage = options.message;\n    this.expected = options.expected;\n    this.received = options.received;\n  }\n\n  /**\n   * Produces a structured multi-line representation of the error for human-readable output.\n   *\n   * Format:\n   * ```\n   * [ERROR_CODE] rawMessage\n   *   Path: Journey 'x' > Adventure 'y' > Action 'z'\n   *   Expected: what was expected\n   *   Received: what was provided\n   *   Fix: suggestion\n   * ```\n   *\n   * Path is omitted when path is empty. Expected/Received are omitted when not provided.\n   * Fix is omitted when there is no suggestion.\n   *\n   * @returns A formatted string representation of the error.\n   */\n  format(): string {\n    const lines: string[] = [`[${this.code}] ${this.rawMessage}`];\n\n    if (this.path.length > 0) {\n      const segments = this.path.map(\n        (segment, i) => `${PATH_LABELS[Math.min(i, PATH_LABELS.length - 1)]} '${segment}'`,\n      );\n      lines.push(`  Path: ${segments.join(' > ')}`);\n    }\n\n    if (this.expected !== undefined) {\n      lines.push(`  Expected: ${this.expected}`);\n    }\n\n    if (this.received !== undefined) {\n      lines.push(`  Received: ${this.received}`);\n    }\n\n    if (this.suggestion) {\n      lines.push(`  Fix: ${this.suggestion}`);\n    }\n\n    return lines.join('\\n');\n  }\n}\n\n/**\n * Computes the Levenshtein edit distance between two strings using a space-efficient\n * two-row approach.\n *\n * @param a - First string\n * @param b - Second string\n * @returns The minimum number of single-character edits (insertions, deletions, substitutions)\n */\nexport function levenshtein(a: string, b: string): number {\n  if (a === b) return 0;\n  if (a.length === 0) return b.length;\n  if (b.length === 0) return a.length;\n\n  // Two-row approach: only keep previous and current rows\n  let prev = new Array<number>(b.length + 1);\n  let curr = new Array<number>(b.length + 1);\n\n  for (let j = 0; j <= b.length; j++) {\n    prev[j] = j;\n  }\n\n  for (let i = 1; i <= a.length; i++) {\n    curr[0] = i;\n    for (let j = 1; j <= b.length; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      curr[j] = Math.min(\n        prev[j] + 1, // deletion\n        curr[j - 1] + 1, // insertion\n        prev[j - 1] + cost, // substitution\n      );\n    }\n    [prev, curr] = [curr, prev];\n  }\n\n  return prev[b.length];\n}\n\n/**\n * Finds the closest matching string from a list of candidates using Levenshtein distance.\n * Returns undefined if no candidate is within the dynamic threshold.\n *\n * The threshold is `max(3, floor(maxLen * 0.4))` where maxLen is the longer of the\n * input and candidate strings.\n *\n * @param input - The string to match against candidates\n * @param candidates - List of valid strings to compare against\n * @returns The closest matching candidate, or undefined if none is close enough\n */\nexport function suggestClosest(input: string, candidates: string[]): string | undefined {\n  if (candidates.length === 0) return undefined;\n\n  let bestMatch: string | undefined;\n  let bestDistance = Infinity;\n\n  for (const candidate of candidates) {\n    const distance = levenshtein(input, candidate);\n    const maxLen = Math.max(input.length, candidate.length);\n    const threshold = Math.max(3, Math.floor(maxLen * 0.4));\n\n    if (distance <= threshold && distance < bestDistance) {\n      bestDistance = distance;\n      bestMatch = candidate;\n    }\n  }\n\n  return bestMatch;\n}\n\n/**\n * Builds a human-readable suggestion string for a not-found error, including\n * the closest match (if any) and the full list of available options.\n *\n * @param kind - The kind of entity (e.g., \"dataset\", \"journey\")\n * @param requested - The name that was requested but not found\n * @param available - List of valid names\n * @returns A suggestion string with \"Did you mean...\" and/or available options\n */\nexport function buildNotFoundSuggestion(\n  kind: string,\n  requested: string,\n  available: string[],\n): string {\n  const closest = suggestClosest(requested, available);\n  const parts: string[] = [];\n\n  if (closest) {\n    parts.push(`Did you mean '${closest}'?`);\n  }\n\n  parts.push(`Available ${kind}s: [${available.join(', ')}]`);\n\n  return parts.join(' ');\n}\n","/**\n * Interface for ID generation strategies.\n */\nexport interface IdGenerator {\n  generate(prefix?: string): string;\n}\n\n/**\n * Default ID generator using crypto.randomUUID.\n */\nexport const defaultIdGenerator: IdGenerator = {\n  generate(prefix?: string) {\n    const uuid = crypto.randomUUID();\n    return prefix ? `${prefix}_${uuid}` : uuid;\n  },\n};\n","import { Faker, allLocales } from '@faker-js/faker';\nimport {\n  Context,\n  Dataset,\n  DatasetHandle,\n  DatasetRow,\n  ContextScope,\n  ContextSetOptions,\n} from '../types.js';\nimport { SynodeError, buildNotFoundSuggestion } from '../errors.js';\nimport { IdGenerator, defaultIdGenerator } from './ids.js';\n\n/**\n * Internal metadata for scoped context fields.\n */\ninterface FieldMetadata {\n  scope?: ContextScope;\n}\n\nexport class SynodeContext implements Context {\n  private state = new Map<string, unknown>();\n  private fieldMetadata = new Map<string, FieldMetadata>();\n  private currentTime: Date;\n  private _userId: string;\n  private _sessionId: string;\n  private _faker: Faker;\n  private completedJourneys = new Set<string>();\n  private datasets = new Map<string, Dataset>();\n\n  constructor(\n    startTime: Date = new Date(),\n    private idGenerator: IdGenerator = defaultIdGenerator,\n    public readonly locale = 'en',\n  ) {\n    this.currentTime = new Date(startTime);\n    this._userId = idGenerator.generate('user');\n    this._sessionId = idGenerator.generate('session');\n\n    // Initialize localized faker\n    const localeDef = allLocales[locale as keyof typeof allLocales];\n    this._faker = new Faker({ locale: localeDef });\n  }\n\n  get faker(): Faker {\n    return this._faker;\n  }\n\n  get userId(): string {\n    return this._userId;\n  }\n\n  get sessionId(): string {\n    return this._sessionId;\n  }\n\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-parameters\n  get<T>(key: string): T | undefined {\n    return this.state.get(key) as T | undefined;\n  }\n\n  /**\n   * Set a context field value with optional scope for automatic cleanup.\n   *\n   * @param key - The field name\n   * @param value - The field value\n   * @param options - Optional settings including lifecycle scope\n   *\n   * @remarks\n   * When calling `set()` multiple times on the same field with different scopes,\n   * the most recent scope setting will be used. For example, if a field is first\n   * set with `scope: 'adventure'` and later set again with `scope: 'action'`,\n   * it will be cleared at the end of the action rather than the adventure.\n   *\n   * @example\n   * ```typescript\n   * ctx.set('cartItems', [], { scope: 'adventure' });\n   * // Later in the same adventure...\n   * ctx.set('cartItems', ['item1'], { scope: 'action' }); // Now scoped to action\n   * ```\n   */\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-parameters\n  set<T>(key: string, value: T, options?: ContextSetOptions): void {\n    this.state.set(key, value);\n    if (options?.scope) {\n      this.fieldMetadata.set(key, { scope: options.scope });\n    } else {\n      // If no scope is set, remove any existing metadata\n      this.fieldMetadata.delete(key);\n    }\n  }\n\n  now(): Date {\n    return new Date(this.currentTime);\n  }\n\n  generateId(prefix?: string): string {\n    return this.idGenerator.generate(prefix);\n  }\n\n  hasCompletedJourney(journeyId: string): boolean {\n    return this.completedJourneys.has(journeyId);\n  }\n\n  markJourneyComplete(journeyId: string): void {\n    this.completedJourneys.add(journeyId);\n  }\n\n  dataset(id: string): DatasetHandle {\n    const ds = this.datasets.get(id);\n    if (!ds) {\n      const available = [...this.datasets.keys()];\n      const suggestion =\n        available.length > 0 ? buildNotFoundSuggestion('dataset', id, available) : undefined;\n      throw new SynodeError({\n        code: 'DATASET_NOT_FOUND',\n        message: `Dataset '${id}' not found in context`,\n        path: [],\n        suggestion,\n      });\n    }\n    return new DatasetHandleImpl(ds);\n  }\n\n  typedDataset<TRow extends DatasetRow>(id: string): DatasetHandle<TRow> {\n    const ds = this.datasets.get(id);\n    if (!ds) {\n      const available = [...this.datasets.keys()];\n      const suggestion =\n        available.length > 0 ? buildNotFoundSuggestion('dataset', id, available) : undefined;\n      throw new SynodeError({\n        code: 'DATASET_NOT_FOUND',\n        message: `Dataset '${id}' not found in context`,\n        path: [],\n        suggestion,\n      });\n    }\n    return new DatasetHandleImpl<TRow>(ds as Dataset<TRow>);\n  }\n\n  /**\n   * Internal: Register a dataset for use in this context.\n   */\n  registerDataset(dataset: Dataset): void {\n    this.datasets.set(dataset.id, dataset);\n  }\n\n  /**\n   * Internal: Advance the simulation time.\n   */\n  advanceTime(ms: number): void {\n    this.currentTime = new Date(this.currentTime.getTime() + ms);\n  }\n\n  /**\n   * Internal: Rotate the session ID.\n   */\n  rotateSession(): void {\n    this._sessionId = this.idGenerator.generate('session');\n  }\n\n  /**\n   * Internal: Clear all fields with the specified scope.\n   * Called by the engine when a scope ends.\n   */\n  clearScope(scope: ContextScope): void {\n    const keysToDelete: string[] = [];\n    for (const [key, metadata] of this.fieldMetadata.entries()) {\n      if (metadata.scope === scope) {\n        keysToDelete.push(key);\n      }\n    }\n    for (const key of keysToDelete) {\n      this.state.delete(key);\n      this.fieldMetadata.delete(key);\n    }\n  }\n}\n\n/**\n * Internal implementation of DatasetHandle.\n */\nclass DatasetHandleImpl<TRow extends DatasetRow = DatasetRow> implements DatasetHandle<TRow> {\n  constructor(private dataset: Dataset<TRow>) {}\n\n  randomRow(): TRow {\n    if (this.dataset.rows.length === 0) {\n      throw new Error(`Dataset '${this.dataset.id}' is empty.`);\n    }\n    const index = Math.floor(Math.random() * this.dataset.rows.length);\n    return this.dataset.rows[index];\n  }\n\n  getRowById(id: string | number): TRow | undefined {\n    // Find row by searching all fields for a matching value\n    return this.dataset.rows.find((row) => {\n      for (const key of Object.keys(row)) {\n        if ((row as Record<string, unknown>)[key] === id) {\n          return true;\n        }\n      }\n      return false;\n    });\n  }\n\n  getRowByIndex(index: number): TRow | undefined {\n    return this.dataset.rows[index];\n  }\n\n  getAllRows(): TRow[] {\n    return [...this.dataset.rows];\n  }\n\n  size(): number {\n    return this.dataset.rows.length;\n  }\n}\n","import { Context, FieldGenerator } from '../types.js';\n\n/**\n * Configuration for a user persona.\n */\nexport interface PersonaDefinition {\n  id: string;\n  name: string;\n  /**\n   * Attributes to initialize in the user's context.\n   * Can include 'locale' to set the faker locale.\n   */\n  attributes: Record<string, FieldGenerator>;\n}\n\n/**\n * Represents an instantiated persona.\n */\nexport interface Persona {\n  id: string;\n  name: string;\n  attributes: Record<string, unknown>;\n}\n\n/**\n * Defines a new persona.\n */\nexport function definePersona(config: PersonaDefinition): PersonaDefinition {\n  return config;\n}\n\n/**\n * Generates a concrete persona instance from a definition.\n * This resolves all dynamic fields and weighted distributions.\n */\nexport async function generatePersona(\n  definition: PersonaDefinition,\n  baseContext: Context,\n): Promise<Persona> {\n  const attributes: Record<string, unknown> = {};\n\n  for (const [key, generator] of Object.entries(definition.attributes)) {\n    if (typeof generator === 'function') {\n      // Execute generator with base context (which might have default locale)\n      const genFn = generator as (\n        context: Context,\n        payload: Record<string, unknown>,\n      ) => Promise<unknown>;\n      attributes[key] = await genFn(baseContext, attributes);\n    } else {\n      attributes[key] = generator;\n    }\n  }\n\n  return {\n    id: definition.id,\n    name: definition.name,\n    attributes,\n  };\n}\n","import { Dataset, DatasetDefinition, DatasetRow, Context } from '../types.js';\n\n/**\n * Defines a new dataset with type inference support.\n *\n * @example\n * ```typescript\n * const products = defineDataset({\n *   id: 'products',\n *   name: 'Products',\n *   count: 100,\n *   fields: {\n *     id: (ctx, row) => `prod-${row.index}`,\n *     name: (ctx) => ctx.faker.commerce.productName(),\n *     price: (ctx) => ctx.faker.number.float({ min: 10, max: 500 }),\n *   },\n * });\n *\n * // Type inference works automatically\n * type Product = InferDatasetRow<typeof products>;\n * ```\n */\nexport function defineDataset<TFields extends Record<string, unknown>>(\n  config: DatasetDefinition<TFields>,\n): DatasetDefinition<TFields> {\n  return config;\n}\n\n/**\n * Generates a concrete dataset from a definition.\n * @param definition The dataset definition.\n * @param context Context providing access to faker, other datasets, and user data.\n */\nexport async function generateDataset<TFields extends Record<string, unknown>>(\n  definition: DatasetDefinition<TFields>,\n  context: Context,\n): Promise<Dataset> {\n  if (!Number.isFinite(definition.count) || definition.count < 0 || definition.count > 10_000_000) {\n    throw new Error(\n      `Dataset '${definition.id}' count must be a finite number between 0 and 10,000,000, got ${String(definition.count)}`,\n    );\n  }\n\n  const rows: DatasetRow[] = [];\n\n  for (let index = 0; index < definition.count; index++) {\n    const row: DatasetRow = {};\n\n    for (const [key, generator] of Object.entries(definition.fields)) {\n      if (typeof generator === 'function') {\n        // Execute generator with context and row metadata\n        const genFn = generator as (\n          context: Context,\n          rowMeta: { index: number; data: DatasetRow },\n        ) => Promise<unknown>;\n        row[key] = await genFn(context, { index, data: row });\n      } else {\n        // Use static value\n        row[key] = generator;\n      }\n    }\n\n    rows.push(row);\n  }\n\n  return {\n    id: definition.id,\n    name: definition.name,\n    rows,\n  };\n}\n","import { TimeSpan } from '../types.js';\n\n/**\n * Generates a delay in milliseconds based on a time span configuration.\n */\nexport function generateDelay(timeSpan: TimeSpan): number {\n  const { min, max, distribution = 'uniform' } = timeSpan;\n\n  switch (distribution) {\n    case 'uniform':\n      return min + Math.random() * (max - min);\n\n    case 'gaussian': {\n      // Box-Muller transform for Gaussian distribution\n      const mean = (min + max) / 2;\n      const stdDev = (max - min) / 6; // 99.7% within range\n      const u1 = Math.random();\n      const u2 = Math.random();\n      const z0 = Math.sqrt(-2.0 * Math.log(u1)) * Math.cos(2.0 * Math.PI * u2);\n      const value = mean + z0 * stdDev;\n      // Clamp to min/max\n      return Math.max(min, Math.min(max, value));\n    }\n\n    case 'exponential': {\n      // Exponential distribution (more shorter delays, fewer long delays)\n      const lambda = 1 / (max - min);\n      const value = min - Math.log(1 - Math.random()) / lambda;\n      return Math.min(max, value);\n    }\n\n    default:\n      return min + Math.random() * (max - min);\n  }\n}\n\n/**\n * Checks if a bounce should occur based on probability.\n */\nexport function shouldBounce(bounceChance?: number): boolean {\n  if (!bounceChance) return false;\n  return Math.random() < bounceChance;\n}\n","import { Journey, Event } from '../types.js';\nimport { SynodeContext } from '../state/context.js';\nimport { SynodeError } from '../errors.js';\nimport { generateDelay, shouldBounce } from '../monitoring/timing.js';\n\nexport class Engine {\n  constructor(private journey: Journey) {}\n\n  /**\n   * Executes the journey and yields events.\n   * @param context Optional context to use. If not provided, a new one is created.\n   */\n  async *run(context?: SynodeContext): AsyncGenerator<Event> {\n    // Initialize context for this run (user) if not provided\n    const ctx = context ?? new SynodeContext();\n\n    // Rotate session ID for this journey run\n    ctx.rotateSession();\n\n    // Check journey prerequisites\n    if (this.journey.requires) {\n      for (const requiredJourneyId of this.journey.requires) {\n        if (!ctx.hasCompletedJourney(requiredJourneyId)) {\n          // Prerequisites not met, skip this journey\n          return;\n        }\n      }\n    }\n\n    // Check if journey should bounce before starting\n    if (shouldBounce(this.journey.bounceChance)) {\n      // Apply suppression period and return without generating events\n      if (this.journey.suppressionPeriod) {\n        const suppressionDelay = generateDelay(this.journey.suppressionPeriod);\n        ctx.advanceTime(suppressionDelay);\n      }\n      return;\n    }\n\n    // Execute adventures in sequence\n    for (const adventure of this.journey.adventures) {\n      // Check adventure bounce\n      if (shouldBounce(adventure.bounceChance)) {\n        if (adventure.onBounce === 'skip') {\n          // Clear adventure-scoped fields before skipping\n          ctx.clearScope('adventure');\n          // Skip to next adventure\n          continue;\n        } else {\n          // Clear adventure-scoped fields before stopping\n          ctx.clearScope('adventure');\n          // Stop the entire journey\n          break;\n        }\n      }\n\n      // Execute actions in sequence\n      for (const action of adventure.actions) {\n        // Check action bounce\n        if (shouldBounce(action.bounceChance)) {\n          // Clear action-scoped fields before breaking\n          ctx.clearScope('action');\n          break; // Stop this adventure\n        }\n\n        // Apply delay before action (from adventure's timeSpan)\n        if (adventure.timeSpan) {\n          const delay = generateDelay(adventure.timeSpan);\n          ctx.advanceTime(delay);\n        }\n\n        // Execute the action handler to get events\n        const actionPath = [this.journey.id, adventure.id, action.id];\n        let events: Event[];\n        try {\n          events = await action.handler(ctx);\n        } catch (err) {\n          if (err instanceof SynodeError) {\n            throw err;\n          }\n          const errorName = err instanceof Error ? err.constructor.name : 'UnknownError';\n          const errorMessage = err instanceof Error ? err.message : String(err);\n          throw new SynodeError({\n            code: 'HANDLER_ERROR',\n            message: `${errorName}: ${errorMessage} (userId: ${ctx.userId}, sessionId: ${ctx.sessionId})`,\n            path: actionPath,\n            cause: err,\n          });\n        }\n\n        if (!Array.isArray(events)) {\n          throw new SynodeError({\n            code: 'INVALID_HANDLER_RETURN',\n            message: `Action handler must return an array of Events, got ${typeof events}`,\n            path: actionPath,\n          });\n        }\n\n        // Yield events with timing between them\n        for (let i = 0; i < events.length; i++) {\n          if (i > 0 && action.timeSpan) {\n            // Apply delay between events within the same action\n            const delay = generateDelay(action.timeSpan);\n            ctx.advanceTime(delay);\n            // Update event timestamp\n            events[i].timestamp = ctx.now();\n          }\n          yield events[i];\n        }\n\n        // Clear action-scoped fields after action completes\n        ctx.clearScope('action');\n      }\n\n      // Clear adventure-scoped fields after adventure completes\n      ctx.clearScope('adventure');\n    }\n\n    // Mark journey as complete\n    ctx.markJourneyComplete(this.journey.id);\n\n    // Clear journey-scoped fields after journey completes\n    ctx.clearScope('journey');\n\n    // Apply suppression period after completion\n    if (this.journey.suppressionPeriod) {\n      const suppressionDelay = generateDelay(this.journey.suppressionPeriod);\n      ctx.advanceTime(suppressionDelay);\n    }\n  }\n}\n"],"mappings":";;;AAuCA,MAAM,cAAc;CAAC;CAAW;CAAa;CAAU;CAAO;;;;;;;;;AAU9D,SAAgB,mBAAmB,SAAiB,MAAgB,YAA6B;CAC/F,IAAI,YAAY;AAEhB,KAAI,KAAK,SAAS,EAIhB,aAAY,IAHK,KAAK,KACnB,SAAS,MAAM,GAAG,YAAY,KAAK,IAAI,GAAG,YAAY,SAAS,EAAE,EAAE,IAAI,QAAQ,GACjF,CACwB,KAAK,MAAM,CAAC,IAAI;AAG3C,KAAI,WACF,cAAa,KAAK;AAGpB,QAAO;;;;;;;;;;;;;;;;AAiBT,IAAa,cAAb,cAAiC,MAAM;;CAErC,AAAS;;CAGT,AAAS;;CAGT,AAAS;;CAGT,AAAS;;CAGT,AAAS;;CAGT,AAAS;CAET,YAAY,SAA6B;EACvC,MAAM,YAAY,mBAAmB,QAAQ,SAAS,QAAQ,MAAM,QAAQ,WAAW;AACvF,QAAM,WAAW,EAAE,OAAO,QAAQ,OAAO,CAAC;AAC1C,OAAK,OAAO;AACZ,OAAK,OAAO,QAAQ;AACpB,OAAK,OAAO,QAAQ;AACpB,OAAK,aAAa,QAAQ;AAC1B,OAAK,aAAa,QAAQ;AAC1B,OAAK,WAAW,QAAQ;AACxB,OAAK,WAAW,QAAQ;;;;;;;;;;;;;;;;;;;CAoB1B,SAAiB;EACf,MAAMA,QAAkB,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,aAAa;AAE7D,MAAI,KAAK,KAAK,SAAS,GAAG;GACxB,MAAM,WAAW,KAAK,KAAK,KACxB,SAAS,MAAM,GAAG,YAAY,KAAK,IAAI,GAAG,YAAY,SAAS,EAAE,EAAE,IAAI,QAAQ,GACjF;AACD,SAAM,KAAK,WAAW,SAAS,KAAK,MAAM,GAAG;;AAG/C,MAAI,KAAK,aAAa,OACpB,OAAM,KAAK,eAAe,KAAK,WAAW;AAG5C,MAAI,KAAK,aAAa,OACpB,OAAM,KAAK,eAAe,KAAK,WAAW;AAG5C,MAAI,KAAK,WACP,OAAM,KAAK,UAAU,KAAK,aAAa;AAGzC,SAAO,MAAM,KAAK,KAAK;;;;;;;;;;;AAY3B,SAAgB,YAAY,GAAW,GAAmB;AACxD,KAAI,MAAM,EAAG,QAAO;AACpB,KAAI,EAAE,WAAW,EAAG,QAAO,EAAE;AAC7B,KAAI,EAAE,WAAW,EAAG,QAAO,EAAE;CAG7B,IAAI,OAAO,IAAI,MAAc,EAAE,SAAS,EAAE;CAC1C,IAAI,OAAO,IAAI,MAAc,EAAE,SAAS,EAAE;AAE1C,MAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC7B,MAAK,KAAK;AAGZ,MAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,KAAK;AAClC,OAAK,KAAK;AACV,OAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,KAAK;GAClC,MAAM,OAAO,EAAE,IAAI,OAAO,EAAE,IAAI,KAAK,IAAI;AACzC,QAAK,KAAK,KAAK,IACb,KAAK,KAAK,GACV,KAAK,IAAI,KAAK,GACd,KAAK,IAAI,KAAK,KACf;;AAEH,GAAC,MAAM,QAAQ,CAAC,MAAM,KAAK;;AAG7B,QAAO,KAAK,EAAE;;;;;;;;;;;;;AAchB,SAAgB,eAAe,OAAe,YAA0C;AACtF,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,IAAIC;CACJ,IAAI,eAAe;AAEnB,MAAK,MAAM,aAAa,YAAY;EAClC,MAAM,WAAW,YAAY,OAAO,UAAU;EAC9C,MAAM,SAAS,KAAK,IAAI,MAAM,QAAQ,UAAU,OAAO;AAGvD,MAAI,YAFc,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,GAAI,CAAC,IAE1B,WAAW,cAAc;AACpD,kBAAe;AACf,eAAY;;;AAIhB,QAAO;;;;;;;;;;;AAYT,SAAgB,wBACd,MACA,WACA,WACQ;CACR,MAAM,UAAU,eAAe,WAAW,UAAU;CACpD,MAAMC,QAAkB,EAAE;AAE1B,KAAI,QACF,OAAM,KAAK,iBAAiB,QAAQ,IAAI;AAG1C,OAAM,KAAK,aAAa,KAAK,MAAM,UAAU,KAAK,KAAK,CAAC,GAAG;AAE3D,QAAO,MAAM,KAAK,IAAI;;;;;;;;AC3OxB,MAAaC,qBAAkC,EAC7C,SAAS,QAAiB;CACxB,MAAM,OAAO,OAAO,YAAY;AAChC,QAAO,SAAS,GAAG,OAAO,GAAG,SAAS;GAEzC;;;;ACID,IAAa,gBAAb,MAA8C;CAC5C,AAAQ,wBAAQ,IAAI,KAAsB;CAC1C,AAAQ,gCAAgB,IAAI,KAA4B;CACxD,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ;CACR,AAAQ,oCAAoB,IAAI,KAAa;CAC7C,AAAQ,2BAAW,IAAI,KAAsB;CAE7C,YACE,4BAAkB,IAAI,MAAM,EAC5B,AAAQC,cAA2B,oBACnC,AAAgB,SAAS,MACzB;EAFQ;EACQ;AAEhB,OAAK,cAAc,IAAI,KAAK,UAAU;AACtC,OAAK,UAAU,YAAY,SAAS,OAAO;AAC3C,OAAK,aAAa,YAAY,SAAS,UAAU;EAGjD,MAAM,YAAY,WAAW;AAC7B,OAAK,SAAS,IAAI,MAAM,EAAE,QAAQ,WAAW,CAAC;;CAGhD,IAAI,QAAe;AACjB,SAAO,KAAK;;CAGd,IAAI,SAAiB;AACnB,SAAO,KAAK;;CAGd,IAAI,YAAoB;AACtB,SAAO,KAAK;;CAId,IAAO,KAA4B;AACjC,SAAO,KAAK,MAAM,IAAI,IAAI;;;;;;;;;;;;;;;;;;;;;;CAwB5B,IAAO,KAAa,OAAU,SAAmC;AAC/D,OAAK,MAAM,IAAI,KAAK,MAAM;AAC1B,MAAI,SAAS,MACX,MAAK,cAAc,IAAI,KAAK,EAAE,OAAO,QAAQ,OAAO,CAAC;MAGrD,MAAK,cAAc,OAAO,IAAI;;CAIlC,MAAY;AACV,SAAO,IAAI,KAAK,KAAK,YAAY;;CAGnC,WAAW,QAAyB;AAClC,SAAO,KAAK,YAAY,SAAS,OAAO;;CAG1C,oBAAoB,WAA4B;AAC9C,SAAO,KAAK,kBAAkB,IAAI,UAAU;;CAG9C,oBAAoB,WAAyB;AAC3C,OAAK,kBAAkB,IAAI,UAAU;;CAGvC,QAAQ,IAA2B;EACjC,MAAM,KAAK,KAAK,SAAS,IAAI,GAAG;AAChC,MAAI,CAAC,IAAI;GACP,MAAM,YAAY,CAAC,GAAG,KAAK,SAAS,MAAM,CAAC;GAC3C,MAAM,aACJ,UAAU,SAAS,IAAI,wBAAwB,WAAW,IAAI,UAAU,GAAG;AAC7E,SAAM,IAAI,YAAY;IACpB,MAAM;IACN,SAAS,YAAY,GAAG;IACxB,MAAM,EAAE;IACR;IACD,CAAC;;AAEJ,SAAO,IAAI,kBAAkB,GAAG;;CAGlC,aAAsC,IAAiC;EACrE,MAAM,KAAK,KAAK,SAAS,IAAI,GAAG;AAChC,MAAI,CAAC,IAAI;GACP,MAAM,YAAY,CAAC,GAAG,KAAK,SAAS,MAAM,CAAC;GAC3C,MAAM,aACJ,UAAU,SAAS,IAAI,wBAAwB,WAAW,IAAI,UAAU,GAAG;AAC7E,SAAM,IAAI,YAAY;IACpB,MAAM;IACN,SAAS,YAAY,GAAG;IACxB,MAAM,EAAE;IACR;IACD,CAAC;;AAEJ,SAAO,IAAI,kBAAwB,GAAoB;;;;;CAMzD,gBAAgB,SAAwB;AACtC,OAAK,SAAS,IAAI,QAAQ,IAAI,QAAQ;;;;;CAMxC,YAAY,IAAkB;AAC5B,OAAK,cAAc,IAAI,KAAK,KAAK,YAAY,SAAS,GAAG,GAAG;;;;;CAM9D,gBAAsB;AACpB,OAAK,aAAa,KAAK,YAAY,SAAS,UAAU;;;;;;CAOxD,WAAW,OAA2B;EACpC,MAAMC,eAAyB,EAAE;AACjC,OAAK,MAAM,CAAC,KAAK,aAAa,KAAK,cAAc,SAAS,CACxD,KAAI,SAAS,UAAU,MACrB,cAAa,KAAK,IAAI;AAG1B,OAAK,MAAM,OAAO,cAAc;AAC9B,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,cAAc,OAAO,IAAI;;;;;;;AAQpC,IAAM,oBAAN,MAA6F;CAC3F,YAAY,AAAQC,SAAwB;EAAxB;;CAEpB,YAAkB;AAChB,MAAI,KAAK,QAAQ,KAAK,WAAW,EAC/B,OAAM,IAAI,MAAM,YAAY,KAAK,QAAQ,GAAG,aAAa;EAE3D,MAAM,QAAQ,KAAK,MAAM,KAAK,QAAQ,GAAG,KAAK,QAAQ,KAAK,OAAO;AAClE,SAAO,KAAK,QAAQ,KAAK;;CAG3B,WAAW,IAAuC;AAEhD,SAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ;AACrC,QAAK,MAAM,OAAO,OAAO,KAAK,IAAI,CAChC,KAAK,IAAgC,SAAS,GAC5C,QAAO;AAGX,UAAO;IACP;;CAGJ,cAAc,OAAiC;AAC7C,SAAO,KAAK,QAAQ,KAAK;;CAG3B,aAAqB;AACnB,SAAO,CAAC,GAAG,KAAK,QAAQ,KAAK;;CAG/B,OAAe;AACb,SAAO,KAAK,QAAQ,KAAK;;;;;;;;;AC1L7B,SAAgB,cAAc,QAA8C;AAC1E,QAAO;;;;;;AAOT,eAAsB,gBACpB,YACA,aACkB;CAClB,MAAMC,aAAsC,EAAE;AAE9C,MAAK,MAAM,CAAC,KAAK,cAAc,OAAO,QAAQ,WAAW,WAAW,CAClE,KAAI,OAAO,cAAc,WAMvB,YAAW,OAAO,MAJJ,UAIgB,aAAa,WAAW;KAEtD,YAAW,OAAO;AAItB,QAAO;EACL,IAAI,WAAW;EACf,MAAM,WAAW;EACjB;EACD;;;;;;;;;;;;;;;;;;;;;;;;;ACpCH,SAAgB,cACd,QAC4B;AAC5B,QAAO;;;;;;;AAQT,eAAsB,gBACpB,YACA,SACkB;AAClB,KAAI,CAAC,OAAO,SAAS,WAAW,MAAM,IAAI,WAAW,QAAQ,KAAK,WAAW,QAAQ,IACnF,OAAM,IAAI,MACR,YAAY,WAAW,GAAG,gEAAgE,OAAO,WAAW,MAAM,GACnH;CAGH,MAAMC,OAAqB,EAAE;AAE7B,MAAK,IAAI,QAAQ,GAAG,QAAQ,WAAW,OAAO,SAAS;EACrD,MAAMC,MAAkB,EAAE;AAE1B,OAAK,MAAM,CAAC,KAAK,cAAc,OAAO,QAAQ,WAAW,OAAO,CAC9D,KAAI,OAAO,cAAc,WAMvB,KAAI,OAAO,MAJG,UAIS,SAAS;GAAE;GAAO,MAAM;GAAK,CAAC;MAGrD,KAAI,OAAO;AAIf,OAAK,KAAK,IAAI;;AAGhB,QAAO;EACL,IAAI,WAAW;EACf,MAAM,WAAW;EACjB;EACD;;;;;;;;AChEH,SAAgB,cAAc,UAA4B;CACxD,MAAM,EAAE,KAAK,KAAK,eAAe,cAAc;AAE/C,SAAQ,cAAR;EACE,KAAK,UACH,QAAO,MAAM,KAAK,QAAQ,IAAI,MAAM;EAEtC,KAAK,YAAY;GAEf,MAAM,QAAQ,MAAM,OAAO;GAC3B,MAAM,UAAU,MAAM,OAAO;GAC7B,MAAM,KAAK,KAAK,QAAQ;GACxB,MAAM,KAAK,KAAK,QAAQ;GAExB,MAAM,QAAQ,OADH,KAAK,KAAK,KAAO,KAAK,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAM,KAAK,KAAK,GAAG,GAC9C;AAE1B,UAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,CAAC;;EAG5C,KAAK,eAAe;GAElB,MAAM,SAAS,KAAK,MAAM;GAC1B,MAAM,QAAQ,MAAM,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,GAAG;AAClD,UAAO,KAAK,IAAI,KAAK,MAAM;;EAG7B,QACE,QAAO,MAAM,KAAK,QAAQ,IAAI,MAAM;;;;;;AAO1C,SAAgB,aAAa,cAAgC;AAC3D,KAAI,CAAC,aAAc,QAAO;AAC1B,QAAO,KAAK,QAAQ,GAAG;;;;;ACpCzB,IAAa,SAAb,MAAoB;CAClB,YAAY,AAAQC,SAAkB;EAAlB;;;;;;CAMpB,OAAO,IAAI,SAAgD;EAEzD,MAAM,MAAM,WAAW,IAAI,eAAe;AAG1C,MAAI,eAAe;AAGnB,MAAI,KAAK,QAAQ,UACf;QAAK,MAAM,qBAAqB,KAAK,QAAQ,SAC3C,KAAI,CAAC,IAAI,oBAAoB,kBAAkB,CAE7C;;AAMN,MAAI,aAAa,KAAK,QAAQ,aAAa,EAAE;AAE3C,OAAI,KAAK,QAAQ,mBAAmB;IAClC,MAAM,mBAAmB,cAAc,KAAK,QAAQ,kBAAkB;AACtE,QAAI,YAAY,iBAAiB;;AAEnC;;AAIF,OAAK,MAAM,aAAa,KAAK,QAAQ,YAAY;AAE/C,OAAI,aAAa,UAAU,aAAa,CACtC,KAAI,UAAU,aAAa,QAAQ;AAEjC,QAAI,WAAW,YAAY;AAE3B;UACK;AAEL,QAAI,WAAW,YAAY;AAE3B;;AAKJ,QAAK,MAAM,UAAU,UAAU,SAAS;AAEtC,QAAI,aAAa,OAAO,aAAa,EAAE;AAErC,SAAI,WAAW,SAAS;AACxB;;AAIF,QAAI,UAAU,UAAU;KACtB,MAAM,QAAQ,cAAc,UAAU,SAAS;AAC/C,SAAI,YAAY,MAAM;;IAIxB,MAAM,aAAa;KAAC,KAAK,QAAQ;KAAI,UAAU;KAAI,OAAO;KAAG;IAC7D,IAAIC;AACJ,QAAI;AACF,cAAS,MAAM,OAAO,QAAQ,IAAI;aAC3B,KAAK;AACZ,SAAI,eAAe,YACjB,OAAM;AAIR,WAAM,IAAI,YAAY;MACpB,MAAM;MACN,SAAS,GAJO,eAAe,QAAQ,IAAI,YAAY,OAAO,eAIxC,IAHH,eAAe,QAAQ,IAAI,UAAU,OAAO,IAAI,CAG5B,YAAY,IAAI,OAAO,eAAe,IAAI,UAAU;MAC3F,MAAM;MACN,OAAO;MACR,CAAC;;AAGJ,QAAI,CAAC,MAAM,QAAQ,OAAO,CACxB,OAAM,IAAI,YAAY;KACpB,MAAM;KACN,SAAS,sDAAsD,OAAO;KACtE,MAAM;KACP,CAAC;AAIJ,SAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,SAAI,IAAI,KAAK,OAAO,UAAU;MAE5B,MAAM,QAAQ,cAAc,OAAO,SAAS;AAC5C,UAAI,YAAY,MAAM;AAEtB,aAAO,GAAG,YAAY,IAAI,KAAK;;AAEjC,WAAM,OAAO;;AAIf,QAAI,WAAW,SAAS;;AAI1B,OAAI,WAAW,YAAY;;AAI7B,MAAI,oBAAoB,KAAK,QAAQ,GAAG;AAGxC,MAAI,WAAW,UAAU;AAGzB,MAAI,KAAK,QAAQ,mBAAmB;GAClC,MAAM,mBAAmB,cAAc,KAAK,QAAQ,kBAAkB;AACtE,OAAI,YAAY,iBAAiB"}