@lunora/client 0.0.0 → 1.0.0-alpha.10

package/dist/index.d.ts

@@ -0,0 +1,385 @@
+import { c as PersistenceAdapter, B as BookmarkStorage, F as FunctionReference, A as ArgsOf, M as MutationCallOptions, R as ReturnOf, O as OfflineQueueOptions, Q as QueryCacheAdapter, d as ReconnectOptions } from "./packem_shared/lunora-client.d-B5vWSgvD.js";
+export { type C as CachedQuery, type e as ClientMessage, type f as ClientShapeSubscribeMessage, type g as ClientShapeUnsubscribeMessage, type h as ConnectionStatus, D as DEFAULT_MAX_BUFFER, type i as FunctionArgumentDescriptor, type j as FunctionDescriptor, type G as GlobalFacetResult, type k as GlobalFacetValue, type l as GlobalFilterClause, type m as GlobalTableInfo, type n as GlobalTablePage, L as LunoraClient, type o as LunoraClientOptions, type p as MutationSettledEvent, type q as OptimisticLocalStore, type r as OptimisticUpdate, type s as OutboxMutation, type t as OutboxSink, type u as PersistedMutation, type P as Preloaded, type v as RowOp, type w as RpcEnvelope, type x as RpcResponseBody, type y as ScheduleRecord, type z as SchedulerPoolStatus, type E as SchedulerStatus, type H as ServerMessage, type I as ServerPokeEndMessage, type J as ServerPokePartMessage, type K as ServerPokeStartMessage, type N as ShardTrafficEntry, type T as ShardTrafficResult, type V as StorageListPage, type W as StorageObject, type X as StreamHandle, type Y as StreamIterable, type Z as SubscriptionCallback, type S as SubscriptionError, type b as SubscriptionErrorCallback, _ as SubscriptionRegistry, type $ as SubscriptionState, type a0 as SyncWatermark, type a as Unsubscribe, type U as User, type a1 as WorkflowInstanceAction, type a2 as WorkflowInstanceDetail, type a3 as WorkflowInstancePage, type a4 as WorkflowInstanceStatus, type a5 as WorkflowInstanceSummary, type a6 as WorkflowStepDetail, a7 as createLocalStore, a8 as createStream } from "./packem_shared/lunora-client.d-B5vWSgvD.js";
+export { p as preloadQuery, a as preloadedQueryResult } from "./packem_shared/preload.d-CKZR675M.js";
+export type { AuthCapabilities, AuthImpersonation, AuthPage, AuthSession, AuthUser, CronJobInfo, VectorIndexSummary, VectorQueryMatch } from '@lunora/runtime';
+/**
+* The slice of React Native's `AsyncStorage` (or any async key/value store —
+* Expo `SecureStore`, a wrapped `localForage`, an in-memory map in tests) this
+* adapter needs. Matches `@react-native-async-storage/async-storage`'s core
+* surface, so you can pass the module straight in.
+*/
+interface AsyncStorageLike {
+  getItem: (key: string) => Promise<string | null>;
+  removeItem: (key: string) => Promise<void>;
+  setItem: (key: string, value: string) => Promise<void>;
+}
+interface AsyncStoragePersistenceOptions {
+  /** Storage key the FIFO mutation log is serialized under; defaults to `"lunora:offline-mutations"`. */
+  key?: string;
+  /** The async key/value store the log is read from and written to (e.g. React Native `AsyncStorage`). */
+  storage: AsyncStorageLike;
+}
+/**
+* Builds a {@link PersistenceAdapter} over an async key/value store — the React
+* Native / Expo counterpart to the IndexedDB adapter (`createIndexedDbPersistence`).
+* The whole FIFO mutation log is serialized to JSON under a single key (`key`),
+* so enqueue order is preserved and `load()` returns freshly-parsed records that
+* callers can't alias.
+*
+* AsyncStorage has no transactions, so every read-modify-write is funnelled
+* through a single promise chain — concurrent `append`/`remove` calls run one at
+* a time and can't clobber each other's writes.
+*/
+declare const createAsyncStoragePersistence: (options: AsyncStoragePersistenceOptions) => PersistenceAdapter;
+/** Default in-memory bookmark store. Survives the lifetime of the client. */
+declare const createInMemoryBookmarkStorage: () => BookmarkStorage;
+/**
+* Client-side incremental merging of structured mutation deltas.
+*
+* Lunora's live-query fan-out has two server paths:
+*
+* 1. Server re-execution (subscriptions carrying a `functionPath`) pushes a
+* full `data` snapshot whenever a write touches a table the query reads. These
+* already carry the authoritative result and are applied wholesale.
+* 2. Legacy delta fan-out (`broadcastDelta`) pushes a structured `MutationDelta`
+* as a `delta` frame to subscribers matched by table + args. The delta describes
+* a single row change (`insert` / `update` / `delete`) keyed by row id, so the
+* client can splice it into the cached list result without a full re-send.
+*
+* Historically the client treated the `delta` field as an opaque blob and
+* replaced the whole cached value with it on every message — which only made
+* sense for the rare delta payloads that already carried the full result. This
+* module lets the client recognise a structured delta and merge it into the
+* existing array (preserving order, no dup/loss), falling back to full
+* replacement when the payload isn't a recognisable row delta or can't be
+* applied cleanly against the current cached shape.
+*/
+/**
+* One row change as emitted by `@lunora/do`'s `broadcastDelta`. Mirrors
+* `MutationDelta` in `@lunora/do` structurally so the client carries no
+* dependency on it. `row` is absent on `delete` events (and may be absent on
+* older servers for any op).
+*/
+interface MutationDelta {
+  /** Row id (`_id`) the change applies to. */
+  key: string;
+  op: "delete" | "insert" | "update";
+  row?: Record<string, unknown>;
+  table: string;
+}
+/**
+* Structural guard: is `value` a `MutationDelta` the client knows how to merge?
+* We require `op`, `table`, and a string `key` so opaque payloads that merely
+* happen to be objects (e.g. an aggregate `{ count: 1 }` a query returns
+* verbatim) are never mistaken for a row delta and keep replacing the cached
+* value wholesale.
+*/
+declare const isMutationDelta: (value: unknown) => value is MutationDelta;
+/**
+* Apply a structured `MutationDelta` to a cached array result, returning a new
+* array (never mutating the input). Returns `undefined` when the delta can't be
+* applied cleanly — the caller should then fall back to the existing
+* full-replacement behaviour (or trust the next snapshot to reconcile).
+*
+* Mergeable shape: a plain array of id-bearing row objects, e.g. the result of
+* `db.query().collect()`.
+*
+* Insert / update / delete are matched by row `_id`:
+* - `insert`: appended (or placed by `_creationTime` order) if absent; treated
+* as an update if a row with the same id already exists (idempotent — guards
+* against a delta replayed after a snapshot already included it).
+* - `update`: replaces the matching row in place, preserving its position.
+* - `delete`: removes the matching row.
+*
+* Returns `undefined` when `current` isn't an array of id-keyable objects, or
+* when an `insert`/`update` delta carries no `row` to splice in.
+*/
+declare const applyDelta: (current: unknown, delta: MutationDelta) => undefined | unknown[];
+/** Error code the server uses for optimistic-concurrency conflicts (HTTP 409). */
+declare const CONFLICT_ERROR_CODE = "CONFLICT";
+/**
+* Whether an unknown rejection is an optimistic-concurrency conflict — the
+* server lost a write race and the caller should refetch and retry (or surface
+* the conflict). Structural check on the `code` property the client attaches
+* when decoding the worker's `{ error: { code, message } }` envelope.
+*/
+declare const isConflictError: (error: unknown) => error is Error & {
+  code: "CONFLICT";
+};
+/** The single transport method a mutation runner needs — narrowed so adapters can test against a stub. */
+interface MutationCapableClient<F extends FunctionReference> {
+  mutation: (function_: F, args: ArgsOf<F>, options?: MutationCallOptions<unknown, unknown, ArgsOf<F>>) => Promise<ReturnOf<F>>;
+}
+/**
+* Reactive sinks an adapter binds to its own primitive's setters (a Solid
+* signal, a Vue ref, a Svelte store). The runner pushes into them; how they
+* store the value is the adapter's concern (e.g. Solid wraps function-valued
+* results in a thunk).
+*/
+interface MutationRunnerSinks<R> {
+  /** Receives the normalized {@link Error} when an invocation rejects. */
+  setError: (error: Error) => void;
+  /** Receives `true` while at least one invocation is in flight (ref-counted across overlapping calls), else `false`. */
+  setPending: (pending: boolean) => void;
+  /** Receives the resolved value when an invocation succeeds. */
+  setResult: (result: R) => void;
+}
+/**
+* Build the framework-neutral `mutate` half of an adapter's mutation hook.
+*
+* Owns the orchestration every adapter otherwise copy-pastes: ref-counts
+* overlapping invocations into `setPending` (so it only clears once the last
+* settles), normalizes a thrown non-`Error`, and routes success/failure to
+* `setResult`/`setError` before re-throwing. Each adapter (`@lunora/react`,
+* `/solid`, `/svelte`, `/vue`) binds the three sinks to its own reactive
+* setters, so this logic lives in exactly one place. Optimistic-update options
+* pass straight through to `client.mutation`.
+*/
+declare const createMutationRunner: <F extends FunctionReference>(client: MutationCapableClient<F>, function_: F, sinks: MutationRunnerSinks<ReturnOf<F>>) => ((args: ArgsOf<F>, options?: MutationCallOptions<unknown, unknown, ArgsOf<F>>) => Promise<ReturnOf<F>>);
+/**
+* The structural surface of a TanStack `Transaction` a bound custom mutator
+* returns — its `isPersisted.promise` resolves once the write is persisted and
+* rejects on failure. Typed structurally so the framework adapters need not
+* depend on `@tanstack/db` or `@lunora/db` (the handle is created app-side by
+* `bindMutators`).
+*/
+interface MutatorTransaction {
+  isPersisted: {
+    promise: Promise<unknown>;
+  };
+}
+/**
+* A bound custom-mutator handle produced by `bindMutators(client, ctx, mutators)`
+* in `@lunora/db`. Calling it applies the optimistic overlay to the local
+* collections and pushes the authoritative server write; it returns the TanStack
+* transaction whose `isPersisted` promise tracks completion.
+*/
+type MutatorHandle<TArgs> = (args: TArgs) => MutatorTransaction;
+/**
+* Reactive sinks an adapter binds to its own primitive's setters (a React
+* `useState`, a Solid signal, a Vue ref, a Svelte store). The runner pushes into
+* them; how they store the value is the adapter's concern.
+*/
+interface MutatorRunnerSinks {
+  /** Receives the normalized {@link Error} when an invocation rejects, or `undefined` on success / reset. */
+  setError: (error: Error | undefined) => void;
+  /** Receives `true` while at least one invocation is in flight (ref-counted across overlapping calls), else `false`. */
+  setPending: (pending: boolean) => void;
+}
+/**
+* Build the framework-neutral `mutate` / `reset` pair of an adapter's
+* custom-mutator hook (`useMutator` / `createMutator` / `mutator`).
+*
+* Owns the orchestration every adapter otherwise copy-pastes: ref-counts
+* overlapping invocations into `setPending` (so it only clears once the last
+* settles), awaits the bound handle's `isPersisted` promise, normalizes a thrown
+* non-`Error`, and routes failure to `setError` (clearing it on success) before
+* re-throwing. Each adapter (`@lunora/react`, `/solid`, `/svelte`, `/vue`) binds
+* the two sinks to its own reactive setters, so this logic lives in exactly one
+* place. The optimistic overlay + server push are owned by the bound handle.
+*
+* `error` tracks the LATEST invocation, not the last to settle: overlapping
+* calls can resolve out of order, so an earlier call that finishes later must
+* not clobber a newer call's outcome. Each invocation takes a monotonic token
+* and only writes `setError` while it is still the most recent one — otherwise
+* `error`/`isError` could surface a stale success or failure (the documented
+* "latest invocation's error" contract every adapter advertises).
+*/
+declare const createMutatorRunner: <TArgs>(handle: MutatorHandle<TArgs>, sinks: MutatorRunnerSinks) => {
+  mutate: (args: TArgs) => Promise<void>;
+  reset: () => void;
+};
+interface QueuedMutation<T = unknown> {
+  readonly args: Record<string, unknown>;
+  readonly functionPath: string;
+  /** Stable id used to remove the entry from durable storage once replayed; assigned by the queue when absent. */
+  id?: string;
+  /**
+  * Issuing identity fingerprint carried through to durable storage (`null` =
+  * signed out). Absent on hydrated legacy records, which replay ambiently.
+  */
+  readonly identity?: string | null;
+  /**
+  * `true` when a live caller is still awaiting this write's `mutation()`
+  * Promise; `false`/absent for a write restored from durable storage after a
+  * reload (its original awaiter is gone). Carried so terminal-verdict
+  * observers can distinguish "the caller already saw this" from "nothing else
+  * will report this". Maps to the public `MutationSettledEvent.hadAwaiter`.
+  */
+  liveAwaiter?: boolean;
+  /**
+  * Invoked on a successful replay with the server's echoed commit CDC cursor,
+  * so a live per-call optimistic layer drops gaplessly once a frame reaches it.
+  * Absent on hydrated records (the optimistic write lived in a prior session).
+  */
+  readonly onCommit?: (commitCursor: number | undefined) => void;
+  /** Rejects if the mutation can no longer be replayed. */
+  readonly reject: (error: unknown) => void;
+  /** Resolves once the mutation has been replayed against the server. */
+  readonly resolve: (value: T) => void;
+  readonly shardKey?: string;
+}
+/**
+* Invoked when the queue itself discards an entry on overflow (capacity
+* eviction), so the client can surface the dropped write on its
+* terminal-verdict observer even when the entry has no live awaiter (a hydrated
+* record). The `error` carries the `OFFLINE_QUEUE_OVERFLOW` code.
+*/
+type EvictHandler = (entry: QueuedMutation, error: Error & {
+  code?: string;
+}) => void;
+/** Injected dependencies for {@link OfflineQueue} (kept off the user-facing {@link OfflineQueueOptions}). */
+interface OfflineQueueDeps {
+  /** Invoked when an entry is discarded on capacity overflow (carries `OFFLINE_QUEUE_OVERFLOW`). */
+  onEvict?: EvictHandler;
+  /** Invoked with the new depth after any size change (drives the client's pending-sync count). */
+  onSizeChange?: (size: number) => void;
+  /** Durable store; when present, writes are mirrored and restored across reloads. */
+  persistence?: PersistenceAdapter;
+  /** App/schema version stamped on persisted writes; mismatched records are purged on hydrate. */
+  version?: string;
+}
+/**
+* A process-unique id, used both per-mutation and as the fallback `clientId`. It
+* MUST be globally unique: the server scopes a custom mutator's replay watermark
+* by `(verifiedIdentity, clientId)`, and an anonymous push has no verified
+* identity — so two anonymous clients that collide on `clientId` would share one
+* watermark namespace, letting one stall/suppress the other's ordered mutations.
+* `crypto.randomUUID` covers every modern runtime; the fallback still mixes
+* crypto-quality (or `Math.random`) entropy with the timestamp + counter so it
+* can't collide across two clients started in the same millisecond.
+*/
+
+/**
+* Bounded FIFO queue. Mutations issued while the client is offline are
+* enqueued and replayed in the order they were submitted once the WS
+* reconnects and identifies. If the queue exceeds `maxItems` the oldest
+* entry is rejected with `OFFLINE_QUEUE_OVERFLOW`.
+*
+* When a {@link PersistenceAdapter} is supplied, enqueued mutations are mirrored
+* to durable storage so they survive a reload — {@link OfflineQueue.hydrate} restores them on
+* the next startup and the client replays them on reconnect. Durable removal is
+* the caller's responsibility *after* a successful replay (see `LunoraClient`);
+* the queue only persists on enqueue and un-persists on overflow.
+*/
+declare class OfflineQueue {
+  /** Opt-in to queueing mutations before the targeted shard's first connect. */
+  readonly queueBeforeFirstConnect: boolean;
+  private readonly maxItems;
+  private readonly onPersistenceError;
+  private readonly persistence;
+  private readonly onEvict;
+  private readonly onSizeChange;
+  /** App/schema version stamped on persisted writes; mismatched records are purged on hydrate. */
+  private readonly version;
+  private readonly items;
+  constructor(options?: OfflineQueueOptions, deps?: OfflineQueueDeps);
+  get size(): number;
+  enqueue<T>(entry: QueuedMutation<T>): void;
+  /**
+  * Restore mutations persisted in a prior session and re-queue them in FIFO
+  * order. Restored entries already live in durable storage, so they are not
+  * re-appended; they carry no-op `resolve`/`reject` (the original awaiter is
+  * gone after a reload). No-op when no persistence adapter is configured.
+  * Returns the distinct shard keys of the restored writes so the caller can
+  * open their sockets to trigger a flush.
+  */
+  hydrate(): Promise<(string | undefined)[]>;
+  /**
+  * Remove and return queued mutations. With no `predicate`, drains the whole
+  * queue. With one, drains only matching entries (preserving FIFO order) and
+  * leaves the rest queued — used to flush a single shard's writes when its
+  * socket reconnects while other shards are still down.
+  */
+  drain(predicate?: (item: QueuedMutation) => boolean): QueuedMutation[];
+  /**
+  * Return previously-drained mutations to the front of the queue, preserving
+  * their FIFO order, without re-persisting them — they were never unpersisted,
+  * so durable storage still holds them. Used when a flush aborts on a transient
+  * transport failure: the unreplayed writes stay queued for the next reconnect.
+  */
+  requeue(items: QueuedMutation[]): void;
+  clear(): void;
+  /** Notify the size observer (the client's pending-sync count) after any change. */
+  private notifySize;
+}
+/**
+* In-memory {@link PersistenceAdapter}. Doesn't survive a reload — it exists so
+* the persistence wiring can be exercised without IndexedDB (tests, SSR, or as
+* a deliberate "no durable store" choice that still satisfies the interface).
+* Preserves enqueue order; `clone` keeps callers from mutating stored args.
+*/
+declare const createInMemoryPersistence: () => PersistenceAdapter;
+interface IndexedDbPersistenceOptions {
+  /** Database name; defaults to `"lunora"`. */
+  databaseName?: string;
+  /** Injectable `IDBFactory` (e.g. `fake-indexeddb` in tests); defaults to the global `indexedDB`. */
+  indexedDB?: IDBFactory;
+  /** Object-store name; defaults to `"offline-mutations"`. */
+  storeName?: string;
+}
+/**
+* IndexedDB-backed {@link PersistenceAdapter}. Each mutation is stored under an
+* autoincrementing key (so `load()` returns them in enqueue order regardless of
+* the string ids) with a unique secondary index on `id` for `remove()`.
+*
+* The store handle is opened lazily and the open promise is cached, so repeated
+* ops reuse one connection. Throws eagerly if no `IDBFactory` is available —
+* callers in non-browser environments should use {@link createInMemoryPersistence}.
+*/
+declare const createIndexedDbPersistence: (options?: IndexedDbPersistenceOptions) => PersistenceAdapter;
+/**
+* Compose the read-cache key for a subscription. Mirrors how
+* `SubscriptionRegistry` keys live subscriptions so a hydrated value lines up
+* with the subscription that will consume it. `shardKey` defaults to `""` (the
+* root shard) exactly as the registry does.
+*/
+declare const queryCacheKey: (functionPath: string, argsKey: string, shardKey?: string) => string;
+/**
+* In-memory {@link QueryCacheAdapter}. Doesn't survive a reload — it exists so
+* the read-cache wiring can be exercised without IndexedDB (tests, SSR, or as a
+* deliberate "no durable store" choice that still satisfies the interface).
+* Enforces the same LRU row cap as the IndexedDB adapter; `clone` keeps callers
+* from mutating stored values.
+*/
+declare const createInMemoryQueryCache: (options?: {
+  maxEntries?: number;
+}) => QueryCacheAdapter;
+interface IndexedDbQueryCacheOptions {
+  /** Database name; defaults to `"lunora"` (shared with the offline-mutation store). */
+  databaseName?: string;
+  /** Injectable `IDBFactory` (e.g. `fake-indexeddb` in tests); defaults to the global `indexedDB`. */
+  indexedDB?: IDBFactory;
+  /** LRU row cap; defaults to 500. The oldest rows by `ts` are pruned on `put` once exceeded. */
+  maxEntries?: number;
+  /** Object-store name; defaults to `"query-cache"`. */
+  storeName?: string;
+}
+/**
+* IndexedDB-backed {@link QueryCacheAdapter}. Each query is stored under its
+* composite key (`functionPath::argsKey::shardKey`) with a `ts` index driving
+* LRU eviction. The store handle is opened lazily and cached, so repeated ops
+* reuse one connection.
+*
+* The store lives in the same `lunora` database as the offline-mutation queue
+* (bumped to schema v2). Opening it upgrades a v1 database in place, adding the
+* `query-cache` store without touching `offline-mutations`. Throws eagerly if no
+* `IDBFactory` is available — callers in non-browser environments should use
+* {@link createInMemoryQueryCache}.
+*/
+declare const createIndexedDbQueryCache: (options?: IndexedDbQueryCacheOptions) => QueryCacheAdapter;
+/**
+* Exponential backoff calculator with optional jitter.
+*
+* `next()` doubles the delay each call up to `maxDelayMs`. When `jitter` is
+* enabled the returned value is randomized in `[delay/2, delay]` so a fleet
+* of clients reconnecting at the same time spread out their retries.
+*/
+interface ReconnectCalculator {
+  /** Returns the delay to wait before the next reconnect attempt. */
+  next: () => number;
+  /** Resets the backoff to the initial delay (call on successful reconnect). */
+  reset: () => void;
+}
+declare const createReconnect: (options?: ReconnectOptions, random?: () => number) => ReconnectCalculator;
+export { type ArgsOf, type AsyncStorageLike, type AsyncStoragePersistenceOptions, type BookmarkStorage, CONFLICT_ERROR_CODE, type FunctionReference, type IndexedDbPersistenceOptions, type IndexedDbQueryCacheOptions, type MutationCallOptions, type MutationDelta, type MutationRunnerSinks, type MutatorHandle, type MutatorRunnerSinks, type MutatorTransaction, OfflineQueue, type OfflineQueueOptions, type PersistenceAdapter, type QueryCacheAdapter, type QueuedMutation, type ReconnectCalculator, type ReconnectOptions, type ReturnOf, applyDelta, createAsyncStoragePersistence, createInMemoryBookmarkStorage, createInMemoryPersistence, createInMemoryQueryCache, createIndexedDbPersistence, createIndexedDbQueryCache, createMutationRunner, createMutatorRunner, createReconnect, isConflictError, isMutationDelta, queryCacheKey };

