![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
What the two MAP/M/1-PS sojourn entry points return. More...
#include <line/api/mam/map_m1ps.h>
Public Attributes | |
| std::vector< T > | w_bar |
| Pr[W > x] at each requested point. | |
| std::vector< std::vector< T > > | w_bar_n_unweighted |
| The reference's second output, sum_i (sum_k)_i / M, per level n and per point. | |
| std::size_t | n_levels |
| levels actually summed | |
| std::size_t | k_max |
| largest uniformization index used | |
What the two MAP/M/1-PS sojourn entry points return.
Definition at line 300 of file map_m1ps.h.
| std::size_t line::mam::MapM1psResult< T >::k_max |
largest uniformization index used
Definition at line 306 of file map_m1ps.h.
Referenced by line::mam::map_m1ps_cdfrespt(), and line::mam::map_m1ps_sojourn().
| std::size_t line::mam::MapM1psResult< T >::n_levels |
levels actually summed
Definition at line 305 of file map_m1ps.h.
Referenced by line::mam::map_m1ps_cdfrespt(), and line::mam::map_m1ps_sojourn().
| std::vector<T> line::mam::MapM1psResult< T >::w_bar |
Pr[W > x] at each requested point.
Definition at line 301 of file map_m1ps.h.
Referenced by line::mam::map_m1ps_cdfrespt(), line::mam::map_m1ps_sojourn(), and line::mam::solver_mam_passage_time().
| std::vector<std::vector<T> > line::mam::MapM1psResult< T >::w_bar_n_unweighted |
The reference's second output, sum_i (sum_k)_i / M, per level n and per point.
NOT a conditional distribution; see the header note.
Definition at line 304 of file map_m1ps.h.
Referenced by line::mam::map_m1ps_cdfrespt(), and line::mam::map_m1ps_sojourn().