LINE Solver (C++)
Templated C++ port of the LINE queueing solver
Loading...
Searching...
No Matches
line::mam::MapM1psResult< T > Struct Template Reference

What the two MAP/M/1-PS sojourn entry points return. More...

#include <line/api/mam/map_m1ps.h>

Collaboration diagram for line::mam::MapM1psResult< T >:

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

Detailed Description

template<class T>
struct line::mam::MapM1psResult< T >

What the two MAP/M/1-PS sojourn entry points return.

Definition at line 300 of file map_m1ps.h.

Member Data Documentation

◆ k_max

template<class T>
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().

◆ n_levels

template<class T>
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().

◆ w_bar

template<class T>
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().

◆ w_bar_n_unweighted

template<class T>
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().


The documentation for this struct was generated from the following file: