![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
What an optimizing distance fit returns. More...
#include <line/api/mam/map_optim_dist.h>
Public Attributes | |
| Matrix< T > | B1 |
| the fitted D1 | |
| T | d |
| the distance achieved | |
| bool | global = false |
| true only on the convex lag-1 path | |
What an optimizing distance fit returns.
Definition at line 78 of file map_optim_dist.h.
| Matrix<T> line::mam::MapOptimDist< T >::B1 |
the fitted D1
Definition at line 79 of file map_optim_dist.h.
Referenced by line::mam::dmap_optim_dist(), line::mam::dmap_optim_dist_acf(), line::mam::map_optim_dist(), and line::mam::map_optim_dist_acf().
| T line::mam::MapOptimDist< T >::d |
the distance achieved
Definition at line 80 of file map_optim_dist.h.
Referenced by line::mam::dmap_optim_dist(), line::mam::dmap_optim_dist_acf(), line::mam::map_optim_dist(), and line::mam::map_optim_dist_acf().
| bool line::mam::MapOptimDist< T >::global = false |
true only on the convex lag-1 path
Definition at line 81 of file map_optim_dist.h.
Referenced by line::mam::dmap_optim_dist(), line::mam::dmap_optim_dist_acf(), line::mam::map_optim_dist(), and line::mam::map_optim_dist_acf().