@ariestools/sdk 7.0.3

package/LICENSE

@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

package/README.md

@@ -0,0 +1,45 @@
+# @ariestools/sdk
+
+All-in-one umbrella for the Aries Tools TypeScript/JavaScript utility libraries.
+
+Import the whole SDK:
+
+```ts
+import { fetchJson } from '@ariestools/sdk'
+```
+
+…or a single slice via a subpath export (tree-shaking-friendly — you only pay for what
+you import):
+
+```ts
+import { fetchJson } from '@ariestools/sdk/fetch'
+import { assertEx } from '@ariestools/sdk/assert'
+import type { ApiConfig } from '@ariestools/sdk/api/model'
+```
+
+`@xylabs/sdk` remains published as a backward-compatibility re-export shim of this package.
+
+## Self-contained build
+
+`@ariestools/sdk` is **self-contained**: its published `dist/` vendors the compiled output of
+each barreled package (under `dist/_pkg/`), with cross-package `@xylabs/*` imports rewritten
+to relative paths. At runtime it depends only on the real externals
+(`async-mutex`, `zod`, `@opentelemetry/*`), declared as `peerDependencies`. The individual
+`@xylabs/*` packages are build-time inputs only (`devDependencies`).
+
+The vendoring is performed by [`scripts/populate-dist.mjs`](scripts/populate-dist.mjs),
+wired into the toolchain via a local **`package-compile`** script in `package.json`. The
+`xy` CLI defers to a package's own `package-compile` script during the compile **emit**
+phase (the built-in still runs the `--validate-only` tsc pre-pass over `src/`). Because the
+emit phase runs topologically over dependencies, every barreled package's `dist/` is built
+before this package vendors it. So the normal commands just work — no manual step:
+
+```sh
+pnpm xy build                      # compiles all packages, then vendors @ariestools/sdk
+pnpm xy build @ariestools/sdk      # vendors using the already-compiled sub-package dist
+```
+
+To run the toolchain's built-in compile instead of this override (e.g. for debugging), pass
+`--no-defer`. This mechanism is a local prototype; it is intended to move into
+`@xylabs/toolchain` as a first-class compile mode (so the `package-compile` shim is no longer
+needed).

package/dist/_pkg/api/neutral/ApiClient.d.ts

@@ -0,0 +1,10 @@
+import { ApiStage } from './ApiStage.ts';
+/** Abstract base class for API clients that provides stage and token configuration. */
+declare abstract class ApiClient {
+    protected stage?: ApiStage;
+    protected token?: string | null;
+    constructor(token?: string | null, stage?: ApiStage);
+    abstract endPoint(): string;
+}
+export { ApiClient };
+//# sourceMappingURL=ApiClient.d.ts.map

package/dist/_pkg/api/neutral/ApiConfig.d.ts

@@ -0,0 +1,9 @@
+/** Configuration for connecting to an API, including domain, authentication, and user identification. */
+interface ApiConfig {
+    apiDomain: string;
+    apiKey?: string;
+    jwtToken?: string;
+    userid?: string;
+}
+export type { ApiConfig };
+//# sourceMappingURL=ApiConfig.d.ts.map

package/dist/_pkg/api/neutral/ApiEndpoint.d.ts

@@ -0,0 +1,19 @@
+import type { ApiConfig } from './ApiConfig.ts';
+/**
+ * Generic REST API endpoint wrapper that supports fetching and inserting typed data.
+ * @typeParam T - The type of data returned by the endpoint
+ */
+declare class ApiEndpoint<T> {
+    private _value?;
+    private config;
+    private path;
+    constructor(config: ApiConfig, path: string);
+    get value(): T | undefined;
+    private get headers();
+    private get url();
+    fetch(): Promise<T | undefined>;
+    get(): Promise<T | NonNullable<T> | undefined>;
+    insert(value: T): Promise<T | undefined>;
+}
+export { ApiEndpoint };
+//# sourceMappingURL=ApiEndpoint.d.ts.map

package/dist/_pkg/api/neutral/ApiStage.d.ts

