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

UQ.getInterval: the RANGE of every metric over the support of the Priors. More...

#include <line/solvers/uq/solver_uq.h>

Collaboration diagram for line::uq::UqInterval< T >:

Public Attributes

Matrix< T > Qlo
 (nstations x nclasses) lower and upper endpoints of each metric.
Matrix< T > Qup
Matrix< T > Ulo
Matrix< T > Uup
Matrix< T > Rlo
Matrix< T > Rup
Matrix< T > Tlo
Matrix< T > Tup
Matrix< T > Wlo
Matrix< T > Wup
Xlo = num_traits<T>::from_int(0)
 System throughput and total response time; the EXACT path only.
Xup = num_traits<T>::from_int(0)
Rtot_lo = num_traits<T>::from_int(0)
Rtot_up = num_traits<T>::from_int(0)
bool has_totals = false
bool exact = false
 True when the interval is the attained hull rather than a sampled range.
std::string method
 mvainterval or sampled.
std::string why
 On the sampled path, the condition that disqualified the exact one.

Detailed Description

template<class T>
struct line::uq::UqInterval< T >

UQ.getInterval: the RANGE of every metric over the support of the Priors.

A different epistemic question from the expectation above, and the one to ask when a parameter can be BOUNDED but not distributed: the weights are dropped and only the endpoints are kept. exact says which of the two regimes produced it, and the distinction is not a quality label but a change of meaning – see uq_interval.

THE INTERVAL IS CONDITIONAL on the true parameters lying inside the Prior supports. It is not a bound on the exact solution of the network, and it must not be composed with the brackets of SolverBA, which bracket the exact solution of a model whose parameters are known.

Definition at line 726 of file solver_uq.h.

Member Data Documentation

◆ exact

template<class T>
bool line::uq::UqInterval< T >::exact = false

True when the interval is the attained hull rather than a sampled range.

Definition at line 734 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ has_totals

template<class T>
bool line::uq::UqInterval< T >::has_totals = false

Definition at line 732 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva().

◆ method

template<class T>
std::string line::uq::UqInterval< T >::method

mvainterval or sampled.

Definition at line 736 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Qlo

template<class T>
Matrix<T> line::uq::UqInterval< T >::Qlo

(nstations x nclasses) lower and upper endpoints of each metric.

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Qup

template<class T>
Matrix<T> line::uq::UqInterval< T >::Qup

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Rlo

template<class T>
Matrix<T> line::uq::UqInterval< T >::Rlo

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Rtot_lo

template<class T>
T line::uq::UqInterval< T >::Rtot_lo = num_traits<T>::from_int(0)

Definition at line 731 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva().

◆ Rtot_up

template<class T>
T line::uq::UqInterval< T >::Rtot_up = num_traits<T>::from_int(0)

Definition at line 731 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva().

◆ Rup

template<class T>
Matrix<T> line::uq::UqInterval< T >::Rup

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Tlo

template<class T>
Matrix<T> line::uq::UqInterval< T >::Tlo

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Tup

template<class T>
Matrix<T> line::uq::UqInterval< T >::Tup

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Ulo

template<class T>
Matrix<T> line::uq::UqInterval< T >::Ulo

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Uup

template<class T>
Matrix<T> line::uq::UqInterval< T >::Uup

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ why

template<class T>
std::string line::uq::UqInterval< T >::why

On the sampled path, the condition that disqualified the exact one.

Definition at line 738 of file solver_uq.h.

Referenced by line::uq::uq_interval(), and line::uq::uq_interval_run().

◆ Wlo

template<class T>
Matrix<T> line::uq::UqInterval< T >::Wlo

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Wup

template<class T>
Matrix<T> line::uq::UqInterval< T >::Wup

Definition at line 728 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva(), and line::uq::uq_interval_by_sampling().

◆ Xlo

template<class T>
T line::uq::UqInterval< T >::Xlo = num_traits<T>::from_int(0)

System throughput and total response time; the EXACT path only.

Definition at line 730 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva().

◆ Xup

template<class T>
T line::uq::UqInterval< T >::Xup = num_traits<T>::from_int(0)

Definition at line 730 of file solver_uq.h.

Referenced by line::uq::uq_interval_by_mva().


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