@ac-kit/core 0.1.0

package/dist/json/replacers/circular-reference.js

@@ -0,0 +1,45 @@
+import { defaults } from "../../object/defaults.js";
+import { jsonMakeReplacerFunction } from "../json-make-replacer-function.js";
+const JSON_MAKE_CIRCULAR_REFERENCE_REPLACER_FUNCTION_DEFAULT_OPTIONS = {
+    placeholder: "[Circular]",
+};
+/**
+ * Create a JSON replacer function that safely handles circular references by
+ * replacing them with a specified placeholder string.
+ *
+ * This function uses a WeakMap to track parent objects during serialization,
+ * allowing it to detect circular references and replace them with the provided
+ * placeholder. It can be combined with an optional user-defined replacer for
+ * additional customization.
+ *
+ * @param replacer An optional user-defined replacer (function or property list)
+ *   to apply after the circular reference handling.
+ * @param options Options for configuring the circular safe replacer function,
+ *   including the placeholder string to use for circular references.
+ * @returns A JSON replacer function that handles circular references and
+ *   applies the user-defined replacer if provided.
+ */
+export function jsonMakeCircularReferenceReplacerFunction(replacer, options) {
+    const { placeholder } = defaults(options, JSON_MAKE_CIRCULAR_REFERENCE_REPLACER_FUNCTION_DEFAULT_OPTIONS);
+    const parentsMap = new WeakMap();
+    function jsonReplacerCircularReplacer(_key, value) {
+        if (typeof value === "object" && value !== null) {
+            const parent = this;
+            if (typeof parent === "object" && parent !== null) {
+                let current = parent;
+                while (current) {
+                    if (current === value) {
+                        return placeholder;
+                    }
+                    current = parentsMap.get(current);
+                }
+                if (!parentsMap.has(value)) {
+                    parentsMap.set(value, parent);
+                }
+            }
+        }
+        return value;
+    }
+    return jsonMakeReplacerFunction(jsonReplacerCircularReplacer, replacer);
+}
+//# sourceMappingURL=circular-reference.js.map

package/dist/json/replacers/circular-reference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"circular-reference.js","sourceRoot":"","sources":["../../../src/json/replacers/circular-reference.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAEpD,OAAO,EAAE,wBAAwB,EAAE,MAAM,mCAAmC,CAAC;AAM7E,MAAM,8DAA8D,GACnE;IACC,WAAW,EAAE,YAAY;CACzB,CAAC;AAEH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,yCAAyC,CACxD,QAAuB,EACvB,OAA0D;IAE1D,MAAM,EAAE,WAAW,EAAE,GAAG,QAAQ,CAC/B,OAAO,EACP,8DAA8D,CAC9D,CAAC;IAEF,MAAM,UAAU,GAAG,IAAI,OAAO,EAAiB,CAAC;IAEhD,SAAS,4BAA4B,CAEpC,IAAY,EACZ,KAAc;QAEd,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAiB,CAAC;YAEjC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACnD,IAAI,OAAO,GAA0B,MAAM,CAAC;gBAC5C,OAAO,OAAO,EAAE,CAAC;oBAChB,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;wBACvB,OAAO,WAAW,CAAC;oBACpB,CAAC;oBACD,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACnC,CAAC;gBAED,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC5B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/B,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAED,OAAO,wBAAwB,CAAC,4BAA4B,EAAE,QAAQ,CAAC,CAAC;AACzE,CAAC"}

package/dist/json/replacers/error.d.ts

@@ -0,0 +1,31 @@
+import { JsonObject, JsonValue } from "type-fest";
+import { JsonReplacer, JsonReplacerFunction } from "../../types/json.js";
+export type JsonError = JsonObject & {
+    name: string;
+    message: string;
+    stack?: string;
+    cause?: JsonError | JsonValue;
+};
+export type JsonAggregateError = JsonError & {
+    errors: (JsonError | JsonValue)[];
+};
+export type JsonSuppressedError = JsonError & {
+    error: JsonError | JsonValue;
+    suppressed: JsonError | JsonValue;
+};
+/**
+ * Create a JSON replacer function that converts Error objects into plain
+ * objects containing their non-enumerable properties (name, message, stack,
+ * cause, etc.) along with any enumerable properties.
+ *
+ * This function can be used as a base replacer to ensure that Error objects are
+ * properly serialized during JSON serialization, and can be combined with a
+ * user-defined replacer for additional customization.
+ *
+ * @param replacer An optional user-defined replacer (function or property list)
+ *   to apply after the Error replacer.
+ * @returns A JSON replacer function that handles Error objects and applies the
+ *   user-defined replacer if provided.
+ */
+export declare function jsonMakeErrorReplacerFunction(replacer?: JsonReplacer): JsonReplacerFunction;
+//# sourceMappingURL=error.d.ts.map