@@ -0,0 +1,11 @@
+import type { EnumValue } from '../../enum/neutral/index.ts';
+import { Enum } from '../../enum/neutral/index.ts';
+/** Deployment stage identifiers for API environments. */
+export declare const ApiStage: Enum<{
+    Beta: "beta";
+    Local: "local";
+    Prod: "prod";
+}>;
+/** A valid API stage value ('prod', 'beta', or 'local'). */
+export type ApiStage = EnumValue<typeof ApiStage>;
+//# sourceMappingURL=ApiStage.d.ts.map

package/dist/_pkg/api/neutral/getApiStage.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Determines the API stage based on the hostname.
+ * @param hostname - The hostname to evaluate
+ * @returns The corresponding ApiStage (Local, Beta, or Prod)
+ */
+declare const getApiStage: (hostname: string) => "beta" | "local" | "prod";
+export { getApiStage };
+//# sourceMappingURL=getApiStage.d.ts.map

package/dist/_pkg/api/neutral/index.d.ts

@@ -0,0 +1,6 @@
+export * from './ApiClient.ts';
+export * from './ApiConfig.ts';
+export * from './ApiEndpoint.ts';
+export * from './ApiStage.ts';
+export * from './getApiStage.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/_pkg/api/neutral/index.mjs

@@ -0,0 +1,78 @@
+// src/ApiStage.ts
+import { Enum } from "../../enum/neutral/index.mjs";
+var ApiStage = Enum({
+  Beta: "beta",
+  Local: "local",
+  Prod: "prod"
+});
+
+// src/ApiClient.ts
+var ApiClient = class {
+  stage;
+  token;
+  constructor(token, stage) {
+    this.stage = stage ?? ApiStage.Prod;
+    this.token = token;
+  }
+};
+
+// src/ApiEndpoint.ts
+import { fetchJsonGet, fetchJsonPost } from "../../fetch/neutral/index.mjs";
+import { isUndefined } from "../../typeof/neutral/index.mjs";
+var ApiEndpoint = class {
+  _value;
+  config;
+  path;
+  constructor(config, path) {
+    this.config = config;
+    this.path = path;
+  }
+  get value() {
+    return this._value;
+  }
+  get headers() {
+    return isUndefined(this.config.jwtToken) ? void 0 : { Authorization: this.config.jwtToken };
+  }
+  get url() {
+    return `${this.config.apiDomain}/${this.path}`;
+  }
+  async fetch() {
+    const response = await fetchJsonGet(this.url, { headers: this.headers });
+    if (response.status === 200) {
+      this._value = response.data ?? void 0;
+    } else {
+      throw new Error("Unexpected Status Code");
+    }
+    return this._value;
+  }
+  async get() {
+    return this._value ?? await this.fetch();
+  }
+  async insert(value) {
+    const response = await fetchJsonPost(this.url, value, { headers: this.headers });
+    if (response.status === 200) {
+      this._value = response.data ?? void 0;
+    } else {
+      throw new Error("Unexpected Status Code");
+    }
+    return this._value;
+  }
+};
+
+// src/getApiStage.ts
+var getApiStage = (hostname) => {
+  if (hostname.startsWith("localhost")) {
+    return ApiStage.Local;
+  }
+  if (hostname.startsWith("beta.")) {
+    return ApiStage.Beta;
+  }
+  return ApiStage.Prod;
+};
+export {
+  ApiClient,
+  ApiEndpoint,
+  ApiStage,
+  getApiStage
+};
+//# sourceMappingURL=index.mjs.map

package/dist/_pkg/api/neutral/model.d.ts

@@ -0,0 +1,3 @@
+export type * from './ApiConfig.ts';
+export type { ApiStage } from './ApiStage.ts';
+//# sourceMappingURL=model.d.ts.map

package/dist/_pkg/api/neutral/model.mjs

@@ -0,0 +1 @@
+//# sourceMappingURL=model.mjs.map

package/dist/_pkg/array/neutral/containsAll.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Checks whether the source array contains every element in the target array.
+ * @param source - The array to search within
+ * @param target - The elements that must all be present
+ * @returns True if every target element exists in source
+ */
+export declare const containsAll: <T>(source: T[], target: T[]) => boolean;
+//# sourceMappingURL=containsAll.d.ts.map

