tetengo 1.8.1
A multipurpose library set
|
A cap. More...
#include <n_best_iterator.hpp>
Public Member Functions | |
cap (std::vector< node > tail_path, int tail_path_cost, int whole_path_cost) | |
Creates a cap. | |
const std::vector< node > & | tail_path () const |
Returns the tail path. | |
int | tail_path_cost () const |
Returns the tail path cost. | |
int | whole_path_cost () const |
Returns the whole path cost. | |
Friends | |
bool | operator< (const cap &one, const cap &another) |
Returns true if one is less than another. | |
A cap.
tetengo::lattice::cap::cap | ( | std::vector< node > | tail_path, |
int | tail_path_cost, | ||
int | whole_path_cost | ||
) |
Creates a cap.
tail_path | A tail path. |
tail_path_cost | A tail path cost. |
whole_path_cost | A whole path cost. |
const std::vector< node > & tetengo::lattice::cap::tail_path | ( | ) | const |
Returns the tail path.
int tetengo::lattice::cap::tail_path_cost | ( | ) | const |
Returns the tail path cost.
int tetengo::lattice::cap::whole_path_cost | ( | ) | const |
Returns the whole path cost.
Returns true if one is less than another.
one | One cap. |
another | Another cap. |
true | When one is less than another. |
false | Otherwise. |