pub struct FindMany<'a, M: 'static, PK: 'static> { /* private fields */ }Implementations§
Source§impl<'a, M: 'static, PK: 'static> FindMany<'a, M, PK>
impl<'a, M: 'static, PK: 'static> FindMany<'a, M, PK>
pub fn where_(self, filter: Filter) -> Self
pub fn where_expr(self, filter: FilterExpr) -> Self
pub fn where_any(self, filters: impl IntoIterator<Item = FilterExpr>) -> Self
Sourcepub fn where_optional<F>(self, filter: Option<F>) -> Selfwhere
F: Into<FilterExpr>,
pub fn where_optional<F>(self, filter: Option<F>) -> Selfwhere
F: Into<FilterExpr>,
Conditionally append a filter. None is a no-op so callers can
pipe FieldRef::match_optional(...) results straight in
without an if let ladder at every optional-param site.
pub fn order_by(self, clause: OrderClause) -> Self
pub fn limit(self, limit: i64) -> Self
pub fn offset(self, offset: i64) -> Self
Sourcepub fn for_update(self) -> Self
pub fn for_update(self) -> Self
Emit SELECT ... FOR UPDATE so the engine takes an exclusive
row-level lock on every matched row for the surrounding
transaction. Only meaningful when paired with Self::run_in_tx.
pub fn preview_sql(&self) -> String
pub fn preview_scoped_sql(&self, ctx: &CratestackContext) -> String
pub async fn run( self, ctx: &CratestackContext, ) -> Result<Vec<M>, CratestackError>
Sourcepub async fn run_in_tx<'tx>(
self,
tx: &mut Transaction<'tx, Postgres>,
ctx: &CratestackContext,
) -> Result<Vec<M>, CratestackError>
pub async fn run_in_tx<'tx>( self, tx: &mut Transaction<'tx, Postgres>, ctx: &CratestackContext, ) -> Result<Vec<M>, CratestackError>
Run inside a caller-supplied transaction. Required when pairing
with Self::for_update.
Sourcepub fn include<Rel, RelPK>(
self,
relation: RelationInclude<M, Rel, RelPK>,
) -> FindManyWith<'a, M, PK, Rel, RelPK>where
Rel: 'static,
RelPK: 'static,
pub fn include<Rel, RelPK>(
self,
relation: RelationInclude<M, Rel, RelPK>,
) -> FindManyWith<'a, M, PK, Rel, RelPK>where
Rel: 'static,
RelPK: 'static,
Side-load a to-one relation alongside the matched rows. Two
queries, not a SQL JOIN, so the related-side read policy +
soft-delete inherit from find_many for free.
Source§impl<'a, M: 'static, PK: 'static> FindMany<'a, M, PK>
impl<'a, M: 'static, PK: 'static> FindMany<'a, M, PK>
Sourcepub fn select<I, C>(self, columns: I) -> ProjectedFindMany<'a, M, PK>where
I: IntoIterator<Item = C>,
C: IntoColumnName,
pub fn select<I, C>(self, columns: I) -> ProjectedFindMany<'a, M, PK>where
I: IntoIterator<Item = C>,
C: IntoColumnName,
Restrict the SELECT to the named columns. See
super::find_unique::FindUnique::select for the caller-side
contract.
Trait Implementations§
Source§impl<'a, M: 'static, PK: 'static> From<FindMany<'a, M, PK>> for AggregateCount<'a, M, PK>
Reuses the exact filters a find_many builder assembled for a
FindMany, discarding order_by/limit/offset/for_update —
meaningless for a scalar COUNT(*). Both FindMany::run and
AggregateCount::run push their WHERE clause through the same
[push_scoped_conditions] with the same descriptor and
[ReadPolicyKind::List], so transferring filters verbatim (rather
than re-deriving them from the caller’s query a second time) is what
guarantees the count can’t apply a different WHERE clause or
policy scope than the page it describes — see cratestack#570, whose
whole risk was exactly that kind of divergence.
impl<'a, M: 'static, PK: 'static> From<FindMany<'a, M, PK>> for AggregateCount<'a, M, PK>
Reuses the exact filters a find_many builder assembled for a
FindMany, discarding order_by/limit/offset/for_update —
meaningless for a scalar COUNT(*). Both FindMany::run and
AggregateCount::run push their WHERE clause through the same
[push_scoped_conditions] with the same descriptor and
[ReadPolicyKind::List], so transferring filters verbatim (rather
than re-deriving them from the caller’s query a second time) is what
guarantees the count can’t apply a different WHERE clause or
policy scope than the page it describes — see cratestack#570, whose
whole risk was exactly that kind of divergence.
Auto Trait Implementations§
impl<'a, M, PK> !RefUnwindSafe for FindMany<'a, M, PK>
impl<'a, M, PK> !UnwindSafe for FindMany<'a, M, PK>
impl<'a, M, PK> Freeze for FindMany<'a, M, PK>where
&'static dyn ReadSource<M, PK>: Freeze,
impl<'a, M, PK> Send for FindMany<'a, M, PK>where
&'static dyn ReadSource<M, PK>: Send,
impl<'a, M, PK> Sync for FindMany<'a, M, PK>where
&'static dyn ReadSource<M, PK>: Sync,
impl<'a, M, PK> Unpin for FindMany<'a, M, PK>where
&'static dyn ReadSource<M, PK>: Unpin,
impl<'a, M, PK> UnsafeUnpin for FindMany<'a, M, PK>where
&'static dyn ReadSource<M, PK>: UnsafeUnpin,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more