A cap.
More...
#include <n_best_iterator.hpp>
|
bool | operator< (const cap &one, const cap &another) |
| Returns true if one is less than another.
|
|
◆ cap()
tetengo::lattice::cap::cap |
( |
std::vector< node > | tail_path, |
|
|
int | tail_path_cost, |
|
|
int | whole_path_cost ) |
Creates a cap.
- Parameters
-
tail_path | A tail path. |
tail_path_cost | A tail path cost. |
whole_path_cost | A whole path cost. |
◆ tail_path()
const std::vector< node > & tetengo::lattice::cap::tail_path |
( |
| ) |
const |
|
nodiscard |
Returns the tail path.
- Returns
- The tail path.
◆ tail_path_cost()
int tetengo::lattice::cap::tail_path_cost |
( |
| ) |
const |
|
nodiscard |
Returns the tail path cost.
- Returns
- The tail path cost.
◆ whole_path_cost()
int tetengo::lattice::cap::whole_path_cost |
( |
| ) |
const |
|
nodiscard |
Returns the whole path cost.
- Returns
- The whole path cost.
◆ operator<
bool operator< |
( |
const cap & | one, |
|
|
const cap & | another ) |
|
friend |
Returns true if one is less than another.
- Parameters
-
one | One cap. |
another | Another cap. |
- Return values
-
true | When one is less than another. |
false | Otherwise. |
The documentation for this class was generated from the following file: