Sharkey/src/prelude/array.ts

52 lines
1.3 KiB
TypeScript
Raw Normal View History

2018-09-05 20:16:08 +03:00
export function countIf<T>(f: (x: T) => boolean, xs: T[]): number {
return xs.filter(f).length;
}
export function count<T>(x: T, xs: T[]): number {
return countIf(y => x === y, xs);
}
2018-09-05 20:28:04 +03:00
2018-09-06 15:31:15 +03:00
export function concat<T>(xss: T[][]): T[] {
return ([] as T[]).concat(...xss);
}
2018-09-05 20:28:04 +03:00
export function intersperse<T>(sep: T, xs: T[]): T[] {
2018-09-06 15:31:15 +03:00
return concat(xs.map(x => [sep, x])).slice(1);
2018-09-05 20:28:04 +03:00
}
2018-09-06 18:02:55 +03:00
export function erase<T>(x: T, xs: T[]): T[] {
return xs.filter(y => x !== y);
}
2018-09-06 18:10:03 +03:00
/**
* Finds the array of all elements in the first array not contained in the second array.
* The order of result values are determined by the first array.
*/
export function difference<T>(includes: T[], excludes: T[]): T[] {
return includes.filter(x => !excludes.includes(x));
2018-11-09 04:01:55 +02:00
}
2018-09-06 18:10:03 +03:00
export function unique<T>(xs: T[]): T[] {
return [...new Set(xs)];
}
2018-09-06 22:21:04 +03:00
export function sum(xs: number[]): number {
return xs.reduce((a, b) => a + b, 0);
}
2018-11-09 06:03:46 +02:00
export function groupBy<T>(f: (x: T, y: T) => boolean, xs: T[]): T[][] {
const groups = [] as T[][];
for (const x of xs) {
if (groups.length !== 0 && f(groups[groups.length - 1][0], x)) {
groups[groups.length - 1].push(x);
} else {
groups.push([x]);
}
}
return groups;
}
export function groupOn<T, S>(f: (x: T) => S, xs: T[]): T[][] {
return groupBy((a, b) => f(a) === f(b), xs);
}