Enum OpKey 

pub enum OpKey {
    Module(String),
    Scalar(String, String),
    TupleType(String, String),
    TupleTypeRebuild,
    Table(String, String),
    Function(String, String),
    View(String, String),
    ForeignKey(String, String),
}

Stable identity an emitted step is grouped by. Every DDL statement that answers the same logical question (e.g. every column/FK/trigger change to one table) shares one key and therefore one step.

Variants

Module(String)

Scalar(String, String)

Covers enums, custom scalar domains, and sequence scalars — all three share one object identity (a scalar can only be one of them).

TupleType(String, String)

One tuple’s composite type, by (pg schema, type name) — created or dropped on its own.

TupleTypeRebuild

Every composite type being replaced, as one step.

Unlike a create or a drop, replacing one is not an independent piece of work: each replacement type has to exist before any column moves to it, and every column has to have moved before any of the types they held can be dropped. Keyed without a name because the set is the unit — a type nested in another cannot have its own step ordered against the step of the type holding it.

Table(String, String)

Covers a concrete type’s own table plus everything folded into it: column/FK diffs, junction tables for its multi-/through-links, vector/search index columns, and constraint/deletion/signal/cache triggers — a user thinks of all of these as “altering type X”, not as separate objects.

Function(String, String)

View(String, String)

ForeignKey(String, String)

A table’s foreign keys, deliberately not folded into Table.

Steps render in insertion order and same-key ops merge into the step that already exists, so an FK keyed by its own table would be emitted inside that table’s CREATE TABLE step — before any table created later. That made correctness depend on topo_sort_types finding a perfect order, which it cannot when links form a cycle (a self-referencing optional link is enough). Giving foreign keys their own key puts every one of them after every table, so the order of the table steps stops mattering.

Trait Implementations

impl Clone for OpKey

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OpKey

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

Formats the value using the given formatter.

impl Eq for OpKey

impl Hash for OpKey

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 PartialEq for OpKey

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for OpKey