lexicographic-weight.h More...
#include <string>#include <fst/pair-weight.h>#include <fst/weight.h>

Go to the source code of this file.
Classes | |
| class | fst::LexicographicWeight< W1, W2 > |
Namespaces | |
| namespace | fst |
For optional argument declarations. | |
Functions | |
| template<class W1 , class W2 > | |
| LexicographicWeight< W1, W2 > | fst::Plus (const LexicographicWeight< W1, W2 > &w, const LexicographicWeight< W1, W2 > &v) |
| template<class W1 , class W2 > | |
| LexicographicWeight< W1, W2 > | fst::Times (const LexicographicWeight< W1, W2 > &w, const LexicographicWeight< W1, W2 > &v) |
| template<class W1 , class W2 > | |
| LexicographicWeight< W1, W2 > | fst::Divide (const LexicographicWeight< W1, W2 > &w, const LexicographicWeight< W1, W2 > &v, DivideType typ=DIVIDE_ANY) |
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2005-2010 Google, Inc. Author: rws@google.com (Richard Sproat)
Lexicographic weight set and associated semiring operation definitions.
A lexicographic weight is a sequence of weights, each of which must have the path property and Times() must be (strongly) cancellative (for all a,b,c != Zero(): Times(c, a) = Times(c, b) => a = b, Times(a, c) = Times(b, c) => a = b). The + operation on two weights a and b is the lexicographically prior of a and b.
Definition in file lexicographic-weight.h.
1.7.1