-
Notifications
You must be signed in to change notification settings - Fork 666
Expand file tree
/
Copy pathquery.ts
More file actions
1851 lines (1711 loc) · 58.1 KB
/
query.ts
File metadata and controls
1851 lines (1711 loc) · 58.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* Copyright 2024 Google LLC. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
import * as protos from '../../protos/firestore_v1_proto_api';
import api = protos.google.firestore.v1;
import * as firestore from '@google-cloud/firestore';
import {GoogleError} from 'google-gax';
import {Transform} from 'stream';
import {and, field, Ordering} from '../pipelines';
import {CompositeFilter, UnaryFilter} from '../filter';
import {
AggregateField,
DocumentChange,
DocumentSnapshot,
FieldPath,
Filter,
Firestore,
QueryDocumentSnapshot,
Timestamp,
} from '../index';
import {compare} from '../order';
import {validateFieldPath} from '../path';
import {Pipeline} from '../pipelines';
import {
reverseOrderings,
toPipelineBooleanExpr,
whereConditionsFromCursor,
} from '../pipelines/pipeline-util';
import {ExplainResults} from '../query-profile';
import {Serializer} from '../serializer';
import {defaultConverter} from '../types';
import {
invalidArgumentMessage,
validateFunction,
validateInteger,
validateMinNumberOfArguments,
} from '../validate';
import {QueryWatch} from '../watch';
import {AggregateQuery} from './aggregate-query';
import {CompositeFilterInternal} from './composite-filter-internal';
import {comparisonOperators, directionOperators} from './constants';
import {DocumentReference} from './document-reference';
import {FieldFilterInternal} from './field-filter-internal';
import {FieldOrder} from './field-order';
import {FilterInternal} from './filter-internal';
import {
validateQueryOperator,
validateQueryOrder,
validateQueryValue,
} from './helpers';
import {QueryOptions} from './query-options';
import {QuerySnapshot} from './query-snapshot';
import {QueryUtil} from './query-util';
import {
LimitType,
QueryCursor,
QueryResponse,
QuerySnapshotResponse,
QueryStreamElement,
} from './types';
import {VectorQuery} from './vector-query';
import {VectorQueryOptions} from './vector-query-options';
import {SPAN_NAME_QUERY_GET} from '../telemetry/trace-util';
/**
* A Query refers to a query which you can read or stream from. You can also
* construct refined Query objects by adding filters and ordering.
*
* @class Query
*/
export class Query<
AppModelType = firestore.DocumentData,
DbModelType extends firestore.DocumentData = firestore.DocumentData,
> implements firestore.Query<AppModelType, DbModelType>
{
/**
* @internal
* @private
**/
readonly _serializer: Serializer;
/**
* @internal
* @private
**/
protected readonly _allowUndefined: boolean;
/**
* @internal
* @private
**/
readonly _queryUtil: QueryUtil<
AppModelType,
DbModelType,
Query<AppModelType, DbModelType>
>;
/**
* @internal
* @private
*
* @param _firestore The Firestore Database client.
* @param _queryOptions Options that define the query.
*/
constructor(
/**
* @internal
* @private
**/
readonly _firestore: Firestore,
/**
* @internal
* @private
**/
readonly _queryOptions: QueryOptions<AppModelType, DbModelType>,
) {
this._serializer = new Serializer(_firestore);
this._allowUndefined =
!!this._firestore._settings.ignoreUndefinedProperties;
this._queryUtil = new QueryUtil<
AppModelType,
DbModelType,
Query<AppModelType, DbModelType>
>(_firestore, _queryOptions, this._serializer);
}
/**
* Extracts field values from the DocumentSnapshot based on the provided
* field order.
*
* @private
* @internal
* @param documentSnapshot The document to extract the fields from.
* @param fieldOrders The field order that defines what fields we should
* extract.
* @returns {Array.<*>} The field values to use.
*/
static _extractFieldValues(
documentSnapshot: DocumentSnapshot,
fieldOrders: FieldOrder[],
): unknown[] {
const fieldValues: unknown[] = [];
for (const fieldOrder of fieldOrders) {
if (FieldPath.documentId().isEqual(fieldOrder.field)) {
fieldValues.push(documentSnapshot.ref);
} else {
const fieldValue = documentSnapshot.get(fieldOrder.field);
if (fieldValue === undefined) {
throw new Error(
`Field "${fieldOrder.field}" is missing in the provided DocumentSnapshot. ` +
'Please provide a document that contains values for all specified ' +
'orderBy() and where() constraints.',
);
} else {
fieldValues.push(fieldValue);
}
}
}
return fieldValues;
}
/**
* The [Firestore]{@link Firestore} instance for the Firestore
* database (useful for performing transactions, etc.).
*
* @type {Firestore}
* @name Query#firestore
* @readonly
*
* @example
* ```
* let collectionRef = firestore.collection('col');
*
* collectionRef.add({foo: 'bar'}).then(documentReference => {
* let firestore = documentReference.firestore;
* console.log(`Root location for document is ${firestore.formattedName}`);
* });
* ```
*/
get firestore(): Firestore {
return this._firestore;
}
/**
* Creates and returns a new [Query]{@link Query} with the additional filter
* that documents must contain the specified field and that its value should
* satisfy the relation constraint provided.
*
* This function returns a new (immutable) instance of the Query (rather than
* modify the existing instance) to impose the filter.
*
* @param {string|FieldPath} fieldPath The name of a property value to compare.
* @param {string} opStr A comparison operation in the form of a string.
* Acceptable operator strings are "<", "<=", "==", "!=", ">=", ">", "array-contains",
* "in", "not-in", and "array-contains-any".
* @param {*} value The value to which to compare the field for inclusion in
* a query.
* @returns {Query} The created Query.
*
* @example
* ```
* let collectionRef = firestore.collection('col');
*
* collectionRef.where('foo', '==', 'bar').get().then(querySnapshot => {
* querySnapshot.forEach(documentSnapshot => {
* console.log(`Found document at ${documentSnapshot.ref.path}`);
* });
* });
* ```
*/
where(
fieldPath: string | FieldPath,
opStr: firestore.WhereFilterOp,
value: unknown,
): Query<AppModelType, DbModelType>;
/**
* Creates and returns a new [Query]{@link Query} with the additional filter
* that documents should satisfy the relation constraint(s) provided.
*
* This function returns a new (immutable) instance of the Query (rather than
* modify the existing instance) to impose the filter.
*
* @param {Filter} filter A unary or composite filter to apply to the Query.
* @returns {Query} The created Query.
*
* @example
* ```
* let collectionRef = firestore.collection('col');
*
* collectionRef.where(Filter.and(Filter.where('foo', '==', 'bar'), Filter.where('foo', '!=', 'baz'))).get()
* .then(querySnapshot => {
* querySnapshot.forEach(documentSnapshot => {
* console.log(`Found document at ${documentSnapshot.ref.path}`);
* });
* });
* ```
*/
where(filter: Filter): Query<AppModelType, DbModelType>;
where(
fieldPathOrFilter: string | firestore.FieldPath | Filter,
opStr?: firestore.WhereFilterOp,
value?: unknown,
): Query<AppModelType, DbModelType> {
let filter: Filter;
if (fieldPathOrFilter instanceof Filter) {
filter = fieldPathOrFilter;
} else {
filter = Filter.where(fieldPathOrFilter, opStr!, value);
}
if (this._queryOptions.startAt || this._queryOptions.endAt) {
throw new Error(
'Cannot specify a where() filter after calling startAt(), ' +
'startAfter(), endBefore() or endAt().',
);
}
const parsedFilter = this._parseFilter(filter);
if (parsedFilter.getFilters().length === 0) {
// Return the existing query if not adding any more filters (e.g. an empty composite filter).
return this;
}
const options = this._queryOptions.with({
filters: this._queryOptions.filters.concat(parsedFilter),
});
return new Query(this._firestore, options);
}
/**
* @internal
* @private
*/
_parseFilter(filter: Filter): FilterInternal {
if (filter instanceof UnaryFilter) {
return this._parseFieldFilter(filter);
}
return this._parseCompositeFilter(filter as CompositeFilter);
}
/**
* @internal
* @private
*/
_parseFieldFilter(fieldFilterData: UnaryFilter): FieldFilterInternal {
let value = fieldFilterData._getValue();
let operator = fieldFilterData._getOperator();
const fieldPath = fieldFilterData._getField();
validateFieldPath('fieldPath', fieldPath);
operator = validateQueryOperator('opStr', operator, value);
validateQueryValue('value', value, this._allowUndefined);
const path = FieldPath.fromArgument(fieldPath);
if (FieldPath.documentId().isEqual(path)) {
if (operator === 'array-contains' || operator === 'array-contains-any') {
throw new Error(
`Invalid Query. You can't perform '${operator}' ` +
'queries on FieldPath.documentId().',
);
} else if (operator === 'in' || operator === 'not-in') {
if (!Array.isArray(value) || value.length === 0) {
throw new Error(
`Invalid Query. A non-empty array is required for '${operator}' filters.`,
);
}
value = value.map(el => this.validateReference(el));
} else {
value = this.validateReference(value);
}
}
return new FieldFilterInternal(
this._serializer,
path,
comparisonOperators[operator],
value,
);
}
/**
* @internal
* @private
*/
_parseCompositeFilter(compositeFilterData: CompositeFilter): FilterInternal {
const parsedFilters = compositeFilterData
._getFilters()
.map(filter => this._parseFilter(filter))
.filter(parsedFilter => parsedFilter.getFilters().length > 0);
// For composite filters containing 1 filter, return the only filter.
// For example: AND(FieldFilter1) == FieldFilter1
if (parsedFilters.length === 1) {
return parsedFilters[0];
}
return new CompositeFilterInternal(
parsedFilters,
compositeFilterData._getOperator() === 'AND' ? 'AND' : 'OR',
);
}
/**
* Creates and returns a new [Query]{@link Query} instance that applies a
* field mask to the result and returns only the specified subset of fields.
* You can specify a list of field paths to return, or use an empty list to
* only return the references of matching documents.
*
* Queries that contain field masks cannot be listened to via `onSnapshot()`
* listeners.
*
* This function returns a new (immutable) instance of the Query (rather than
* modify the existing instance) to impose the field mask.
*
* @param {...(string|FieldPath)} fieldPaths The field paths to return.
* @returns {Query} The created Query.
*
* @example
* ```
* let collectionRef = firestore.collection('col');
* let documentRef = collectionRef.doc('doc');
*
* return documentRef.set({x:10, y:5}).then(() => {
* return collectionRef.where('x', '>', 5).select('y').get();
* }).then((res) => {
* console.log(`y is ${res.docs[0].get('y')}.`);
* });
* ```
*/
select(...fieldPaths: Array<string | FieldPath>): Query {
const fields: api.StructuredQuery.IFieldReference[] = [];
if (fieldPaths.length === 0) {
fields.push({fieldPath: FieldPath.documentId().formattedName});
} else {
for (let i = 0; i < fieldPaths.length; ++i) {
validateFieldPath(i, fieldPaths[i]);
fields.push({
fieldPath: FieldPath.fromArgument(fieldPaths[i]).formattedName,
});
}
}
// By specifying a field mask, the query result no longer conforms to type
// `T`. We there return `Query<DocumentData>`;
const options = this._queryOptions.with({
projection: {fields},
}) as QueryOptions<firestore.DocumentData, firestore.DocumentData>;
return new Query(this._firestore, options);
}
/**
* Creates and returns a new [Query]{@link Query} that's additionally sorted
* by the specified field, optionally in descending order instead of
* ascending.
*
* This function returns a new (immutable) instance of the Query (rather than
* modify the existing instance) to impose the field mask.
*
* @param {string|FieldPath} fieldPath The field to sort by.
* @param {string=} directionStr Optional direction to sort by ('asc' or
* 'desc'). If not specified, order will be ascending.
* @returns {Query} The created Query.
*
* @example
* ```
* let query = firestore.collection('col').where('foo', '>', 42);
*
* query.orderBy('foo', 'desc').get().then(querySnapshot => {
* querySnapshot.forEach(documentSnapshot => {
* console.log(`Found document at ${documentSnapshot.ref.path}`);
* });
* });
* ```
*/
orderBy(
fieldPath: string | firestore.FieldPath,
directionStr?: firestore.OrderByDirection,
): Query<AppModelType, DbModelType> {
validateFieldPath('fieldPath', fieldPath);
directionStr = validateQueryOrder('directionStr', directionStr);
if (this._queryOptions.startAt || this._queryOptions.endAt) {
throw new Error(
'Cannot specify an orderBy() constraint after calling ' +
'startAt(), startAfter(), endBefore() or endAt().',
);
}
const newOrder = new FieldOrder(
FieldPath.fromArgument(fieldPath),
directionOperators[directionStr || 'asc'],
);
const options = this._queryOptions.with({
fieldOrders: this._queryOptions.fieldOrders.concat(newOrder),
});
return new Query(this._firestore, options);
}
/**
* Creates and returns a new [Query]{@link Query} that only returns the
* first matching documents.
*
* This function returns a new (immutable) instance of the Query (rather than
* modify the existing instance) to impose the limit.
*
* @param {number} limit The maximum number of items to return.
* @returns {Query} The created Query.
*
* @example
* ```
* let query = firestore.collection('col').where('foo', '>', 42);
*
* query.limit(1).get().then(querySnapshot => {
* querySnapshot.forEach(documentSnapshot => {
* console.log(`Found document at ${documentSnapshot.ref.path}`);
* });
* });
* ```
*/
limit(limit: number): Query<AppModelType, DbModelType> {
validateInteger('limit', limit);
const options = this._queryOptions.with({
limit,
limitType: LimitType.First,
});
return new Query(this._firestore, options);
}
/**
* Creates and returns a new [Query]{@link Query} that only returns the
* last matching documents.
*
* You must specify at least one orderBy clause for limitToLast queries,
* otherwise an exception will be thrown during execution.
*
* Results for limitToLast queries cannot be streamed via the `stream()` API.
*
* @param limit The maximum number of items to return.
* @returns The created Query.
*
* @example
* ```
* let query = firestore.collection('col').where('foo', '>', 42);
*
* query.limitToLast(1).get().then(querySnapshot => {
* querySnapshot.forEach(documentSnapshot => {
* console.log(`Last matching document is ${documentSnapshot.ref.path}`);
* });
* });
* ```
*/
limitToLast(limit: number): Query<AppModelType, DbModelType> {
validateInteger('limitToLast', limit);
const options = this._queryOptions.with({limit, limitType: LimitType.Last});
return new Query(this._firestore, options);
}
/**
* Specifies the offset of the returned results.
*
* This function returns a new (immutable) instance of the
* [Query]{@link Query} (rather than modify the existing instance)
* to impose the offset.
*
* @param {number} offset The offset to apply to the Query results
* @returns {Query} The created Query.
*
* @example
* ```
* let query = firestore.collection('col').where('foo', '>', 42);
*
* query.limit(10).offset(20).get().then(querySnapshot => {
* querySnapshot.forEach(documentSnapshot => {
* console.log(`Found document at ${documentSnapshot.ref.path}`);
* });
* });
* ```
*/
offset(offset: number): Query<AppModelType, DbModelType> {
validateInteger('offset', offset);
const options = this._queryOptions.with({offset});
return new Query(this._firestore, options);
}
/**
* Returns a query that counts the documents in the result set of this
* query.
*
* The returned query, when executed, counts the documents in the result set
* of this query without actually downloading the documents.
*
* Using the returned query to count the documents is efficient because only
* the final count, not the documents' data, is downloaded. The returned
* query can count the documents in cases where the result set is
* prohibitively large to download entirely (thousands of documents).
*
* @returns a query that counts the documents in the result set of this
* query. The count can be retrieved from `snapshot.data().count`, where
* `snapshot` is the `AggregateQuerySnapshot` resulting from running the
* returned query.
*/
count(): AggregateQuery<
{count: firestore.AggregateField<number>},
AppModelType,
DbModelType
> {
return this.aggregate({
count: AggregateField.count(),
});
}
/**
* Returns a query that can perform the given aggregations.
*
* The returned query, when executed, calculates the specified aggregations
* over the documents in the result set of this query without actually
* downloading the documents.
*
* Using the returned query to perform aggregations is efficient because only
* the final aggregation values, not the documents' data, is downloaded. The
* returned query can perform aggregations of the documents count the
* documents in cases where the result set is prohibitively large to download
* entirely (thousands of documents).
*
* @param aggregateSpec An `AggregateSpec` object that specifies the aggregates
* to perform over the result set. The AggregateSpec specifies aliases for each
* aggregate, which can be used to retrieve the aggregate result.
* @example
* ```typescript
* const aggregateQuery = col.aggregate(query, {
* countOfDocs: count(),
* totalHours: sum('hours'),
* averageScore: average('score')
* });
*
* const aggregateSnapshot = await aggregateQuery.get();
* const countOfDocs: number = aggregateSnapshot.data().countOfDocs;
* const totalHours: number = aggregateSnapshot.data().totalHours;
* const averageScore: number | null = aggregateSnapshot.data().averageScore;
* ```
*/
aggregate<T extends firestore.AggregateSpec>(
aggregateSpec: T,
): AggregateQuery<T, AppModelType, DbModelType> {
return new AggregateQuery<T, AppModelType, DbModelType>(
this,
aggregateSpec,
);
}
/**
* Returns a query that can perform vector distance (similarity) search with given parameters.
*
* The returned query, when executed, performs a distance (similarity) search on the specified
* `vectorField` against the given `queryVector` and returns the top documents that are closest
* to the `queryVector`.
*
* Only documents whose `vectorField` field is a {@link VectorValue} of the same dimension as `queryVector`
* participate in the query, all other documents are ignored.
*
* @example
* ```
* // Returns the closest 10 documents whose Euclidean distance from their 'embedding' fields are closed to [41, 42].
* const vectorQuery = col.findNearest('embedding', [41, 42], {limit: 10, distanceMeasure: 'EUCLIDEAN'});
*
* const querySnapshot = await vectorQuery.get();
* querySnapshot.forEach(...);
* ```
*
* @param vectorField - A string or {@link FieldPath} specifying the vector field to search on.
* @param queryVector - The {@link VectorValue} used to measure the distance from `vectorField` values in the documents.
* @param options - Options control the vector query. `limit` specifies the upper bound of documents to return, must
* be a positive integer with a maximum value of 1000. `distanceMeasure` specifies what type of distance is calculated
* when performing the query.
*
* @deprecated Use the new {@link Query.(findNearest:VectorQueryOptions)} implementation
* accepting a single `options` param.
*/
findNearest(
vectorField: string | firestore.FieldPath,
queryVector: firestore.VectorValue | Array<number>,
options: {
limit: number;
distanceMeasure: 'EUCLIDEAN' | 'COSINE' | 'DOT_PRODUCT';
},
): VectorQuery<AppModelType, DbModelType>;
/**
* Returns a query that can perform vector distance (similarity) search with given parameters.
*
* The returned query, when executed, performs a distance (similarity) search on the specified
* `vectorField` against the given `queryVector` and returns the top documents that are closest
* to the `queryVector`.
*
* Only documents whose `vectorField` field is a {@link VectorValue} of the same dimension as `queryVector`
* participate in the query, all other documents are ignored.
*
* @example
* ```
* // Returns the closest 10 documents whose Euclidean distance from their 'embedding' fields are closed to [41, 42].
* const vectorQuery = col.findNearest({
* vectorField: 'embedding',
* queryVector: [41, 42],
* limit: 10,
* distanceMeasure: 'EUCLIDEAN',
* distanceResultField: 'distance',
* distanceThreshold: 0.125
* });
*
* const querySnapshot = await aggregateQuery.get();
* querySnapshot.forEach(...);
* ```
* @param options - An argument specifying the behavior of the {@link VectorQuery} returned by this function.
* See {@link VectorQueryOptions}.
*/
findNearest(
options: VectorQueryOptions,
): VectorQuery<AppModelType, DbModelType>;
findNearest(
vectorFieldOrOptions: string | firestore.FieldPath | VectorQueryOptions,
queryVector?: firestore.VectorValue | Array<number>,
options?: {
limit?: number;
distanceMeasure?: 'EUCLIDEAN' | 'COSINE' | 'DOT_PRODUCT';
},
): VectorQuery<AppModelType, DbModelType> {
if (
typeof vectorFieldOrOptions === 'string' ||
vectorFieldOrOptions instanceof FieldPath
) {
const vqOptions: VectorQueryOptions = {
distanceMeasure: options!.distanceMeasure!,
limit: options!.limit!,
queryVector: queryVector!,
vectorField: vectorFieldOrOptions,
};
return this._findNearest(vqOptions);
} else {
return this._findNearest(vectorFieldOrOptions as VectorQueryOptions);
}
}
_findNearest(
options: VectorQueryOptions,
): VectorQuery<AppModelType, DbModelType> {
validateFieldPath('vectorField', options.vectorField);
if (options.limit <= 0) {
throw invalidArgumentMessage('limit', 'positive limit number');
}
if (
(Array.isArray(options.queryVector)
? options.queryVector.length
: options.queryVector.toArray().length) === 0
) {
throw invalidArgumentMessage(
'queryVector',
'vector size must be larger than 0',
);
}
return new VectorQuery<AppModelType, DbModelType>(this, options);
}
/**
* Returns a value indicating if this query is a collection group query
*/
_isCollectionGroupQuery(): boolean {
return this._queryOptions.allDescendants;
}
/**
* @private
* @internal
*/
_pipeline(): Pipeline {
let pipeline: Pipeline;
const db = this.firestore;
if (this._isCollectionGroupQuery()) {
pipeline = db
.pipeline()
.collectionGroup(this._queryOptions.collectionId!);
} else {
pipeline = db
.pipeline()
.collection(
this._queryOptions.parentPath.append(this._queryOptions.collectionId)
.relativeName,
);
}
// filters
for (const filter of this._queryOptions.filters) {
pipeline = pipeline.where(
toPipelineBooleanExpr(filter, this._serializer),
);
}
// projections
const projections = this._queryOptions.projection?.fields || [];
if (projections.length > 0) {
const projectionFields = projections.map(p => field(p.fieldPath!));
pipeline = pipeline.select(
projectionFields[0],
...projectionFields.slice(1),
);
}
// orders
// Ignore inequality fields when creating implicit order-bys
// for generating existsConditions, because existence filters
// will have already been added in the call to `toPipelineBooleanExpr`
const existsConditions = this.createImplicitOrderBy(true).map(
fieldOrder => {
return field(fieldOrder.field).exists();
},
);
if (existsConditions.length > 1) {
const [first, second, ...rest] = existsConditions;
pipeline = pipeline.where(and(first, second, ...rest));
} else {
pipeline = pipeline.where(existsConditions[0]);
}
const orderings = this.createImplicitOrderBy().map(fieldOrder => {
let dir: 'ascending' | 'descending' | undefined = undefined;
switch (fieldOrder.direction) {
case 'ASCENDING': {
dir = 'ascending';
break;
}
case 'DESCENDING': {
dir = 'descending';
break;
}
}
return new Ordering(field(fieldOrder.field), dir || 'ascending');
});
if (orderings.length > 0) {
if (this._queryOptions.limitType === LimitType.Last) {
const actualOrderings = reverseOrderings(orderings);
pipeline = pipeline.sort(
actualOrderings[0],
...actualOrderings.slice(1),
);
// cursors
if (this._queryOptions.startAt !== undefined) {
pipeline = pipeline.where(
whereConditionsFromCursor(
this._queryOptions.startAt,
orderings,
'after',
),
);
}
if (this._queryOptions.endAt !== undefined) {
pipeline = pipeline.where(
whereConditionsFromCursor(
this._queryOptions.endAt,
orderings,
'before',
),
);
}
if (this._queryOptions.limit !== undefined) {
pipeline = pipeline.limit(this._queryOptions.limit!);
}
pipeline = pipeline.sort(orderings[0], ...orderings.slice(1));
} else {
pipeline = pipeline.sort(orderings[0], ...orderings.slice(1));
if (this._queryOptions.startAt !== undefined) {
pipeline = pipeline.where(
whereConditionsFromCursor(
this._queryOptions.startAt,
orderings,
'after',
),
);
}
if (this._queryOptions.endAt !== undefined) {
pipeline = pipeline.where(
whereConditionsFromCursor(
this._queryOptions.endAt,
orderings,
'before',
),
);
}
if (this._queryOptions.limit !== undefined) {
pipeline = pipeline.limit(this._queryOptions.limit);
}
}
}
// offset
if (this._queryOptions.offset) {
pipeline = pipeline.offset(this._queryOptions.offset);
}
return pipeline;
}
/**
* Returns true if this `Query` is equal to the provided value.
*
* @param {*} other The value to compare against.
* @returns {boolean} true if this `Query` is equal to the provided value.
*/
isEqual(other: firestore.Query<AppModelType, DbModelType>): boolean {
if (this === other) {
return true;
}
return (
other instanceof Query && this._queryOptions.isEqual(other._queryOptions)
);
}
/**
* Returns the sorted array of inequality filter fields used in this query.
*
* @returns An array of inequality filter fields sorted lexicographically by FieldPath.
*/
private getInequalityFilterFields(): FieldPath[] {
const inequalityFields: FieldPath[] = [];
for (const filter of this._queryOptions.filters) {
for (const subFilter of filter.getFlattenedFilters()) {
if (subFilter.isInequalityFilter()) {
inequalityFields.push(subFilter.field);
}
}
}
return inequalityFields.sort((a, b) => a.compareTo(b));
}
/**
* Computes the backend ordering semantics for DocumentSnapshot cursors.
*
* @private
* @internal
* @param cursorValuesOrDocumentSnapshot The snapshot of the document or the
* set of field values to use as the boundary.
* @returns The implicit ordering semantics.
*/
private createImplicitOrderByForCursor(
cursorValuesOrDocumentSnapshot: Array<
DocumentSnapshot<AppModelType, DbModelType> | unknown
>,
): FieldOrder[] {
// Add an implicit orderBy if the only cursor value is a DocumentSnapshot.
if (
cursorValuesOrDocumentSnapshot.length !== 1 ||
!(cursorValuesOrDocumentSnapshot[0] instanceof DocumentSnapshot)
) {
return this._queryOptions.fieldOrders;
}
return this.createImplicitOrderBy();
}
private createImplicitOrderBy(ignoreInequalityFields = false): FieldOrder[] {
const fieldOrders = this._queryOptions.fieldOrders.slice();
const fieldsNormalized = new Set([
...fieldOrders.map(item => item.field.toString()),
]);
/** The order of the implicit ordering always matches the last explicit order by. */
const lastDirection =
fieldOrders.length === 0
? directionOperators.ASC
: fieldOrders[fieldOrders.length - 1].direction;
if (!ignoreInequalityFields) {
/**
* Any inequality fields not explicitly ordered should be implicitly ordered in a
* lexicographical order. When there are multiple inequality filters on the same field, the
* field should be added only once.
* Note: getInequalityFilterFields function sorts the key field before
* other fields. However, we want the key field to be sorted last.
*/
const inequalityFields = this.getInequalityFilterFields();
for (const field of inequalityFields) {
if (
!fieldsNormalized.has(field.toString()) &&
!field.isEqual(FieldPath.documentId())
) {
fieldOrders.push(new FieldOrder(field, lastDirection));
fieldsNormalized.add(field.toString());
}
}
}
// Add the document key field to the last if it is not explicitly ordered.
if (!fieldsNormalized.has(FieldPath.documentId().toString())) {
fieldOrders.push(new FieldOrder(FieldPath.documentId(), lastDirection));
}
return fieldOrders;
}
/**
* Builds a Firestore 'Position' proto message.
*
* @private
* @internal
* @param {Array.<FieldOrder>} fieldOrders The field orders to use for this
* cursor.
* @param {Array.<DocumentSnapshot|*>} cursorValuesOrDocumentSnapshot The
* snapshot of the document or the set of field values to use as the boundary.
* @param before Whether the query boundary lies just before or after the
* provided data.
* @returns {Object} The proto message.
*/
private createCursor(
fieldOrders: FieldOrder[],
cursorValuesOrDocumentSnapshot: Array<DocumentSnapshot | unknown>,
before: boolean,
): QueryCursor {
let fieldValues;
if (
cursorValuesOrDocumentSnapshot.length === 1 &&
cursorValuesOrDocumentSnapshot[0] instanceof DocumentSnapshot
) {
fieldValues = Query._extractFieldValues(
cursorValuesOrDocumentSnapshot[0] as DocumentSnapshot,
fieldOrders,