@gitkraken/core-gitlens 0.6.0 → 0.7.1

package/dist/utils/object.d.ts

@@ -1,3 +1,4 @@
+//#region ../utils/src/object.d.ts
 /**
  * Structural deep-equality. Walks both values and short-circuits on the first difference without
  * serializing to a string (unlike a `JSON.stringify` compare): the `a === b` fast path skips
@@ -24,41 +25,15 @@ type Primitive = string | number | boolean;
 type FlattenedValue = string | number | boolean;
 type AddPrefix<P extends string | undefined, K extends string> = P extends '' | undefined ? K : `${P}.${K}`;
 type AddArrayIndex<P extends string | undefined, I extends number> = P extends '' | undefined ? `[${I}]` : `${P}[${I}]`;
-type Merge<U> = MergeUnion<U extends object ? {
-    [K in keyof U]: U[K];
-} : never>;
-type MergeUnion<U> = (U extends unknown ? (k: U) => void : never) extends (k: infer I) => void ? {
-    [K in keyof I]: I[K];
-} : never;
-type FlattenArray<T extends object, P extends string | undefined> = T extends (infer U)[] ? U extends object ? {
-    [Key in `${AddArrayIndex<P, number>}.${string}`]: FlattenedValue;
-} : {
-    [Key in AddArrayIndex<P, number>]: FlattenedValue;
-} : T extends object ? {
-    [Key in `${AddArrayIndex<P, number>}.${string}`]: FlattenedValue;
-} : {
-    [Key in AddArrayIndex<P, number>]: FlattenedValue;
-};
-type FlattenSpread<T extends object, P extends string | undefined> = T extends ReadonlyArray<any> ? FlattenArray<T, P> : {
-    [K in keyof T & string]: NonNullable<T[K]> extends Primitive ? {
-        [Key in AddPrefix<P, K>]: NonNullable<T[K]>;
-    } : T[K] extends ReadonlyArray<any> ? FlattenArray<T[K], AddPrefix<P, K>> : T[K] extends object ? FlattenSpread<T[K], AddPrefix<P, K>> : {
-        [Key in AddPrefix<P, K>]: string;
-    };
-}[keyof T & string];
-type FlattenJoin<T extends object, P extends string | undefined> = {
-    [K in keyof T & string]: NonNullable<T[K]> extends Primitive ? {
-        [Key in AddPrefix<P, K>]: NonNullable<T[K]>;
-    } : T[K] extends ReadonlyArray<any> ? {
-        [Key in AddPrefix<P, K>]: string;
-    } : T[K] extends object ? FlattenJoin<T[K], AddPrefix<P, K>> : {
-        [Key in AddPrefix<P, K>]: string;
-    };
-}[keyof T & string];
+type Merge<U> = MergeUnion<U extends object ? { [K in keyof U]: U[K]; } : never>;
+type MergeUnion<U> = (U extends unknown ? (k: U) => void : never) extends ((k: infer I) => void) ? { [K in keyof I]: I[K]; } : never;
+type FlattenArray<T extends object, P extends string | undefined> = T extends (infer U)[] ? U extends object ? { [Key in `${AddArrayIndex<P, number>}.${string}`]: FlattenedValue; } : { [Key in AddArrayIndex<P, number>]: FlattenedValue; } : T extends object ? { [Key in `${AddArrayIndex<P, number>}.${string}`]: FlattenedValue; } : { [Key in AddArrayIndex<P, number>]: FlattenedValue; };
+type FlattenSpread<T extends object, P extends string | undefined> = T extends ReadonlyArray<any> ? FlattenArray<T, P> : { [K in keyof T & string]: NonNullable<T[K]> extends Primitive ? { [Key in AddPrefix<P, K>]: NonNullable<T[K]>; } : T[K] extends ReadonlyArray<any> ? FlattenArray<T[K], AddPrefix<P, K>> : T[K] extends object ? FlattenSpread<T[K], AddPrefix<P, K>> : { [Key in AddPrefix<P, K>]: string; }; }[keyof T & string];
+type FlattenJoin<T extends object, P extends string | undefined> = { [K in keyof T & string]: NonNullable<T[K]> extends Primitive ? { [Key in AddPrefix<P, K>]: NonNullable<T[K]>; } : T[K] extends ReadonlyArray<any> ? { [Key in AddPrefix<P, K>]: string; } : T[K] extends object ? FlattenJoin<T[K], AddPrefix<P, K>> : { [Key in AddPrefix<P, K>]: string; }; }[keyof T & string];
 export type Flatten<T extends object | null | undefined, P extends string | undefined, JoinArrays extends boolean> = T extends object ? Merge<JoinArrays extends true ? FlattenJoin<T, P> : FlattenSpread<T, P>> : object;
 type FlattenOptions = {
-    joinArrays?: boolean;
-    skipPaths?: string[];
+  joinArrays?: boolean;
+  skipPaths?: string[];
 };
 export declare function flatten<T extends object | null | undefined, P extends string | undefined, O extends FlattenOptions>(o: T, prefix?: P, options?: O): Flatten<T, P, NonNullable<O['joinArrays']> extends true ? true : false>;
 export declare function filterMap<T, TMapped>(o: Record<string, T> | undefined, predicateMapper: (key: string, value: T) => TMapped | null | undefined): Record<string, TMapped>;
@@ -79,5 +54,5 @@ export declare function hasKeys(o: Record<string, any> | null | undefined): o is
  * @returns true if the object has at least the required number of properties with truthy values
  */
 export declare function hasTruthyKeys(o: Record<string, any> | null | undefined, required?: number): o is Record<string, any>;
-export {};
+//#endregion
 //# sourceMappingURL=object.d.ts.map

package/dist/utils/object.js