package/dist/_pkg/array/neutral/distinct.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Array filter callback that removes duplicate values, with correct NaN handling.
+ * Use with `array.filter(distinct)`.
+ */
+export declare const distinct: <T>(value: T, index: number, array: T[]) => boolean;
+//# sourceMappingURL=distinct.d.ts.map

package/dist/_pkg/array/neutral/filterAs.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Maps each element using the predicate and filters out nullish results.
+ * @param x - The input array
+ * @param predicate - Transform function applied to each element
+ * @returns Array of non-nullish transformed values
+ */
+export declare const filterAs: <In, Out>(x: In[], predicate: (a: In) => Out) => NonNullable<Out>[];
+//# sourceMappingURL=filterAs.d.ts.map

package/dist/_pkg/array/neutral/filterAsync.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Returns the elements of an array that meet the condition specified in a callback function.
+ * @param array The array to filter.
+ * @param predicate A function that accepts up to three arguments. The filter method calls the predicate function one time for each element in the array.
+ * @param concurrency Maximum number of predicates to run in parallel.
+ * @returns The elements of an array that meet the condition specified in a callback function.
+ */
+export declare const filterAsync: <T>(array: T[], predicate: (value: T, index: number, array: T[]) => Promise<boolean>, concurrency?: number) => Promise<T[]>;
+//# sourceMappingURL=filterAsync.d.ts.map

package/dist/_pkg/array/neutral/findAs.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Maps each element using the predicate and returns the first non-nullish result.
+ * @param x - The input array
+ * @param predicate - Transform function applied to each element
+ * @returns The first non-nullish transformed value, or undefined
+ */
+export declare const findAs: <In, Out>(x: In[], predicate: (a: In) => Out) => NonNullable<Out> | undefined;
+/**
+ * Maps each element using the predicate and returns the last non-nullish result.
+ * @param x - The input array
+ * @param predicate - Transform function applied to each element
+ * @returns The last non-nullish transformed value, or undefined
+ */
+export declare const findLastAs: <In, Out>(x: In[], predicate: (a: In) => Out) => NonNullable<Out> | undefined;
+//# sourceMappingURL=findAs.d.ts.map

package/dist/_pkg/array/neutral/flatten.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Concatenates two values or arrays into a single flat array, filtering out nullish entries.
+ * @param a - First value or array
+ * @param b - Second value or array
+ * @returns A flat array of non-nullish elements
+ */
+export declare const flatten: <T>(a?: T | ConcatArray<T>, b?: T | ConcatArray<T>) => T[];
+//# sourceMappingURL=flatten.d.ts.map

package/dist/_pkg/array/neutral/index.d.ts

@@ -0,0 +1,8 @@
+export * from './containsAll.ts';
+export * from './distinct.ts';
+export * from './filterAs.ts';
+export * from './filterAsync.ts';
+export * from './findAs.ts';
+export * from './flatten.ts';
+export * from './uniq.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/_pkg/array/neutral/index.mjs

