pub struct ColumnarRules;Trait Implementations§
Source§impl EngineRules for ColumnarRules
impl EngineRules for ColumnarRules
Source§fn plan_insert_select(&self, p: InsertSelectParams) -> Result<Vec<SqlPlan>>
fn plan_insert_select(&self, p: InsertSelectParams) -> Result<Vec<SqlPlan>>
UPSERT / INSERT ... ON CONFLICT (pk) DO UPDATE on columnar.
Duplicate PK tombstones the prior row via the segment’s delete
bitmap; the new row (or its merged form, when on_conflict_updates
is non-empty) is appended. Sort-key semantics are unchanged.
Source§fn plan_update_from(&self, p: UpdateFromParams) -> Result<Vec<SqlPlan>>
fn plan_update_from(&self, p: UpdateFromParams) -> Result<Vec<SqlPlan>>
UPDATE ... FROM writes through the document join-update, which
columnar storage does not take.
Source§fn accepts_undeclared_columns(&self) -> bool
fn accepts_undeclared_columns(&self) -> bool
Every column is declared at creation and encoded per column.
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_upsert(&self, p: UpsertParams) -> Result<Vec<SqlPlan>>
fn plan_upsert(&self, p: UpsertParams) -> Result<Vec<SqlPlan>>
Plan an UPSERT (insert-or-merge). Returns
Err for append-only or
columnar engines that don’t support merge semantics.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_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_truncate(&self, p: TruncateParams) -> Result<Vec<SqlPlan>>
fn plan_truncate(&self, p: TruncateParams) -> Result<Vec<SqlPlan>>
Plan a TRUNCATE. Returns
Err(SqlError::Unsupported) for engines
that carry no whole-collection clear on the SQL surface (array).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
Source§fn implicit_columns(&self) -> &'static [&'static str]
fn implicit_columns(&self) -> &'static [&'static str]
Columns every collection on this engine carries whether or not the
DDL declares them. A reference to one resolves like a declared column.
Source§fn value_column_name_is_free(&self) -> bool
fn value_column_name_is_free(&self) -> bool
True when the engine stores one value whose column name the statement
picks. Such a collection resolves any name while it declares no value
column, and closes to the declared set once it names one.
Auto Trait Implementations§
impl Freeze for ColumnarRules
impl RefUnwindSafe for ColumnarRules
impl Send for ColumnarRules
impl Sync for ColumnarRules
impl Unpin for ColumnarRules
impl UnsafeUnpin for ColumnarRules
impl UnwindSafe for ColumnarRules
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
impl<T> ErasedDestructor for Twhere
T: 'static,
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<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.