47 lines
1.1 KiB
JavaScript
47 lines
1.1 KiB
JavaScript
// Merge two arrays, using the given comparator
|
|
export function mergeArrays (leftArray, rightArray, comparator) {
|
|
let leftIndex = 0
|
|
let rightIndex = 0
|
|
const merged = []
|
|
while (leftIndex < leftArray.length || rightIndex < rightArray.length) {
|
|
if (leftIndex === leftArray.length) {
|
|
merged.push(rightArray[rightIndex])
|
|
rightIndex++
|
|
continue
|
|
}
|
|
if (rightIndex === rightArray.length) {
|
|
merged.push(leftArray[leftIndex])
|
|
leftIndex++
|
|
continue
|
|
}
|
|
const left = leftArray[leftIndex]
|
|
const right = rightArray[rightIndex]
|
|
const comparison = comparator(right, left)
|
|
if (comparison === 0) {
|
|
merged.push(left)
|
|
rightIndex++
|
|
leftIndex++
|
|
} else if (comparison > 0) {
|
|
merged.push(right)
|
|
rightIndex++
|
|
} else {
|
|
merged.push(left)
|
|
leftIndex++
|
|
}
|
|
}
|
|
return merged
|
|
}
|
|
|
|
export function concat () {
|
|
let res = []
|
|
for (let i = 0, len = arguments.length; i < len; i++) {
|
|
const arg = arguments[i]
|
|
if (Array.isArray(arg)) {
|
|
res = res.concat(arguments[i])
|
|
} else {
|
|
res.push(arguments[i])
|
|
}
|
|
}
|
|
return res
|
|
}
|