![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
One CTMC state as a state-set predicate sees it, the reference's RewardState: the AGGREGATE row of state_space_aggr(), per-(station, class) job counts in (ist-1)*K + k order. More...
#include <line/solvers/solver.h>
Public Member Functions | |
| StateView (const std::vector< double > &row, const qn::NetworkStruct< double > &sn) | |
| double | total (std::size_t node) const |
| s.at(node).total(): jobs of every class at a station node; a handle converts. | |
| double | at (std::size_t node, std::size_t cls) const |
| s.at(node, cls): jobs of class cls (1-based; a handle converts) at a station node. | |
| const std::vector< double > & | row () const |
| The aggregate row itself. | |
One CTMC state as a state-set predicate sees it, the reference's RewardState: the AGGREGATE row of state_space_aggr(), per-(station, class) job counts in (ist-1)*K + k order.
A Place is a station, so its count is its marking.
|
inline |
| double line::StateView::at | ( | std::size_t | node, |
| std::size_t | cls ) const |
s.at(node, cls): jobs of class cls (1-based; a handle converts) at a station node.
Definition at line 1296 of file solver_facade.cpp.
|
inline |
| double line::StateView::total | ( | std::size_t | node | ) | const |
s.at(node).total(): jobs of every class at a station node; a handle converts.
Definition at line 1300 of file solver_facade.cpp.