pub enum PartitionBound<X: Extension = NoExt> {
List {
values: ThinVec<Expr<X>>,
meta: Meta,
},
Range {
from: ThinVec<Expr<X>>,
to: ThinVec<Expr<X>>,
meta: Meta,
},
Hash {
modulus: Literal,
remainder: Literal,
meta: Meta,
},
Default {
meta: Meta,
},
}Expand description
The partition-bound spec of a PartitionOf child (or an
AttachPartition action): FOR VALUES {IN | FROM…TO | WITH} (…) or DEFAULT (PostgreSQL).
The bound datums are full a_exprs (PostgreSQL parses the minvalue/maxvalue range
sentinels as ordinary column references at raw-parse time, so they need no dedicated node).
The hash bound’s MODULUS m, REMAINDER r are unsigned integer literals validated in the
grammar action — exactly one of each, either order — so they are modelled as a resolved
pair rather than a raw option list (a missing/duplicate/non-integer value is a raw-parse
error PostgreSQL raises, matched at the same layer).
Variants§
List
FOR VALUES IN (<expr>, ...) — a list partition (≥ 1 value).
Fields
Range
FOR VALUES FROM (<expr>, ...) TO (<expr>, ...) — a range partition (each side ≥ 1).
Fields
Hash
FOR VALUES WITH (MODULUS <n>, REMAINDER <n>) — a hash partition.
Fields
Default
DEFAULT — the catch-all partition.
Trait Implementations§
Source§impl<X: Clone + Extension> Clone for PartitionBound<X>
impl<X: Clone + Extension> Clone for PartitionBound<X>
Source§fn clone(&self) -> PartitionBound<X>
fn clone(&self) -> PartitionBound<X>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<'de, X> Deserialize<'de> for PartitionBound<X>where
X: Deserialize<'de> + Extension,
impl<'de, X> Deserialize<'de> for PartitionBound<X>where
X: Deserialize<'de> + Extension,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
impl<X: Eq + Extension> Eq for PartitionBound<X>
Source§impl<X: Extension + Render> Render for PartitionBound<X>
impl<X: Extension + Render> Render for PartitionBound<X>
Source§fn render(&self, ctx: &RenderCtx<'_>, f: &mut Formatter<'_>) -> Result
fn render(&self, ctx: &RenderCtx<'_>, f: &mut Formatter<'_>) -> Result
Source§fn operand_binding_power(&self) -> Option<BindingPower>
fn operand_binding_power(&self) -> Option<BindingPower>
None (the default) for a self-delimiting node — an atom, call, or
constructor — that never needs parentheses. Read moreSource§impl<X> Serialize for PartitionBound<X>
impl<X> Serialize for PartitionBound<X>
Source§impl<X: Extension> Spanned for PartitionBound<X>
impl<X: Extension> Spanned for PartitionBound<X>
impl<X: PartialEq + Extension> StructuralPartialEq for PartitionBound<X>
Auto Trait Implementations§
impl<X> Freeze for PartitionBound<X>
impl<X> RefUnwindSafe for PartitionBound<X>where
X: RefUnwindSafe,
impl<X> Send for PartitionBound<X>where
X: Send,
impl<X> Sync for PartitionBound<X>where
X: Sync,
impl<X> Unpin for PartitionBound<X>where
X: Unpin,
impl<X> UnsafeUnpin for PartitionBound<X>
impl<X> UnwindSafe for PartitionBound<X>where
X: UnwindSafe,
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> DynAstExt for T
impl<T> DynAstExt for T
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&dyn Any for downcasting a node back to its concrete type.Source§fn dyn_clone(&self) -> Box<dyn DynAstExt>
fn dyn_clone(&self) -> Box<dyn DynAstExt>
Clone (whose
Self-returning signature cannot go through a vtable).Source§fn dyn_eq(&self, other: &dyn DynAstExt) -> bool
fn dyn_eq(&self, other: &dyn DynAstExt) -> bool
PartialEq (whose &Self argument cannot go through a vtable). Equal
iff other holds the same concrete type and that type deems the values
equal; differently-typed nodes are never equal.