package/dist/index.mjs

@@ -0,0 +1,15 @@
+export { createAsyncStoragePersistence } from './packem_shared/createAsyncStoragePersistence-1Z5BZ8RC.mjs';
+export { default as createInMemoryBookmarkStorage } from './packem_shared/createInMemoryBookmarkStorage-BoN7a7TH.mjs';
+export { applyDelta, isMutationDelta } from './packem_shared/applyDelta-4jFGTPA3.mjs';
+export { CONFLICT_ERROR_CODE, isConflictError } from './packem_shared/CONFLICT_ERROR_CODE-aUdVbEDw.mjs';
+export { c as createLocalStore } from './packem_shared/local-store-BNgN3Dw3.mjs';
+export { LunoraClient } from './packem_shared/LunoraClient-CgZ6FhKP.mjs';
+export { createMutationRunner } from './packem_shared/createMutationRunner-BqsavzvG.mjs';
+export { createMutatorRunner } from './packem_shared/createMutatorRunner-BETvCd0p.mjs';
+export { O as OfflineQueue } from './packem_shared/offline-queue-7Wc4onA0.mjs';
+export { createInMemoryPersistence, createIndexedDbPersistence } from './packem_shared/createInMemoryPersistence-CW82inU5.mjs';
+export { preloadQuery, preloadedQueryResult } from './packem_shared/preloadQuery-lobFkD2Z.mjs';
+export { createInMemoryQueryCache, createIndexedDbQueryCache, queryCacheKey } from './packem_shared/createInMemoryQueryCache-B1PQ9Twl.mjs';
+export { createReconnect } from './packem_shared/createReconnect-Di_-oHH7.mjs';
+export { DEFAULT_MAX_BUFFER, createStream } from './packem_shared/DEFAULT_MAX_BUFFER-BDkqO5PW.mjs';
+export { S as SubscriptionRegistry } from './packem_shared/subscription-C1Jy7HiF.mjs';

