@crawlee/types 4.0.0-beta.8 → 4.0.0-beta.81

package/storages.d.ts

@@ -11,16 +11,13 @@ export interface QueueOperationInfo {
     /** The ID of the added request */
     requestId: string;
 }
-export interface DatasetCollectionClientOptions {
-    storageDir: string;
-}
-export interface DatasetCollectionData {
-    id: string;
-    name?: string;
-    createdAt: Date;
-    modifiedAt: Date;
-    accessedAt: Date;
-}
+/**
+ * A single page of items returned by {@link DatasetBackend.getData}.
+ *
+ * Datasets paginate by offset, so a page is self-describing via `total` / `offset` / `limit`: a
+ * frontend assembling all pages knows it has reached the end once `offset + items.length >= total`.
+ * The cursor-based counterpart for key-value stores is {@link KeyValueStoreListKeysResult}.
+ */
 export interface PaginatedList<Data> {
     /** Total count of entries in the dataset. */
     total: number;
@@ -35,20 +32,7 @@ export interface PaginatedList<Data> {
     /** Dataset entries based on chosen format parameter. */
     items: Data[];
 }
-export interface Dataset extends DatasetCollectionData {
-    itemCount: number;
-}
-/**
- * Dataset collection client.
- */
-export interface DatasetCollectionClient {
-    list(): Promise<PaginatedList<Dataset>>;
-    getOrCreate(name?: string): Promise<DatasetCollectionData>;
-}
-export interface DatasetClientUpdateOptions {
-    name?: string;
-}
-export interface DatasetClientListOptions {
+export interface DatasetBackendListOptions {
     desc?: boolean;
     limit?: number;
     offset?: number;
@@ -60,162 +44,158 @@ export interface DatasetInfo {
     modifiedAt: Date;
     accessedAt: Date;
     itemCount: number;
-    actId?: string;
-    actRunId?: string;
-}
-export interface DatasetStats {
-    readCount?: number;
-    writeCount?: number;
-    deleteCount?: number;
-    storageBytes?: number;
-}
-export interface DatasetClient<Data extends Dictionary = Dictionary> {
-    get(): Promise<DatasetInfo | undefined>;
-    update(newFields: DatasetClientUpdateOptions): Promise<Partial<DatasetInfo>>;
-    delete(): Promise<void>;
-    downloadItems(...args: unknown[]): Promise<Buffer>;
-    listItems(options?: DatasetClientListOptions): Promise<PaginatedList<Data>>;
-    pushItems(items: Data | Data[] | string | string[]): Promise<void>;
 }
-export interface KeyValueStoreStats {
-    readCount?: number;
-    writeCount?: number;
-    deleteCount?: number;
-    listCount?: number;
-    storageBytes?: number;
+export interface DatasetBackend<Data extends Dictionary = Dictionary> {
+    /**
+     * Returns metadata about the dataset (id, name, timestamps, item count, etc.).
+     *
+     * Implementations should throw if the underlying storage no longer exists
+     * (e.g. it was deleted externally). This method should never return stale data
+     * for a storage that has been removed.
+     */
+    getMetadata(): Promise<DatasetInfo>;
+    /** Remove the dataset and all its data. */
+    drop(): Promise<void>;
+    /** Remove all items from the dataset but keep the dataset itself. */
+    purge(): Promise<void>;
+    /** Add items to the dataset. */
+    pushData(items: Data[]): Promise<void>;
+    /** Fetch a page of items from the dataset. */
+    getData(options?: DatasetBackendListOptions): Promise<PaginatedList<Data>>;
 }
 export interface KeyValueStoreInfo {
     id: string;
     name?: string;
-    userId?: string;
     createdAt: Date;
     modifiedAt: Date;
     accessedAt: Date;
-    actId?: string;
-    actRunId?: string;
-    stats?: KeyValueStoreStats;
 }
 /**
- * Key-value store collection client.
+ * The value a serialized record carries on the way *into* a storage backend (`setValue`).
+ *
+ * The `KeyValueStore` frontend has already serialized by this point, so it is a pre-serialized
+ * string, raw bytes (`Buffer` / `ArrayBuffer` / typed array), or a stream the client drains.
+ */
+export type KeyValueStoreRecordInputValue = Buffer | ArrayBuffer | ArrayBufferView | string | NodeJS.ReadableStream | ReadableStream;
+/**
+ * A record as returned by a storage backend (`getValue`).
+ *
+ * Storage backends are byte transports: they persist and return bytes verbatim and never serialize
+ * or parse. Interpretation is the `KeyValueStore` frontend's job (it parses according to the content
+ * type via `parseValue`). The value is therefore always raw bytes — a `Buffer` (Node) or an
+ * `ArrayBuffer` (browser backends).
  */
-export interface KeyValueStoreCollectionClient {
-    list(): Promise<PaginatedList<KeyValueStoreInfo>>;
-    getOrCreate(name?: string): Promise<KeyValueStoreInfo>;
-}
 export interface KeyValueStoreRecord {
     key: string;
-    value: any;
+    value: Buffer | ArrayBuffer;
     contentType?: string;
 }
-export interface KeyValueStoreRecordOptions {
-    timeoutSecs?: number;
-    doNotRetryTimeouts?: boolean;
-}
-export interface KeyValueStoreClientUpdateOptions {
-    name?: string;
+/**
+ * A record passed to a storage backend for writing (`setValue`). Like {@link KeyValueStoreRecord} but
+ * with the lenient, pre-serialized {@link KeyValueStoreRecordInputValue} for the value.
+ */
+export interface KeyValueStoreInputRecord {
+    key: string;
+    value: KeyValueStoreRecordInputValue;
+    contentType?: string;
 }
-export interface KeyValueStoreClientListOptions {
-    limit?: number;
+export interface KeyValueStoreListKeysOptions {
+    /** If set, only keys that start with this prefix are returned. */
+    prefix?: string;
+    /** All keys up to this one are skipped from the result. */
     exclusiveStartKey?: string;
+    /** Maximum number of keys to return. */
+    limit?: number;
 }
 export interface KeyValueStoreItemData {
     key: string;
     size: number;
+    /** The MIME content type the record was stored with, if known. */
+    contentType: string;
 }
-export interface KeyValueStoreClientListData {
+/**
+ * A single page of keys returned by {@link KeyValueStoreBackend.listKeys}.
+ *
+ * This mirrors {@link PaginatedList} (the shape returned by {@link DatasetBackend.getData}) so that
+ * both listing operations on the storage backend layer return a self-describing page. The difference
+ * is the pagination model: datasets are offset-based (`total` / `offset`), whereas key-value stores
+ * are cursor-based. A frontend assembling all pages should therefore not guess "is this the last
+ * page?" from `items.length < limit` — it should rely on {@link isTruncated} and resume from
+ * {@link nextExclusiveStartKey}.
+ */
+export interface KeyValueStoreListKeysResult {
+    /** Keys returned on this page. */
+    items: KeyValueStoreItemData[];
+    /** Number of keys returned on this page (`items.length`). */
     count: number;
+    /** Maximum number of keys requested for this page. */
     limit: number;
+    /** The `exclusiveStartKey` that produced this page, if any. */
     exclusiveStartKey?: string;
+    /** `true` if there are more keys beyond this page. When `true`, {@link nextExclusiveStartKey} is set. */
     isTruncated: boolean;
+    /** Cursor to pass as the next call's `exclusiveStartKey`, or `undefined` when {@link isTruncated} is `false`. */
     nextExclusiveStartKey?: string;
-    items: KeyValueStoreItemData[];
-}
-export interface KeyValueStoreClientGetRecordOptions {
-    buffer?: boolean;
-    stream?: boolean;
 }
 /**
  * Key-value Store client.
  */
-export interface KeyValueStoreClient {
-    get(): Promise<KeyValueStoreInfo | undefined>;
-    update(newFields: KeyValueStoreClientUpdateOptions): Promise<Partial<KeyValueStoreInfo>>;
-    delete(): Promise<void>;
-    listKeys(options?: KeyValueStoreClientListOptions): Promise<KeyValueStoreClientListData>;
+export interface KeyValueStoreBackend {
+    /**
+     * Returns metadata about the key-value store (id, name, timestamps, etc.).
+     *
+     * Implementations should throw if the underlying storage no longer exists
+     * (e.g. it was deleted externally). This method should never return stale data
+     * for a storage that has been removed.
+     */
+    getMetadata(): Promise<KeyValueStoreInfo>;
+    /** Remove the key-value store and all its data. */
+    drop(): Promise<void>;
+    /** Remove all records from the store but keep the store itself. */
+    purge(): Promise<void>;
+    /**
+     * Get a record by key. Returns the raw bytes plus content type, or `undefined` if not found.
+     *
+     * Clients are byte transports and must not parse the body — the `KeyValueStore` frontend
+     * interprets it according to the content type.
+     */
+    getValue(key: string): Promise<KeyValueStoreRecord | undefined>;
+    /** Set a record value. */
+    setValue(record: KeyValueStoreInputRecord): Promise<void>;
+    /** Delete a record by key. */
+    deleteValue(key: string): Promise<void>;
+    /**
+     * List a single page of keys in the store. Returns at most `limit` keys starting after
+     * `exclusiveStartKey`, wrapped in a self-describing page.
+     *
+     * Like {@link DatasetBackend.getData}, this returns one page rather than the whole collection;
+     * assembling all pages (e.g. for `KeyValueStore.keys()`) is the frontend's job. The result carries
+     * a cursor (`isTruncated` / `nextExclusiveStartKey`) so the frontend can paginate deterministically
+     * instead of inferring the end from `items.length < limit`.
+     */
+    listKeys(options?: KeyValueStoreListKeysOptions): Promise<KeyValueStoreListKeysResult>;
+    /** Get the public URL for a record, or `undefined` if unavailable. */
+    getPublicUrl(key: string): Promise<string | undefined>;
+    /** Check whether a record with the given key exists. */
     recordExists(key: string): Promise<boolean>;
-    getRecord(key: string, options?: KeyValueStoreClientGetRecordOptions): Promise<KeyValueStoreRecord | undefined>;
-    setRecord(record: KeyValueStoreRecord, options?: KeyValueStoreRecordOptions): Promise<void>;
-    deleteRecord(key: string): Promise<void>;
-}
-export interface RequestQueueStats {
-    readCount?: number;
-    writeCount?: number;
-    deleteCount?: number;
-    headItemReadCount?: number;
-    storageBytes?: number;
 }
 export interface RequestQueueInfo {
     id: string;
     name?: string;
-    userId?: string;
     createdAt: Date;
     modifiedAt: Date;
     accessedAt: Date;
-    expireAt?: string;
     totalRequestCount: number;
     handledRequestCount: number;
     pendingRequestCount: number;
-    actId?: string;
-    actRunId?: string;
-    hadMultipleClients?: boolean;
-    stats?: RequestQueueStats;
 }
 /**
- * Request queue collection client.
+ * Options for request-queue operations that add or return requests to the queue
+ * ({@link RequestQueueBackend.addBatchOfRequests}, {@link RequestQueueBackend.reclaimRequest}).
  */
-export interface RequestQueueCollectionClient {
-    list(): Promise<PaginatedList<RequestQueueInfo>>;
-    getOrCreate(name: string): Promise<RequestQueueInfo>;
-}
-export interface RequestQueueHeadItem {
-    id: string;
-    retryCount: number;
-    uniqueKey: string;
-    url: string;
-    method: AllowedHttpMethods;
-}
-export interface QueueHead {
-    limit: number;
-    queueModifiedAt: Date;
-    hadMultipleClients?: boolean;
-    items: RequestQueueHeadItem[];
-}
-export interface ListOptions {
-    /**
-     * @default 100
-     */
-    limit?: number;
-}
-export interface ListAndLockOptions extends ListOptions {
-    lockSecs: number;
-}
-export interface ListAndLockHeadResult extends QueueHead {
-    lockSecs: number;
-    queueHasLockedRequests?: boolean;
-}
-export interface ProlongRequestLockOptions {
-    lockSecs: number;
-    forefront?: boolean;
-}
-export interface ProlongRequestLockResult {
-    lockExpiresAt: Date;
-}
-export interface DeleteRequestLockOptions {
-    forefront?: boolean;
-}
-export interface RequestOptions {
+export interface RequestQueueOperationOptions {
+    /** Place the affected request(s) at the beginning of the queue so they are processed sooner. */
     forefront?: boolean;
-    [k: string]: unknown;
 }
 export interface RequestSchema {
     id?: string;
@@ -249,45 +229,189 @@ export interface BatchAddRequestsResult {
     processedRequests: ProcessedRequest[];
     unprocessedRequests: UnprocessedRequest[];
 }
-export interface RequestQueueClient {
-    get(): Promise<RequestQueueInfo | undefined>;
-    update(newFields: {
-        name?: string;
-    }): Promise<Partial<RequestQueueInfo> | undefined>;
-    delete(): Promise<void>;
-    listHead(options?: ListOptions): Promise<QueueHead>;
-    addRequest(request: RequestSchema, options?: RequestOptions): Promise<QueueOperationInfo>;
-    batchAddRequests(requests: RequestSchema[], options?: RequestOptions): Promise<BatchAddRequestsResult>;
-    getRequest(id: string): Promise<RequestOptions | undefined>;
-    updateRequest(request: UpdateRequestSchema, options?: RequestOptions): Promise<QueueOperationInfo>;
-    deleteRequest(id: string): Promise<unknown>;
-    listAndLockHead(options: ListAndLockOptions): Promise<ListAndLockHeadResult>;
-    prolongRequestLock(id: string, options: ProlongRequestLockOptions): Promise<ProlongRequestLockResult>;
-    deleteRequestLock(id: string, options?: DeleteRequestLockOptions): Promise<void>;
-}
-export interface RequestQueueOptions {
-    clientKey?: string;
-    timeoutSecs?: number;
-}
-export interface SetStatusMessageOptions {
-    isStatusMessageTerminal?: boolean;
-    level?: 'DEBUG' | 'INFO' | 'WARNING' | 'ERROR';
+/**
+ * Operations on a single request queue.
+ *
+ * A backend implementation owns all request bookkeeping (pending, in-progress, handled). Any
+ * coordination required between multiple distributed clients accessing the same queue (e.g. request
+ * locking on the Apify platform) is an internal concern of the implementation and is not exposed on
+ * this interface.
+ */
+export interface RequestQueueBackend {
+    /**
+     * Returns metadata about the request queue (id, name, timestamps, request counts, etc.).
+     *
+     * Implementations should throw if the underlying storage no longer exists
+     * (e.g. it was deleted externally). This method should never return stale data
+     * for a storage that has been removed.
+     */
+    getMetadata(): Promise<RequestQueueInfo>;
+    /** Remove the request queue and all its data. */
+    drop(): Promise<void>;
+    /** Remove all requests from the queue but keep the queue itself. */
+    purge(): Promise<void>;
+    /**
+     * Add a batch of requests to the queue.
+     *
+     * Each request is deduplicated by its `uniqueKey`. Duplicates are reported in the result
+     * but not re-added. With `forefront`, requests are placed at the beginning of the queue so
+     * they are processed sooner.
+     */
+    addBatchOfRequests(requests: RequestSchema[], options?: RequestQueueOperationOptions): Promise<BatchAddRequestsResult>;
+    /**
+     * Retrieve a request from the queue by its `uniqueKey`, or `undefined` if it does not exist.
+     */
+    getRequest(uniqueKey: string): Promise<UpdateRequestSchema | undefined>;
+    /**
+     * Return the next request in the queue to be processed, or `undefined` if there are currently no
+     * pending requests.
+     *
+     * The returned request is marked as in-progress; it will not be returned again until it is
+     * either reclaimed via {@link reclaimRequest} or marked as handled via {@link markRequestAsHandled}.
+     *
+     * An `undefined` return value does not mean processing is finished — only that there are no pending
+     * requests right now. Use {@link isEmpty} (together with the frontend's knowledge of pending
+     * add operations) to determine whether the queue is truly finished.
+     */
+    fetchNextRequest(): Promise<UpdateRequestSchema | undefined>;
+    /**
+     * Mark a request previously returned by {@link fetchNextRequest} as handled.
+     *
+     * Handled requests are never returned again by {@link fetchNextRequest}. Returns information
+     * about the operation, or `undefined` if the request was not in progress.
+     *
+     * An `undefined` result is a no-op, not an error: the request is simply not something this client is
+     * currently processing, so nothing is changed and the request is never added to the queue as a side
+     * effect. (Marking an already-handled request is idempotent and still returns operation info with
+     * `wasAlreadyHandled: true` rather than `undefined`.)
+     */
+    markRequestAsHandled(request: UpdateRequestSchema): Promise<QueueOperationInfo | undefined>;
+    /**
+     * Reclaim a failed request back to the queue so it can be processed again by a later call to
+     * {@link fetchNextRequest}. With `forefront`, the request is returned to the beginning of the
+     * queue. Returns information about the operation, or `undefined` if the request was not in progress.
+     *
+     * The request is expected to already be present in the queue (it should have been obtained via
+     * {@link fetchNextRequest}); reclaiming releases its lock rather than inserting it. An `undefined` result
+     * is a no-op, not an error: the request is simply not something this client is currently processing,
+     * so nothing is changed and the request is never added to the queue as a side effect. Use
+     * {@link addBatchOfRequests} to insert a new request.
+     */
+    reclaimRequest(request: UpdateRequestSchema, options?: RequestQueueOperationOptions): Promise<QueueOperationInfo | undefined>;
+    /**
+     * Resolves to `true` if the next call to {@link fetchNextRequest} would return `undefined` — i.e. there
+     * are no pending requests to fetch right now.
+     *
+     * Requests that are currently in progress (fetched but not yet handled or reclaimed, including
+     * requests locked by other clients sharing the same queue) are **not** counted. An empty queue
+     * therefore does not mean crawling is finished — those in-progress requests may still be reclaimed,
+     * and background tasks may still add more requests. Use {@link isFinished} to detect completion.
+     */
+    isEmpty(): Promise<boolean>;
+    /**
+     * Resolves to `true` only when there is no outstanding work left in the queue at all — i.e. there
+     * are no pending requests to fetch **and** no requests currently in progress (fetched but not yet
+     * handled or reclaimed, including requests locked by other clients sharing the same queue).
+     *
+     * This is the strong counterpart of {@link isEmpty}: a queue whose only remaining requests are in
+     * progress is empty (nothing to fetch) but not finished (that work might still be reclaimed). It is
+     * the building block for determining whether crawling is done — though a frontend may still need to
+     * account for its own pending background add operations on top of this.
+     */
+    isFinished(): Promise<boolean>;
+    /**
+     * Tells the client how long (in seconds) a consumer expects to hold a request fetched via
+     * {@link fetchNextRequest} before marking it handled or reclaiming it — typically the consumer's
+     * request-processing timeout plus some padding.
+     *
+     * A client that coordinates consumers via locking uses this to keep the request reserved for at least
+     * this long, so that a long-running consumer does not have its request handed out again while it is
+     * still being processed. Clients that do not lock may ignore it.
+     */
+    setExpectedRequestProcessingTimeSecs?(secs: number): Promise<void>;
 }
 /**
- * Represents a storage capable of working with datasets, KV stores and request queues.
+ * Identifies a storage by its ID, name, or alias. At most one may be provided.
+ *
+ * - `{ id }` — open a pre-existing storage by its unique ID.
+ * - `{ name }` — open or create a globally named storage (persists across runs).
+ * - `{ alias }` — open or create a run-scoped unnamed storage identified by this alias.
+ *   The alias is used locally (e.g. as a directory name or cache key) but the storage
+ *   itself has no persistent name. Use this for non-default unnamed storages.
+ * - `{}` / omitted — open the default storage.
+ */
+export type StorageIdentifier = {
+    id: string;
+    name?: never;
+    alias?: never;
+} | {
+    id?: never;
+    name: string;
+    alias?: never;
+} | {
+    id?: never;
+    name?: never;
+    alias: string;
+} | {
+    id?: never;
+    name?: never;
+    alias?: never;
+};
+/**
+ * Represents a storage backend capable of working with datasets, key-value stores and request queues.
+ *
+ * A new storage backend needs to implement 4 classes:
+ * - `StorageBackend` - the factory that creates sub-backends
+ * - `DatasetBackend` - operations on a single dataset
+ * - `KeyValueStoreBackend` - operations on a single key-value store
+ * - `RequestQueueBackend` - operations on a single request queue
+ *
+ * The `StorageBackend` acts as an async factory: each `create*` method either opens an existing
+ * storage or creates a new one, returning a sub-backend bound to that storage instance.
  */
-export interface StorageClient {
-    datasets(): DatasetCollectionClient;
-    dataset(id: string): DatasetClient;
-    keyValueStores(): KeyValueStoreCollectionClient;
-    keyValueStore(id: string): KeyValueStoreClient;
-    requestQueues(): RequestQueueCollectionClient;
-    requestQueue(id: string, options?: RequestQueueOptions): RequestQueueClient;
+export interface StorageBackend {
+    /**
+     * Create (or open) a dataset backend.
+     * If `id` is provided, opens the dataset with that ID.
+     * If `name` is provided, opens an existing dataset with that name or creates a new one.
+     * If neither is provided, opens or creates the default dataset.
+     */
+    createDatasetBackend(options?: StorageIdentifier): Promise<DatasetBackend>;
+    /**
+     * Create (or open) a key-value store backend.
+     * If `id` is provided, opens the key-value store with that ID.
+     * If `name` is provided, opens an existing store with that name or creates a new one.
+     * If neither is provided, opens or creates the default key-value store.
+     */
+    createKeyValueStoreBackend(options?: StorageIdentifier): Promise<KeyValueStoreBackend>;
+    /**
+     * Create (or open) a request queue backend.
+     * If `id` is provided, opens the request queue with that ID.
+     * If `name` is provided, opens an existing queue with that name or creates a new one.
+     * If neither is provided, opens or creates the default request queue.
+     */
+    createRequestQueueBackend(options?: StorageIdentifier): Promise<RequestQueueBackend>;
+    /**
+     * Check whether a storage with the given ID exists.
+     *
+     * Used internally to resolve ambiguous `idOrName` strings passed to `Dataset.open()`,
+     * `KeyValueStore.open()`, and `RequestQueue.open()`.
+     */
+    storageExists?(id: string, type: 'Dataset' | 'KeyValueStore' | 'RequestQueue'): Promise<boolean>;
+    /**
+     * Return an opaque key that uniquely identifies this storage backend instance.
+     *
+     * The key is used by `StorageInstanceManager` to partition the storage cache per-backend,
+     * so that two storages with the same name but backed by different clients
+     * (e.g. a local `MemoryStorageBackend` and a cloud `ApifyClient`) are cached as separate instances.
+     *
+     * When not provided, the fallback uses the client's constructor name, so different
+     * `StorageBackend` implementations automatically get separate cache partitions.
+     */
+    getStorageBackendCacheKey?(): string;
     purge?(): Promise<void>;
     teardown?(): Promise<void>;
-    setStatusMessage?(message: string, options?: SetStatusMessageOptions): Promise<void>;
     stats?: {
         rateLimitErrors: number[];
     };
 }
-//# sourceMappingURL=storages.d.ts.map

package/storages.js

@@ -1,2 +1 @@
 export {};
-//# sourceMappingURL=storages.js.map

package/utility-types.d.ts

@@ -4,5 +4,4 @@ export type Dictionary<T = any> = Record<PropertyKey, T>;
 export type Constructor<T = unknown> = new (...args: any[]) => T;
 /** @ignore */
 export type Awaitable<T> = T | PromiseLike<T>;
-export type AllowedHttpMethods = 'GET' | 'HEAD' | 'POST' | 'PUT' | 'DELETE' | 'TRACE' | 'OPTIONS' | 'CONNECT' | 'PATCH';
-//# sourceMappingURL=utility-types.d.ts.map
+export type AllowedHttpMethods = 'GET' | 'HEAD' | 'POST' | 'PUT' | 'DELETE' | 'TRACE' | 'OPTIONS' | 'CONNECT' | 'PATCH' | 'get' | 'head' | 'post' | 'put' | 'delete' | 'trace' | 'options' | 'connect' | 'patch';

package/utility-types.js

@@ -1,2 +1 @@
 export {};
-//# sourceMappingURL=utility-types.js.map

package/browser.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"browser.d.ts","sourceRoot":"","sources":["../src/browser.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD,MAAM,WAAW,MAAM;IACnB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;OAEG;IACH,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB;;OAEG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;OAEG;IACH,QAAQ,CAAC,EAAE,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC;IACrC;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,QAAQ,CAAC,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACrC;;OAEG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;OAEG;IACH,YAAY,CAAC,EAAE,OAAO,GAAG,WAAW,GAAG,QAAQ,CAAC;IAChD;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,mBAAmB;IAChC,GAAG,IAAI,MAAM,CAAC;IACd,OAAO,IAAI,UAAU,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC;CAC5C"}

package/browser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"browser.js","sourceRoot":"","sources":["../src/browser.ts"],"names":[],"mappings":""}

package/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,oBAAoB,CAAC;AACnC,cAAc,cAAc,CAAC"}

package/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,oBAAoB,CAAC;AACnC,cAAc,cAAc,CAAC"}

package/storages.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"storages.d.ts","sourceRoot":"","sources":["../src/storages.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAEzE;;;GAGG;AACH,MAAM,WAAW,kBAAkB;IAC/B,6DAA6D;IAC7D,iBAAiB,EAAE,OAAO,CAAC;IAE3B,0DAA0D;IAC1D,iBAAiB,EAAE,OAAO,CAAC;IAE3B,kCAAkC;IAClC,SAAS,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,8BAA8B;IAC3C,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,qBAAqB;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,IAAI,CAAC;IACjB,UAAU,EAAE,IAAI,CAAC;CACpB;AAED,MAAM,WAAW,aAAa,CAAC,IAAI;IAC/B,6CAA6C;IAC7C,KAAK,EAAE,MAAM,CAAC;IACd,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;IACd,2DAA2D;IAC3D,MAAM,EAAE,MAAM,CAAC;IACf,mDAAmD;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,iDAAiD;IACjD,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,wDAAwD;IACxD,KAAK,EAAE,IAAI,EAAE,CAAC;CACjB;AAED,MAAM,WAAW,OAAQ,SAAQ,qBAAqB;IAClD,SAAS,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACpC,IAAI,IAAI,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IACxC,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC;CAC9D;AAED,MAAM,WAAW,0BAA0B;IACvC,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,wBAAwB;IACrC,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,WAAW;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,IAAI,CAAC;IACjB,UAAU,EAAE,IAAI,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;CACrB;AACD,MAAM,WAAW,YAAY;IACzB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,aAAa,CAAC,IAAI,SAAS,UAAU,GAAG,UAAU;IAC/D,GAAG,IAAI,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;IACxC,MAAM,CAAC,SAAS,EAAE,0BAA0B,GAAG,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;IAC7E,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACxB,aAAa,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IACnD,SAAS,CAAC,OAAO,CAAC,EAAE,wBAAwB,GAAG,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5E,SAAS,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACtE;AAED,MAAM,WAAW,kBAAkB;IAC/B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,iBAAiB;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,IAAI,CAAC;IACjB,UAAU,EAAE,IAAI,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,kBAAkB,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,WAAW,6BAA6B;IAC1C,IAAI,IAAI,OAAO,CAAC,aAAa,CAAC,iBAAiB,CAAC,CAAC,CAAC;IAClD,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC;CAC1D;AAED,MAAM,WAAW,mBAAmB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,GAAG,CAAC;IACX,WAAW,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,0BAA0B;IACvC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAChC;AAED,MAAM,WAAW,gCAAgC;IAC7C,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,8BAA8B;IAC3C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,qBAAqB;IAClC,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,2BAA2B;IACxC,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,WAAW,EAAE,OAAO,CAAC;IACrB,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,KAAK,EAAE,qBAAqB,EAAE,CAAC;CAClC;AAED,MAAM,WAAW,mCAAmC;IAChD,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAChC,GAAG,IAAI,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC,CAAC;IAC9C,MAAM,CAAC,SAAS,EAAE,gCAAgC,GAAG,OAAO,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC;IACzF,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACxB,QAAQ,CAAC,OAAO,CAAC,EAAE,8BAA8B,GAAG,OAAO,CAAC,2BAA2B,CAAC,CAAC;IACzF,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5C,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,mCAAmC,GAAG,OAAO,CAAC,mBAAmB,GAAG,SAAS,CAAC,CAAC;IAChH,SAAS,CAAC,MAAM,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,0BAA0B,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5F,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC5C;AAED,MAAM,WAAW,iBAAiB;IAC9B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,YAAY,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,gBAAgB;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,IAAI,CAAC;IACjB,UAAU,EAAE,IAAI,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,KAAK,CAAC,EAAE,iBAAiB,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,4BAA4B;IACzC,IAAI,IAAI,OAAO,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACjD,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;CACxD;AAED,MAAM,WAAW,oBAAoB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,kBAAkB,CAAC;CAC9B;AAED,MAAM,WAAW,SAAS;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,EAAE,IAAI,CAAC;IACtB,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,KAAK,EAAE,oBAAoB,EAAE,CAAC;CACjC;AAED,MAAM,WAAW,WAAW;IACxB;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,kBAAmB,SAAQ,WAAW;IACnD,QAAQ,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,qBAAsB,SAAQ,SAAS;IACpD,QAAQ,EAAE,MAAM,CAAC;IACjB,sBAAsB,CAAC,EAAE,OAAO,CAAC;CACpC;AAED,MAAM,WAAW,yBAAyB;IACtC,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,wBAAwB;IACrC,aAAa,EAAE,IAAI,CAAC;CACvB;AAED,MAAM,WAAW,wBAAwB;IACrC,SAAS,CAAC,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,cAAc;IAC3B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,aAAa;IAC1B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,OAAO,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,EAAE,UAAU,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAoB,SAAQ,aAAa;IACtD,EAAE,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,gBAAgB;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,iBAAiB,EAAE,OAAO,CAAC;CAC9B;AAED,MAAM,WAAW,kBAAkB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,CAAC,EAAE,kBAAkB,CAAC;CAC/B;AAED,MAAM,WAAW,sBAAsB;IACnC,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtC,mBAAmB,EAAE,kBAAkB,EAAE,CAAC;CAC7C;AAED,MAAM,WAAW,kBAAkB;IAC/B,GAAG,IAAI,OAAO,CAAC,gBAAgB,GAAG,SAAS,CAAC,CAAC;IAC7C,MAAM,CAAC,SAAS,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC,CAAC;IACrF,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACxB,QAAQ,CAAC,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACpD,UAAU,CAAC,OAAO,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAC1F,gBAAgB,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAC;IACvG,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,GAAG,SAAS,CAAC,CAAC;IAC5D,aAAa,CAAC,OAAO,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC;IACnG,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5C,eAAe,CAAC,OAAO,EAAE,kBAAkB,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC;IAC7E,kBAAkB,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,yBAAyB,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC;IACtG,iBAAiB,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,wBAAwB,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACpF;AAED,MAAM,WAAW,mBAAmB;IAChC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,uBAAuB;IACpC,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAClC,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;CAClD;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC1B,QAAQ,IAAI,uBAAuB,CAAC;IACpC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,CAAC;IACnC,cAAc,IAAI,6BAA6B,CAAC;IAChD,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,mBAAmB,CAAC;IAC/C,aAAa,IAAI,4BAA4B,CAAC;IAC9C,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,mBAAmB,GAAG,kBAAkB,CAAC;IAC5E,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACxB,QAAQ,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3B,gBAAgB,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,uBAAuB,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACrF,KAAK,CAAC,EAAE;QAAE,eAAe,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;CACzC"}

package/storages.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"storages.js","sourceRoot":"","sources":["../src/storages.ts"],"names":[],"mappings":""}