package/dist/json/replacers/error.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../../src/json/replacers/error.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAGlD,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAGzE,MAAM,MAAM,SAAS,GAAG,UAAU,GAAG;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,SAAS,GAAG,SAAS,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG,SAAS,GAAG;IAC5C,MAAM,EAAE,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC;CAClC,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG;IAC7C,KAAK,EAAE,SAAS,GAAG,SAAS,CAAC;IAC7B,UAAU,EAAE,SAAS,GAAG,SAAS,CAAC;CAClC,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,wBAAgB,6BAA6B,CAC5C,QAAQ,CAAC,EAAE,YAAY,GACrB,oBAAoB,CAsCtB"}

package/dist/json/replacers/error.js

@@ -0,0 +1,42 @@
+import { jsonMakeReplacerFunction } from "../json-make-replacer-function.js";
+/**
+ * Create a JSON replacer function that converts Error objects into plain
+ * objects containing their non-enumerable properties (name, message, stack,
+ * cause, etc.) along with any enumerable properties.
+ *
+ * This function can be used as a base replacer to ensure that Error objects are
+ * properly serialized during JSON serialization, and can be combined with a
+ * user-defined replacer for additional customization.
+ *
+ * @param replacer An optional user-defined replacer (function or property list)
+ *   to apply after the Error replacer.
+ * @returns A JSON replacer function that handles Error objects and applies the
+ *   user-defined replacer if provided.
+ */
+export function jsonMakeErrorReplacerFunction(replacer) {
+    return jsonMakeReplacerFunction((_key, value) => {
+        if (value instanceof Error) {
+            const { 
+            // Error non-enumerable properties
+            name, message, stack, cause, 
+            // AggregateError non-enumerable properties
+            errors, 
+            // SuppressedError non-enumerable properties
+            suppressed, error, 
+            // Other enumerable properties
+            ...restError } = value;
+            return {
+                name,
+                message,
+                stack,
+                cause,
+                errors,
+                suppressed,
+                error,
+                ...restError,
+            };
+        }
+        return value;
+    }, replacer);
+}
+//# sourceMappingURL=error.js.map

package/dist/json/replacers/error.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"error.js","sourceRoot":"","sources":["../../../src/json/replacers/error.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,wBAAwB,EAAE,MAAM,mCAAmC,CAAC;AAkB7E;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,6BAA6B,CAC5C,QAAuB;IAEvB,OAAO,wBAAwB,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC/C,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;YAC5B,MAAM;YACL,kCAAkC;YAClC,IAAI,EACJ,OAAO,EACP,KAAK,EACL,KAAK;YAEL,2CAA2C;YAC3C,MAAM;YAEN,4CAA4C;YAC5C,UAAU,EACV,KAAK;YAEL,8BAA8B;YAC9B,GAAG,SAAS,EACZ,GAAG,KAGoB,CAAC;YAEzB,OAAO;gBACN,IAAI;gBACJ,OAAO;gBACP,KAAK;gBACL,KAAK;gBACL,MAAM;gBACN,UAAU;gBACV,KAAK;gBACL,GAAG,SAAS;aACZ,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC,EAAE,QAAQ,CAAC,CAAC;AACd,CAAC"}

package/dist/map/case-insensitive-map.d.ts

@@ -0,0 +1,17 @@
+/**
+ * A case-insensitive `Map`.
+ *
+ * Keys that are strings are treated in a case-insensitive manner: lookups are
+ * O(1) via an internal lowercase-to-original-key index, and `keys()`/
+ * `entries()`/iteration still yield the original casing as first inserted.
+ */
+export declare class CaseInsensitiveMap<T, U> extends Map<T, U> {
+    private readonly keyIndex_;
+    constructor(entries?: Iterable<readonly [T, U]> | null);
+    set(key: T, value: U): this;
+    get(key: T): U | undefined;
+    has(key: T): boolean;
+    delete(key: T): boolean;
+    clear(): void;
+}
+//# sourceMappingURL=case-insensitive-map.d.ts.map

