import { r as __name } from "./rolldown-runtime.mjs";
import { Ca as ReorderedArray, Pi as Fqn, ha as IteratorLike, ma as IterableContainer, ya as NonEmptyArray } from "./index.mjs";
//#region ../../node_modules/.pnpm/mnemonist@0.40.4/node_modules/mnemonist/default-weak-map.d.ts
/**
 * Mnemonist DefaultWeakMap Typings
 * ================================
 */
declare class DefaultWeakMap<K extends object, V> {
  // Constructor
  constructor(factory: (key: K) => V);
  // Methods
  clear(): void;
  set(key: K, value: V): this;
  delete(key: K): boolean;
  has(key: K): boolean;
  get(key: K): V;
  peek(key: K): V | undefined;
  inspect(): any;
}
//#endregion
//#region ../../node_modules/.pnpm/mnemonist@0.40.4/node_modules/mnemonist/linked-list.d.ts
/**
 * Mnemonist LinkedList Typings
 * =============================
 */
declare class LinkedList<T> implements Iterable<T> {
  // Members
  size: number;
  // Constructor
  constructor();
  // Methods
  clear(): void;
  first(): T | undefined;
  last(): T | undefined;
  peek(): T | undefined;
  push(value: T): number;
  shift(): T | undefined;
  unshift(value: T): number;
  forEach(callback: (value: T, index: number, list: this) => void, scope?: any): void;
  toArray(): Array<T>;
  values(): IterableIterator<T>;
  entries(): IterableIterator<[number, T]>;
  [Symbol.iterator](): IterableIterator<T>;
  toString(): string;
  toJSON(): Array<T>;
  inspect(): any;
  // Statics
  static from<I>(iterable: Iterable<I> | {
    [key: string]: I;
  }): LinkedList<I>;
}
//#endregion
//#region ../../node_modules/.pnpm/mnemonist@0.40.4/node_modules/mnemonist/multi-map.d.ts
/**
 * Mnemonist MultiMap Typings
 * ===========================
 */
interface MultiMap<K, V, C extends V[] | Set<V> = V[]> extends Iterable<[K, V]> {
  // Members
  dimension: number;
  size: number;
  // Methods
  clear(): void;
  set(key: K, value: V): this;
  delete(key: K): boolean;
  remove(key: K, value: V): boolean;
  has(key: K): boolean;
  get(key: K): C | undefined;
  multiplicity(key: K): number;
  forEach(callback: (value: V, key: K, map: this) => void, scope?: any): void;
  forEachAssociation(callback: (value: C, key: K, map: this) => void, scope?: any): void;
  keys(): IterableIterator<K>;
  values(): IterableIterator<V>;
  entries(): IterableIterator<[K, V]>;
  containers(): IterableIterator<C>;
  associations(): IterableIterator<[K, C]>;
  [Symbol.iterator](): IterableIterator<[K, V]>;
  inspect(): any;
  toJSON(): any;
}
interface MultiMapConstructor {
  new <K, V>(container: SetConstructor): MultiMap<K, V, Set<V>>;
  new <K, V>(container?: ArrayConstructor): MultiMap<K, V, V[]>;
  from<K, V>(iterable: Iterable<[K, V]> | {
    [key: string]: V;
  }, Container: SetConstructor): MultiMap<K, V, Set<V>>;
  from<K, V>(iterable: Iterable<[K, V]> | {
    [key: string]: V;
  }, Container?: ArrayConstructor): MultiMap<K, V, V[]>;
}
declare const MultiMap: MultiMapConstructor;
//#endregion
//#region ../../node_modules/.pnpm/mnemonist@0.40.4/node_modules/mnemonist/queue.d.ts
/**
 * Mnemonist Queue Typings
 * ========================
 */
declare class Queue<T> implements Iterable<T> {
  // Members
  size: number;
  // Constructor
  constructor();
  // Methods
  clear(): void;
  enqueue(item: T): number;
  dequeue(): T | undefined;
  peek(): T | undefined;
  forEach(callback: (item: T, index: number, queue: this) => void, scope?: any): void;
  toArray(): Array<T>;
  values(): IterableIterator<T>;
  entries(): IterableIterator<[number, T]>;
  [Symbol.iterator](): IterableIterator<T>;
  toString(): string;
  toJSON(): Array<T>;
  inspect(): any;
  // Statics
  static from<I>(iterable: Iterable<I> | {
    [key: string]: I;
  }): Queue<I>;
  static of<I>(...items: Array<I>): Queue<I>;
}
//#endregion
//#region ../../node_modules/.pnpm/mnemonist@0.40.4/node_modules/mnemonist/stack.d.ts
/**
 * Mnemonist Stack Typings
 * ========================
 */
declare class Stack<T> implements Iterable<T> {
  // Members
  size: number;
  // Constructor
  constructor();
  // Methods
  clear(): void;
  push(item: T): number;
  pop(): T | undefined;
  peek(): T | undefined;
  forEach(callback: (item: T, index: number, stack: this) => void, scope?: any): void;
  toArray(): Array<T>;
  values(): IterableIterator<T>;
  entries(): IterableIterator<[number, T]>;
  [Symbol.iterator](): IterableIterator<T>;
  toString(): string;
  toJSON(): Array<T>;
  inspect(): any;
  // Statics
  static from<I>(iterable: Iterable<I> | {
    [key: string]: I;
  }): Stack<I>;
  static of<I>(...items: Array<I>): Stack<I>;
}
//#endregion
//#region src/utils/invariant.d.ts
declare function nonNullable<T>(value: T, message?: string | (() => string)): NonNullable<T>;
declare function invariant(condition: any, message?: string): asserts condition;
declare function nonexhaustive(value: never): never;
//#endregion
//#region src/utils/common-head.d.ts
/**
 * Common head of two arrays
 *
 * @param equals - Equality function, defaults to `Object.is`
 */
declare function commonHead<T>(sources: ReadonlyArray<T>, targets: ReadonlyArray<T>, equals?: (a: T, b: T) => boolean): T[];
//#endregion
//#region src/utils/compare-natural.d.ts
declare function compareNatural(a: string | undefined, b: string | undefined): -1 | 0 | 1;
declare function sortNatural(): <T extends IterableContainer<string>>(elements: T) => ReorderedArray<T>;
declare function sortNatural<T extends IterableContainer<string>>(elements: T): ReorderedArray<T>;
/**
 * Compares two strings lexicographically first, then hierarchically based on their depth.\
 * From parent nodes to leaves
 *
 * @param separator - The separator to use for splitting the strings
 * @param deepestFirst - If true, deeper paths come first (reverse order)
 *
 * @example
 * const lines = [
 *   'b.c',
 *   'b',
 *   'a.b.c',
 * ]
 * lines.sort(compareNaturalHierarchically('.'))
 * // [
 * //   'a.b.c',
 * //   'b',
 * //   'b.c',
 * // ]
 */
declare function compareNaturalHierarchically(separator?: string, deepestFirst?: boolean): (a: string | undefined, b: string | undefined) => number;
//#endregion
//#region src/utils/fqn.d.ts
declare function parentFqn<E extends string>(fqn: E): E | null;
declare function nameFromFqn<E extends string>(fqn: E): string;
/**
 * Check if one element is an ancestor of another
 * Composable version
 * @signature
 *  isAncestor(another)(ancestor)
 */
declare function isAncestor<A extends string | {
  id: string;
}>(another: NoInfer<A>): (ancestor: A) => boolean;
/**
 * Check if one element is an ancestor of another
 * @signature
 *   isAncestor(ancestor, another)
 */
