node.h File Reference

A node. More...

#include <stdbool.h>
#include <stddef.h>
#include <tetengo/lattice/entry.h>

Include dependency graph for node.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	tetengo_lattice_node_tag
	A node. More...

Typedefs
typedef struct tetengo_lattice_node_tag	tetengo_lattice_node_t
	A node.

Functions
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_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_equal (const tetengo_lattice_node_t *p_one, const tetengo_lattice_node_t *p_another)
	Returns true if one node is equal to another.
bool	tetengo_lattice_node_isBos (const tetengo_lattice_node_t *p_node)
	Returns true is this node is the BOS.

Detailed Description

A node.

Copyright (C) 2019-2023 kaoru https://www.tetengo.org/

Function Documentation

tetengo_lattice_node_bos()

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).

Parameters

p_preceding_edge_costs	A pointer to preceding edge costs.
preceding_edge_count	A preceding edge count.
p_bos	The storage for an output BOS.

Return values

true	When an BOS is stored.
false	Otherwise.

tetengo_lattice_node_eos()

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).

Parameters

preceding_step	An index of a preceding step.
p_preceding_edge_costs	A pointer to preceding edge costs.
preceding_edge_count	A preceding edge count.
best_preceding_node	An index of a best preceding node.
path_cost	A path cost.
p_eos	The storage for an output EOS.

Return values

true	When an EOS is stored.
false	Otherwise.

tetengo_lattice_node_equal()

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.

Parameters

p_one	A pointer to one node.
p_another	A pointer to another node.

Return values

true	When one node is equal to another.
false	Otherwise.

tetengo_lattice_node_isBos()

bool tetengo_lattice_node_isBos

(

const tetengo_lattice_node_t *

p_node

)

Returns true is this node is the BOS.

Parameters

p_node

A pointer to node.

Return values

true	When this node is the BOS.
false	Otherwise.

tetengo_lattice_node_toNode()

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.

Parameters

p_entry	A pointer to an entry.
index_in_step	An index of the step.
preceding_step	An index of a preceding step.
p_preceding_edge_costs	A pointer to preceding edge costs.
preceding_edge_count	A preceding edge count.
best_preceding_node	An index of a best preceding node.
path_cost	A path cost.
p_node	The storage for an output node.

Return values

true	When a node is stored.
false	Otherwise.