@likec4/core 1.23.1 → 1.24.0

package/dist/types/index.cjs

@@ -1,110 +0,0 @@
-'use strict';
-
-const view = require('../shared/core.CEJQrbXY.cjs');
-
-const ThemeColors = [
-  "amber",
-  "blue",
-  "gray",
-  "slate",
-  "green",
-  "indigo",
-  "muted",
-  "primary",
-  "red",
-  "secondary",
-  "sky"
-];
-function isThemeColor(color) {
-  return color in ThemeColors;
-}
-
-exports.AsFqn = view.AsFqn;
-exports.BorderStyles = view.BorderStyles;
-Object.defineProperty(exports, "ComputedNode", {
-  enumerable: true,
-  get: function () { return view.ComputedNode; }
-});
-Object.defineProperty(exports, "ComputedView", {
-  enumerable: true,
-  get: function () { return view.ComputedView; }
-});
-exports.DefaultArrowType = view.DefaultArrowType;
-exports.DefaultElementShape = view.DefaultElementShape;
-exports.DefaultLineStyle = view.DefaultLineStyle;
-exports.DefaultPaddingSize = view.DefaultPaddingSize;
-exports.DefaultRelationshipColor = view.DefaultRelationshipColor;
-exports.DefaultShapeSize = view.DefaultShapeSize;
-exports.DefaultTextSize = view.DefaultTextSize;
-exports.DefaultThemeColor = view.DefaultThemeColor;
-Object.defineProperty(exports, "DeploymentElement", {
-  enumerable: true,
-  get: function () { return view.DeploymentElement; }
-});
-Object.defineProperty(exports, "DiagramNode", {
-  enumerable: true,
-  get: function () { return view.DiagramNode; }
-});
-Object.defineProperty(exports, "ElementKind", {
-  enumerable: true,
-  get: function () { return view.ElementKind; }
-});
-exports.ElementShapes = view.ElementShapes;
-Object.defineProperty(exports, "ExpressionV2", {
-  enumerable: true,
-  get: function () { return view.ExpressionV2; }
-});
-Object.defineProperty(exports, "FqnExpr", {
-  enumerable: true,
-  get: function () { return view.FqnExpr; }
-});
-Object.defineProperty(exports, "FqnRef", {
-  enumerable: true,
-  get: function () { return view.FqnRef; }
-});
-Object.defineProperty(exports, "RelationExpr", {
-  enumerable: true,
-  get: function () { return view.RelationExpr; }
-});
-exports.extractStep = view.extractStep;
-exports.getBBoxCenter = view.getBBoxCenter;
-exports.getParallelStepsPrefix = view.getParallelStepsPrefix;
-exports.isAndOperator = view.isAndOperator;
-exports.isAutoLayoutDirection = view.isAutoLayoutDirection;
-exports.isCustomElement = view.isCustomElement;
-exports.isCustomRelationExpr = view.isCustomRelationExpr;
-exports.isDeploymentView = view.isDeploymentView;
-exports.isDynamicView = view.isDynamicView;
-exports.isDynamicViewParallelSteps = view.isDynamicViewParallelSteps;
-exports.isElement = view.isElement;
-exports.isElementKindExpr = view.isElementKindExpr;
-exports.isElementPredicateExpr = view.isElementPredicateExpr;
-exports.isElementRef = view.isElementRef;
-exports.isElementTagExpr = view.isElementTagExpr;
-exports.isElementView = view.isElementView;
-exports.isElementWhere = view.isElementWhere;
-exports.isExpandedElementExpr = view.isExpandedElementExpr;
-exports.isExtendsElementView = view.isExtendsElementView;
-exports.isInOut = view.isInOut;
-exports.isIncoming = view.isIncoming;
-exports.isKindEqual = view.isKindEqual;
-exports.isNotOperator = view.isNotOperator;
-exports.isOrOperator = view.isOrOperator;
-exports.isOutgoing = view.isOutgoing;
-exports.isRelation = view.isRelation;
-exports.isRelationExpression = view.isRelationExpression;
-exports.isRelationPredicateExpr = view.isRelationPredicateExpr;
-exports.isRelationWhere = view.isRelationWhere;
-exports.isScopedElementView = view.isScopedElementView;
-exports.isStepEdgeId = view.isStepEdgeId;
-exports.isTagEqual = view.isTagEqual;
-exports.isViewRuleAutoLayout = view.isViewRuleAutoLayout;
-exports.isViewRuleGlobalPredicateRef = view.isViewRuleGlobalPredicateRef;
-exports.isViewRuleGlobalStyle = view.isViewRuleGlobalStyle;
-exports.isViewRuleGroup = view.isViewRuleGroup;
-exports.isViewRulePredicate = view.isViewRulePredicate;
-exports.isViewRuleStyle = view.isViewRuleStyle;
-exports.isWildcard = view.isWildcard;
-exports.stepEdgeId = view.stepEdgeId;
-exports.whereOperatorAsPredicate = view.whereOperatorAsPredicate;
-exports.isThemeColor = isThemeColor;