declare function isAncestor<A extends string | {
  id: string;
}>(ancestor: A, another: A): boolean;
declare function isSameHierarchy<T extends string>(one: NoInfer<T> | WithId<NoInfer<T>>): (another: T | WithId<T>) => boolean;
declare function isSameHierarchy<T extends string>(one: T | WithId<T>, another: T | WithId<T>): boolean;
type WithId<T = string> = {
  id: T;
};
declare function isDescendantOf<T extends string>(ancestor: WithId<T>): (descedant: WithId<T>) => boolean;
declare function isDescendantOf<T extends string>(descedant: WithId<T>, ancestor: WithId<T>): boolean;
/**
 * How deep in the hierarchy the element is.
 * Root element has depth 1
 */
declare function hierarchyLevel<E extends string | {
  id: Fqn;
}>(elementOfFqn: E): number;
/**
 * Calculate the distance as number of steps from one element to another, i.e.
 * going up to the common ancestor, then going down to the other element.
 * Sibling distance is always 1
 *
 * Can be used for hierarchical clustering
 */
declare function hierarchyDistance<E extends string | {
  id: Fqn;
}>(one: E, another: E): number;
declare function commonAncestor<E extends string>(first: E, second: E): E | null;
/**
 * Get all ancestor elements (i.e. parent, parent’s parent, etc.)
 * going up from parent to the root
 * @example
 * ```ts
 * ancestorsFqn('a.b.c.d')
 * // ['a.b.c', 'a.b', 'a']
 * ```
 */
declare function ancestorsFqn<Id extends string>(fqn: Id): Id[];
/**
 * Compares two fully qualified names (fqns) hierarchically based on their depth.
 * From parent nodes to leaves
 *
 * @param {string} a - The first fqn to compare.
 * @param {string} b - The second fqn to compare.
 * @returns {number} - 0 if the fqns have the same depth.
 *                    - Positive number if a is deeper than b.
 *                    - Negative number if b is deeper than a.
 */
declare function compareFqnHierarchically<T extends string = string>(a: T, b: T): -1 | 0 | 1;
declare function compareByFqnHierarchically<T extends {
  id: string;
}>(a: T, b: T): -1 | 0 | 1;
/**
 * Sorts an array of objects hierarchically based on their fully qualified names (FQN).
 * Objects are sorted by the number of segments in their FQN (defined by dot-separated ID).
 *
 * @typeParam T - Object type that contains an 'id' string property
 * @typeParam A - Type extending IterableContainer of T
 *
 * @param array - Array of objects to be sorted
 * @returns A new array with items sorted by their FQN hierarchy depth (number of segments)
 *
 * @example
 * ```ts
 * const items = [
 *   { id: "a.b.c" },
 *   { id: "a" },
 *   { id: "a.b" }
 * ];
 * sortByFqnHierarchically(items);
 * // Result: [
 * //   { id: "a" },
 * //   { id: "a.b" },
 * //   { id: "a.b.c" }
 * // ]
 * ```
 */
declare function sortByFqnHierarchically<T extends {
  id: string;
}, A extends IterableContainer<T>>(array: A): ReorderedArray<A>;
/**
 * Keeps initial order of the elements, but ensures that parents are before children
 *
 * @example
 * ```ts
 * const items = [
 *   {id: 'a.c'},
 *   {id: 'a'},
 *   {id: 'a.b.c'},
 *   {id: 'a.b'},
 * ];
 * sortParentsFirst(items);
 * // Result: [
 * //   { id: "a" },
 * //   { id: "a.c" }, // because of initial order
 * //   { id: "a.b" },
 * //   { id: "a.b.c" },
 * // ]
 * ```
 */
declare function sortParentsFirst<T extends WithId<string>, A extends IterableContainer<T>>(array: A): ReorderedArray<A>;
/**
 * Sorts an array of objects naturally by their fully qualified name (FQN) identifier.
 *
 * @template T - Type of objects containing an 'id' string property
 * @template A - Type extending IterableContainer of T
 *
 * @param first - Optional. Either the array to sort or the sort direction ('asc'|'desc')
 * @param sort - Optional. The sort direction ('asc'|'desc'). Defaults to 'asc' if not specified
 *
 * @example
 * // As a function that returns a sorting function
 * const sorted = sortNaturalByFqn('desc')(myArray);
 *
 * // Direct array sorting
 * const sorted = sortNaturalByFqn(myArray, 'desc');
 */
