56 lines
2.0 KiB
Plaintext
56 lines
2.0 KiB
Plaintext
|
(function (factory) {
|
||
|
|
if (typeof module === "object" && typeof module.exports === "object") {
|
||
|
|
var v = factory(require, exports);
|
||
|
|
if (v !== undefined) module.exports = v;
|
||
|
|
}
|
||
|
|
else if (typeof define === "function" && define.amd) {
|
||
|
|
define(["require", "exports"], factory);
|
||
|
|
}
|
||
|
|
})(function (require, exports) {
|
||
|
|
/*---------------------------------------------------------------------------------------------
|
||
|
|
* Copyright (c) Microsoft Corporation. All rights reserved.
|
||
|
|
* Licensed under the MIT License. See License.txt in the project root for license information.
|
||
|
|
*--------------------------------------------------------------------------------------------*/
|
||
|
|
'use strict';
|
||
|
|
Object.defineProperty(exports, "__esModule", { value: true });
|
||
|
|
exports.union = exports.includes = exports.findFirst = void 0;
|
||
|
|
/**
|
||
|
|
* Takes a sorted array and a function p. The array is sorted in such a way that all elements where p(x) is false
|
||
|
|
* are located before all elements where p(x) is true.
|
||
|
|
* @returns the least x for which p(x) is true or array.length if no element fullfills the given function.
|
||
|
|
*/
|
||
|
|
function findFirst(array, p) {
|
||
|
|
let low = 0, high = array.length;
|
||
|
|
if (high === 0) {
|
||
|
|
return 0; // no children
|
||
|
|
}
|
||
|
|
while (low < high) {
|
||
|
|
let mid = Math.floor((low + high) / 2);
|
||
|
|
if (p(array[mid])) {
|
||
|
|
high = mid;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
low = mid + 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return low;
|
||
|
|
}
|
||
|
|
exports.findFirst = findFirst;
|
||
|
|
function includes(array, item) {
|
||
|
|
return array.indexOf(item) !== -1;
|
||
|
|
}
|
||
|
|
exports.includes = includes;
|
||
|
|
function union(...arrays) {
|
||
|
|
const result = [];
|
||
|
|
for (const array of arrays) {
|
||
|
|
for (const item of array) {
|
||
|
|
if (!includes(result, item)) {
|
||
|
|
result.push(item);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
exports.union = union;
|
||
|
|
});
|