package/dist/types/index.d.cts

@@ -1,72 +0,0 @@
-import { X as XYPoint, N as NonEmptyArray, P as Point, k as BorderStyle, o as ElementShape, M as ThemeColor, F as Fqn } from '../shared/core.QP35c488.cjs';
-export { A as AsFqn, B as BorderStyles, v as Color, w as ColorLiteral, C as CustomColor, D as DefaultElementShape, e as DefaultPaddingSize, f as DefaultShapeSize, g as DefaultTextSize, h as DefaultThemeColor, l as Element, i as ElementKind, m as ElementKindSpecification, n as ElementKindSpecificationStyle, j as ElementShapes, p as ElementStyle, y as ElementThemeColorValues, x as ElementThemeColors, E as ExclusiveUnion, H as HexColorLiteral, I as IconUrl, a as IteratorLike, K as KeysOf, L as LikeC4Theme, q as Link, c as NTuple, b as NonEmptyReadonlyArray, d as Predicate, z as RelationshipThemeColorValues, R as RelationshipThemeColors, S as ShapeSize, G as SpacingSize, r as Tag, s as TagSpec, J as TextSize, T as ThemeColorValues, t as TypedElement, u as isThemeColor } from '../shared/core.QP35c488.cjs';
-import { bk as ViewId, aW as BBox, bl as ViewManualLayout, aT as AutoLayoutDirection } from '../shared/core.BS_nXBsP.cjs';
-export { as as AbstractRelation, ag as AndOperator, a5 as AnyParsedLikeC4Model, aU as BasicElementView, aV as BasicView, aX as ComputedDeploymentView, aY as ComputedDynamicView, aZ as ComputedEdge, a_ as ComputedElementView, C as ComputedLikeC4Model, az as ComputedNode, a as ComputedView, a$ as CustomColorDefinitions, A as CustomElementExpr, B as CustomRelationExpr, ap as DefaultArrowType, aq as DefaultLineStyle, ar as DefaultRelationshipColor, b as DeployedInstance, D as DeploymentElement, c as DeploymentElementStyle, d as DeploymentNode, f as DeploymentNodeKind, g as DeploymentNodeKindSpecification, h as DeploymentRef, i as DeploymentRelation, b0 as DeploymentView, b1 as DeploymentViewRule, b2 as DeploymentViewRulePredicate, b3 as DeploymentViewRuleStyle, b4 as DiagramEdge, aA as DiagramNode, b5 as DiagramView, E as DirectRelationExpr, b6 as DynamicView, b7 as DynamicViewIncludeRule, b8 as DynamicViewParallelSteps, b9 as DynamicViewRule, ba as DynamicViewStep, bb as DynamicViewStepOrParallel, bc as EdgeId, F as ElementExpression, G as ElementKindExpr, bw as ElementNotation, H as ElementPredicateExpression, I as ElementRefExpr, J as ElementTagExpr, bd as ElementView, K as ElementWhereExpr, ah as EqualOperator, M as ExpandedElementExpr, N as Expression, X as ExpressionV2, be as ExtendsElementView, ai as Filterable, Y as FqnExpr, Z as FqnRef, a6 as GenericLikeC4Model, $ as GlobalDynamicPredicates, a0 as GlobalPredicateId, a1 as GlobalPredicates, a2 as GlobalStyleID, a3 as GlobalStyles, Q as InOutExpr, O as IncomingExpr, aj as KindEqual, a7 as LayoutedLikeC4Model, a8 as LikeC4ModelDump, L as LikeC4View, a4 as ModelGlobals, at as ModelRelation, bf as NodeId, R as NonWilcard, ak as NotOperator, al as OperatorPredicate, am as OrOperator, S as OutgoingExpr, a9 as ParsedLikeC4Model, P as PredicateSelector, _ as RelationExpr, T as RelationExpression, au as RelationId, U as RelationPredicateExpression, V as RelationWhereExpr, av as RelationshipArrowType, aw as RelationshipKind, ax as RelationshipKindSpecification, ay as RelationshipLineType, bg as ScopedElementView, bh as StepEdgeId, bi as StepEdgeIdLiteral, an as TagEqual, bj as ViewAutoLayout, bm as ViewRule, bn as ViewRuleAutoLayout, bo as ViewRuleGlobalPredicateRef, bp as ViewRuleGlobalStyle, bq as ViewRuleGroup, br as ViewRulePredicate, bs as ViewRuleStyle, bt as ViewRuleStyleOrGlobalRef, bu as ViewWithHash, bv as ViewWithNotation, ao as WhereOperator, W as WildcardExpr, aB as extractStep, aC as getBBoxCenter, aD as getParallelStepsPrefix, aa as isAndOperator, aE as isAutoLayoutDirection, j as isCustomElement, k as isCustomRelationExpr, aF as isDeploymentView, aG as isDynamicView, aH as isDynamicViewParallelSteps, l as isElement, m as isElementKindExpr, n as isElementPredicateExpr, o as isElementRef, p as isElementTagExpr, aI as isElementView, q as isElementWhere, r as isExpandedElementExpr, aJ as isExtendsElementView, t as isInOut, s as isIncoming, ab as isKindEqual, ac as isNotOperator, ad as isOrOperator, u as isOutgoing, v as isRelation, w as isRelationExpression, x as isRelationPredicateExpr, y as isRelationWhere, aK as isScopedElementView, aL as isStepEdgeId, ae as isTagEqual, aM as isViewRuleAutoLayout, aN as isViewRuleGlobalPredicateRef, aO as isViewRuleGlobalStyle, aP as isViewRuleGroup, aQ as isViewRulePredicate, aR as isViewRuleStyle, z as isWildcard, aS as stepEdgeId, af as whereOperatorAsPredicate } from '../shared/core.BS_nXBsP.cjs';
-import 'type-fest';
-
-/**
- * OverviewGraph is a graph representation of all views in a model
- */
-declare namespace OverviewGraph {
-    type Node = {
-        id: string;
-        type: 'folder' | 'file';
-        path: string;
-        label: string;
-        parentId: string | null;
-        position: XYPoint;
-        width: number;
-        height: number;
-    } | {
-        id: string;
-        type: 'view';
-        viewId: ViewId;
-        label: string;
-        parentId: string | null;
-        position: XYPoint;
-        width: number;
-        height: number;
-    };
-    /**
-     * Edge represents a navigational link from one view to another
-     */
-    type Edge = {
-        id: string;
-        source: string;
-        target: string;
-        points: NonEmptyArray<Point>;
-    };
-}
-interface OverviewGraph {
-    nodes: OverviewGraph.Node[];
-    edges: OverviewGraph.Edge[];
-    bounds: BBox;
-}
-
-declare namespace ViewChange {
-    interface ChangeElementStyle {
-        op: 'change-element-style';
-        style: {
-            border?: BorderStyle;
-            opacity?: number;
-            shape?: ElementShape;
-            color?: ThemeColor;
-        };
-        targets: NonEmptyArray<Fqn>;
-    }
-    interface SaveManualLayout {
-        op: 'save-manual-layout';
-        layout: ViewManualLayout;
-    }
-    interface ChangeAutoLayout {
-        op: 'change-autolayout';
-        layout: {
-            direction: AutoLayoutDirection;
-            nodeSep?: number | null;
-            rankSep?: number | null;
-        };
-    }
-}
-type ViewChange = ViewChange.ChangeElementStyle | ViewChange.SaveManualLayout | ViewChange.ChangeAutoLayout;
-
-export { AutoLayoutDirection, BBox, BorderStyle, ElementShape, Fqn, NonEmptyArray, OverviewGraph, Point, ThemeColor, ViewChange, ViewId, ViewManualLayout, XYPoint };