package/dist/map/case-insensitive-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"case-insensitive-map.d.ts","sourceRoot":"","sources":["../../src/map/case-insensitive-map.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,qBAAa,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAEtD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAwB;IAElD,YAAY,OAAO,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,EAUrD;IAEQ,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAanC;IAEQ,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAOlC;IAEQ,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAM5B;IAEQ,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAc/B;IAEQ,KAAK,IAAI,IAAI,CAGrB;CACD"}

package/dist/map/case-insensitive-map.js

@@ -0,0 +1,64 @@
+/**
+ * A case-insensitive `Map`.
+ *
+ * Keys that are strings are treated in a case-insensitive manner: lookups are
+ * O(1) via an internal lowercase-to-original-key index, and `keys()`/
+ * `entries()`/iteration still yield the original casing as first inserted.
+ */
+export class CaseInsensitiveMap extends Map {
+    // Maps lowercased string keys to the original-cased key stored in the map.
+    keyIndex_ = new Map();
+    constructor(entries) {
+        // Skip the native constructor's iterable handling: it would call our
+        // overridden `set` before `keyIndex_` is initialized.
+        super();
+        if (entries) {
+            for (const [key, value] of entries) {
+                this.set(key, value);
+            }
+        }
+    }
+    set(key, value) {
+        if (typeof key === "string") {
+            const lower = key.toLowerCase();
+            const existingKey = this.keyIndex_.get(lower);
+            if (existingKey === undefined) {
+                this.keyIndex_.set(lower, key);
+            }
+            else {
+                key = existingKey;
+            }
+        }
+        return super.set(key, value);
+    }
+    get(key) {
+        if (typeof key === "string") {
+            const existingKey = this.keyIndex_.get(key.toLowerCase());
+            return existingKey === undefined ? undefined : super.get(existingKey);
+        }
+        return super.get(key);
+    }
+    has(key) {
+        if (typeof key === "string") {
+            return this.keyIndex_.has(key.toLowerCase());
+        }
+        return super.has(key);
+    }
+    delete(key) {
+        if (typeof key === "string") {
+            const lower = key.toLowerCase();
+            const existingKey = this.keyIndex_.get(lower);
+            if (existingKey === undefined) {
+                return false;
+            }
+            this.keyIndex_.delete(lower);
+            return super.delete(existingKey);
+        }
+        return super.delete(key);
+    }
+    clear() {
+        this.keyIndex_.clear();
+        super.clear();
+    }
+}
+//# sourceMappingURL=case-insensitive-map.js.map

package/dist/map/case-insensitive-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"case-insensitive-map.js","sourceRoot":"","sources":["../../src/map/case-insensitive-map.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,OAAO,kBAAyB,SAAQ,GAAS;IACtD,2EAA2E;IAC1D,SAAS,GAAG,IAAI,GAAG,EAAa,CAAC;IAElD,YAAY,OAA0C;QACrD,qEAAqE;QACrE,sDAAsD;QACtD,KAAK,EAAE,CAAC;QAER,IAAI,OAAO,EAAE,CAAC;YACb,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACtB,CAAC;QACF,CAAC;IACF,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,KAAQ;QAC5B,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAE9C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACP,GAAG,GAAG,WAAW,CAAC;YACnB,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAEQ,GAAG,CAAC,GAAM;QAClB,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;YAC1D,OAAO,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACvE,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAEQ,GAAG,CAAC,GAAM;QAClB,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;QAC9C,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAEQ,MAAM,CAAC,GAAM;QACrB,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAE9C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC/B,OAAO,KAAK,CAAC;YACd,CAAC;YAED,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7B,OAAO,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAClC,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAEQ,KAAK;QACb,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;CACD"}

package/dist/map/join-mappings.d.ts

