@vinicunca/perkakas 0.3.6 → 0.4.0

package/dist/es/array/count-by.js

@@ -1,20 +0,0 @@
-import { purry } from '../function/purry';
-function countBy_(indexed) {
-    return (array, fn) => {
-        let out = 0;
-        for (const [index, item] of array.entries()) {
-            const value = indexed ? fn(item, index, array) : fn(item);
-            out += value ? 1 : 0;
-        }
-        return out;
-    };
-}
-export function countBy(...args) {
-    return purry(countBy_(false), args);
-}
-(function (countBy) {
-    function indexed(...args) {
-        return purry(countBy_(true), args);
-    }
-    countBy.indexed = indexed;
-})(countBy || (countBy = {}));

package/dist/es/array/difference.js

@@ -1,18 +0,0 @@
-import { purry } from '../function/purry';
-import { reduceLazy } from '../utils/reduce-lazy';
-export function difference(...args) {
-    return purry(difference_, args, difference.lazy);
-}
-function difference_(array, other) {
-    const lazy = difference.lazy(other);
-    return reduceLazy(array, lazy);
-}
-(function (difference) {
-    function lazy(other) {
-        const set = new Set(other);
-        return (value) => set.has(value)
-            ? { done: false, hasNext: false }
-            : { done: false, hasNext: true, next: value };
-    }
-    difference.lazy = lazy;
-})(difference || (difference = {}));

package/dist/es/array/intersection.js

@@ -1,18 +0,0 @@
-import { purry } from '../function/purry';
-import { reduceLazy } from '../utils/reduce-lazy';
-export function intersection(...args) {
-    return purry(intersection_, args, intersection.lazy);
-}
-function intersection_(array, other) {
-    const lazy = intersection.lazy(other);
-    return reduceLazy(array, lazy);
-}
-(function (intersection) {
-    function lazy(other) {
-        const set = new Set(other);
-        return (value) => set.has(value)
-            ? { done: false, hasNext: true, next: value }
-            : { done: false, hasNext: false };
-    }
-    intersection.lazy = lazy;
-})(intersection || (intersection = {}));

package/dist/es/object/equals.js

@@ -1,63 +0,0 @@
-import { purry } from '../function/purry';
-export function equals(...args) {
-    return purry(equals_, args);
-}
-function equals_(a, b) {
-    if (a === b) {
-        return true;
-    }
-    if (typeof a === 'number' && typeof b === 'number') {
-        return Number.isNaN(a) && Number.isNaN(b);
-    }
-    if (typeof a !== 'object' || typeof b !== 'object') {
-        return false;
-    }
-    if (a === null || b === null) {
-        return false;
-    }
-    const isArrayA = Array.isArray(a);
-    const isArrayB = Array.isArray(b);
-    if (isArrayA && isArrayB) {
-        if (a.length !== b.length) {
-            return false;
-        }
-        for (let i = 0; i < a.length; i++) {
-            if (!equals_(a[i], b[i])) {
-                return false;
-            }
-        }
-        return true;
-    }
-    if (isArrayA !== isArrayB) {
-        return false;
-    }
-    const isDateA = a instanceof Date;
-    const isDateB = b instanceof Date;
-    if (isDateA && isDateB) {
-        return a.getTime() === b.getTime();
-    }
-    if (isDateA !== isDateB) {
-        return false;
-    }
-    const isRegExpA = a instanceof RegExp;
-    const isRegExpB = b instanceof RegExp;
-    if (isRegExpA && isRegExpB) {
-        return a.toString() === b.toString();
-    }
-    if (isRegExpA !== isRegExpB) {
-        return false;
-    }
-    const keys = Object.keys(a);
-    if (keys.length !== Object.keys(b).length) {
-        return false;
-    }
-    for (const key of keys) {
-        if (!Object.prototype.hasOwnProperty.call(b, key)) {
-            return false;
-        }
-        if (!equals_(a[key], b[key])) {
-            return false;
-        }
-    }
-    return true;
-}

package/dist/types/array/compact.d.ts

@@ -1,12 +0,0 @@
-/**
- * Filter out all falsey values. The values `false`, `null`, `0`, `""`, `undefined`, and `NaN` are falsey.
- * @param items the array to compact
- * @signature
- *    P.compact(array)
- * @example
- *    P.compact([0, 1, false, 2, '', 3]) // => [1, 2, 3]
- * @category Array
- * @pipeable
- */
-export declare function compact<T>(items: ReadonlyArray<'' | 0 | T | false | null | undefined>): Array<T>;
-//# sourceMappingURL=compact.d.ts.map

package/dist/types/array/compact.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"compact.d.ts","sourceRoot":"","sources":["../../../src/array/compact.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,SAAS,CAAC,GAC1D,KAAK,CAAC,CAAC,CAAC,CAGV"}

package/dist/types/array/count-by.d.ts

@@ -1,20 +0,0 @@
-import type { Pred, PredIndexed } from '../utils/types';
-/**
- * Counts how many values of the collection pass the specified predicate.
- * @param items The input data.
- * @param fn The predicate.
- * @signature
- *    P.countBy(array, fn)
- * @example
- *    P.countBy([1, 2, 3, 4, 5], x => x % 2 === 0) // => 2
- * @dataFirst
- * @indexed
- * @category Array
- */
-export declare function countBy<T>(items: ReadonlyArray<T>, fn: Pred<T, boolean>): number;
-export declare function countBy<T>(fn: Pred<T, boolean>): (array: ReadonlyArray<T>) => number;
-export declare namespace countBy {
-    function indexed<T>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): number;
-    function indexed<T>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => number;
-}
-//# sourceMappingURL=count-by.d.ts.map