package/dist/utils/index.cjs

@@ -1,99 +0,0 @@
-'use strict';
-
-const object_hash = require('../shared/core.DEzbhxsA.cjs');
-const chunkWIMGWYZL = require('../shared/core.DUbKSpjd.cjs');
-
-function o(r,n){let e=Math.ceil(r),t=Math.floor(n);if(t<e)throw new RangeError(`randomInteger: The range [${r.toString()},${n.toString()}] contains no integer`);return Math.floor(Math.random()*(t-e+1)+e)}
-
-function ireduce(arg1, arg2, arg3) {
-  const reducer = object_hash.n(arg3) ? arg2 : arg1;
-  const initialValue = arg3 ?? arg2;
-  chunkWIMGWYZL.invariant(object_hash.t$1(reducer));
-  function _reduce(iter) {
-    let acc = initialValue;
-    for (const value of iter) {
-      acc = reducer(acc, value);
-    }
-    return acc;
-  }
-  return object_hash.n(arg3) ? _reduce(arg1) : _reduce;
-}
-
-const DELAY = "LIKEC4_DELAY";
-function delay(...args) {
-  let ms = 100;
-  if (args.length === 2) {
-    ms = o(args[0], args[1]);
-  } else if (args.length === 1) {
-    ms = args[0];
-  }
-  return new Promise((resolve) => {
-    setTimeout(() => {
-      resolve(DELAY);
-    }, ms ?? 100);
-  });
-}
-
-const compareRelations = (a, b) => {
-  const parentA = object_hash.commonAncestor(a.source, a.target);
-  const parentB = object_hash.commonAncestor(b.source, b.target);
-  if (parentA && !parentB) {
-    return 1;
-  }
-  if (!parentA && parentB) {
-    return -1;
-  }
-  const compareParents = parentA && parentB ? object_hash.compareFqnHierarchically(parentA, parentB) : 0;
-  if (compareParents !== 0) {
-    return compareParents;
-  }
-  const compareSource = object_hash.compareFqnHierarchically(a.source, b.source);
-  if (compareSource !== 0) {
-    return compareSource;
-  }
-  return object_hash.compareFqnHierarchically(a.target, b.target);
-};
-
-exports.DefaultMap = object_hash.DefaultMap;
-exports.LinkedList = object_hash.linkedList;
-exports.Queue = object_hash.queue;
-exports.Stack = object_hash.Stack;
-exports.ancestorsFqn = object_hash.ancestorsFqn;
-exports.commonAncestor = object_hash.commonAncestor;
-exports.commonHead = object_hash.commonHead;
-exports.compareByFqnHierarchically = object_hash.compareByFqnHierarchically;
-exports.compareFqnHierarchically = object_hash.compareFqnHierarchically;
-exports.compareNatural = object_hash.compareNatural;
-exports.difference = object_hash.difference;
-exports.equalsSet = object_hash.equals;
-exports.getOrCreate = object_hash.getOrCreate;
-exports.hasAtLeast = object_hash.i;
-exports.hierarchyDistance = object_hash.hierarchyDistance;
-exports.hierarchyLevel = object_hash.hierarchyLevel;
-exports.ifilter = object_hash.ifilter;
-exports.ifind = object_hash.ifind;
-exports.iflat = object_hash.iflat;
-exports.imap = object_hash.imap;
-exports.intersection = object_hash.intersection;
-exports.isAncestor = object_hash.isAncestor;
-exports.isDescendantOf = object_hash.isDescendantOf;
-exports.isIterable = object_hash.isIterable;
-exports.isNonEmptyArray = object_hash.isNonEmptyArray;
-exports.isSameHierarchy = object_hash.isSameHierarchy;
-exports.isString = object_hash.isString;
-exports.isome = object_hash.isome;
-exports.iunique = object_hash.iunique;
-exports.nameFromFqn = object_hash.nameFromFqn;
-exports.objectHash = object_hash.objectHash;
-exports.parentFqn = object_hash.parentFqn;
-exports.sortByFqnHierarchically = object_hash.sortByFqnHierarchically;
-exports.sortNaturalByFqn = object_hash.sortNaturalByFqn;
-exports.sortParentsFirst = object_hash.sortParentsFirst;
-exports.stringHash = object_hash.stringHash;
-exports.symmetricDifference = object_hash.symmetricDifference;
-exports.toArray = object_hash.toArray;
-exports.toSet = object_hash.toSet;
-exports.union = object_hash.union;
-exports.compareRelations = compareRelations;
-exports.delay = delay;
-exports.ireduce = ireduce;

