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

Return value of pfqn_mvacld, mirroring [XN, QN, UN, CN, pij]. More...

#include <line/api/pfqn/pfqn_mvacld.h>

Public Attributes

std::vector< T > X
 (R) per-class throughput
Matrix< T > Q
 (M x R) per-class queue length
std::vector< T > U
 (M) per-station utilization, 1 - P_j(0)
std::vector< T > C
 (R) per-class cycle time exclusive of think time
Matrix< T > pij
 (M x sumN+1) marginal queue-length probabilities

Detailed Description

template<class T>
struct line::pfqn::MvacldResult< T >

Return value of pfqn_mvacld, mirroring [XN, QN, UN, CN, pij].

Definition at line 69 of file pfqn_mvacld.h.

Member Data Documentation

◆ C

template<class T>
std::vector<T> line::pfqn::MvacldResult< T >::C

(R) per-class cycle time exclusive of think time

Definition at line 73 of file pfqn_mvacld.h.

Referenced by line::pfqn::pfqn_mvacld().

◆ pij

template<class T>
Matrix<T> line::pfqn::MvacldResult< T >::pij

(M x sumN+1) marginal queue-length probabilities

Definition at line 74 of file pfqn_mvacld.h.

Referenced by line::pfqn::pfqn_mvacld().

◆ Q

template<class T>
Matrix<T> line::pfqn::MvacldResult< T >::Q

(M x R) per-class queue length

Definition at line 71 of file pfqn_mvacld.h.

Referenced by line::pfqn::pfqn_mvacld().

◆ U

template<class T>
std::vector<T> line::pfqn::MvacldResult< T >::U

(M) per-station utilization, 1 - P_j(0)

Definition at line 72 of file pfqn_mvacld.h.

Referenced by line::pfqn::pfqn_mvacld().

◆ X

template<class T>
std::vector<T> line::pfqn::MvacldResult< T >::X

(R) per-class throughput

Definition at line 70 of file pfqn_mvacld.h.

Referenced by line::pfqn::pfqn_mvacld().


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