@@ -0,0 +1,32 @@
+import type { Callable } from "../types/callable.js";
+/**
+ * Decides which value survives when two maps carry the same key.
+ *
+ * Receives the key, the value already accumulated, and the one arriving from a
+ * later map.
+ */
+export type MappingConflictResolver<K, V> = Callable<[
+    key: K,
+    existing: V,
+    incoming: V
+], V>;
+/**
+ * Merges several maps into one, resolving repeated keys with a stated rule.
+ *
+ * `resolveConflict` is required rather than defaulted, because the default
+ * everyone reaches for — `new Map([...a, ...b])` — silently keeps the last
+ * write, and a silent default is the bug this exists to prevent. Pass `(_key,
+ * _existing, incoming) => incoming` to ask for it deliberately.
+ *
+ * Insertion order follows first appearance: a key repeated in a later map keeps
+ * the position it was first given, only its value changes.
+ *
+ * Time complexity: O(total entries).
+ *
+ * @param maps The maps to merge, in precedence order.
+ * @param resolveConflict Called once per repeated key, with the accumulated
+ *   value and the incoming one.
+ * @returns A new map. The inputs are not modified.
+ */
+export declare function joinMappings<K, V>(maps: Iterable<ReadonlyMap<K, V>>, resolveConflict: MappingConflictResolver<K, V>): Map<K, V>;
+//# sourceMappingURL=join-mappings.d.ts.map

package/dist/map/join-mappings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-mappings.d.ts","sourceRoot":"","sources":["../../src/map/join-mappings.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAErD;;;;;GAKG;AACH,MAAM,MAAM,uBAAuB,CAAC,CAAC,EAAE,CAAC,IAAI,QAAQ,CACnD;IAAC,GAAG,EAAE,CAAC;IAAE,QAAQ,EAAE,CAAC;IAAE,QAAQ,EAAE,CAAC;CAAC,EAClC,CAAC,CACD,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAChC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EACjC,eAAe,EAAE,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,GAC5C,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAiBX"}

package/dist/map/join-mappings.js

@@ -0,0 +1,31 @@
+/**
+ * Merges several maps into one, resolving repeated keys with a stated rule.
+ *
+ * `resolveConflict` is required rather than defaulted, because the default
+ * everyone reaches for — `new Map([...a, ...b])` — silently keeps the last
+ * write, and a silent default is the bug this exists to prevent. Pass `(_key,
+ * _existing, incoming) => incoming` to ask for it deliberately.
+ *
+ * Insertion order follows first appearance: a key repeated in a later map keeps
+ * the position it was first given, only its value changes.
+ *
+ * Time complexity: O(total entries).
+ *
+ * @param maps The maps to merge, in precedence order.
+ * @param resolveConflict Called once per repeated key, with the accumulated
+ *   value and the incoming one.
+ * @returns A new map. The inputs are not modified.
+ */
+export function joinMappings(maps, resolveConflict) {
+    const joined = new Map();
+    for (const map of maps) {
+        for (const [key, value] of map) {
+            const existing = joined.get(key);
+            joined.set(key, existing === undefined && !joined.has(key)
+                ? value
+                : resolveConflict(key, existing, value));
+        }
+    }
+    return joined;
+}
+//# sourceMappingURL=join-mappings.js.map

package/dist/map/join-mappings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-mappings.js","sourceRoot":"","sources":["../../src/map/join-mappings.ts"],"names":[],"mappings":"AAaA;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,YAAY,CAC3B,IAAiC,EACjC,eAA8C;IAE9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAC;IAE/B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC;YAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEjC,MAAM,CAAC,GAAG,CACT,GAAG,EACH,QAAQ,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBACzC,CAAC,CAAC,KAAK;gBACP,CAAC,CAAC,eAAe,CAAC,GAAG,EAAE,QAAa,EAAE,KAAK,CAAC,CAC7C,CAAC;QACH,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC"}

package/dist/net/ephemeral-port.d.ts

@@ -0,0 +1,13 @@
+/** First port of the RFC 6335 dynamic / private range. */
+export declare const EPHEMERAL_PORT_MIN_VALUE = 49152;
+/** Last port of the RFC 6335 dynamic / private range. */
+export declare const EPHEMERAL_PORT_MAX_VALUE = 65535;
+/**
+ * Get a random ephemeral port number in the range suggested by RFC 6335 and the
+ * Internet Assigned Numbers Authority (IANA) for dynamic or private ports
+ * (between 49152 and 65535).
+ *
+ * @returns A random ephemeral port number.
+ */
+export declare function getRandomEphemeralPort(): number;
+//# sourceMappingURL=ephemeral-port.d.ts.map