package/dist/packem_shared/CONFLICT_ERROR_CODE-aUdVbEDw.mjs

@@ -0,0 +1,4 @@
+const CONFLICT_ERROR_CODE = "CONFLICT";
+const isConflictError = (error) => error instanceof Error && error.code === CONFLICT_ERROR_CODE;
+
+export { CONFLICT_ERROR_CODE, isConflictError };

package/dist/packem_shared/DEFAULT_MAX_BUFFER-BDkqO5PW.mjs

@@ -0,0 +1,107 @@
+const DEFAULT_MAX_BUFFER = 1024;
+const createStream = (options) => {
+  const maxBuffer = options.maxBuffer ?? DEFAULT_MAX_BUFFER;
+  const buffer = [];
+  const pending = [];
+  let done = false;
+  let failure;
+  let cancelled = false;
+  const flushOne = () => {
+    const waiter = pending.shift();
+    if (!waiter) {
+      return false;
+    }
+    if (failure) {
+      waiter.reject(failure);
+      return true;
+    }
+    if (buffer.length > 0) {
+      const value = buffer.shift();
+      waiter.resolve({ done: false, value });
+      return true;
+    }
+    if (done) {
+      waiter.resolve({ done: true, value: void 0 });
+      return true;
+    }
+    pending.unshift(waiter);
+    return false;
+  };
+  const handle = {
+    complete() {
+      if (done || failure) {
+        return;
+      }
+      done = true;
+      while (flushOne()) {
+      }
+    },
+    fail(error) {
+      if (done || failure) {
+        return;
+      }
+      failure = error;
+      buffer.length = 0;
+      while (flushOne()) {
+      }
+    },
+    push(value) {
+      if (done || failure || cancelled) {
+        return;
+      }
+      if (buffer.length >= maxBuffer) {
+        handle.fail(
+          Object.assign(new Error(`stream buffer overflow (max=${maxBuffer.toString()}); the consumer cannot keep up with the producer`), {
+            code: "STREAM_BACKPRESSURE"
+          })
+        );
+        return;
+      }
+      buffer.push(value);
+      flushOne();
+    }
+  };
+  const cancel = () => {
+    if (cancelled) {
+      return;
+    }
+    cancelled = true;
+    done = true;
+    buffer.length = 0;
+    try {
+      options.onCancel();
+    } catch {
+    }
+    while (flushOne()) {
+    }
+  };
+  const iterable = {
+    cancel,
+    [Symbol.asyncIterator]() {
+      return {
+        next() {
+          if (failure) {
+            return Promise.reject(failure);
+          }
+          if (buffer.length > 0) {
+            const value = buffer.shift();
+            return Promise.resolve({ done: false, value });
+          }
+          if (done) {
+            return Promise.resolve({ done: true, value: void 0 });
+          }
+          return new Promise((resolve, reject) => {
+            pending.push({ reject, resolve });
+          });
+        },
+        return() {
+          cancel();
+          return Promise.resolve({ done: true, value: void 0 });
+        }
+      };
+    }
+  };
+  return { handle, iterable };
+};
+
+export { DEFAULT_MAX_BUFFER, createStream };