@@ -0,0 +1,80 @@
+// src/containsAll.ts
+var containsAll = (source, target) => target.every((i) => source.includes(i));
+
+// src/distinct.ts
+var distinct = (value, index, array) => {
+  if (Number.isNaN(value)) {
+    return array.findIndex((item) => Number.isNaN(item)) === index;
+  }
+  return array.indexOf(value) === index;
+};
+
+// src/filterAs.ts
+import { exists } from "../../exists/neutral/index.mjs";
+var filterAs = (x, predicate) => {
+  return x.map(predicate).filter(exists);
+};
+
+// src/filterAsync.ts
+var filterAsync = async (array, predicate, concurrency = 16) => {
+  if (array.length === 0) {
+    return [];
+  }
+  const results = Array.from({ length: array.length });
+  let nextIndex = 0;
+  const limit = Math.max(1, concurrency);
+  const worker = async () => {
+    while (true) {
+      const index = nextIndex++;
+      if (index >= array.length) {
+        return;
+      }
+      results[index] = await predicate(array[index], index, array);
+    }
+  };
+  await Promise.all(Array.from({ length: Math.min(limit, array.length) }, () => worker()));
+  return array.filter((_, index) => results[index]);
+};
+
+// src/findAs.ts
+import { exists as exists2 } from "../../exists/neutral/index.mjs";
+var findAs = (x, predicate) => {
+  return x.map(predicate).find(exists2);
+};
+var findLastAs = (x, predicate) => {
+  return x.map(predicate).findLast(exists2);
+};
+
+// src/flatten.ts
+import { exists as exists3 } from "../../exists/neutral/index.mjs";
+var flatten = (a, b) => {
+  return [].concat(a).concat(b).filter(exists3);
+};
+
+// src/uniq.ts
+var uniq = (arr) => {
+  return [...new Set(arr)];
+};
+var uniqBy = (arr, iteratee) => {
+  const seen = /* @__PURE__ */ new Set();
+  return arr.filter((item) => {
+    const key = iteratee(item);
+    if (!seen.has(key)) {
+      seen.add(key);
+      return true;
+    }
+    return false;
+  });
+};
+export {
+  containsAll,
+  distinct,
+  filterAs,
+  filterAsync,
+  findAs,
+  findLastAs,
+  flatten,
+  uniq,
+  uniqBy
+};
+//# sourceMappingURL=index.mjs.map

package/dist/_pkg/array/neutral/uniq.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Returns a new array with duplicate values removed.
+ * @param arr - The input array
+ * @returns A deduplicated array
+ */
+export declare const uniq: <T>(arr: T[]) => T[];
+/**
+ * Returns a new array with duplicates removed, using a key function for comparison.
+ * @param arr - The input array
+ * @param iteratee - Function that returns the key to compare by
+ * @returns A deduplicated array keeping the first occurrence of each key
+ */
+export declare const uniqBy: <T, I>(arr: T[], iteratee: (item: T) => I) => T[];
+//# sourceMappingURL=uniq.d.ts.map

package/dist/_pkg/arraybuffer/neutral/equalArrayBuffers.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Compares two ArrayBuffers for byte-level equality.
+ * @param a1 - First buffer
+ * @param a2 - Second buffer
+ * @returns True if the buffers have the same length and identical bytes
+ */
+export declare const equalArrayBuffers: (a1: ArrayBufferLike, a2: ArrayBufferLike) => boolean;
+//# sourceMappingURL=equalArrayBuffers.d.ts.map

package/dist/_pkg/arraybuffer/neutral/index.d.ts

@@ -0,0 +1,5 @@
+export * from './equalArrayBuffers.ts';
+export * from './isArrayBuffer.ts';
+export * from './toArrayBuffer.ts';
+export * from './toUint8Array.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/_pkg/arraybuffer/neutral/index.mjs

