7#if !defined(TETENGO_LATTICE_NODE_H)
8#define TETENGO_LATTICE_NODE_H
16#if defined(__cplusplus)
67 const int* p_preceding_edge_costs,
68 size_t preceding_edge_count,
85 size_t preceding_step,
86 const int* p_preceding_edge_costs,
87 size_t preceding_edge_count,
88 size_t best_preceding_node,
109 size_t index_in_step,
110 size_t preceding_step,
111 const int* p_preceding_edge_costs,
112 size_t preceding_edge_count,
113 size_t best_preceding_node,
139#if defined(__cplusplus)
const struct tetengo_lattice_entryView_valueHandle_tag * tetengo_lattice_entryView_valueHandle_t
An entry view value handle.
Definition entry.h:33
const struct tetengo_lattice_entryView_keyHandle_tag * tetengo_lattice_entryView_keyHandle_t
An entry view key handle.
Definition entry.h:28
struct tetengo_lattice_node_tag tetengo_lattice_node_t
A node.
bool tetengo_lattice_node_isBos(const tetengo_lattice_node_t *p_node)
Returns true is this node is the BOS.
bool tetengo_lattice_node_eos(size_t preceding_step, const int *p_preceding_edge_costs, size_t preceding_edge_count, size_t best_preceding_node, int path_cost, tetengo_lattice_node_t *p_eos)
Returns an EOS (End of Sequence).
bool tetengo_lattice_node_toNode(const tetengo_lattice_entryView_t *p_entry, size_t index_in_step, size_t preceding_step, const int *p_preceding_edge_costs, size_t preceding_edge_count, size_t best_preceding_node, int path_cost, tetengo_lattice_node_t *p_node)
Makes a node from an entry.
bool tetengo_lattice_node_bos(const int *p_preceding_edge_costs, size_t preceding_edge_count, tetengo_lattice_node_t *p_bos)
Returns the pointer to the BOS (Beginning of Sequence).
bool tetengo_lattice_node_equal(const tetengo_lattice_node_t *p_one, const tetengo_lattice_node_t *p_another)
Returns true if one node is equal to another.
An entry view.
Definition entry.h:57
A node.
Definition node.h:25
tetengo_lattice_entryView_valueHandle_t value_handle
Definition node.h:30
size_t preceding_step
Definition node.h:36
size_t best_preceding_node
Definition node.h:45
tetengo_lattice_entryView_keyHandle_t key_handle
Definition node.h:27
int node_cost
Definition node.h:48
size_t index_in_step
Definition node.h:33
size_t preceding_edge_cost_count
Definition node.h:42
int path_cost
Definition node.h:51
const int * p_preceding_edge_costs
Definition node.h:39