mirror of
https://github.com/laurent22/joplin.git
synced 2024-12-24 10:27:10 +02:00
112 lines
3.7 KiB
TypeScript
112 lines
3.7 KiB
TypeScript
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const unique = function<T extends any>(array: T[]): T[] {
|
|
return array.filter((elem, index, self) => {
|
|
return index === self.indexOf(elem);
|
|
});
|
|
};
|
|
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const removeElement = function<T extends any>(array: T[], element: T): T[] {
|
|
const index = array.indexOf(element);
|
|
if (index < 0) return array;
|
|
const newArray = array.slice();
|
|
newArray.splice(index, 1);
|
|
return newArray;
|
|
};
|
|
|
|
// https://stackoverflow.com/a/10264318/561309
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const binarySearch = function(items: any[], value: any) {
|
|
let startIndex = 0,
|
|
stopIndex = items.length - 1,
|
|
middle = Math.floor((stopIndex + startIndex) / 2);
|
|
|
|
while (items[middle] !== value && startIndex < stopIndex) {
|
|
// adjust search area
|
|
if (value < items[middle]) {
|
|
stopIndex = middle - 1;
|
|
} else if (value > items[middle]) {
|
|
startIndex = middle + 1;
|
|
}
|
|
|
|
// recalculate middle
|
|
middle = Math.floor((stopIndex + startIndex) / 2);
|
|
}
|
|
|
|
// make sure it's the right value
|
|
return items[middle] !== value ? -1 : middle;
|
|
};
|
|
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const findByKey = function(array: any[], key: any, value: any) {
|
|
for (let i = 0; i < array.length; i++) {
|
|
const o = array[i];
|
|
if (typeof o !== 'object') continue;
|
|
if (o[key] === value) return o;
|
|
}
|
|
return null;
|
|
};
|
|
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const contentEquals = function(array1: any[], array2: any[]) {
|
|
if (array1 === array2) return true;
|
|
if (!array1.length && !array2.length) return true;
|
|
if (array1.length !== array2.length) return false;
|
|
|
|
for (let i = 0; i < array1.length; i++) {
|
|
const a1 = array1[i];
|
|
if (array2.indexOf(a1) < 0) return false;
|
|
}
|
|
|
|
return true;
|
|
};
|
|
|
|
// Merges multiple overlapping intervals into a single interval
|
|
// e.g. [0, 25], [20, 50], [75, 100] --> [0, 50], [75, 100]
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const mergeOverlappingIntervals = function(intervals: any[], limit: number) {
|
|
intervals.sort((a, b) => a[0] - b[0]);
|
|
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
const stack: any[] = [];
|
|
if (intervals.length) {
|
|
stack.push(intervals[0]);
|
|
for (let i = 1; i < intervals.length && stack.length < limit; i++) {
|
|
const top = stack[stack.length - 1];
|
|
if (top[1] < intervals[i][0]) {
|
|
stack.push(intervals[i]);
|
|
} else if (top[1] < intervals[i][1]) {
|
|
top[1] = intervals[i][1];
|
|
stack.pop();
|
|
stack.push(top);
|
|
}
|
|
}
|
|
}
|
|
return stack;
|
|
};
|
|
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const shuffle = function(array: any[]) {
|
|
array = array.slice();
|
|
for (let i = array.length - 1; i > 0; i--) {
|
|
const j = Math.floor(Math.random() * (i + 1));
|
|
const temp = array[i];
|
|
array[i] = array[j];
|
|
array[j] = temp;
|
|
}
|
|
return array;
|
|
};
|
|
|
|
// Used to replace lodash.pull, so that we don't need to import the whole
|
|
// package. Not optimised.
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
export const pull = (array: any[], ...elements: any[]) => {
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Old code before rule was applied
|
|
const output: any[] = [];
|
|
for (const e of array) {
|
|
if (elements.includes(e)) continue;
|
|
output.push(e);
|
|
}
|
|
return output;
|
|
};
|