Enum PrimaryKeyAdditionStrategy 

#[non_exhaustive]
pub enum PrimaryKeyAdditionStrategy {
    DeleteDuplicates {
        keep: KeepPolicy,
    },
}

How AddConstraint(PrimaryKey) should handle pre-existing duplicate rows in the chosen column set.

KeepPolicy is reused from UniqueConstraintStrategy (F2) - “First” / “Last” are defined by the table’s surviving primary-key or row identity ordering. The cleanup SQL is emitted by vespertide-query::sql::add_constraint::primary_key.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

DeleteDuplicates

Emit a DELETE statement ahead of ADD CONSTRAINT PRIMARY KEY so only one row per group of new-PK duplicates survives.

Fields

keep: KeepPolicy

Which row of each duplicate group is preserved.

Trait Implementations

impl Clone for PrimaryKeyAdditionStrategy

fn clone(&self) -> PrimaryKeyAdditionStrategy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PrimaryKeyAdditionStrategy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for PrimaryKeyAdditionStrategy

fn default() -> Self

Default strategy is DeleteDuplicates { keep: First }. Wire- format omitted-field decodes to this value.

Wire-format breaking change vs v0.1.x. v0.1.x emitted no pre-cleanup and let the database reject the migration. v0.2 emits a DELETE automatically. Already-applied migrations are unaffected (apply happens once); v0.1.x migration files re-run against a fresh DB now drop duplicate rows instead of failing.

impl<'de> Deserialize<'de> for PrimaryKeyAdditionStrategy

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for PrimaryKeyAdditionStrategy

impl Hash for PrimaryKeyAdditionStrategy

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl JsonSchema for PrimaryKeyAdditionStrategy

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl Ord for PrimaryKeyAdditionStrategy

fn cmp(&self, other: &PrimaryKeyAdditionStrategy) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for PrimaryKeyAdditionStrategy

fn eq(&self, other: &PrimaryKeyAdditionStrategy) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for PrimaryKeyAdditionStrategy

fn partial_cmp(&self, other: &PrimaryKeyAdditionStrategy) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for PrimaryKeyAdditionStrategy

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for PrimaryKeyAdditionStrategy