@likec4/core 1.47.0 → 1.48.0

package/dist/_chunks/index8.d.mts

@@ -0,0 +1,144 @@
+import { bt as IteratorLike } from "./_aux.mjs";
+
+//#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
+export { ireduce as a, iflatMap as c, ifind as d, ifilter as f, isome as i, iflat as l, toArray as n, imap as o, isIterable as p, toSet as r, ihead as s, iunique as t, ifirst as u };

package/dist/_chunks/invariant.mjs

@@ -0,0 +1,18 @@
+//#region src/utils/invariant.ts
+function nonNullable(value, message) {
+	if (typeof value === "undefined" || value == null) {
+		const msg = typeof message === "function" ? message() : message;
+		throw new Error(msg ?? `Expected defined value, but received ${value}`);
+	}
+	return value;
+}
+function invariant(condition, message) {
+	if (condition) return;
+	throw new Error(message ?? "Invariant failed");
+}
+function nonexhaustive(value) {
+	throw new Error(`NonExhaustive value: ${value}`);
+}
+
+//#endregion
+export { nonNullable as n, nonexhaustive as r, invariant as t };

package/dist/_chunks/iterable.mjs

@@ -0,0 +1,146 @@
+import { L as e$2, N as e, P as e$1 } from "./libs/remeda.mjs";
+import { t as invariant } from "./invariant.mjs";
+
+//#region src/utils/iterable/_types.ts
+function isIterable(something) {
+	return e(something) && typeof something === "object" && Symbol.iterator in something;
+}
+
+//#endregion
+//#region src/utils/iterable/filter.ts
+function ifilter(arg1, arg2) {
+	const pred = arg2 ?? arg1;
+	invariant(e$1(pred));
+	function* _filter(iter) {
+		for (const value of iter) if (pred(value)) yield value;
+	}
+	if (!arg2) return _filter;
+	return _filter(arg1);
+}
+
+//#endregion
+//#region src/utils/iterable/find.ts
+function ifind(arg1, arg2) {
+	const pred = arg2 ?? arg1;
+	invariant(e$1(pred));
+	function _find(iter) {
+		for (const value of iter) if (pred(value)) return value;
+	}
+	if (!arg2) return _find;
+	return _find(arg1);
+}
+
+//#endregion
+//#region src/utils/iterable/first.ts
+function ifirst(arg1, arg2) {
+	const count = arg2 ?? arg1;
+	invariant(typeof count === "number" && count >= 0, "Count must be a non-negative number");
+	function* _first(iter) {
+		let taken = 0;
+		for (const value of iter) {
+			if (taken >= count) break;
+			yield value;
+			taken++;
+		}
+	}
+	if (arg2 === void 0) return (iterable) => _first(iterable);
+	return _first(arg1);
+}
+
+//#endregion
+//#region src/utils/iterable/flat.ts
+function iflat(iterable) {
+	return iterable ? _iflat(iterable) : _iflat;
+}
+function* _iflat(iterable) {
+	for (const inner of iterable) yield* inner;
+}
+
+//#endregion
+//#region src/utils/iterable/flatMap.ts
+function iflatMap(arg1, arg2) {
+	const mapper = arg2 ?? arg1;
+	invariant(e$1(mapper));
+	function* _flatMap(iter) {
+		for (const value of iter) yield* mapper(value);
+	}
+	if (!arg2) return _flatMap;
+	return _flatMap(arg1);
+}
+
+//#endregion
+//#region src/utils/iterable/head.ts
+function ihead(iterable) {
+	if (!iterable) return _head;
+	return _head(iterable);
+}
+function _head(iter) {
+	const { value } = iter[Symbol.iterator]().next();
+	return value;
+}
+
+//#endregion
+//#region src/utils/iterable/map.ts
+function imap(arg1, arg2) {
+	const mapper = arg2 ?? arg1;
+	invariant(e$1(mapper));
+	function* _map(iter) {
+		for (const value of iter) yield mapper(value);
+	}
+	if (!arg2) return _map;
+	return _map(arg1);
+}
+
+//#endregion
+//#region src/utils/iterable/reduce.ts
+function ireduce(arg1, arg2, arg3) {
+	const reducer = e$2(arg3) ? arg2 : arg1;
+	const initialValue = arg3 ?? arg2;
+	invariant(e$1(reducer));
+	function _reduce(iter) {
+		let acc = initialValue;
+		for (const value of iter) acc = reducer(acc, value);
+		return acc;
+	}
+	return e$2(arg3) ? _reduce(arg1) : _reduce;
+}
+
+//#endregion
+//#region src/utils/iterable/some.ts
+function isome(arg1, arg2) {
+	const pred = arg2 ?? arg1;
+	invariant(e$1(pred));
+	function _some(iter) {
+		for (const value of iter) if (pred(value)) return true;
+		return false;
+	}
+	if (!arg2) return _some;
+	return _some(arg1);
+}
+
+//#endregion
+//#region src/utils/iterable/to.ts
+function toArray(iterable) {
+	if (iterable) return Array.from(iterable);
+	return (it) => Array.from(it);
+}
+function toSet(iterable) {
+	if (iterable) return new Set(iterable);
+	return (it) => new Set(it);
+}
+
+//#endregion
+//#region src/utils/iterable/unique.ts
+function iunique(iterable) {
+	return iterable ? _iunique(iterable) : _iunique;
+}
+function* _iunique(iterable) {
+	const seen = /* @__PURE__ */ new Set();
+	for (const item of iterable) if (!seen.has(item)) {
+		seen.add(item);
+		yield item;
+	}
+}
+
+//#endregion
+export { ireduce as a, iflatMap as c, ifind as d, ifilter as f, isome as i, iflat as l, toArray as n, imap as o, isIterable as p, toSet as r, ihead as s, iunique as t, ifirst as u };