@@ -0,0 +1,74 @@
+// src/equalArrayBuffers.ts
+var equalArrayBuffers = (a1, a2) => {
+  const u1 = new Uint8Array(a1);
+  const u2 = new Uint8Array(a2);
+  if (u1.byteLength !== u2.byteLength) return false;
+  for (let i = 0; i < u1.byteLength; i++) {
+    if (u1[i] !== u2[i]) return false;
+  }
+  return true;
+};
+
+// src/isArrayBuffer.ts
+function isArrayBuffer(value) {
+  return value instanceof ArrayBuffer;
+}
+function isArrayBufferLike(value) {
+  return value !== null && typeof value === "object" && "byteLength" in value && typeof value.byteLength === "number" && "slice" in value && typeof value.slice === "function";
+}
+
+// src/toArrayBuffer.ts
+import { assertEx } from "../../assert/neutral/index.mjs";
+import { toHex } from "../../hex/neutral/index.mjs";
+import { isUndefined } from "../../typeof/neutral/index.mjs";
+function hexToArrayBuffer(value) {
+  if (value.length % 2 !== 0) {
+    throw new Error("Invalid hex value");
+  }
+  const length = value.length / 2;
+  const result = new Uint8Array(new ArrayBuffer(length));
+  for (let i = 0; i < length; i++) {
+    const byte = value.slice(i * 2, i * 2 + 2);
+    result[i] = Number.parseInt(byte, 16);
+  }
+  return result;
+}
+function stringToArrayBuffer(value, base = 16) {
+  switch (base) {
+    case 16: {
+      return hexToArrayBuffer(toHex((value.startsWith("0x") ? value.slice(2) : value).toUpperCase()));
+    }
+    default: {
+      throw new Error(`Unsupported base [${base}]`);
+    }
+  }
+}
+function toArrayBuffer(value, padLength = 0, base) {
+  if (isUndefined(value)) return void 0;
+  if (typeof value === "bigint" && value < 0) {
+    throw new Error(`negative bigint values are not supported: ${typeof value}`);
+  }
+  let result = typeof value === "string" ? stringToArrayBuffer(value, base) : typeof value === "bigint" ? stringToArrayBuffer(value.toString(16)) : new Uint8Array(value);
+  if (result === void 0) {
+    throw new Error(`toArrayBuffer - Unknown type: ${typeof value}`);
+  }
+  if (result.length < padLength) {
+    result = new Uint8Array([...new Uint8Array(padLength - result.length), ...result]);
+    assertEx(result?.length <= padLength, () => "Resulting length is greater than padLength");
+  }
+  return result.buffer;
+}
+
+// src/toUint8Array.ts
+function toUint8Array(value, padLength, base) {
+  const arrayBuffer = toArrayBuffer(value, padLength, base);
+  return arrayBuffer ? new Uint8Array(arrayBuffer) : void 0;
+}
+export {
+  equalArrayBuffers,
+  isArrayBuffer,
+  isArrayBufferLike,
+  toArrayBuffer,
+  toUint8Array
+};
+//# sourceMappingURL=index.mjs.map

package/dist/_pkg/arraybuffer/neutral/isArrayBuffer.d.ts

@@ -0,0 +1,7 @@
+/** Type guard that checks if a value is an ArrayBuffer instance. */
+export declare function isArrayBuffer(value: unknown): value is ArrayBuffer;
+export declare function isArrayBuffer<T extends ArrayBuffer>(value: T): value is Extract<T, ArrayBuffer>;
+/** Type guard that checks if a value conforms to the ArrayBufferLike interface (has byteLength and slice). */
+export declare function isArrayBufferLike(value: unknown): value is ArrayBufferLike;
+export declare function isArrayBufferLike<T extends ArrayBufferLike>(value: T): value is Extract<T, ArrayBufferLike>;
+//# sourceMappingURL=isArrayBuffer.d.ts.map

package/dist/_pkg/arraybuffer/neutral/toArrayBuffer.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Converts a string, bigint, or ArrayBufferLike to an ArrayBufferLike, with optional zero-padding.
+ * @param value - The value to convert (hex string, bigint, or existing buffer)
+ * @param padLength - Minimum byte length, left-padded with zeros if needed
+ * @param base - Numeric base for string parsing (default 16)
+ * @returns The resulting ArrayBufferLike, or undefined if value is undefined
+ */
+export declare function toArrayBuffer(value: undefined, padLength?: number, base?: number): undefined;
+export declare function toArrayBuffer(value: ArrayBufferLike | bigint | string, padLength?: number, base?: number): ArrayBufferLike;
+export declare function toArrayBuffer(value: ArrayBufferLike | bigint | string | undefined, padLength?: number, base?: number): ArrayBufferLike | undefined;
+//# sourceMappingURL=toArrayBuffer.d.ts.map

package/dist/_pkg/arraybuffer/neutral/toUint8Array.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Converts a string, bigint, or ArrayBufferLike to a Uint8Array, with optional zero-padding.
+ * @param value - The value to convert
+ * @param padLength - Minimum byte length, left-padded with zeros if needed
+ * @param base - Numeric base for string parsing (default 16)
+ * @returns The resulting Uint8Array, or undefined if value is undefined
+ */
+export declare function toUint8Array(value: undefined, padLength?: number, base?: number): undefined;
+export declare function toUint8Array(value: ArrayBufferLike | bigint | string, padLength?: number, base?: number): Uint8Array;
+export declare function toUint8Array(value: ArrayBufferLike | bigint | string | undefined, padLength?: number, base?: number): Uint8Array | undefined;
+//# sourceMappingURL=toUint8Array.d.ts.map