package/dist/net/ephemeral-port.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ephemeral-port.d.ts","sourceRoot":"","sources":["../../src/net/ephemeral-port.ts"],"names":[],"mappings":"AAAA,0DAA0D;AAC1D,eAAO,MAAM,wBAAwB,QAAQ,CAAC;AAE9C,yDAAyD;AACzD,eAAO,MAAM,wBAAwB,QAAQ,CAAC;AAK9C;;;;;;GAMG;AACH,wBAAgB,sBAAsB,IAAI,MAAM,CAK/C"}

package/dist/net/ephemeral-port.js

@@ -0,0 +1,19 @@
+/** First port of the RFC 6335 dynamic / private range. */
+export const EPHEMERAL_PORT_MIN_VALUE = 49152;
+/** Last port of the RFC 6335 dynamic / private range. */
+export const EPHEMERAL_PORT_MAX_VALUE = 65535;
+const EPHEMERAL_PORT_COUNT = EPHEMERAL_PORT_MAX_VALUE - EPHEMERAL_PORT_MIN_VALUE + 1;
+/**
+ * Get a random ephemeral port number in the range suggested by RFC 6335 and the
+ * Internet Assigned Numbers Authority (IANA) for dynamic or private ports
+ * (between 49152 and 65535).
+ *
+ * @returns A random ephemeral port number.
+ */
+export function getRandomEphemeralPort() {
+    const draw = new Uint16Array(1);
+    crypto.getRandomValues(draw);
+    // 65536 is an exact multiple of the 16384-port range, so the modulo is unbiased.
+    return EPHEMERAL_PORT_MIN_VALUE + (draw[0] % EPHEMERAL_PORT_COUNT);
+}
+//# sourceMappingURL=ephemeral-port.js.map

package/dist/net/ephemeral-port.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ephemeral-port.js","sourceRoot":"","sources":["../../src/net/ephemeral-port.ts"],"names":[],"mappings":"AAAA,0DAA0D;AAC1D,MAAM,CAAC,MAAM,wBAAwB,GAAG,KAAK,CAAC;AAE9C,yDAAyD;AACzD,MAAM,CAAC,MAAM,wBAAwB,GAAG,KAAK,CAAC;AAE9C,MAAM,oBAAoB,GACzB,wBAAwB,GAAG,wBAAwB,GAAG,CAAC,CAAC;AAEzD;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB;IACrC,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAC7B,iFAAiF;IACjF,OAAO,wBAAwB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,oBAAoB,CAAC,CAAC;AACrE,CAAC"}

package/dist/net/inet-address.d.ts

@@ -0,0 +1,20 @@
+/** Represents an Internet address with IP family and address. */
+export type InetAddress = {
+    /** IP family: 4 for IPv4, 6 for IPv6, or null for unknown family. */
+    family: 4 | 6 | null;
+    /** IP address string. */
+    address: string;
+};
+/**
+ * Composes an InetAddress from a family and address. Validates and converts the
+ * family to ensure it is 4, 6, or null.
+ *
+ * @param family The IP family, either as a string ('IPv4', 'IPv6'), number (4,
+ *   6), or null for unknown.
+ * @param address The IP address string.
+ * @returns An InetAddress object.
+ * @throws {UnsupportedError} If the family is not valid (not 'IPv4'/'IPv6' or
+ *   4/6 or null).
+ */
+export declare function composeInetAddress(family: string | number | null, address: string): InetAddress;
+//# sourceMappingURL=inet-address.d.ts.map

package/dist/net/inet-address.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inet-address.d.ts","sourceRoot":"","sources":["../../src/net/inet-address.ts"],"names":[],"mappings":"AAEA,iEAAiE;AACjE,MAAM,MAAM,WAAW,GAAG;IACzB,qEAAqE;IACrE,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IACrB,yBAAyB;IACzB,OAAO,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CACjC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,EAC9B,OAAO,EAAE,MAAM,GACb,WAAW,CA6Bb"}

package/dist/net/inet-address.js

