51 lines
1.8 KiB
JavaScript
51 lines
1.8 KiB
JavaScript
/**
|
|
* @license
|
|
* Copyright (c) 2024 Handsoncode. All rights reserved.
|
|
*/
|
|
import { getRawValue } from '../interpreter/InterpreterValue';
|
|
import { forceNormalizeString } from '../interpreter/ArithmeticHelper';
|
|
import { findLastOccurrenceInOrderedRange } from '../interpreter/binarySearch';
|
|
export class AdvancedFind {
|
|
constructor(dependencyGraph) {
|
|
this.dependencyGraph = dependencyGraph;
|
|
}
|
|
advancedFind(keyMatcher, rangeValue) {
|
|
let values;
|
|
const range = rangeValue.range;
|
|
if (range === undefined) {
|
|
values = rangeValue.valuesFromTopLeftCorner();
|
|
} else {
|
|
values = this.dependencyGraph.computeListOfValuesInRange(range);
|
|
}
|
|
for (let i = 0; i < values.length; i++) {
|
|
if (keyMatcher(getRawValue(values[i]))) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
/*
|
|
* WARNING: Finding lower/upper bounds in unordered ranges is not supported. When ordering === 'none', assumes matchExactly === true
|
|
*/
|
|
basicFind(searchKey, rangeValue, searchCoordinate, {
|
|
ordering,
|
|
matchExactly
|
|
}) {
|
|
const normalizedSearchKey = typeof searchKey === 'string' ? forceNormalizeString(searchKey) : searchKey;
|
|
const range = rangeValue.range;
|
|
if (range === undefined) {
|
|
return this.findNormalizedValue(normalizedSearchKey, rangeValue.valuesFromTopLeftCorner());
|
|
}
|
|
if (ordering === 'none') {
|
|
return this.findNormalizedValue(normalizedSearchKey, this.dependencyGraph.computeListOfValuesInRange(range));
|
|
}
|
|
return findLastOccurrenceInOrderedRange(normalizedSearchKey, range, {
|
|
searchCoordinate,
|
|
orderingDirection: ordering,
|
|
matchExactly
|
|
}, this.dependencyGraph);
|
|
}
|
|
findNormalizedValue(searchKey, searchArray) {
|
|
return searchArray.map(getRawValue).map(val => typeof val === 'string' ? forceNormalizeString(val) : val).indexOf(searchKey);
|
|
}
|
|
} |