declare function sortNaturalByFqn(sort?: 'asc' | 'desc'): <I extends WithId<string>, A extends IterableContainer<I>>(array: A) => ReorderedArray<A>;
declare function sortNaturalByFqn<A extends IterableContainer<WithId>>(array: A, sort?: 'asc' | 'desc'): ReorderedArray<A>;
//#endregion
//#region src/utils/getOrCreate.d.ts
declare function getOrCreate<K, V>(map: Map<K, V>, key: K, create: (key: K) => V): V;
declare function getOrCreate<K extends WeakKey, V>(map: WeakMap<K, V>, key: K, create: (key: K) => V): V;
//#endregion
//#region src/utils/iterable/_types.d.ts
declare function isIterable<T, I extends Iterable<T>>(something: I | unknown): something is Iterable<T>;
//#endregion
//#region src/utils/iterable/filter.d.ts
/**
 * Filters an iterable based on a predicate.
 * Composabel first version of `ifilter`.
 * @signature
 *    ifilter(predicate)(data)
 */
declare function ifilter<T, S extends T>(predicate: (v: T) => v is S): (iterable: Iterable<T>) => IteratorLike<S>;
declare function ifilter<T>(predicate: (v: T) => boolean): (iterable: Iterable<T>) => IteratorLike<T>;
/**
 * Filters an iterable based on a predicate.
 * Data first version of `ifilter`.
 * @signature
 *    ifilter(data, predicate)
 * @example
 *    ifilter(new Set([1, 2, 3]), x => x % 2 === 1) // => Iterable<[1, 3]>
 */
declare function ifilter<T, S extends T>(iterable: Iterable<T>, predicate: (v: T) => v is S): IteratorLike<S>;
declare function ifilter<T>(iterable: Iterable<T>, predicate: (v: T) => boolean): IteratorLike<T>;
//#endregion
//#region src/utils/iterable/find.d.ts
/**
 * Finds the first element in the iterable that satisfies the predicate.
 * Composable first version of `find`.
 * @signature
 *   ifind(predicate)(data)
 */
declare function ifind<T, S extends T>(predicate: (item: T) => item is S): (iterable: Iterable<T>) => S | undefined;
declare function ifind<T>(predicate: (item: T) => boolean): (iterable: Iterable<T>) => T | undefined;
/**
 * Finds the first element in the iterable that satisfies the predicate.
 * Data first version of `find`.
 * @signature
 *  ifind(data, predicate)
 */
declare function ifind<T, S extends T>(iterable: Iterable<T>, predicate: (item: T) => item is S): S | undefined;
declare function ifind<T>(iterable: Iterable<T>, predicate: (item: T) => boolean): T | undefined;
//#endregion
//#region src/utils/iterable/first.d.ts
/**
 * Takes the first N elements from an iterable.
 * Composable first version of `ifirst`.
 * @signature
 *   ifirst(count)(data)
 */
declare function ifirst<T>(count: number): (iterable: Iterable<T>) => IteratorLike<T>;
/**
 * Takes the first N elements from an iterable.
 * Data first version of `ifirst`.
 * @signature
 *   ifirst(data, count)
 * @example
 *   ifirst([1, 2, 3, 4, 5], 3) // => Iterable<[1, 2, 3]>
 */
