pub struct SpatialRules;Trait Implementations§
Source§impl EngineRules for SpatialRules
impl EngineRules for SpatialRules
Source§fn plan_upsert(&self, p: UpsertParams) -> Result<Vec<SqlPlan>>
fn plan_upsert(&self, p: UpsertParams) -> Result<Vec<SqlPlan>>
Spatial extends columnar and inherits the same upsert semantics:
duplicate PK tombstones the prior row; the new row (or merged form
when on_conflict_updates is non-empty) is appended.
Source§fn plan_insert(&self, p: InsertParams) -> Result<Vec<SqlPlan>>
fn plan_insert(&self, p: InsertParams) -> Result<Vec<SqlPlan>>
Plan an INSERT. Returns
Err if the engine does not support inserts
(e.g. timeseries routes to TimeseriesIngest instead).Source§fn plan_scan(&self, p: ScanParams) -> Result<SqlPlan>
fn plan_scan(&self, p: ScanParams) -> Result<SqlPlan>
Plan a table scan (SELECT without point-get optimization).
Source§fn plan_point_get(&self, p: PointGetParams) -> Result<SqlPlan>
fn plan_point_get(&self, p: PointGetParams) -> Result<SqlPlan>
Plan a point lookup by primary key. Returns
Err for engines
that don’t support O(1) key lookups (e.g. timeseries).Source§fn plan_update(&self, p: UpdateParams) -> Result<Vec<SqlPlan>>
fn plan_update(&self, p: UpdateParams) -> Result<Vec<SqlPlan>>
Plan an UPDATE. Returns
Err for append-only engines.Source§fn plan_update_from(&self, p: UpdateFromParams) -> Result<Vec<SqlPlan>>
fn plan_update_from(&self, p: UpdateFromParams) -> Result<Vec<SqlPlan>>
Plan an
UPDATE target SET ... FROM src WHERE .... Read moreSource§fn plan_delete(&self, p: DeleteParams) -> Result<Vec<SqlPlan>>
fn plan_delete(&self, p: DeleteParams) -> Result<Vec<SqlPlan>>
Plan a DELETE (point or bulk).
Source§fn plan_aggregate(&self, p: AggregateParams) -> Result<SqlPlan>
fn plan_aggregate(&self, p: AggregateParams) -> Result<SqlPlan>
Plan a GROUP BY / aggregate query.
Source§fn plan_merge(&self, p: MergeParams) -> Result<Vec<SqlPlan>>
fn plan_merge(&self, p: MergeParams) -> Result<Vec<SqlPlan>>
Plan a MERGE statement. Read more
Auto Trait Implementations§
impl Freeze for SpatialRules
impl RefUnwindSafe for SpatialRules
impl Send for SpatialRules
impl Sync for SpatialRules
impl Unpin for SpatialRules
impl UnsafeUnpin for SpatialRules
impl UnwindSafe for SpatialRules
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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
Mutably borrows from an owned value. Read more
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>
Converts
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>
Converts
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 moreSource§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.