Port of SolverBA.getBounds: the {lower,upper} bracket of a family. More...

#include <line/solvers/ba/solver_ba_runner.h>

Collaboration diagram for line::ba::BaBounds< T >:

Public Attributes
Matrix< T >	Qlower
Matrix< T >	Qupper
	(M x K), all-NaN on a side the family lacks
Matrix< T >	Tlower
Matrix< T >	Tupper
bool	has_lower = false
bool	has_upper = false
std::vector< std::vector< bool > >	keep
	getBoundsTable's row filter, (M x K): whether the (station, class) pair earns a row.

Detailed Description

template<class T>
struct line::ba::BaBounds< T >

Port of SolverBA.getBounds: the {lower,upper} bracket of a family.

Definition at line 463 of file solver_ba_runner.h.

Member Data Documentation

◆ has_lower

template<class T>

bool line::ba::BaBounds< T >::has_lower = false

Definition at line 466 of file solver_ba_runner.h.

Referenced by line::ba::ba_bounds().

◆ has_upper

template<class T>

bool line::ba::BaBounds< T >::has_upper = false

Definition at line 466 of file solver_ba_runner.h.

Referenced by line::ba::ba_bounds().

◆ keep

template<class T>

std::vector<std::vector<bool> > line::ba::BaBounds< T >::keep

getBoundsTable's row filter, (M x K): whether the (station, class) pair earns a row.

This is the only part of getBoundsTable that is behaviour rather than formatting, so it is carried here and the label columns are not ported – no solver in cpp/ has a table layer, getAvgTable included, and the CLI formats its own. The rule mirrors getAvgTable's drop of disabled pairs but is NaN-SAFE: a row survives when any value that is present is nonzero, so an all-NaN side (a one-sided family) never removes it.

Definition at line 478 of file solver_ba_runner.h.

Referenced by line::ba::ba_bounds(), and line::SolverBA::bounds_table().