#include <dag.h>
Public Attributes | |
dagnode_t * | node |
dagnode_t * | src |
struct daglink_s * | next |
struct daglink_s * | history |
struct daglink_s * | bypass |
int32 | ascr |
int32 | lscr |
int32 | pscr |
int32 | hscr |
s3frmid_t | ef |
int16 | pscr_valid |
void * | hook |
int32 daglink_s::ascr |
Acoustic score for segment of source node ending just before the end point of this link. (Actually this gets corrupted because of filler node deletion.)
struct daglink_s* daglink_s::bypass [read] |
If this links A->B, bypassing A->fillnode->B, then bypass is ptr to fillnode->B
End time for this link. Should be 1 before the start time of destination node (or source node for reverse links), but gets corrupted because of filler deletion
struct daglink_s* daglink_s::history [read] |
Previous link along best path (for traceback)
void* daglink_s::hook |
A hook that could allow arbitrary data structure to use daglink_t
int32 daglink_s::hscr |
Heuristic score from end of link to dag exit node
int32 daglink_s::lscr |
LM score to the SUCCESSOR node
struct daglink_s* daglink_s::next [read] |
Next in same dagnode_t.succlist or dagnode_t.predlist
Target of link (source determined by dagnode_t.succlist or dagnode_t.predlist)
int32 daglink_s::pscr |
Best path score to root beginning with this link
int16 daglink_s::pscr_valid |
Flag to avoid evaluating the same path multiple times
Source node of link