Defined in: packages/db/src/indexes/reverse-index.ts:6
TKey extends string | number
IndexInterface<TKey>
new ReverseIndex<TKey>(index): ReverseIndex<TKey>;Defined in: packages/db/src/indexes/reverse-index.ts:11
IndexInterface<TKey>
ReverseIndex<TKey>
get indexedKeysSet(): Set<TKey>;Defined in: packages/db/src/indexes/reverse-index.ts:128
Set<TKey>
get keyCount(): number;Defined in: packages/db/src/indexes/reverse-index.ts:116
number
get orderedEntriesArray(): [any, Set<TKey>][];Defined in: packages/db/src/indexes/reverse-index.ts:62
[any, Set<TKey>][]
IndexInterface.orderedEntriesArray
get orderedEntriesArrayReversed(): [any, Set<TKey>][];Defined in: packages/db/src/indexes/reverse-index.ts:66
[any, Set<TKey>][]
IndexInterface.orderedEntriesArrayReversed
get supportsRangeOptimization(): boolean;Defined in: packages/db/src/indexes/reverse-index.ts:76
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.
boolean
IndexInterface.supportsRangeOptimization
get valueMapData(): Map<any, Set<TKey>>;Defined in: packages/db/src/indexes/reverse-index.ts:132
Map<any, Set<TKey>>
add(key, item): void;Defined in: packages/db/src/indexes/reverse-index.ts:96
TKey
any
void
build(entries): void;Defined in: packages/db/src/indexes/reverse-index.ts:108
Iterable<[TKey, any]>
void
clear(): void;Defined in: packages/db/src/indexes/reverse-index.ts:112
void
equalityLookup(value): Set<TKey>;Defined in: packages/db/src/indexes/reverse-index.ts:120
any
Set<TKey>
getStats(): IndexStats;Defined in: packages/db/src/indexes/reverse-index.ts:92
inArrayLookup(values): Set<TKey>;Defined in: packages/db/src/indexes/reverse-index.ts:124
any[]
Set<TKey>
lookup(operation, value): Set<TKey>;Defined in: packages/db/src/indexes/reverse-index.ts:17
"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike"
any
Set<TKey>
matchesCompareOptions(compareOptions): boolean;Defined in: packages/db/src/indexes/reverse-index.ts:84
CompareOptions
boolean
IndexInterface.matchesCompareOptions
matchesDirection(direction): boolean;Defined in: packages/db/src/indexes/reverse-index.ts:88
boolean
IndexInterface.matchesDirection
matchesField(fieldPath): boolean;Defined in: packages/db/src/indexes/reverse-index.ts:80
string[]
boolean
rangeQuery(options): Set<TKey>;Defined in: packages/db/src/indexes/reverse-index.ts:31
Set<TKey>
rangeQueryReversed(options): Set<TKey>;Defined in: packages/db/src/indexes/reverse-index.ts:35
Set<TKey>
IndexInterface.rangeQueryReversed
remove(key, item): void;Defined in: packages/db/src/indexes/reverse-index.ts:100
TKey
any
void
supports(operation): boolean;Defined in: packages/db/src/indexes/reverse-index.ts:72
"eq" | "gt" | "gte" | "lt" | "lte" | "in" | "like" | "ilike"
boolean
take(
n,
from,
filterFn?): TKey[];Defined in: packages/db/src/indexes/reverse-index.ts:39
number
any
(key) => boolean
TKey[]
takeFromStart(n, filterFn?): TKey[];Defined in: packages/db/src/indexes/reverse-index.ts:43
number
(key) => boolean
TKey[]
takeReversed(
n,
from,
filterFn?): TKey[];Defined in: packages/db/src/indexes/reverse-index.ts:47
number
any
(key) => boolean
TKey[]
takeReversedFromEnd(n, filterFn?): TKey[];Defined in: packages/db/src/indexes/reverse-index.ts:55
number
(key) => boolean
TKey[]
IndexInterface.takeReversedFromEnd
update(
key,
oldItem,
newItem): void;Defined in: packages/db/src/indexes/reverse-index.ts:104
TKey
any
any
void