declare function ifirst<T>(iterable: Iterable<T>, count: number): IteratorLike<T>;
//#endregion
//#region src/utils/iterable/flat.d.ts
declare function iflat(): <T>(iterable: Iterable<IteratorLike<T>>) => IteratorLike<T>;
declare function iflat<T>(iterable: Iterable<IteratorLike<T>>): IteratorLike<T>;
//#endregion
//#region src/utils/iterable/flatMap.d.ts
type FlatMapFunction<T, S> = (item: T) => Iterable<S>;
/**
 * Maps an iterable using a mapper function and flattens the result by one level.
 * Composable first version of `iflatMap`.
 * @signature
 *   iflatMap(mapper)(data)
 */
declare function iflatMap<T, S>(mapper: FlatMapFunction<T, S>): (iterable: Iterable<T>) => IteratorLike<S>;
/**
 * Maps an iterable using a mapper function and flattens the result by one level.
 * Data first version of `iflatMap`.
 * @signature
 *   iflatMap(data, mapper)
 */
declare function iflatMap<T, S>(iterable: Iterable<T>, mapper: FlatMapFunction<T, S>): IteratorLike<S>;
//#endregion
//#region src/utils/iterable/head.d.ts
declare function ihead<T>(): (iterable: Iterable<T>) => T | undefined;
/**
 * Finds the first element in the iterable that satisfies the predicate.
 * Data first version of `find`.
 * @signature
 *  ifind(data, predicate)
 */
declare function ihead<T>(iterable: Iterable<T>): T | undefined;
//#endregion
//#region src/utils/iterable/map.d.ts
type MapFunction<T, S> = (item: T) => S;
/**
 * Maps an iterable using a mapper function.
 * Composable first version of `imap`.
 * @signature
 *   imap(mapper)(data)
 */
declare function imap<T, S>(mapper: MapFunction<T, S>): (iterable: Iterable<T>) => IteratorLike<S>;
/**
 * Maps an iterable using a mapper function.
 * Data first version of `imap`.
 * @signature
 *   imap(data, mapper)
 */
declare function imap<T, S>(iterable: Iterable<T>, mapper: MapFunction<T, S>): IteratorLike<S>;
//#endregion
//#region src/utils/iterable/reduce.d.ts
declare function ireduce<T, R>(reducer: (acc: R, item: T) => R, initialValue: R): (iterable: Iterable<T>) => R;
declare function ireduce<T, R>(iterable: Iterable<T>, reducer: (acc: R, item: T) => R, initialValue: R): R;
//#endregion
//#region src/utils/iterable/some.d.ts
/**
 * Checks if at least one element in the iterable satisfies the predicate.
 * Composable first version of `some`.
 * @signature
 *   isome(predicate)(data)
 */
declare function isome<T>(predicate: (item: T) => boolean): (iterable: Iterable<T>) => boolean;
/**
 * Checks if at least one element in the iterable satisfies the predicate.
 * Data first version of `some`.
 * @signature
 *  isome(data, predicate)
 */
declare function isome<T>(iterable: Iterable<T>, predicate: (item: T) => boolean): boolean;
//#endregion
//#region src/utils/iterable/to.d.ts
declare function toArray(): <T>(iterable: Iterable<T> | ArrayLike<T>) => T[];
declare function toArray<T>(iterable: Iterable<T> | ArrayLike<T>): T[];
declare function toSet(): <T>(iterable: Iterable<T>) => Set<T>;
declare function toSet<T>(iterable: Iterable<T>): Set<T>;
//#endregion
//#region src/utils/iterable/unique.d.ts
/**
 * Returns an iterable that yields only unique values.
 * It uses a Set to keep track of the values.
 */
declare function iunique(): <T>(iterable: Iterable<T>) => IteratorLike<T>;
declare function iunique<T>(iterable: Iterable<T>): IteratorLike<T>;
//#endregion
//#region src/utils/memoize-prop.d.ts
/**
 * Saves the value returned by fn() in a hidden property tag of obj object, so next time memoizeProp() is called,
 * that value will be returned, and fn won't be called.
 *
 * @example
 * ```ts
 * class Model {
 *   // using same Symbol
 *   get computed1() {
 *     return memoizeProp(this, Symbol.for('computed1'), () => doOnce())
 *   }
 *   // using string
 *   get computed2() {
 *     return memoizeProp(this, 'computed2', () => doOnce())
 *   }
 *
 * }
 * ```
 */
