BTreeIndex

Defined in: packages/db/src/indexes/btree-index.ts:41

B+Tree index for sorted data with range queries This maintains items in sorted order and provides efficient range operations

Extends#

• BaseIndex<TKey>

Type Parameters#

TKey#

TKey extends string | number = string | number

Constructors#

Constructor#

new BTreeIndex<TKey>(
   id, 
   expression, 
   name?, 
options?): BTreeIndex<TKey>;

Defined in: packages/db/src/indexes/base-index.ts:139

Parameters#

id#

number

expression#

BasicExpression

name?#

string

options?#

any

Returns#

BTreeIndex<TKey>

Inherited from#

BaseIndex.constructor

Properties#

compareFn()#

protected readonly compareFn: (a, b) => number;

Defined in: packages/db/src/indexes/base-index.ts:130

Orders indexed values. Every result is checked, because a custom comparator or custom collation may be supplied by the user.

Parameters#

a#

any

b#

any

Returns#

number

Inherited from#

BaseIndex.compareFn

compareOptions#

protected readonly compareOptions: CompareOptions;

Defined in: packages/db/src/indexes/base-index.ts:125

Inherited from#

BaseIndex.compareOptions

expression#

readonly expression: BasicExpression;

Defined in: packages/db/src/indexes/base-index.ts:123

Inherited from#

BaseIndex.expression

hasCustomComparator#

protected readonly hasCustomComparator: boolean;

Defined in: packages/db/src/indexes/base-index.ts:136

A user-supplied comparator's ordering may not match the WHERE evaluator's relational operators.

Inherited from#

BaseIndex.hasCustomComparator

id#

readonly id: number;

Defined in: packages/db/src/indexes/base-index.ts:121

Inherited from#

BaseIndex.id

name?#

readonly optional name: string;

Defined in: packages/db/src/indexes/base-index.ts:122

Inherited from#

BaseIndex.name

supportedOperations#

readonly supportedOperations: Set<"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike">;

Defined in: packages/db/src/indexes/btree-index.ts:44

Overrides#

BaseIndex.supportedOperations

Accessors#

keyCount#

Get Signature#

get keyCount(): number;

Defined in: packages/db/src/indexes/btree-index.ts:262

Gets the number of indexed keys

Returns#

number

Overrides#

BaseIndex.keyCount

supportsRangeOptimization#

Get Signature#

get supportsRangeOptimization(): boolean;

Defined in: packages/db/src/indexes/base-index.ts:205

Whether range lookups (gt/gte/lt/lte) on this index can be trusted to return every matching key. Range traversal relies on the index ordering, so it is unsafe when the index uses a custom comparator, whose order may not match the WHERE evaluator's relational operators. Callers must fall back to a full scan when this is false.

Returns#

boolean

Inherited from#

BaseIndex.supportsRangeOptimization

Methods#

add()#

add(key, item): void;

Defined in: packages/db/src/indexes/btree-index.ts:76

Adds a value to the index

Parameters#

key#

TKey

item#

any

Returns#

void

Overrides#

BaseIndex.add

addRangeValue()#

protected addRangeValue(value): void;

Defined in: packages/db/src/indexes/base-index.ts:209

Parameters#

value#

unknown

Returns#

void

Inherited from#

BaseIndex.addRangeValue

build()#

build(entries): void;

Defined in: packages/db/src/indexes/btree-index.ts:210

Builds the index from a collection of entries

Parameters#

entries#

Iterable<[TKey, any]>

Returns#

void

Overrides#

BaseIndex.build

canOptimizeRangeFor()#

canOptimizeRangeFor(value): boolean;

Defined in: packages/db/src/indexes/base-index.ts:231

Whether the live values in this index share the predicate operand's relational domain. Mixed domains can sort differently in the index and WHERE evaluator, which can make a range lookup omit matching rows.

Parameters#

value#

unknown

Returns#

boolean

Inherited from#

BaseIndex.canOptimizeRangeFor

clear()#

clear(): void;

Defined in: packages/db/src/indexes/btree-index.ts:221

Clears all data from the index

Returns#

void

Overrides#

BaseIndex.clear

clearRangeValues()#

protected clearRangeValues(): void;

Defined in: packages/db/src/indexes/base-index.ts:227

Returns#

void

Inherited from#

BaseIndex.clearRangeValues

equalityLookup()#

equalityLookup(value): Set<TKey>;

Defined in: packages/db/src/indexes/btree-index.ts:271

Performs an equality lookup

Parameters#

value#

any

Returns#

Set<TKey>

Overrides#

BaseIndex.equalityLookup

evaluateIndexExpression()#

protected evaluateIndexExpression(item): any;

Defined in: packages/db/src/indexes/base-index.ts:299

Parameters#

item#

any

Returns#

any

Inherited from#

BaseIndex.evaluateIndexExpression

inArrayLookup()#

