Skip to content
v3.3.0

ColumnBinarySearch

+ new ColumnBinarySearch(dependencyGraph: DependencyGraph): ColumnBinarySearch

Defined in src/Lookup/ColumnBinarySearch.ts:15

Parameters:

NameType
dependencyGraphDependencyGraph

Returns: ColumnBinarySearch

add(value: RawScalarValue, address: SimpleCellAddress): void

Defined in src/Lookup/ColumnBinarySearch.ts:21

Parameters:

NameType
valueRawScalarValue
addressSimpleCellAddress

Returns: void


addColumns(columnsSpan: ColumnsSpan): void

Defined in src/Lookup/ColumnBinarySearch.ts:37

Parameters:

NameType
columnsSpanColumnsSpan

Returns: void


advancedFind(keyMatcher: function, rangeValue: SimpleRangeValue, __namedParameters: object): number

Defined in src/Lookup/AdvancedFind.ts:26

Parameters:

keyMatcher: function

▸ (arg: RawInterpreterValue): boolean

Parameters:

NameType
argRawInterpreterValue

rangeValue: SimpleRangeValue

Default value __namedParameters: object= { returnOccurrence: ‘first’ }

NameType
returnOccurrenceundefined | “first” | “last”

Returns: number


applyChanges(contentChanges: CellValueChange[]): void

Defined in src/Lookup/ColumnBinarySearch.ts:33

Parameters:

NameType
contentChangesCellValueChange[]

Returns: void


change(oldValue: RawScalarValue | undefined, newValue: RawScalarValue, address: SimpleCellAddress): void

Defined in src/Lookup/ColumnBinarySearch.ts:29

Parameters:

NameType
oldValueRawScalarValue | undefined
newValueRawScalarValue
addressSimpleCellAddress

Returns: void


find(searchKey: RawNoErrorScalarValue, rangeValue: SimpleRangeValue, searchOptions: SearchOptions): number

Defined in src/Lookup/ColumnBinarySearch.ts:69

Parameters:

NameType
searchKeyRawNoErrorScalarValue
rangeValueSimpleRangeValue
searchOptionsSearchOptions

Returns: number


forceApplyPostponedTransformations(): void

Defined in src/Lookup/ColumnBinarySearch.ts:63

No-op: ColumnBinarySearch reads cell values directly from the dependency graph on every lookup, so it has no cached data that could become stale. Unlike ColumnIndex, which maintains a separate value-to-address index that must be kept in sync with lazy transformations, binary search always operates on the current graph state.

Returns: void


moveValues(sourceRange: IterableIterator‹[RawScalarValue, SimpleCellAddress]›, toRight: number, toBottom: number, toSheet: number): void

Defined in src/Lookup/ColumnBinarySearch.ts:49

Parameters:

NameType
sourceRangeIterableIterator‹[RawScalarValue, SimpleCellAddress]›
toRightnumber
toBottomnumber
toSheetnumber

Returns: void


remove(value: RawScalarValue | undefined, address: SimpleCellAddress): void

Defined in src/Lookup/ColumnBinarySearch.ts:25

Parameters:

NameType
valueRawScalarValue | undefined
addressSimpleCellAddress

Returns: void


removeColumns(columnsSpan: ColumnsSpan): void

Defined in src/Lookup/ColumnBinarySearch.ts:41

Parameters:

NameType
columnsSpanColumnsSpan

Returns: void


removeSheet(sheetId: number): void

Defined in src/Lookup/ColumnBinarySearch.ts:45

Parameters:

NameType
sheetIdnumber

Returns: void


removeValues(range: IterableIterator‹[RawScalarValue, SimpleCellAddress]›): void

Defined in src/Lookup/ColumnBinarySearch.ts:53

Parameters:

NameType
rangeIterableIterator‹[RawScalarValue, SimpleCellAddress]›

Returns: void