declare function memoizeProp<Tag extends symbol | string, Res>(obj: object, tag: Tag, fn: () => Res): Res;
//#endregion
//#region src/utils/promises.d.ts
declare function delay(): Promise<string>;
declare function delay(ms: number): Promise<string>;
declare function delay(randomFrom: number, randomTo: number): Promise<string>;
declare function promiseNextTick(): Promise<void>;
declare function onNextTick(fn: () => Promise<void> | void): void;
//#endregion
//#region src/utils/relations.d.ts
type RelationshipLike = {
  source: {
    id: string;
  };
  target: {
    id: string;
  };
};
/**
 * Compares two relations hierarchically.
 * From the most general (implicit) to the most specific (deepest in the tree)
 */
declare const compareRelations: <T extends RelationshipLike>(a: T, b: T) => number;
//#endregion
//#region src/utils/set.d.ts
/**
 * Returns new set as a union of given sets
 * Keeps order of elements
 */
declare function union<T>(...sets: ReadonlySet<T>[]): Set<T>;
/**
 * Returns new set as an intersection of all sets
 * Keeps order from the first set
 */
declare function intersection<T>(first: ReadonlySet<T>, ...sets: NonEmptyArray<ReadonlySet<NoInfer<T>>>): Set<T>;
/**
 * Returns new set as a difference of two sets (A-B)
 * Keeps order from the first set
 */
declare function difference<T>(a: ReadonlySet<T>, b: ReadonlySet<NoInfer<T>>): Set<T>;
declare function equals<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): boolean;
declare function symmetricDifference<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): Set<T>;
//#endregion
//#region src/utils/object-hash.d.ts
declare function objectHash(value: any): string;
//#endregion
//#region src/utils/string-hash.d.ts
/**
 * @see https://gist.github.com/victor-homyakov/bcb7d7911e4a388b1c810f8c3ce17bcf
 */
declare function stringHash(str: string): string;
//#endregion
//#region src/utils/markdown/to-html.d.ts
declare function markdownToHtml(markdown: string): string;
//#endregion
//#region src/utils/markdown/to-text.d.ts
/**
 * Converts markdown to plain text, removing any markdown formatting.
 * @param markdown - The markdown to convert.
 * @returns The plain text.
 */
declare function markdownToText(markdown: string): string;
//#endregion
//#region src/utils/unsafe.d.ts
/**
 * Casts a partial object to a full object type, mostly for tests.
 * Motivation: to avoid using `as` in the code
 */
declare function unsafePartial<T>(value: Partial<NoInfer<T>>): T;
//#endregion
export { MultiMap as $, ancestorsFqn as A, parentFqn as B, iflatMap as C, ifilter as D, ifind as E, hierarchyLevel as F, compareNaturalHierarchically as G, sortNaturalByFqn as H, isAncestor as I, invariant as J, sortNatural as K, isDescendantOf as L, compareByFqnHierarchically as M, compareFqnHierarchically as N, isIterable as O, hierarchyDistance as P, Queue as Q, isSameHierarchy as R, ihead as S, ifirst as T, sortParentsFirst as U, sortByFqnHierarchically as V, compareNatural as W, nonexhaustive as X, nonNullable as Y, Stack as Z, toArray as _, objectHash as a, ireduce as b, intersection as c, compareRelations as d, LinkedList as et, delay as f, iunique as g, memoizeProp as h, stringHash as i, commonAncestor as j, getOrCreate as k, symmetricDifference as l, promiseNextTick as m, markdownToText as n, difference as o, onNextTick as p, commonHead as q, markdownToHtml as r, equals as s, unsafePartial as t, DefaultWeakMap as tt, union as u, toSet as v, iflat as w, imap as x, isome as y, nameFromFqn as z };