Class StructuredQuery.Builder (3.17.0)

A Firestore query.

The query stages are executed in the following order:

1. from
2. where
3. select
4. order_by + start_at + end_at
5. offset
6. limit

Protobuf type google.firestore.v1.StructuredQuery

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

The number of documents to skip before returning the first result.

This applies after the constraints specified by the WHERE, START AT, & END AT but before the LIMIT clause.

Requires:

• The value must be greater than or equal to zero if specified.

int32 offset = 6;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

The number of documents to skip before returning the first result.

This applies after the constraints specified by the WHERE, START AT, & END AT but before the LIMIT clause.

Requires:

• The value must be greater than or equal to zero if specified.

int32 offset = 6;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

A potential prefix of a position in the result set to end the query at.

This is similar to START_AT but with it controlling the end position rather than the start position.

Requires:

• The number of values cannot be greater than the number of fields specified in the ORDER BY clause.

.google.firestore.v1.Cursor end_at = 8;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The collections to query.

repeated .google.firestore.v1.StructuredQuery.CollectionSelector from = 2;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

The maximum number of results to return.

Applies after all other constraints.

Requires:

• The value must be greater than or equal to zero if specified.

.google.protobuf.Int32Value limit = 5;

The number of documents to skip before returning the first result.

This applies after the constraints specified by the WHERE, START AT, & END AT but before the LIMIT clause.

Requires:

• The value must be greater than or equal to zero if specified.

int32 offset = 6;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

The order to apply to the query results.

Firestore allows callers to provide a full ordering, a partial ordering, or no ordering at all. In all cases, Firestore guarantees a stable ordering through the following rules:

• The order_by is required to reference all fields used with an inequality filter.
• All fields that are required to be in the order_by but are not already present are appended in lexicographical ordering of the field name.

• If an order on name is not specified, it is appended by default.

  Fields are appended with the same sort direction as the last order specified, or 'ASCENDING' if no order was specified. For example:

• ORDER BY a becomes ORDER BY a ASC, name ASC

• ORDER BY a DESC becomes ORDER BY a DESC, name DESC
• WHERE a > 1 becomes WHERE a > 1 ORDER BY a ASC, name ASC
• WHERE name > ... AND a > 1 becomes WHERE name > ... AND a > 1 ORDER BY a ASC, name ASC

repeated .google.firestore.v1.StructuredQuery.Order order_by = 4;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

Optional sub-set of the fields to return.

This acts as a DocumentMask over the documents returned from a query. When not set, assumes that the caller wants all fields returned.

.google.firestore.v1.StructuredQuery.Projection select = 1;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

A potential prefix of a position in the result set to start the query at.

The ordering of the result set is based on the ORDER BY clause of the original query.

` SELECT * FROM k WHERE a = 1 AND b > 2 ORDER BY b ASC, name ASC;

This query's results are ordered by (b ASC, name ASC).

Cursors can reference either the full ordering or a prefix of the location, though it cannot reference more fields than what are in the provided ORDER BY.

Continuing off the example above, attaching the following start cursors will have varying impact:

Unlike OFFSET which requires scanning over the first N results to skip, a start cursor allows the query to begin at a logical position. This position is not required to match an actual result, it will scan forward from this position to find the next document.

Requires:

.google.firestore.v1.Cursor start_at = 7;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;

The filter to apply.

.google.firestore.v1.StructuredQuery.Filter where = 3;