inArrayLookup(values): Set<TKey>;

Defined in: packages/db/src/indexes/btree-index.ts:416

Performs an IN array lookup

Parameters#

values#

any[]

Returns#

Set<TKey>

Overrides#

BaseIndex.inArrayLookup

initialize()#

protected initialize(_options?): void;

Defined in: packages/db/src/indexes/btree-index.ts:71

Parameters#

_options?#

BTreeIndexOptions

Returns#

void

Overrides#

BaseIndex.initialize

lookup()#

lookup(operation, value): Set<TKey>;

Defined in: packages/db/src/indexes/btree-index.ts:231

Performs a lookup operation

Parameters#

operation#

"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike"

value#

any

Returns#

Set<TKey>

Overrides#

BaseIndex.lookup

matchesCompareOptions()#

matchesCompareOptions(compareOptions): boolean;

Defined in: packages/db/src/indexes/base-index.ts:253

Checks if the compare options match the index's compare options. The direction is ignored because the index can be reversed if the direction is different.

Parameters#

compareOptions#

CompareOptions

Returns#

boolean

Inherited from#

BaseIndex.matchesCompareOptions

matchesDirection()#

matchesDirection(direction): boolean;

Defined in: packages/db/src/indexes/base-index.ts:293

Checks if the index matches the provided direction.

Parameters#

direction#

OrderByDirection

Returns#

boolean

Inherited from#

BaseIndex.matchesDirection

matchesField()#

matchesField(fieldPath): boolean;

Defined in: packages/db/src/indexes/base-index.ts:241

Parameters#

fieldPath#

string[]

Returns#

boolean

Inherited from#

BaseIndex.matchesField

rangeQuery()#

rangeQuery(options): Set<TKey>;

Defined in: packages/db/src/indexes/btree-index.ts:280

Performs a range query with options This is more efficient for compound queries like "WHERE a > 5 AND a < 10"

Parameters#

options#

BTreeRangeQueryOptions = {}

Returns#

Set<TKey>

Overrides#

BaseIndex.rangeQuery

rangeQueryReversed()#

rangeQueryReversed(options): Set<TKey>;

Defined in: packages/db/src/indexes/base-index.ts:187

Parameters#

options#

BTreeRangeQueryOptions = {}

Returns#

Set<TKey>

Inherited from#

BaseIndex.rangeQueryReversed

remove()#

remove(key, item): void;

Defined in: packages/db/src/indexes/btree-index.ts:124

Removes a value from the index

Parameters#

key#

TKey

item#

any

Returns#

void

Overrides#

BaseIndex.remove

removeRangeValue()#

protected removeRangeValue(value): void;

Defined in: packages/db/src/indexes/base-index.ts:218

Parameters#

value#

unknown

Returns#

void

Inherited from#

BaseIndex.removeRangeValue

supports()#

supports(operation): boolean;

Defined in: packages/db/src/indexes/base-index.ts:201

Parameters#

operation#

"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike"

Returns#

boolean

Inherited from#

BaseIndex.supports

take()#

take(
   n, 
   from, 
   filterFn?): TKey[];

Defined in: packages/db/src/indexes/btree-index.ts:362

Returns the next n items after the provided item.

Parameters#

n#

number

The number of items to return

from#

any

The item to start from (exclusive).

filterFn?#

(key) => boolean

Returns#

TKey[]

The next n items after the provided key.

Overrides#

BaseIndex.take

takeFromStart()#

takeFromStart(n, filterFn?): TKey[];

Defined in: packages/db/src/indexes/btree-index.ts:375

Returns the first n items from the beginning.

Parameters#

n#

number

The number of items to return

filterFn?#

(key) => boolean

Optional filter function

Returns#

TKey[]

The first n items

Overrides#

BaseIndex.takeFromStart

takeReversed()#

takeReversed(
   n, 
   from, 
   filterFn?): TKey[];

Defined in: packages/db/src/indexes/btree-index.ts:387

Returns the next n items before the provided item (in descending order).

Parameters#

n#

number

The number of items to return

from#

any

The item to start from (exclusive). Required.

filterFn?#

(key) => boolean

Returns#

TKey[]

The next n items before the provided key.

Overrides#

BaseIndex.takeReversed

takeReversedFromEnd()#

takeReversedFromEnd(n, filterFn?): TKey[];

Defined in: packages/db/src/indexes/btree-index.ts:404

Returns the last n items from the end.

Parameters#

n#

number

The number of items to return

filterFn?#

(key) => boolean

Optional filter function

Returns#

TKey[]

The last n items

Overrides#

BaseIndex.takeReversedFromEnd

update()#

update(
   key, 
   oldItem, 
   newItem): void;

Defined in: packages/db/src/indexes/btree-index.ts:177

Updates a value in the index

Parameters#

key#

TKey

oldItem#

any

newItem#

any

Returns#

void

Overrides#

BaseIndex.update