@@ -0,0 +1,42 @@
+import { UnsupportedError } from "@ac-kit/core";
+/**
+ * Composes an InetAddress from a family and address. Validates and converts the
+ * family to ensure it is 4, 6, or null.
+ *
+ * @param family The IP family, either as a string ('IPv4', 'IPv6'), number (4,
+ *   6), or null for unknown.
+ * @param address The IP address string.
+ * @returns An InetAddress object.
+ * @throws {UnsupportedError} If the family is not valid (not 'IPv4'/'IPv6' or
+ *   4/6 or null).
+ */
+export function composeInetAddress(family, address) {
+    let validatedFamily;
+    if (typeof family === "string") {
+        if (family === "IPv4") {
+            validatedFamily = 4;
+        }
+        else if (family === "IPv6") {
+            validatedFamily = 6;
+        }
+        else {
+            throw new UnsupportedError(`Unsupported IP family: ${family}. Expected 'IPv4' or 'IPv6'.`);
+        }
+    }
+    else if (typeof family === "number") {
+        if (family === 4 || family === 6) {
+            validatedFamily = family;
+        }
+        else {
+            throw new UnsupportedError(`Unsupported IP family: ${family}. Expected 4 (IPv4) or 6 (IPv6).`);
+        }
+    }
+    else {
+        validatedFamily = null;
+    }
+    return {
+        family: validatedFamily,
+        address,
+    };
+}
+//# sourceMappingURL=inet-address.js.map

package/dist/net/inet-address.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inet-address.js","sourceRoot":"","sources":["../../src/net/inet-address.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAUhD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CACjC,MAA8B,EAC9B,OAAe;IAEf,IAAI,eAA6B,CAAC;IAElC,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAChC,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACvB,eAAe,GAAG,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YAC9B,eAAe,GAAG,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACP,MAAM,IAAI,gBAAgB,CACzB,0BAA0B,MAAM,8BAA8B,CAC9D,CAAC;QACH,CAAC;IACF,CAAC;SAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QACvC,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,eAAe,GAAG,MAAM,CAAC;QAC1B,CAAC;aAAM,CAAC;YACP,MAAM,IAAI,gBAAgB,CACzB,0BAA0B,MAAM,kCAAkC,CAClE,CAAC;QACH,CAAC;IACF,CAAC;SAAM,CAAC;QACP,eAAe,GAAG,IAAI,CAAC;IACxB,CAAC;IAED,OAAO;QACN,MAAM,EAAE,eAAe;QACvB,OAAO;KACP,CAAC;AACH,CAAC"}

package/dist/net/inet-endpoint.d.ts

@@ -0,0 +1,7 @@
+import { InetAddress } from "./inet-address.js";
+/** Represents an Internet endpoint with IP family, address, and port. */
+export type InetEndpoint = InetAddress & {
+    /** Port number. */
+    port: number;
+};
+//# sourceMappingURL=inet-endpoint.d.ts.map

package/dist/net/inet-endpoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inet-endpoint.d.ts","sourceRoot":"","sources":["../../src/net/inet-endpoint.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhD,yEAAyE;AACzE,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG;IACxC,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;CACb,CAAC"}

package/dist/net/inet-endpoint.js

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

package/dist/net/inet-endpoint.js.map

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

package/dist/number/bit/bit-reverse32.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Reverses the bit order within the low 32 bits of `value` — the bit at
+ * position 0 moves to position 31 and so on.
+ *
+ * SWAR: swaps adjacent bit-pairs, then nibbles, then bytes, then the two 16-bit
+ * halves — the same halving strategy as {@link popcount32}, applied to a swap
+ * instead of a sum.
+ *
+ * @param value - The value to reverse; only its low 32 bits are considered.
+ * @returns The bit-reversed value as an unsigned 32-bit integer.
+ */
+export declare function bitReverse32(value: number): number;
+//# sourceMappingURL=bit-reverse32.d.ts.map

package/dist/number/bit/bit-reverse32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-reverse32.d.ts","sourceRoot":"","sources":["../../../src/number/bit/bit-reverse32.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAUlD"}

package/dist/number/bit/bit-reverse32.js

