Struct ReactiveLimits 

pub struct ReactiveLimits { /* private fields */ }

Enforces q_min/q_max on every PV bus by switching violators to PQ.

Reports Invalidates::Pattern: a bus type change moves n_unknowns, so the Jacobian’s sparsity pattern changes and the cached symbolic factorization cannot be kept. That is the opposite of DistributedSlack, which only moves p_spec.

Implementations

impl ReactiveLimits

pub fn new() -> Self

pub fn report(&self) -> QLimitReport

What it did, readable after the solve.

pub fn switches(&self) -> &[usize]

Buses switched PV → PQ, in switch order.

Trait Implementations

impl Clone for ReactiveLimits

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 ReactiveLimits

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

Formats the value using the given formatter.

impl Default for ReactiveLimits

fn default() -> Self

Returns the “default value” for a type.

impl OuterLoop for ReactiveLimits

fn name(&self) -> &'static str

fn invalidates(&self) -> Invalidates

What this loop invalidates when it reports OuterLoopStatus::Unstable. Read by the driver, which then resets or restamps as required. See the module docs.

fn check(&mut self, ctx: &mut OuterLoopContext<'_, '_>) -> OuterLoopStatus

Look at the converged state and either accept it or change something.

fn initialize(&mut self, _ctx: &mut OuterLoopContext<'_, '_>)

Called once, before the first solve, with the network in its initial state. The place to record starting tap positions or bus types.