-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharrays.ts
More file actions
104 lines (91 loc) · 2.8 KB
/
arrays.ts
File metadata and controls
104 lines (91 loc) · 2.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
export const sum = (arr: number[]): number => arr.reduce((acc, curr) => acc + curr, 0);
export const max = (arr: number[]): number => arr.reduce((maximum, curr) => maximum > curr ? maximum : curr, arr[0] ?? 0);
export const min = (arr: number[]): number => arr.reduce((minimum, curr) => minimum < curr ? minimum : curr, arr[0] ?? 0);
export const empty = (arr: any[]): boolean => arr.length === 0;
export function first<T>(arr: T[]): T {
if (empty(arr)) {
throw new Error(`Cannot get first from empty array`);
}
return arr[0];
}
export function last<T>(arr: T[]): T {
if (empty(arr)) {
throw new Error(`Cannot get last from empty array`);
}
return arr[arr.length - 1];
}
/**
* Sorts the given numbers in ascending order in a new array.
*
* @param arr array of numbers
* @returns a copy of the given array in ascending order
*/
export function sortNumbers(arr: number[]): number[] {
return [...arr].sort((a, b) => a - b);
}
export function minAndMax(numbers: number[]): [number, number] {
if (empty(numbers)) {
throw new Error(`Cannot get min and max from empty array`);
}
let min = numbers[0];
let max = numbers[0];
numbers.forEach(n => {
if (n < min) {
min = n;
}
if (n > max) {
max = n;
}
});
return [min, max];
}
// https://stackoverflow.com/a/55435856
function* chunks<T>(arr: T[], chunkSize: number): Generator<T[], void> {
for (let i = 0; i < arr.length; i += chunkSize) {
yield arr.slice(i, i + chunkSize);
}
}
export function splitToChunks<T>(arr: T[], chunkSize: number): T[][] {
return [...chunks(arr, chunkSize)];
}
/**
* Transposes the given 2 dimensional array so that rows become columns and columns become rows.
*/
export function transpose<T>(matrix: T[][]): T[][] {
let rotated = matrix[0].map(col => new Array<T>());
matrix.forEach((row, y) => {
row.forEach((value, x) => {
rotated[x][y] = value;
});
})
return rotated;
}
/**
* Returns a deep copy of the given matrix with each row reversed.
*/
export function reverseRows<T>(matrix: T[][]): T[][] {
return matrix.map(row => [...row].reverse());
}
/**
* Returns an array that contains pairs from arr1 and arr2 as tuples.
*/
export function zip<T, U>(arr1: T[], arr2: U[]): [T, U][] {
return arr1.map((v, i) => [v, arr2[i]]);
}
/**
* Returns true if all elements in arr1 equal the ones on arr2.
*/
export function equal<T>(arr1: T[], arr2: T[]): boolean {
if (!Array.isArray(arr1) || !Array.isArray(arr2) || arr1.length !== arr2.length) {
return false;
}
if (arr1 === arr2) {
return true;
}
for (let i = 0; i < arr1.length; i++) {
if (arr1[i] !== arr2[i]) {
return false;
}
}
return true;
}