line::lqn::LqnRefGroup< T > Struct Template Reference

One group, the reference's R(g): the DAG below one REF task. More...

#include <line/api/lqn/lqn_ref_routes.h>

Collaboration diagram for line::lqn::LqnRefGroup< T >:

Public Attributes
std::size_t	reftask = 0
	task index of the REF task at the root
bool	head_is_caller = false
	the REF task is itself a caller of the layer
std::vector< std::size_t >	members
	callers of the layer on the DAG, descent order
std::vector< std::size_t >	entries
	every DAG entry, topological order, roots first
std::vector< std::size_t >	etask
	lqn.parent of each entry
std::vector< bool >	ismember
	that entry's task is a caller of the layer
std::vector< T >	ventry
	mean invocations of each entry per REF cycle
std::vector< std::vector< std::pair< std::size_t, T > > >	actweight
	per entry, (aidx, executions per invocation of the entry)
std::vector< LqnRefCall< T > >	calls
std::vector< std::size_t >	prefix_pos
	0-based positions forming the prefix, topological order
std::vector< bool >	prefix_term
	that prefix position is a first caller
double	npaths = 0.0
	distinct REF-to-caller routes, counted
double	poolmin = std::numeric_limits<double>::infinity()
	min of lqn.maxmult over the DAG tasks. A DIAGNOSTIC: the chain population is never capped by it.

Detailed Description

template<class T>
struct line::lqn::LqnRefGroup< T >

One group, the reference's R(g): the DAG below one REF task.

Definition at line 58 of file lqn_ref_routes.h.

Member Data Documentation

actweight

template<class T>

std::vector<std::vector<std::pair<std::size_t, T> > > line::lqn::LqnRefGroup< T >::actweight

per entry, (aidx, executions per invocation of the entry)

Definition at line 67 of file lqn_ref_routes.h.

calls

template<class T>

std::vector<LqnRefCall<T> > line::lqn::LqnRefGroup< T >::calls

Definition at line 68 of file lqn_ref_routes.h.

entries

template<class T>

std::vector<std::size_t> line::lqn::LqnRefGroup< T >::entries

every DAG entry, topological order, roots first

Definition at line 62 of file lqn_ref_routes.h.

etask

template<class T>

std::vector<std::size_t> line::lqn::LqnRefGroup< T >::etask

lqn.parent of each entry

Definition at line 63 of file lqn_ref_routes.h.

head_is_caller

template<class T>

bool line::lqn::LqnRefGroup< T >::head_is_caller = false

the REF task is itself a caller of the layer

Definition at line 60 of file lqn_ref_routes.h.

ismember

template<class T>

std::vector<bool> line::lqn::LqnRefGroup< T >::ismember

that entry's task is a caller of the layer

Definition at line 64 of file lqn_ref_routes.h.

members

template<class T>

std::vector<std::size_t> line::lqn::LqnRefGroup< T >::members

callers of the layer on the DAG, descent order

Definition at line 61 of file lqn_ref_routes.h.

npaths

template<class T>

double line::lqn::LqnRefGroup< T >::npaths = 0.0

distinct REF-to-caller routes, counted

Definition at line 71 of file lqn_ref_routes.h.

poolmin

template<class T>

double line::lqn::LqnRefGroup< T >::poolmin = std::numeric_limits<double>::infinity()

min of lqn.maxmult over the DAG tasks. A DIAGNOSTIC: the chain population is never capped by it.

Definition at line 73 of file lqn_ref_routes.h.

prefix_pos

template<class T>

std::vector<std::size_t> line::lqn::LqnRefGroup< T >::prefix_pos

0-based positions forming the prefix, topological order

Definition at line 69 of file lqn_ref_routes.h.

prefix_term

template<class T>

std::vector<bool> line::lqn::LqnRefGroup< T >::prefix_term

that prefix position is a first caller

Definition at line 70 of file lqn_ref_routes.h.

reftask

template<class T>

std::size_t line::lqn::LqnRefGroup< T >::reftask = 0

task index of the REF task at the root

Definition at line 59 of file lqn_ref_routes.h.

ventry

template<class T>

std::vector<T> line::lqn::LqnRefGroup< T >::ventry

mean invocations of each entry per REF cycle

Definition at line 65 of file lqn_ref_routes.h.

---

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

• include/line/api/lqn/lqn_ref_routes.h