package/dist/utils/index.d.cts

@@ -1,340 +0,0 @@
-export { I as IterableContainer, R as ReorderedArray, a as ancestorsFqn, c as commonAncestor, b as compareByFqnHierarchically, d as compareFqnHierarchically, h as hierarchyDistance, e as hierarchyLevel, i as isAncestor, f as isDescendantOf, g as isSameHierarchy, n as nameFromFqn, p as parentFqn, s as sortByFqnHierarchically, j as sortNaturalByFqn, k as sortParentsFirst } from '../shared/core.BYs5deiY.cjs';
-import { N as NonEmptyArray, a as IteratorLike } from '../shared/core.QP35c488.cjs';
-export { default as objectHash } from '/home/runner/work/likec4/likec4/node_modules/.pnpm/@types+object-hash@3.0.6/node_modules/@types/object-hash/index.d.ts';
-import { IsNumericLiteral } from 'type-fest';
-
-/**
- * Mnemonist DefaultMap Typings
- * =============================
- */
-declare class DefaultMap<K, V> implements Iterable<[K, V]> {
-
-  // Members
-  size: number;
-
-  // Constructor
-  constructor(factory: (key: K, index: number) => 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;
-  forEach(callback: (value: V, key: K, map: this) => void, scope?: any): void;
-  keys(): IterableIterator<K>;
-  values(): IterableIterator<V>;
-  entries(): IterableIterator<[K, V]>;
-  [Symbol.iterator](): IterableIterator<[K, V]>;
-  inspect(): any;
-
-  // Statics
-  static autoIncrement(): number;
-}
-
-/**
- * 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>;
-}
-
-/**
- * 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>;
-}
-
-/**
- * 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>;
-}
-
-/**
- * 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[];
-
-declare function compareNatural(a: string | undefined, b: string | undefined): -1 | 0 | 1;
-
-declare function getOrCreate<K, V>(map: Map<K, V>, key: K, create: (key: K) => V): V;
-
-/**
- * This should only be used for defining generics which extend any kind of JS
- * array under the hood, this includes arrays *AND* tuples (of the form [x, y],
- * and of the form [x, ...y[]], etc...), and their readonly equivalent. This
- * allows us to be more inclusive to what functions can process.
- *
- * @example
- *   function map<T extends IterableContainer>(items: T) { ... }
- *
- * We would've named this `ArrayLike`, but that's already used by typescript...
- * @see This was inspired by the type-definition of Promise.all (https://github.com/microsoft/TypeScript/blob/1df5717b120cddd325deab8b0f2b2c3eecaf2b01/src/lib/es2015.promise.d.ts#L21)
- */
-type IterableContainer<T = unknown> = ReadonlyArray<T> | readonly [];
-
-type ArraySetRequired<T extends IterableContainer, Min extends number, Iteration extends ReadonlyArray<unknown> = []> = number extends Min ? never : Iteration["length"] extends Min ? T : T extends readonly [] ? never : T extends [infer Head, ...infer Rest] ? [
-    Head,
-    ...ArraySetRequired<Rest, Min, [unknown, ...Iteration]>
-] : T extends readonly [infer Head, ...infer Rest] ? readonly [
-    Head,
-    ...ArraySetRequired<Rest, Min, [unknown, ...Iteration]>
-] : T extends Array<infer Item> ? [
-    Item,
-    ...ArraySetRequired<T, Min, [unknown, ...Iteration]>
-] : T extends ReadonlyArray<infer Item> ? readonly [
-    Item,
-    ...ArraySetRequired<T, Min, [unknown, ...Iteration]>
-] : never;
-/**
- * Checks if the given array has at least the defined number of elements. When
- * the minimum used is a literal (e.g. `3`) the output is refined accordingly so
- * that those indices are defined when accessing the array even when using
- * typescript's 'noUncheckedIndexAccess'.
- *
- * @param data - The input array.
- * @param minimum - The minimum number of elements the array must have.
- * @returns True if the array's length is *at least* `minimum`. When `minimum`
- * is a literal value, the output is narrowed to ensure the first items are
- * guaranteed.
- * @signature
- *   R.hasAtLeast(data, minimum)
- * @example
- *   R.hasAtLeast([], 4); // => false
- *
- *   const data: number[] = [1,2,3,4];
- *   R.hasAtLeast(data, 1); // => true
- *   data[0]; // 1, with type `number`
- * @dataFirst
- * @category Array
- */
-declare function hasAtLeast<T extends IterableContainer, N extends number>(data: IterableContainer | T, minimum: IsNumericLiteral<N> extends true ? N : never): data is ArraySetRequired<T, N>;
-declare function hasAtLeast(data: IterableContainer, minimum: number): boolean;
-/**
- * Checks if the given array has at least the defined number of elements. When
- * the minimum used is a literal (e.g. `3`) the output is refined accordingly so
- * that those indices are defined when accessing the array even when using
- * typescript's 'noUncheckedIndexAccess'.
- *
- * @param minimum - The minimum number of elements the array must have.
- * @returns True if the array's length is *at least* `minimum`. When `minimum`
- * is a literal value, the output is narrowed to ensure the first items are
- * guaranteed.
- * @signature
- *   R.hasAtLeast(minimum)(data)
- * @example
- *   R.pipe([], R.hasAtLeast(4)); // => false
- *
- *   const data = [[1,2], [3], [4,5]];
- *   R.pipe(
- *     data,
- *     R.filter(R.hasAtLeast(2)),
- *     R.map(([, second]) => second),
- *   ); // => [2,5], with type `number[]`
- * @dataLast
- * @category Array
- */
-declare function hasAtLeast<N extends number>(minimum: IsNumericLiteral<N> extends true ? N : never): <T extends IterableContainer>(data: IterableContainer | T) => data is ArraySetRequired<T, N>;
-declare function hasAtLeast(minimum: number): (data: IterableContainer) => boolean;
-
-declare function isString(value: unknown): value is string;
-declare function isNonEmptyArray<A>(arr: ArrayLike<A> | undefined): arr is NonEmptyArray<A>;
-
-declare function isIterable<T, I extends Iterable<T>>(something: I | unknown): something is Iterable<T>;
-
-/**
- * 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>;
-
-/**
- * Finds the first element in the iterable that satisfies the predicate.
- * Composable first version of `find`.
- * @signature
- *   ifind(predicate)(data)
- */
-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>(iterable: Iterable<T>, predicate: (item: T) => boolean): T | undefined;
-
-declare function iflat(): <T>(iterable: Iterable<IteratorLike<T>>) => IteratorLike<T>;
-declare function iflat<T>(iterable: Iterable<IteratorLike<T>>): IteratorLike<T>;
-
-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>;
-
-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;
-
-/**
- * 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;
-
-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>;
-
-/**
- * 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>;
-
-declare function delay(): Promise<string>;
-declare function delay(ms: number): Promise<string>;
-declare function delay(randomFrom: number, randomTo: number): Promise<string>;
-
-/**
- * Compares two relations hierarchically.
- * From the most general (implicit) to the most specific.
- */
-declare const compareRelations: <T extends {
-    source: string;
-    target: string;
-}>(a: T, b: T) => number;
-
-/**
- * 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>;
-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>;
-
-/**
- * @see https://gist.github.com/victor-homyakov/bcb7d7911e4a388b1c810f8c3ce17bcf
- */
-declare function stringHash(str: string): string;
-
-export { DefaultMap, LinkedList, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, stringHash, symmetricDifference, toArray, toSet, union };