package/dist/types/array/count-by.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"count-by.d.ts","sourceRoot":"","sources":["../../../src/array/count-by.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAuB,MAAM,gBAAgB,CAAC;AAiB7E;;;;;;;;;;;GAWG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,MAAM,CAAC;AAEV,wBAAgB,OAAO,CAAC,CAAC,EACvB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC;AAiBvC,yBAAiB,OAAO,CAAC;IACvB,SAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,MAAM,CAAC;IACV,SAAgB,OAAO,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC;CAIxC"}

package/dist/types/array/difference.d.ts

@@ -1,35 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-/**
- * Excludes the values from `other` array.
- * @param array the source array
- * @param other the values to exclude
- * @signature
- *    P.difference(array, other)
- * @example
- *    P.difference([1, 2, 3, 4], [2, 5, 3]) // => [1, 4]
- * @dataFirst
- * @category Array
- * @pipeable
- */
-export declare function difference<T>(array: ReadonlyArray<T>, other: ReadonlyArray<T>): Array<T>;
-/**
- * Excludes the values from `other` array.
- * @param other the values to exclude
- * @signature
- *    P.difference(other)(array)
- * @example
- *    P.difference([2, 5, 3])([1, 2, 3, 4]) // => [1, 4]
- *    P.pipe(
- *      [1, 2, 3, 4, 5, 6], // only 4 iterations
- *      P.difference([2, 3]),
- *      P.take(2)
- *    ) // => [1, 4]
- * @dataLast
- * @category Array
- * @pipeable
- */
-export declare function difference<T, K>(other: ReadonlyArray<T>): (array: ReadonlyArray<K>) => Array<T>;
-export declare namespace difference {
-    function lazy<T>(other: ReadonlyArray<T>): LazyEvaluator<T>;
-}
-//# sourceMappingURL=difference.d.ts.map

package/dist/types/array/difference.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"difference.d.ts","sourceRoot":"","sources":["../../../src/array/difference.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKtD;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GACtB,KAAK,CAAC,CAAC,CAAC,CAAC;AAEZ;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAC7B,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GACtB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAczC,yBAAiB,UAAU,CAAC;IAC1B,SAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAMjE;CACF"}

package/dist/types/array/intersection.d.ts

@@ -1,30 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-/**
- * Returns a list of elements that exist in both array.
- * @param array the source array
- * @param other the second array
- * @signature
- *    P.intersection(array, other)
- * @example
- *    P.intersection([1, 2, 3], [2, 3, 5]) // => [2, 3]
- * @dataFirst
- * @category Array
- * @pipeable
- */
-export declare function intersection<T>(array: ReadonlyArray<T>, other: ReadonlyArray<T>): Array<T>;
-/**
- * Returns a list of elements that exist in both array.
- * @param other the second array
- * @signature
- *    P.intersection(other)(array)
- * @example
- *    P.intersection([2, 3, 5])([1, 2, 3]) // => [2, 3]
- * @dataLast
- * @category Array
- * @pipeable
- */
-export declare function intersection<T, K>(other: ReadonlyArray<T>): (source: ReadonlyArray<K>) => Array<T>;
-export declare namespace intersection {
-    function lazy<T>(other: ReadonlyArray<T>): LazyEvaluator<T>;
-}
-//# sourceMappingURL=intersection.d.ts.map

package/dist/types/array/intersection.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"intersection.d.ts","sourceRoot":"","sources":["../../../src/array/intersection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKtD;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GACtB,KAAK,CAAC,CAAC,CAAC,CAAC;AAEZ;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAC/B,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GACtB,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAc1C,yBAAiB,YAAY,CAAC;IAC5B,SAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAMjE;CACF"}

package/dist/types/object/equals.d.ts

@@ -1,30 +0,0 @@
-/**
- * Returns true if its arguments are equivalent, false otherwise.
- * NOTE: Doesn't handle cyclical data structures.
- * @param a the first object to compare
- * @param b the second object to compare
- * @signature
- *    P.equals(a, b)
- * @example
- *    P.equals(1, 1) //=> true
- *    P.equals(1, '1') //=> false
- *    P.equals([1, 2, 3], [1, 2, 3]) //=> true
- * @dataFirst
- * @category Object
- */
-export declare function equals(a: unknown, b: unknown): boolean;
-/**
- * Returns true if its arguments are equivalent, false otherwise.
- * NOTE: Doesn't handle cyclical data structures.
- * @param a the first object to compare
- * @signature
- *    P.equals(b)(a)
- * @example
- *    P.equals(1)(1) //=> true
- *    P.equals('1')(1) //=> false
- *    P.equals([1, 2, 3])([1, 2, 3]) //=> true
- * @dataLast
- * @category Object
- */
-export declare function equals(a: unknown): (b: unknown) => boolean;
-//# sourceMappingURL=equals.d.ts.map

package/dist/types/object/equals.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"equals.d.ts","sourceRoot":"","sources":["../../../src/object/equals.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC;AAExD;;;;;;;;;;;;GAYG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,OAAO,KAAK,OAAO,CAAC"}