#include <fst/weight.h>
Public Types | |
| typedef W | Weight |
Public Member Functions | |
| NaturalLess () | |
| bool | operator() (const W &w1, const W &w2) const |
NATURAL ORDER
By definition: a <= b iff a + b = a The natural order is a monotonic and negative partial order iff the semiring is idempotent and (left and right) distributive. It is a total order iff the semiring has the path property. See Mohri, "Semiring Framework and Algorithms for Shortest-Distance Problems", Journal of Automata, Languages and Combinatorics 7(3):321-350, 2002. We define the strict version of this order below.
Definition at line 125 of file weight.h.
| typedef W fst::NaturalLess< W >::Weight |
| fst::NaturalLess< W >::NaturalLess | ( | ) | [inline] |
| bool fst::NaturalLess< W >::operator() | ( | const W & | w1, | |
| const W & | w2 | |||
| ) | const [inline] |
1.7.1