Enum GateRed 

pub enum GateRed {
    SwapWo,
    SwapEpGateUp,
    SkipPeerCombine,
    CorruptEpMap,
}

Gate-harness RED-arm knob, never a serving flag (MEMRA_GLM5_TP_GATE_RED):

• swap-wo — each rank’s column wo slice takes the NEXT rank’s out rows (a broken shard map); the gate run MUST diverge from plain.
• swap-ep-gateup — the root EP slab’s gate and up projections swap (wrong expert weights); MUST diverge.
• skip-peer-combine — the EP combine drops every peer-owned slot; MUST diverge, which is also the non-vacuity proof that the peer ranks contribute real work.
• corrupt-ep-map — the placement’s local-slot table for rank 0 is reversed after the slabs are built (owner table and slab bytes disagree — a corrupted map row); MUST diverge. This is the red that proves the MEASURED-placement indirection is load-bearing, not decorative.

Unknown values refuse at load.

Variants

SwapWo

SwapEpGateUp

SkipPeerCombine

CorruptEpMap

Trait Implementations

impl Clone for GateRed

fn clone(&self) -> GateRed

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GateRed

impl Debug for GateRed

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

Formats the value using the given formatter.

impl Eq for GateRed

impl PartialEq for GateRed

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GateRed