@@ -0,0 +1,21 @@
+/**
+ * Reverses the bit order within the low 32 bits of `value` — the bit at
+ * position 0 moves to position 31 and so on.
+ *
+ * SWAR: swaps adjacent bit-pairs, then nibbles, then bytes, then the two 16-bit
+ * halves — the same halving strategy as {@link popcount32}, applied to a swap
+ * instead of a sum.
+ *
+ * @param value - The value to reverse; only its low 32 bits are considered.
+ * @returns The bit-reversed value as an unsigned 32-bit integer.
+ */
+export function bitReverse32(value) {
+    let v = value >>> 0;
+    v = ((v >>> 1) & 0x55555555) | ((v & 0x55555555) << 1);
+    v = ((v >>> 2) & 0x33333333) | ((v & 0x33333333) << 2);
+    v = ((v >>> 4) & 0x0f0f0f0f) | ((v & 0x0f0f0f0f) << 4);
+    v = ((v >>> 8) & 0x00ff00ff) | ((v & 0x00ff00ff) << 8);
+    v = (v >>> 16) | (v << 16);
+    return v >>> 0;
+}
+//# sourceMappingURL=bit-reverse32.js.map

package/dist/number/bit/bit-reverse32.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-reverse32.js","sourceRoot":"","sources":["../../../src/number/bit/bit-reverse32.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACzC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;IAEpB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAE3B,OAAO,CAAC,KAAK,CAAC,CAAC;AAChB,CAAC"}

package/dist/number/bit/byte-swap32.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Reverses the byte order within the low 32 bits of `value` — an endian swap of
+ * a value already in hand, distinct from `getUint32Le`/`setUint32Le`, which
+ * convert between a `Uint8Array` and a number at a chosen endianness rather
+ * than flipping one already-extracted value.
+ *
+ * @param value - The value to byte-swap; only its low 32 bits are considered.
+ * @returns The byte-swapped value as an unsigned 32-bit integer.
+ */
+export declare function byteSwap32(value: number): number;
+//# sourceMappingURL=byte-swap32.d.ts.map

package/dist/number/bit/byte-swap32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"byte-swap32.d.ts","sourceRoot":"","sources":["../../../src/number/bit/byte-swap32.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAUhD"}

package/dist/number/bit/byte-swap32.js

@@ -0,0 +1,18 @@
+/**
+ * Reverses the byte order within the low 32 bits of `value` — an endian swap of
+ * a value already in hand, distinct from `getUint32Le`/`setUint32Le`, which
+ * convert between a `Uint8Array` and a number at a chosen endianness rather
+ * than flipping one already-extracted value.
+ *
+ * @param value - The value to byte-swap; only its low 32 bits are considered.
+ * @returns The byte-swapped value as an unsigned 32-bit integer.
+ */
+export function byteSwap32(value) {
+    const v = value >>> 0;
+    return ((((v & 0xff) << 24) |
+        ((v & 0xff00) << 8) |
+        ((v >>> 8) & 0xff00) |
+        ((v >>> 24) & 0xff)) >>>
+        0);
+}
+//# sourceMappingURL=byte-swap32.js.map

package/dist/number/bit/byte-swap32.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"byte-swap32.js","sourceRoot":"","sources":["../../../src/number/bit/byte-swap32.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa;IACvC,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;IAEtB,OAAO,CACN,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC;QACpB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QACrB,CAAC,CACD,CAAC;AACH,CAAC"}

package/dist/number/bit/bytes-for-bits.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Minimum number of bytes needed to hold `bits` bits.
+ *
+ * @param bits - The number of bits to fit, non-negative.
+ * @returns `⌈bits / 8⌉`.
+ */
+export declare function bytesForBits(bits: number): number;
+//# sourceMappingURL=bytes-for-bits.d.ts.map

package/dist/number/bit/bytes-for-bits.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes-for-bits.d.ts","sourceRoot":"","sources":["../../../src/number/bit/bytes-for-bits.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEjD"}

package/dist/number/bit/bytes-for-bits.js

@@ -0,0 +1,10 @@
+/**
+ * Minimum number of bytes needed to hold `bits` bits.
+ *
+ * @param bits - The number of bits to fit, non-negative.
+ * @returns `⌈bits / 8⌉`.
+ */
+export function bytesForBits(bits) {
+    return (bits + 7) >>> 3;
+}
+//# sourceMappingURL=bytes-for-bits.js.map