@@ -1,204 +1,145 @@
+//#region ../utils/src/object.ts
 /**
- * Structural deep-equality. Walks both values and short-circuits on the first difference without
- * serializing to a string (unlike a `JSON.stringify` compare): the `a === b` fast path skips
- * unchanged shared subtrees, and unequal values bail at the first mismatched field. Handles
- * primitives, `null`/`undefined`, `Date` (by timestamp), arrays, and plain objects.
- *
- * Differs from the prior `JSON.stringify` compare in three ways — each intended or matching the old
- * behavior:
- * - Key-order-insensitive (the old compare was order-sensitive). Observable at one caller
- *   (`configuration.update`, when a config value equals its schema default but with different key
- *   order), where it harmlessly treats the value as the default rather than persisting a redundant
- *   override.
- * - A present-but-`undefined` key is distinct from an absent key (the old compare dropped
- *   `undefined` keys).
- * - `Map`/`Set`/`RegExp` and other exotic objects are NOT deep-compared — they reduce to their
- *   own-enumerable keys (so two are effectively always-equal), same as the old stringify behavior.
- *   No caller compares those.
- *
- * Assumes acyclic input — it recurses without a cycle guard (a self-referential value would
- * overflow the stack). Every caller compares JSON-origin or same-shape data.
- */
-export function areEqual(a, b) {
-    if (a === b)
-        return true;
-    if (a == null || b == null)
-        return false;
-    const type = typeof a;
-    if (type !== typeof b || type !== 'object')
-        return false;
-    // Both are non-null objects from here.
-    if (a instanceof Date)
-        return b instanceof Date && a.getTime() === b.getTime();
-    if (b instanceof Date)
-        return false;
-    const aIsArray = Array.isArray(a);
-    if (aIsArray !== Array.isArray(b))
-        return false;
-    if (aIsArray) {
-        const arrA = a;
-        const arrB = b;
-        if (arrA.length !== arrB.length)
-            return false;
-        for (let i = 0; i < arrA.length; i++) {
-            if (!areEqual(arrA[i], arrB[i]))
-                return false;
-        }
-        return true;
-    }
-    const objA = a;
-    const objB = b;
-    const keysA = Object.keys(objA);
-    if (keysA.length !== Object.keys(objB).length)
-        return false;
-    // Equal key COUNT alone doesn't prove equal key SETS — without the `hasOwn` check,
-    // `{ a: 1, b: undefined }` and `{ a: 1, c: undefined }` would falsely compare equal (each
-    // missing key reads as `undefined`). The count check plus "every A-key is an own-key of B"
-    // together guarantee identical key sets.
-    for (const key of keysA) {
-        if (!Object.hasOwn(objB, key) || !areEqual(objA[key], objB[key]))
-            return false;
-    }
-    return true;
+* Structural deep-equality. Walks both values and short-circuits on the first difference without
+* serializing to a string (unlike a `JSON.stringify` compare): the `a === b` fast path skips
+* unchanged shared subtrees, and unequal values bail at the first mismatched field. Handles
+* primitives, `null`/`undefined`, `Date` (by timestamp), arrays, and plain objects.
+*
+* Differs from the prior `JSON.stringify` compare in three ways — each intended or matching the old
+* behavior:
+* - Key-order-insensitive (the old compare was order-sensitive). Observable at one caller
+*   (`configuration.update`, when a config value equals its schema default but with different key
+*   order), where it harmlessly treats the value as the default rather than persisting a redundant
+*   override.
+* - A present-but-`undefined` key is distinct from an absent key (the old compare dropped
+*   `undefined` keys).
+* - `Map`/`Set`/`RegExp` and other exotic objects are NOT deep-compared — they reduce to their
+*   own-enumerable keys (so two are effectively always-equal), same as the old stringify behavior.
+*   No caller compares those.
+*
+* Assumes acyclic input — it recurses without a cycle guard (a self-referential value would
+* overflow the stack). Every caller compares JSON-origin or same-shape data.
+*/
+function areEqual(a, b) {
+	if (a === b) return true;
+	if (a == null || b == null) return false;
+	const type = typeof a;
+	if (type !== typeof b || type !== "object") return false;
+	if (a instanceof Date) return b instanceof Date && a.getTime() === b.getTime();
+	if (b instanceof Date) return false;
+	const aIsArray = Array.isArray(a);
+	if (aIsArray !== Array.isArray(b)) return false;
+	if (aIsArray) {
+		const arrA = a;
+		const arrB = b;
+		if (arrA.length !== arrB.length) return false;
+		for (let i = 0; i < arrA.length; i++) if (!areEqual(arrA[i], arrB[i])) return false;
+		return true;
+	}
+	const objA = a;
+	const objB = b;
+	const keysA = Object.keys(objA);
+	if (keysA.length !== Object.keys(objB).length) return false;
+	for (const key of keysA) if (!Object.hasOwn(objB, key) || !areEqual(objA[key], objB[key])) return false;
+	return true;
 }
-export function flatten(o, prefix, options) {
-    const joinArrays = options?.joinArrays ?? false;
-    const skipPaths = options?.skipPaths?.length
-        ? prefix
-            ? options.skipPaths.map(p => `${prefix}.${p}`)
-            : options.skipPaths
-        : undefined;
-    function flattenCore(flattened, key, value) {
-        if (skipPaths?.includes(key))
-            return;
-        if (Object(value) !== value) {
-            if (value == null)
-                return;
-            flattened[key] =
-                typeof value === 'string'
-                    ? value
-                    : typeof value === 'number' || typeof value === 'boolean'
-                        ? value
-                        : JSON.stringify(value);
-        }
-        else if (Array.isArray(value)) {
-            const len = value.length;
-            if (len === 0)
-                return;
-            if (joinArrays) {
-                flattened[key] = value.join(',');
-            }
-            else {
-                for (let i = 0; i < len; i++) {
-                    flattenCore(flattened, `${key}[${i}]`, value[i]);
-                }
-            }
-        }
-        else {
-            const entries = Object.entries(value);
-            if (entries.length === 0)
-                return;
-            for (const [k, v] of entries) {
-                flattenCore(flattened, key ? `${key}.${k}` : k, v);
-            }
-        }
-    }
-    const flattened = Object.create(null);
-    flattenCore(flattened, prefix ?? '', o);
-    return flattened;
+function flatten(o, prefix, options) {
+	const joinArrays = options?.joinArrays ?? false;
+	const skipPaths = options?.skipPaths?.length ? prefix ? options.skipPaths.map((p) => `${prefix}.${p}`) : options.skipPaths : void 0;
+	function flattenCore(flattened, key, value) {
+		if (skipPaths?.includes(key)) return;
+		if (Object(value) !== value) {
+			if (value == null) return;
+			flattened[key] = typeof value === "string" ? value : typeof value === "number" || typeof value === "boolean" ? value : JSON.stringify(value);
+		} else if (Array.isArray(value)) {
+			const len = value.length;
+			if (len === 0) return;
+			if (joinArrays) flattened[key] = value.join(",");
+			else for (let i = 0; i < len; i++) flattenCore(flattened, `${key}[${i}]`, value[i]);
+		} else {
+			const entries = Object.entries(value);
+			if (entries.length === 0) return;
+			for (const [k, v] of entries) flattenCore(flattened, key ? `${key}.${k}` : k, v);
+		}
+	}
+	const flattened = Object.create(null);
+	flattenCore(flattened, prefix ?? "", o);
+	return flattened;
 }
-export function filterMap(o, predicateMapper) {
-    if (o == null)
-        return {};
-    const result = {};
-    for (const [key, value] of Object.entries(o)) {
-        const mapped = predicateMapper(key, value);
-        if (mapped == null)
-            continue;
-        result[key] = mapped;
-    }
-    return result;
+function filterMap(o, predicateMapper) {
+	if (o == null) return {};
+	const result = {};
+	for (const [key, value] of Object.entries(o)) {
+		const mapped = predicateMapper(key, value);
+		if (mapped == null) continue;
+		result[key] = mapped;
+	}
+	return result;
 }
-export function filterMapEntries(o, predicateMapper) {
-    if (o == null)
-        return [];
-    const result = [];
-    for (const [key, value] of Object.entries(o)) {
-        const mapped = predicateMapper(key, value);
-        if (mapped == null)
-            continue;
-        result.push([key, mapped]);
-    }
-    return result;
+function filterMapEntries(o, predicateMapper) {
+	if (o == null) return [];
+	const result = [];
+	for (const [key, value] of Object.entries(o)) {
+		const mapped = predicateMapper(key, value);
+		if (mapped == null) continue;
+		result.push([key, mapped]);
+	}
+	return result;
 }
-export function filterMapValues(o, predicateMapper) {
-    if (o == null)
-        return [];
-    const result = [];
-    for (const key in o) {
-        const mapped = predicateMapper(o[key]);
-        if (mapped == null)
-            continue;
-        result.push(mapped);
-    }
-    return result;
+function filterMapValues(o, predicateMapper) {
+	if (o == null) return [];
+	const result = [];
+	for (const key in o) {
+		const mapped = predicateMapper(o[key]);
+		if (mapped == null) continue;
+		result.push(mapped);
+	}
+	return result;
 }
-export function paths(o, path) {
-    const results = [];
-    for (const key in o) {
-        const child = o[key];
-        if (typeof child === 'object') {
-            results.push(...paths(child, path === undefined ? key : `${path}.${key}`));
-        }
-        else {
-            results.push(path === undefined ? key : `${path}.${key}`);
-        }
-    }
-    return results;
+function paths(o, path) {
+	const results = [];
+	for (const key in o) {
+		const child = o[key];
+		if (typeof child === "object") results.push(...paths(child, path === void 0 ? key : `${path}.${key}`));
+		else results.push(path === void 0 ? key : `${path}.${key}`);
+	}
+	return results;
 }
-export function updateRecordValue(o, key, value) {
-    o ??= Object.create(null);
-    if (value != null && (typeof value !== 'boolean' || value)) {
-        if (typeof value === 'object') {
-            o[key] = { ...value };
-        }
-        else {
-            o[key] = value;
-        }
-    }
-    else {
-        const { [key]: _, ...rest } = o;
-        o = rest;
-    }
-    return o;
+function updateRecordValue(o, key, value) {
+	o ??= Object.create(null);
+	if (value != null && (typeof value !== "boolean" || value)) {
+		if (typeof value === "object") o[key] = { ...value };
+		else o[key] = value;
+	} else {
+		const { [key]: _, ...rest } = o;
+		o = rest;
+	}
+	return o;
 }
 /**
- * Efficiently checks if an object has at least one own enumerable property
- * @param o - The object to check
- * @returns true if the object has at least one own enumerable property, false otherwise
- */
-export function hasKeys(o) {
-    for (const k in o) {
-        if (Object.hasOwn(o, k))
-            return true;
-    }
-    return false;
+* Efficiently checks if an object has at least one own enumerable property
+* @param o - The object to check
+* @returns true if the object has at least one own enumerable property, false otherwise
+*/
+function hasKeys(o) {
+	for (const k in o) if (Object.hasOwn(o, k)) return true;
+	return false;
 }
 /**
- * Efficiently checks if an object has at least the specified number of truthy values (or at least one if not specified)
- * @param o - The object to check (typically a Record<string, boolean>)
- * @param required - The minimum number of truthy values required (default: 1)
- * @returns true if the object has at least the required number of properties with truthy values
- */
-export function hasTruthyKeys(o, required = 1) {
-    let count = 0;
-    for (const k in o) {
-        if (Object.hasOwn(o, k) && o[k]) {
-            count++;
-            if (count >= required)
-                return true; // Early exit once we know we have enough
-        }
-    }
-    return count >= required;
+* Efficiently checks if an object has at least the specified number of truthy values (or at least one if not specified)
+* @param o - The object to check (typically a Record<string, boolean>)
+* @param required - The minimum number of truthy values required (default: 1)
+* @returns true if the object has at least the required number of properties with truthy values
+*/
+function hasTruthyKeys(o, required = 1) {
+	let count = 0;
+	for (const k in o) if (Object.hasOwn(o, k) && o[k]) {
+		count++;
+		if (count >= required) return true;
+	}
+	return count >= required;
 }
+//#endregion
+export { areEqual, filterMap, filterMapEntries, filterMapValues, flatten, hasKeys, hasTruthyKeys, paths, updateRecordValue };
+
 //# sourceMappingURL=object.js.map

package/dist/utils/object.js.map

@@ -1 +1 @@
-{"version":3,"file":"object.js","sourceRoot":"","sources":["../../src/utils/object.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAU,EAAE,CAAU;IAC9C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI;QAAE,OAAO,KAAK,CAAC;IAEzC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC;IACtB,IAAI,IAAI,KAAK,OAAO,CAAC,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAEzD,uCAAuC;IACvC,IAAI,CAAC,YAAY,IAAI;QAAE,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;IAC/E,IAAI,CAAC,YAAY,IAAI;QAAE,OAAO,KAAK,CAAC;IAEpC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClC,IAAI,QAAQ,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAEhD,IAAI,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,CAAc,CAAC;QAC5B,MAAM,IAAI,GAAG,CAAc,CAAC;QAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAE9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC/C,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,IAAI,GAAG,CAA4B,CAAC;IAC1C,MAAM,IAAI,GAAG,CAA4B,CAAC;IAC1C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAE5D,mFAAmF;IACnF,0FAA0F;IAC1F,2FAA2F;IAC3F,yCAAyC;IACzC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAChF,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAsDD,MAAM,UAAU,OAAO,CACtB,CAAI,EACJ,MAAU,EACV,OAAW;IAEX,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,KAAK,CAAC;IAEhD,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,MAAM;QAC3C,CAAC,CAAC,MAAM;YACP,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC;YAC9C,CAAC,CAAC,OAAO,CAAC,SAAS;QACpB,CAAC,CAAC,SAAS,CAAC;IAEb,SAAS,WAAW,CAAC,SAA8B,EAAE,GAAW,EAAE,KAAU;QAC3E,IAAI,SAAS,EAAE,QAAQ,CAAC,GAAG,CAAC;YAAE,OAAO;QAErC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE,CAAC;YAC7B,IAAI,KAAK,IAAI,IAAI;gBAAE,OAAO;YAE1B,SAAS,CAAC,GAAG,CAAC;gBACb,OAAO,KAAK,KAAK,QAAQ;oBACxB,CAAC,CAAC,KAAK;oBACP,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,SAAS;wBACxD,CAAC,CAAC,KAAK;wBACP,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;YACzB,IAAI,GAAG,KAAK,CAAC;gBAAE,OAAO;YAEtB,IAAI,UAAU,EAAE,CAAC;gBAChB,SAAS,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,WAAW,CAAC,SAAS,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClD,CAAC;YACF,CAAC;QACF,CAAC;aAAM,CAAC;YACP,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO;YAEjC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;gBAC9B,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpD,CAAC;QACF,CAAC;IACF,CAAC;IAED,MAAM,SAAS,GAAwB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3D,WAAW,CAAC,SAAS,EAAE,MAAM,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IACxC,OAAO,SAAoF,CAAC;AAC7F,CAAC;AAED,MAAM,UAAU,SAAS,CACxB,CAAgC,EAChC,eAAsE;IAEtE,IAAI,CAAC,IAAI,IAAI;QAAE,OAAO,EAAE,CAAC;IAEzB,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,MAAM,IAAI,IAAI;YAAE,SAAS;QAE7B,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IACtB,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC/B,CAAgC,EAChC,eAAsE;IAEtE,IAAI,CAAC,IAAI,IAAI;QAAE,OAAO,EAAE,CAAC;IAEzB,MAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,MAAM,IAAI,IAAI;YAAE,SAAS;QAE7B,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,UAAU,eAAe,CAC9B,CAAgC,EAChC,eAAyD;IAEzD,IAAI,CAAC,IAAI,IAAI;QAAE,OAAO,EAAE,CAAC;IAEzB,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,MAAM,IAAI,IAAI;YAAE,SAAS;QAE7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,CAAsB,EAAE,IAAa;IAC1D,MAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAC5E,CAAC;aAAM,CAAC;YACP,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;QAC3D,CAAC;IACF,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,iBAAiB,CAChC,CAAgC,EAChC,GAAW,EACX,KAAoB;IAEpB,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAsB,CAAC;IAE/C,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,EAAE,CAAC;QAC5D,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC/B,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;QACvB,CAAC;aAAM,CAAC;YACP,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QAChB,CAAC;IACF,CAAC;SAAM,CAAC;QACP,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC,GAAG,IAAI,CAAC;IACV,CAAC;IACD,OAAO,CAAC,CAAC;AACV,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,CAAyC;IAChE,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC5B,CAAyC,EACzC,QAAQ,GAAW,CAAC;IAEpB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjC,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,IAAI,QAAQ;gBAAE,OAAO,IAAI,CAAC,CAAC,yCAAyC;QAC9E,CAAC;IACF,CAAC;IACD,OAAO,KAAK,IAAI,QAAQ,CAAC;AAC1B,CAAC"}
+{"version":3,"file":"object.js","names":[],"sources":["../../../utils/src/object.ts"],"sourcesContent":["/**\n * Structural deep-equality. Walks both values and short-circuits on the first difference without\n * serializing to a string (unlike a `JSON.stringify` compare): the `a === b` fast path skips\n * unchanged shared subtrees, and unequal values bail at the first mismatched field. Handles\n * primitives, `null`/`undefined`, `Date` (by timestamp), arrays, and plain objects.\n *\n * Differs from the prior `JSON.stringify` compare in three ways — each intended or matching the old\n * behavior:\n * - Key-order-insensitive (the old compare was order-sensitive). Observable at one caller\n *   (`configuration.update`, when a config value equals its schema default but with different key\n *   order), where it harmlessly treats the value as the default rather than persisting a redundant\n *   override.\n * - A present-but-`undefined` key is distinct from an absent key (the old compare dropped\n *   `undefined` keys).\n * - `Map`/`Set`/`RegExp` and other exotic objects are NOT deep-compared — they reduce to their\n *   own-enumerable keys (so two are effectively always-equal), same as the old stringify behavior.\n *   No caller compares those.\n *\n * Assumes acyclic input — it recurses without a cycle guard (a self-referential value would\n * overflow the stack). Every caller compares JSON-origin or same-shape data.\n */\nexport function areEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true;\n\tif (a == null || b == null) return false;\n\n\tconst type = typeof a;\n\tif (type !== typeof b || type !== 'object') return false;\n\n\t// Both are non-null objects from here.\n\tif (a instanceof Date) return b instanceof Date && a.getTime() === b.getTime();\n\tif (b instanceof Date) return false;\n\n\tconst aIsArray = Array.isArray(a);\n\tif (aIsArray !== Array.isArray(b)) return false;\n\n\tif (aIsArray) {\n\t\tconst arrA = a as unknown[];\n\t\tconst arrB = b as unknown[];\n\t\tif (arrA.length !== arrB.length) return false;\n\n\t\tfor (let i = 0; i < arrA.length; i++) {\n\t\t\tif (!areEqual(arrA[i], arrB[i])) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tconst objA = a as Record<string, unknown>;\n\tconst objB = b as Record<string, unknown>;\n\tconst keysA = Object.keys(objA);\n\tif (keysA.length !== Object.keys(objB).length) return false;\n\n\t// Equal key COUNT alone doesn't prove equal key SETS — without the `hasOwn` check,\n\t// `{ a: 1, b: undefined }` and `{ a: 1, c: undefined }` would falsely compare equal (each\n\t// missing key reads as `undefined`). The count check plus \"every A-key is an own-key of B\"\n\t// together guarantee identical key sets.\n\tfor (const key of keysA) {\n\t\tif (!Object.hasOwn(objB, key) || !areEqual(objA[key], objB[key])) return false;\n\t}\n\treturn true;\n}\n\ntype Primitive = string | number | boolean;\ntype FlattenedValue = string | number | boolean;\ntype AddPrefix<P extends string | undefined, K extends string> = P extends '' | undefined ? K : `${P}.${K}`;\ntype AddArrayIndex<P extends string | undefined, I extends number> = P extends '' | undefined ? `[${I}]` : `${P}[${I}]`;\n\ntype Merge<U> = MergeUnion<U extends object ? { [K in keyof U]: U[K] } : never>;\ntype MergeUnion<U> = (U extends unknown ? (k: U) => void : never) extends (k: infer I) => void\n\t? { [K in keyof I]: I[K] }\n\t: never;\n\ntype FlattenArray<T extends object, P extends string | undefined> = T extends (infer U)[]\n\t? U extends object\n\t\t? { [Key in `${AddArrayIndex<P, number>}.${string}`]: FlattenedValue }\n\t\t: { [Key in AddArrayIndex<P, number>]: FlattenedValue }\n\t: T extends object\n\t\t? { [Key in `${AddArrayIndex<P, number>}.${string}`]: FlattenedValue }\n\t\t: { [Key in AddArrayIndex<P, number>]: FlattenedValue };\n\ntype FlattenSpread<T extends object, P extends string | undefined> =\n\tT extends ReadonlyArray<any>\n\t\t? FlattenArray<T, P>\n\t\t: {\n\t\t\t\t[K in keyof T & string]: NonNullable<T[K]> extends Primitive\n\t\t\t\t\t? { [Key in AddPrefix<P, K>]: NonNullable<T[K]> }\n\t\t\t\t\t: T[K] extends ReadonlyArray<any>\n\t\t\t\t\t\t? FlattenArray<T[K], AddPrefix<P, K>>\n\t\t\t\t\t\t: T[K] extends object\n\t\t\t\t\t\t\t? FlattenSpread<T[K], AddPrefix<P, K>>\n\t\t\t\t\t\t\t: { [Key in AddPrefix<P, K>]: string };\n\t\t\t}[keyof T & string];\n\ntype FlattenJoin<T extends object, P extends string | undefined> = {\n\t[K in keyof T & string]: NonNullable<T[K]> extends Primitive\n\t\t? { [Key in AddPrefix<P, K>]: NonNullable<T[K]> }\n\t\t: T[K] extends ReadonlyArray<any>\n\t\t\t? { [Key in AddPrefix<P, K>]: string }\n\t\t\t: T[K] extends object\n\t\t\t\t? FlattenJoin<T[K], AddPrefix<P, K>>\n\t\t\t\t: { [Key in AddPrefix<P, K>]: string };\n}[keyof T & string];\n\nexport type Flatten<\n\tT extends object | null | undefined,\n\tP extends string | undefined,\n\tJoinArrays extends boolean,\n> = T extends object ? Merge<JoinArrays extends true ? FlattenJoin<T, P> : FlattenSpread<T, P>> : object;\n\ntype FlattenOptions = {\n\tjoinArrays?: boolean;\n\tskipPaths?: string[];\n};\n\nexport function flatten<T extends object | null | undefined, P extends string | undefined, O extends FlattenOptions>(\n\to: T,\n\tprefix?: P,\n\toptions?: O,\n): Flatten<T, P, NonNullable<O['joinArrays']> extends true ? true : false> {\n\tconst joinArrays = options?.joinArrays ?? false;\n\n\tconst skipPaths = options?.skipPaths?.length\n\t\t? prefix\n\t\t\t? options.skipPaths.map(p => `${prefix}.${p}`)\n\t\t\t: options.skipPaths\n\t\t: undefined;\n\n\tfunction flattenCore(flattened: Record<string, any>, key: string, value: any) {\n\t\tif (skipPaths?.includes(key)) return;\n\n\t\tif (Object(value) !== value) {\n\t\t\tif (value == null) return;\n\n\t\t\tflattened[key] =\n\t\t\t\ttypeof value === 'string'\n\t\t\t\t\t? value\n\t\t\t\t\t: typeof value === 'number' || typeof value === 'boolean'\n\t\t\t\t\t\t? value\n\t\t\t\t\t\t: JSON.stringify(value);\n\t\t} else if (Array.isArray(value)) {\n\t\t\tconst len = value.length;\n\t\t\tif (len === 0) return;\n\n\t\t\tif (joinArrays) {\n\t\t\t\tflattened[key] = value.join(',');\n\t\t\t} else {\n\t\t\t\tfor (let i = 0; i < len; i++) {\n\t\t\t\t\tflattenCore(flattened, `${key}[${i}]`, value[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tconst entries = Object.entries(value);\n\t\t\tif (entries.length === 0) return;\n\n\t\t\tfor (const [k, v] of entries) {\n\t\t\t\tflattenCore(flattened, key ? `${key}.${k}` : k, v);\n\t\t\t}\n\t\t}\n\t}\n\n\tconst flattened: Record<string, any> = Object.create(null);\n\tflattenCore(flattened, prefix ?? '', o);\n\treturn flattened as Flatten<T, P, NonNullable<O['joinArrays']> extends true ? true : false>;\n}\n\nexport function filterMap<T, TMapped>(\n\to: Record<string, T> | undefined,\n\tpredicateMapper: (key: string, value: T) => TMapped | null | undefined,\n): Record<string, TMapped> {\n\tif (o == null) return {};\n\n\tconst result: Record<string, TMapped> = {};\n\tfor (const [key, value] of Object.entries(o)) {\n\t\tconst mapped = predicateMapper(key, value);\n\t\tif (mapped == null) continue;\n\n\t\tresult[key] = mapped;\n\t}\n\treturn result;\n}\n\nexport function filterMapEntries<T, TMapped>(\n\to: Record<string, T> | undefined,\n\tpredicateMapper: (key: string, value: T) => TMapped | null | undefined,\n): [string, TMapped][] {\n\tif (o == null) return [];\n\n\tconst result: [string, TMapped][] = [];\n\tfor (const [key, value] of Object.entries(o)) {\n\t\tconst mapped = predicateMapper(key, value);\n\t\tif (mapped == null) continue;\n\n\t\tresult.push([key, mapped]);\n\t}\n\treturn result;\n}\n\nexport function filterMapValues<T, TMapped>(\n\to: Record<string, T> | undefined,\n\tpredicateMapper: (value: T) => TMapped | null | undefined,\n): TMapped[] {\n\tif (o == null) return [];\n\n\tconst result: TMapped[] = [];\n\tfor (const key in o) {\n\t\tconst mapped = predicateMapper(o[key]);\n\t\tif (mapped == null) continue;\n\n\t\tresult.push(mapped);\n\t}\n\treturn result;\n}\n\nexport function paths(o: Record<string, any>, path?: string): string[] {\n\tconst results = [];\n\n\tfor (const key in o) {\n\t\tconst child = o[key];\n\t\tif (typeof child === 'object') {\n\t\t\tresults.push(...paths(child, path === undefined ? key : `${path}.${key}`));\n\t\t} else {\n\t\t\tresults.push(path === undefined ? key : `${path}.${key}`);\n\t\t}\n\t}\n\n\treturn results;\n}\n\nexport function updateRecordValue<T>(\n\to: Record<string, T> | undefined,\n\tkey: string,\n\tvalue: T | undefined,\n): Record<string, T> {\n\to ??= Object.create(null) as Record<string, T>;\n\n\tif (value != null && (typeof value !== 'boolean' || value)) {\n\t\tif (typeof value === 'object') {\n\t\t\to[key] = { ...value };\n\t\t} else {\n\t\t\to[key] = value;\n\t\t}\n\t} else {\n\t\tconst { [key]: _, ...rest } = o;\n\t\to = rest;\n\t}\n\treturn o;\n}\n\n/**\n * Efficiently checks if an object has at least one own enumerable property\n * @param o - The object to check\n * @returns true if the object has at least one own enumerable property, false otherwise\n */\nexport function hasKeys(o: Record<string, any> | null | undefined): o is Record<string, any> {\n\tfor (const k in o) {\n\t\tif (Object.hasOwn(o, k)) return true;\n\t}\n\treturn false;\n}\n\n/**\n * Efficiently checks if an object has at least the specified number of truthy values (or at least one if not specified)\n * @param o - The object to check (typically a Record<string, boolean>)\n * @param required - The minimum number of truthy values required (default: 1)\n * @returns true if the object has at least the required number of properties with truthy values\n */\nexport function hasTruthyKeys(\n\to: Record<string, any> | null | undefined,\n\trequired: number = 1,\n): o is Record<string, any> {\n\tlet count = 0;\n\tfor (const k in o) {\n\t\tif (Object.hasOwn(o, k) && o[k]) {\n\t\t\tcount++;\n\t\t\tif (count >= required) return true; // Early exit once we know we have enough\n\t\t}\n\t}\n\treturn count >= required;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,SAAS,GAAY,GAAqB;CACzD,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,KAAK,QAAQ,KAAK,MAAM,OAAO;CAEnC,MAAM,OAAO,OAAO;CACpB,IAAI,SAAS,OAAO,KAAK,SAAS,UAAU,OAAO;CAGnD,IAAI,aAAa,MAAM,OAAO,aAAa,QAAQ,EAAE,QAAQ,MAAM,EAAE,QAAQ;CAC7E,IAAI,aAAa,MAAM,OAAO;CAE9B,MAAM,WAAW,MAAM,QAAQ,CAAC;CAChC,IAAI,aAAa,MAAM,QAAQ,CAAC,GAAG,OAAO;CAE1C,IAAI,UAAU;EACb,MAAM,OAAO;EACb,MAAM,OAAO;EACb,IAAI,KAAK,WAAW,KAAK,QAAQ,OAAO;EAExC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAChC,IAAI,CAAC,SAAS,KAAK,IAAI,KAAK,EAAE,GAAG,OAAO;EAEzC,OAAO;CACR;CAEA,MAAM,OAAO;CACb,MAAM,OAAO;CACb,MAAM,QAAQ,OAAO,KAAK,IAAI;CAC9B,IAAI,MAAM,WAAW,OAAO,KAAK,IAAI,CAAC,CAAC,QAAQ,OAAO;CAMtD,KAAK,MAAM,OAAO,OACjB,IAAI,CAAC,OAAO,OAAO,MAAM,GAAG,KAAK,CAAC,SAAS,KAAK,MAAM,KAAK,IAAI,GAAG,OAAO;CAE1E,OAAO;AACR;AAsDA,SAAgB,QACf,GACA,QACA,SAC0E;CAC1E,MAAM,aAAa,SAAS,cAAc;CAE1C,MAAM,YAAY,SAAS,WAAW,SACnC,SACC,QAAQ,UAAU,KAAI,MAAK,GAAG,OAAO,GAAG,GAAG,IAC3C,QAAQ,YACT,KAAA;CAEH,SAAS,YAAY,WAAgC,KAAa,OAAY;EAC7E,IAAI,WAAW,SAAS,GAAG,GAAG;EAE9B,IAAI,OAAO,KAAK,MAAM,OAAO;GAC5B,IAAI,SAAS,MAAM;GAEnB,UAAU,OACT,OAAO,UAAU,WACd,QACA,OAAO,UAAU,YAAY,OAAO,UAAU,YAC7C,QACA,KAAK,UAAU,KAAK;EAC1B,OAAO,IAAI,MAAM,QAAQ,KAAK,GAAG;GAChC,MAAM,MAAM,MAAM;GAClB,IAAI,QAAQ,GAAG;GAEf,IAAI,YACH,UAAU,OAAO,MAAM,KAAK,GAAG;QAE/B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KACxB,YAAY,WAAW,GAAG,IAAI,GAAG,EAAE,IAAI,MAAM,EAAE;EAGlD,OAAO;GACN,MAAM,UAAU,OAAO,QAAQ,KAAK;GACpC,IAAI,QAAQ,WAAW,GAAG;GAE1B,KAAK,MAAM,CAAC,GAAG,MAAM,SACpB,YAAY,WAAW,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,CAAC;EAEnD;CACD;CAEA,MAAM,YAAiC,OAAO,OAAO,IAAI;CACzD,YAAY,WAAW,UAAU,IAAI,CAAC;CACtC,OAAO;AACR;AAEA,SAAgB,UACf,GACA,iBAC0B;CAC1B,IAAI,KAAK,MAAM,OAAO,CAAC;CAEvB,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,CAAC,GAAG;EAC7C,MAAM,SAAS,gBAAgB,KAAK,KAAK;EACzC,IAAI,UAAU,MAAM;EAEpB,OAAO,OAAO;CACf;CACA,OAAO;AACR;AAEA,SAAgB,iBACf,GACA,iBACsB;CACtB,IAAI,KAAK,MAAM,OAAO,CAAC;CAEvB,MAAM,SAA8B,CAAC;CACrC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,CAAC,GAAG;EAC7C,MAAM,SAAS,gBAAgB,KAAK,KAAK;EACzC,IAAI,UAAU,MAAM;EAEpB,OAAO,KAAK,CAAC,KAAK,MAAM,CAAC;CAC1B;CACA,OAAO;AACR;AAEA,SAAgB,gBACf,GACA,iBACY;CACZ,IAAI,KAAK,MAAM,OAAO,CAAC;CAEvB,MAAM,SAAoB,CAAC;CAC3B,KAAK,MAAM,OAAO,GAAG;EACpB,MAAM,SAAS,gBAAgB,EAAE,IAAI;EACrC,IAAI,UAAU,MAAM;EAEpB,OAAO,KAAK,MAAM;CACnB;CACA,OAAO;AACR;AAEA,SAAgB,MAAM,GAAwB,MAAyB;CACtE,MAAM,UAAU,CAAC;CAEjB,KAAK,MAAM,OAAO,GAAG;EACpB,MAAM,QAAQ,EAAE;EAChB,IAAI,OAAO,UAAU,UACpB,QAAQ,KAAK,GAAG,MAAM,OAAO,SAAS,KAAA,IAAY,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;OAEzE,QAAQ,KAAK,SAAS,KAAA,IAAY,MAAM,GAAG,KAAK,GAAG,KAAK;CAE1D;CAEA,OAAO;AACR;AAEA,SAAgB,kBACf,GACA,KACA,OACoB;CACpB,MAAM,OAAO,OAAO,IAAI;CAExB,IAAI,SAAS,SAAS,OAAO,UAAU,aAAa,QAAQ;EAC3D,IAAI,OAAO,UAAU,UACpB,EAAE,OAAO,EAAE,GAAG,MAAM;OAEpB,EAAE,OAAO;CAEX,OAAO;EACN,MAAM,GAAG,MAAM,GAAG,GAAG,SAAS;EAC9B,IAAI;CACL;CACA,OAAO;AACR;;;;;;AAOA,SAAgB,QAAQ,GAAqE;CAC5F,KAAK,MAAM,KAAK,GACf,IAAI,OAAO,OAAO,GAAG,CAAC,GAAG,OAAO;CAEjC,OAAO;AACR;;;;;;;AAQA,SAAgB,cACf,GACA,WAAmB,GACQ;CAC3B,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,GACf,IAAI,OAAO,OAAO,GAAG,CAAC,KAAK,EAAE,IAAI;EAChC;EACA,IAAI,SAAS,UAAU,OAAO;CAC/B;CAED,OAAO,SAAS;AACjB"}

package/dist/utils/paging.d.ts

@@ -1,48 +1,50 @@
+//#region ../utils/src/paging.d.ts
 export interface PagedResult<T> {
-    readonly paging?: {
-        readonly cursor: string;
-        readonly more: boolean;
-        /**
-         * True when the results may be incomplete in a way that following `cursor` won't resolve. Two sources:
-         * a read that fetched a single default page and can't report `hasNextPage` (no cursor to follow at all),
-         * or a multi-scope read where a sibling scope failed (`partial`/`unknown` completeness) even though the
-         * current scope still exposes a real next page. `truncated` is therefore independent of `more`: `more`
-         * means "there is a next page you can fetch with `cursor`"; `truncated` means "content may be missing
-         * that paging alone won't recover." Consumers should surface this as a truncation signal rather than
-         * treating the result as complete, and should not assume `truncated` implies `more` is false.
-         */
-        readonly truncated?: boolean;
-        /** 1-based page that produced this result. Populated by numbered-page providers only. */
-        readonly page?: number;
-        /** Items requested per page, when known. */
-        readonly pageSize?: number;
-        /** Next page number, when the provider pages by number. */
-        readonly nextPage?: number;
-        /** Total number of pages, when the provider reports totals. */
-        readonly totalPages?: number;
-        /** Total number of items across all pages, when the provider reports totals. */
-        readonly totalCount?: number;
-    };
-    readonly values: NonNullable<T>[];
+  readonly paging?: {
+    readonly cursor: string;
+    readonly more: boolean;
+    /**
+     * True when the results may be incomplete in a way that following `cursor` won't resolve. Two sources:
+     * a read that fetched a single default page and can't report `hasNextPage` (no cursor to follow at all),
+     * or a multi-scope read where a sibling scope failed (`partial`/`unknown` completeness) even though the
+     * current scope still exposes a real next page. `truncated` is therefore independent of `more`: `more`
+     * means "there is a next page you can fetch with `cursor`"; `truncated` means "content may be missing
+     * that paging alone won't recover." Consumers should surface this as a truncation signal rather than
+     * treating the result as complete, and should not assume `truncated` implies `more` is false.
+     */
+    readonly truncated?: boolean;
+    /** 1-based page that produced this result. Populated by numbered-page providers only. */
+    readonly page?: number;
+    /** Items requested per page, when known. */
+    readonly pageSize?: number;
+    /** Next page number, when the provider pages by number. */
+    readonly nextPage?: number;
+    /** Total number of pages, when the provider reports totals. */
+    readonly totalPages?: number;
+    /** Total number of items across all pages, when the provider reports totals. */
+    readonly totalCount?: number;
+  };
+  readonly values: NonNullable<T>[];
 }
 /** A shared, frozen empty result to avoid allocating on every "nothing found" path. */
 export declare const emptyPagedResult: PagedResult<any>;
 export interface PagingOptions {
-    cursor?: string;
-    /** 1-based page to request from numbered-page providers. */
-    page?: number;
-    /** Items to request per page (numbered-page providers, and GitHub's cursor pages). */
-    pageSize?: number;
+  cursor?: string;
+  /** 1-based page to request from numbered-page providers. */
+  page?: number;
+  /** Items to request per page (numbered-page providers, and GitHub's cursor pages). */
+  pageSize?: number;
 }
 export declare class PageableResult<T> {
-    private readonly fetch;
-    private cached;
-    constructor(fetch: (paging: PagedResult<T>['paging']) => Promise<PagedResult<T>>, seed?: PagedResult<T>);
-    values(): AsyncIterable<NonNullable<T>>;
+  private readonly fetch;
+  private cached;
+  constructor(fetch: (paging: PagedResult<T>['paging']) => Promise<PagedResult<T>>, seed?: PagedResult<T>);
+  values(): AsyncIterable<NonNullable<T>>;
 }
 /**
  * Drains a paged fetcher into a single array, following `paging.cursor` until exhausted. Bounded by
  * `maxPages` (default 20) as a backstop against a provider that never stops paging.
  */
 export declare function collectPagedResults<T>(fetch: (cursor: string | undefined) => Promise<PagedResult<T> | undefined>, maxPages?: number): Promise<NonNullable<T>[]>;
+//#endregion
 //# sourceMappingURL=paging.d.ts.map

package/dist/utils/paging.js

@@ -1,49 +1,46 @@
+//#region ../utils/src/paging.ts
 /** A shared, frozen empty result to avoid allocating on every "nothing found" path. */
-export const emptyPagedResult = Object.freeze({ values: [] });
-export class PageableResult {
-    fetch;
-    cached;
-    constructor(fetch, seed) {
-        this.fetch = fetch;
-        this.cached = seed;
-    }
-    async *values() {
-        let page = this.cached;
-        if (page == null) {
-            // No seed or cached results yet, so perform the initial fetch
-            page = await this.fetch(undefined);
-            this.cached = page;
-        }
-        const cached = page; // memoized accumulator (the first page)
-        for (const value of cached.values) {
-            yield value;
-        }
-        while (page.paging?.more) {
-            page = await this.fetch(page.paging);
-            cached.values.push(...page.values);
-            cached.paging = page.paging;
-            for (const value of page.values) {
-                yield value;
-            }
-        }
-    }
-}
+const emptyPagedResult = Object.freeze({ values: [] });
+var PageableResult = class {
+	fetch;
+	cached;
+	constructor(fetch, seed) {
+		this.fetch = fetch;
+		this.cached = seed;
+	}
+	async *values() {
+		let page = this.cached;
+		if (page == null) {
+			page = await this.fetch(void 0);
+			this.cached = page;
+		}
+		const cached = page;
+		for (const value of cached.values) yield value;
+		while (page.paging?.more) {
+			page = await this.fetch(page.paging);
+			cached.values.push(...page.values);
+			cached.paging = page.paging;
+			for (const value of page.values) yield value;
+		}
+	}
+};
 /**
- * Drains a paged fetcher into a single array, following `paging.cursor` until exhausted. Bounded by
- * `maxPages` (default 20) as a backstop against a provider that never stops paging.
- */
-export async function collectPagedResults(fetch, maxPages = 20) {
-    const all = [];
-    let cursor;
-    for (let page = 0; page < maxPages; page++) {
-        const result = await fetch(cursor);
-        if (result == null)
-            break;
-        all.push(...result.values);
-        if (!result.paging?.more || result.paging.cursor === cursor)
-            break;
-        cursor = result.paging.cursor;
-    }
-    return all;
+* Drains a paged fetcher into a single array, following `paging.cursor` until exhausted. Bounded by
+* `maxPages` (default 20) as a backstop against a provider that never stops paging.
+*/
+async function collectPagedResults(fetch, maxPages = 20) {
+	const all = [];
+	let cursor;
+	for (let page = 0; page < maxPages; page++) {
+		const result = await fetch(cursor);
+		if (result == null) break;
+		all.push(...result.values);
+		if (!result.paging?.more || result.paging.cursor === cursor) break;
+		cursor = result.paging.cursor;
+	}
+	return all;
 }
+//#endregion
+export { PageableResult, collectPagedResults, emptyPagedResult };
+
 //# sourceMappingURL=paging.js.map