Struct Delete 

pub struct Delete<D, T>
where
    T: Table,
{ /* private fields */ }

Implementations

impl<D, T> Delete<D, T>

where T: Table,

pub fn correlated<S, InnerSel>( &self, source: S, selection: InnerSel, ) -> Select<D, Cons<TableSlot<<S as JoinSource<D>>::Table, NotNull>, Cons<TableSlot<T, NotNull>, Nil>>, InnerSel, Cons<TableSlot<T, NotNull>, Nil>>

where S: JoinSource<D>,

A correlated subquery over the table this statement writes — the same EXISTS a SELECT builds with Select::correlated, against the one-table scope a write statement has.

pub fn filter<C, Idxs>(self, cond: C) -> Delete<D, T>

where C: Condition<D, Cons<TableSlot<T, NotNull>, Nil>, Idxs>,

pub fn filter_all( self, conds: impl IntoIterator<Item = Predicate<D, Cons<TableSlot<T, NotNull>, Nil>>>, ) -> Delete<D, T>

AND-folds a runtime-length collection of discharged conditions, the same way Select::filter_all does.

Trait Implementations

impl<D, T> Statement for Delete<D, T>

where D: Dialect, T: Table,

type Dialect = D

type Table = T

fn to_sql(&self, _dialect: Self::Dialect) -> (String, Vec<Value>)

The dialect is an argument for the reason Select::to_sql’s is.

fn returning<Sel, Idx>(self, sel: Sel) -> Returning<Self, Sel>

where Self: Sized, Self::Dialect: SupportsReturning, Sel: Selection<Cons<TableSlot<Self::Table, NotNull>, Nil>, Idx>,

RETURNING, on whichever of the three this is — the clause is the same clause. A distinct type rather than Self with a flag set: the execution layer needs Sel’s concrete type to know what to decode a returned row into, and an optional field would erase it.