package/dist/number/bit/bytes-for-bits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes-for-bits.js","sourceRoot":"","sources":["../../../src/number/bit/bytes-for-bits.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY;IACxC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACzB,CAAC"}

package/dist/number/bit/ctz32.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Counts the trailing zero bits in the low 32 bits of `value`.
+ *
+ * The complement `Math.clz32` doesn't provide: that counts from the high end,
+ * nothing built in counts from the low end. `value & -value` isolates the
+ * lowest set bit, leaving a power of two whose leading-zero count fixes its
+ * position — so the answer is `31 - Math.clz32` of it. Zero has no set bit to
+ * isolate and is handled separately.
+ *
+ * @param value - The value to inspect; only its low 32 bits are considered.
+ * @returns The number of trailing zero bits, from 0 to 32. `ctz32(0)` is 32,
+ *   matching `Math.clz32(0)` being 32.
+ */
+export declare function ctz32(value: number): number;
+//# sourceMappingURL=ctz32.d.ts.map

package/dist/number/bit/ctz32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ctz32.d.ts","sourceRoot":"","sources":["../../../src/number/bit/ctz32.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAI3C"}

package/dist/number/bit/ctz32.js

@@ -0,0 +1,18 @@
+/**
+ * Counts the trailing zero bits in the low 32 bits of `value`.
+ *
+ * The complement `Math.clz32` doesn't provide: that counts from the high end,
+ * nothing built in counts from the low end. `value & -value` isolates the
+ * lowest set bit, leaving a power of two whose leading-zero count fixes its
+ * position — so the answer is `31 - Math.clz32` of it. Zero has no set bit to
+ * isolate and is handled separately.
+ *
+ * @param value - The value to inspect; only its low 32 bits are considered.
+ * @returns The number of trailing zero bits, from 0 to 32. `ctz32(0)` is 32,
+ *   matching `Math.clz32(0)` being 32.
+ */
+export function ctz32(value) {
+    const x = value >>> 0;
+    return x === 0 ? 32 : 31 - Math.clz32(x & -x);
+}
+//# sourceMappingURL=ctz32.js.map

package/dist/number/bit/ctz32.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ctz32.js","sourceRoot":"","sources":["../../../src/number/bit/ctz32.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,KAAK,CAAC,KAAa;IAClC,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;IAEtB,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC"}

package/dist/number/bit/pop-count32.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Counts the set bits in the low 32 bits of `value` (Hamming weight).
+ *
+ * SWAR (SIMD-within-a-register): sums adjacent bit-pairs, then nibbles, then
+ * bytes, then all four bytes in one multiply — no loop, no lookup table.
+ *
+ * @param value - The value to count; only its low 32 bits are considered.
+ * @returns The number of set bits, from 0 to 32.
+ */
+export declare function popCount32(value: number): number;
+//# sourceMappingURL=pop-count32.d.ts.map

package/dist/number/bit/pop-count32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pop-count32.d.ts","sourceRoot":"","sources":["../../../src/number/bit/pop-count32.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAQhD"}

package/dist/number/bit/pop-count32.js

@@ -0,0 +1,17 @@
+/**
+ * Counts the set bits in the low 32 bits of `value` (Hamming weight).
+ *
+ * SWAR (SIMD-within-a-register): sums adjacent bit-pairs, then nibbles, then
+ * bytes, then all four bytes in one multiply — no loop, no lookup table.
+ *
+ * @param value - The value to count; only its low 32 bits are considered.
+ * @returns The number of set bits, from 0 to 32.
+ */
+export function popCount32(value) {
+    let v = value >>> 0;
+    v = v - ((v >>> 1) & 0x55555555);
+    v = (v & 0x33333333) + ((v >>> 2) & 0x33333333);
+    v = (v + (v >>> 4)) & 0x0f0f0f0f;
+    return (v * 0x01010101) >>> 24;
+}
+//# sourceMappingURL=pop-count32.js.map

package/dist/number/bit/pop-count32.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pop-count32.js","sourceRoot":"","sources":["../../../src/number/bit/pop-count32.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa;IACvC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;IAEpB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IACjC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IAChD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IAEjC,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;AAChC,CAAC"}