FST  openfst-1.8.3
OpenFst Library
fstlib.h
Go to the documentation of this file.
1 // Copyright 2005-2024 Google LLC
2 //
3 // Licensed under the Apache License, Version 2.0 (the 'License');
4 // you may not use this file except in compliance with the License.
5 // You may obtain a copy of the License at
6 //
7 // http://www.apache.org/licenses/LICENSE-2.0
8 //
9 // Unless required by applicable law or agreed to in writing, software
10 // distributed under the License is distributed on an 'AS IS' BASIS,
11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 // See the License for the specific language governing permissions and
13 // limitations under the License.
14 //
15 // See www.openfst.org for extensive documentation on this weighted
16 // finite-state transducer library.
17 //
18 // This is a library for constructing, combining, optimizing, and searching
19 // "weighted finite-state transducers" (FSTs). Weighted finite-state transducers
20 // are automata where each transition has an input label, an output label, and a
21 // weight. The more familiar finite-state acceptor is represented as a
22 // transducer with each transition's input and output the same. Finite-state
23 // acceptors are used to represent sets of strings (specifically, "regular" or
24 // "rational sets"); finite-state transducers are used to represent binary
25 // relations between pairs of strings (specifically, "rational transductions").
26 // The weights can be used to represent the cost of taking a particular
27 // transition.
28 //
29 // In this library, transducers are templated on the Arc (transition)
30 // definition, which allows changing the label, weight, and state ID sets.
31 // Labels and state IDs are restricted to signed integral types but the weight
32 // can be an arbitrary type whose members satisfy certain algebraic ("semiring")
33 // properties.
34 //
35 // This convenience file includes all other FST header files.
36 
37 #ifndef FST_FSTLIB_H_
38 #define FST_FSTLIB_H_
39 
40 // Do not let Include-What-You-Use suggest this file.
41 
42 #include <fst/accumulator.h>
43 #include <fst/add-on.h>
44 #include <fst/arc-map.h>
45 #include <fst/arc.h>
46 #include <fst/arcfilter.h>
47 #include <fst/arcsort.h>
48 #include <fst/cache.h>
49 #include <fst/cc-visitors.h>
50 #include <fst/closure.h>
51 #include <fst/compact-fst.h>
52 #include <fst/complement.h>
53 #include <fst/compose-filter.h>
54 #include <fst/compose.h>
55 #include <fst/concat.h>
56 #include <fst/connect.h>
57 #include <fst/const-fst.h>
58 #include <fst/determinize.h>
59 #include <fst/dfs-visit.h>
60 #include <fst/difference.h>
61 #include <fst/disambiguate.h>
62 #include <fst/edit-fst.h>
63 #include <fst/encode.h>
64 #include <fst/epsnormalize.h>
65 #include <fst/equal.h>
66 #include <fst/equivalent.h>
67 #include <fst/expanded-fst.h>
68 #include <fst/expectation-weight.h>
69 #include <fst/factor-weight.h>
70 #include <fst/float-weight.h>
71 #include <fst/fst.h>
72 #include <fst/generic-register.h>
73 #include <fst/heap.h>
74 #include <fst/impl-to-fst.h>
75 #include <fst/intersect.h>
76 #include <fst/interval-set.h>
77 #include <fst/invert.h>
78 #include <fst/isomorphic.h>
79 #include <fst/label-reachable.h>
81 #include <fst/lookahead-filter.h>
82 #include <fst/lookahead-matcher.h>
83 #include <fst/matcher-fst.h>
84 #include <fst/matcher.h>
85 #include <fst/minimize.h>
86 #include <fst/mutable-fst.h>
87 #include <fst/pair-weight.h>
88 #include <fst/partition.h>
89 #include <fst/power-weight.h>
90 #include <fst/product-weight.h>
91 #include <fst/project.h>
92 #include <fst/properties.h>
93 #include <fst/prune.h>
94 #include <fst/push.h>
95 #include <fst/queue.h>
96 #include <fst/randequivalent.h>
97 #include <fst/randgen.h>
98 #include <fst/rational.h>
99 #include <fst/register.h>
100 #include <fst/relabel.h>
101 #include <fst/replace-util.h>
102 #include <fst/replace.h>
103 #include <fst/reverse.h>
104 #include <fst/reweight.h>
105 #include <fst/rmepsilon.h>
106 #include <fst/rmfinalepsilon.h>
107 #include <fst/shortest-distance.h>
108 #include <fst/shortest-path.h>
109 #include <fst/signed-log-weight.h>
110 #include <fst/sparse-power-weight.h>
111 #include <fst/sparse-tuple-weight.h>
112 #include <fst/state-map.h>
113 #include <fst/state-reachable.h>
114 #include <fst/state-table.h>
115 #include <fst/statesort.h>
116 #include <fst/string-weight.h>
117 #include <fst/string.h>
118 #include <fst/symbol-table-ops.h>
119 #include <fst/symbol-table.h>
120 #include <fst/synchronize.h>
121 #include <fst/topsort.h>
122 #include <fst/tuple-weight.h>
123 #include <fst/union-find.h>
124 #include <fst/union.h>
125 #include <fst/util.h>
126 #include <fst/vector-fst.h>
127 #include <fst/verify.h>
128 #include <fst/visit.h>
129 #include <fst/weight.h>
130 
131 #endif // FST_FSTLIB_H_