Defined in: packages/db/src/indexes/btree-index.ts:30
B+Tree index for sorted data with range queries This maintains items in sorted order and provides efficient range operations
TKey extends string | number = string | number
new BTreeIndex<TKey>(
id,
expression,
name?,
options?): BTreeIndex<TKey>;
new BTreeIndex<TKey>(
id,
expression,
name?,
options?): BTreeIndex<TKey>;
Defined in: packages/db/src/indexes/btree-index.ts:50
number
string
any
BTreeIndex<TKey>
protected compareOptions: CompareOptions;
protected compareOptions: CompareOptions;
Defined in: packages/db/src/indexes/base-index.ts:87
readonly expression: BasicExpression;
readonly expression: BasicExpression;
Defined in: packages/db/src/indexes/base-index.ts:81
readonly id: number;
readonly id: number;
Defined in: packages/db/src/indexes/base-index.ts:79
protected lastUpdated: Date;
protected lastUpdated: Date;
Defined in: packages/db/src/indexes/base-index.ts:86
protected lookupCount: number = 0;
protected lookupCount: number = 0;
Defined in: packages/db/src/indexes/base-index.ts:84
readonly optional name: string;
readonly optional name: string;
Defined in: packages/db/src/indexes/base-index.ts:80
readonly supportedOperations: Set<"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike">;
readonly supportedOperations: Set<"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike">;
Defined in: packages/db/src/indexes/btree-index.ts:33
protected totalLookupTime: number = 0;
protected totalLookupTime: number = 0;
Defined in: packages/db/src/indexes/base-index.ts:85
get indexedKeysSet(): Set<TKey>;
get indexedKeysSet(): Set<TKey>;
Defined in: packages/db/src/indexes/btree-index.ts:333
Set<TKey>
get keyCount(): number;
get keyCount(): number;
Defined in: packages/db/src/indexes/btree-index.ts:199
Gets the number of indexed keys
number
get orderedEntriesArray(): [any, Set<TKey>][];
get orderedEntriesArray(): [any, Set<TKey>][];
Defined in: packages/db/src/indexes/btree-index.ts:337
[any, Set<TKey>][]
get orderedEntriesArrayReversed(): [any, Set<TKey>][];
get orderedEntriesArrayReversed(): [any, Set<TKey>][];
Defined in: packages/db/src/indexes/btree-index.ts:343
[any, Set<TKey>][]
BaseIndex.orderedEntriesArrayReversed
get valueMapData(): Map<any, Set<TKey>>;
get valueMapData(): Map<any, Set<TKey>>;
Defined in: packages/db/src/indexes/btree-index.ts:350
Map<any, Set<TKey>>
add(key, item): void;
add(key, item): void;
Defined in: packages/db/src/indexes/btree-index.ts:69
Adds a value to the index
TKey
any
void
build(entries): void;
build(entries): void;
Defined in: packages/db/src/indexes/btree-index.ts:143
Builds the index from a collection of entries
Iterable<[TKey, any]>
void
clear(): void;
clear(): void;
Defined in: packages/db/src/indexes/btree-index.ts:154
Clears all data from the index
void
equalityLookup(value): Set<TKey>;
equalityLookup(value): Set<TKey>;
Defined in: packages/db/src/indexes/btree-index.ts:208
Performs an equality lookup
any
Set<TKey>
protected evaluateIndexExpression(item): any;
protected evaluateIndexExpression(item): any;
Defined in: packages/db/src/indexes/base-index.ts:182
any
any
BaseIndex.evaluateIndexExpression
getStats(): IndexStats;
getStats(): IndexStats;
Defined in: packages/db/src/indexes/base-index.ts:169
inArrayLookup(values): Set<TKey>;
inArrayLookup(values): Set<TKey>;
Defined in: packages/db/src/indexes/btree-index.ts:318
Performs an IN array lookup
any[]
Set<TKey>
protected initialize(_options?): void;
protected initialize(_options?): void;
Defined in: packages/db/src/indexes/btree-index.ts:64
void
lookup(operation, value): Set<TKey>;
lookup(operation, value): Set<TKey>;
Defined in: packages/db/src/indexes/btree-index.ts:164
Performs a lookup operation
"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike"
any
Set<TKey>
matchesCompareOptions(compareOptions): boolean;
matchesCompareOptions(compareOptions): boolean;
Defined in: packages/db/src/indexes/base-index.ts:146
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.
CompareOptions
boolean
BaseIndex.matchesCompareOptions
matchesDirection(direction): boolean;
matchesDirection(direction): boolean;
Defined in: packages/db/src/indexes/base-index.ts:165
Checks if the index matches the provided direction.
boolean
matchesField(fieldPath): boolean;
matchesField(fieldPath): boolean;
Defined in: packages/db/src/indexes/base-index.ts:134
string[]
boolean
rangeQuery(options): Set<TKey>;
rangeQuery(options): Set<TKey>;
Defined in: packages/db/src/indexes/btree-index.ts:217
Performs a range query with options This is more efficient for compound queries like "WHERE a > 5 AND a < 10"
RangeQueryOptions = {}
Set<TKey>
rangeQueryReversed(options): Set<TKey>;
rangeQueryReversed(options): Set<TKey>;
Defined in: packages/db/src/indexes/btree-index.ts:250
Performs a reversed range query
RangeQueryOptions = {}
Set<TKey>
remove(key, item): void;
remove(key, item): void;
Defined in: packages/db/src/indexes/btree-index.ts:100
Removes a value from the index
TKey
any
void
supports(operation): boolean;
supports(operation): boolean;
Defined in: packages/db/src/indexes/base-index.ts:130
"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike"
boolean
take(
n,
from?,
filterFn?): TKey[];
take(
n,
from?,
filterFn?): TKey[];
Defined in: packages/db/src/indexes/btree-index.ts:295
Returns the next n items after the provided item or the first n items if no from item is provided.
number
The number of items to return
any
The item to start from (exclusive). Starts from the smallest item (inclusive) if not provided.
(key) => boolean
TKey[]
The next n items after the provided key. Returns the first n items if no from item is provided.
takeReversed(
n,
from?,
filterFn?): TKey[];
takeReversed(
n,
from?,
filterFn?): TKey[];
Defined in: packages/db/src/indexes/btree-index.ts:306
Returns the next n items before the provided item (in descending order) or the last n items if no from item is provided.
number
The number of items to return
any
The item to start from (exclusive). Starts from the largest item (inclusive) if not provided.
(key) => boolean
TKey[]
The next n items before the provided key. Returns the last n items if no from item is provided.
protected trackLookup(startTime): void;
protected trackLookup(startTime): void;
Defined in: packages/db/src/indexes/base-index.ts:187
number
void
update(
key,
oldItem,
newItem): void;
update(
key,
oldItem,
newItem): void;
Defined in: packages/db/src/indexes/btree-index.ts:135
Updates a value in the index
TKey
any
any
void
protected updateTimestamp(): void;
protected updateTimestamp(): void;
Defined in: packages/db/src/indexes/base-index.ts:193
void
Your weekly dose of JavaScript news. Delivered every Monday to over 100,000 devs, for free.
Your weekly dose of JavaScript news. Delivered every Monday to over 100,000 devs, for free.
