Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
fst::AcceptorCompactor< A >Compactor for weighted acceptor FSTs
fst::AcyclicMinimizer< A >
fst::AddOnImpl< F, T >
fst::AddOnPair< A1, A2 >Create a new add-on from a pair of add-ons
fst::AlgoTester< Arc, WeightGenerator >
fst::script::AllFstOperationsRegisterer< Arc >
fst::AltSequenceComposeFilter< M1, M2 >This filter requires epsilons on FST2 to be read before epsilons on FST1
fst::AnyArcFilter< A >True for all arcs
fst::ArcIterator< F >
fst::ArcIterator< ArcSortFst< A, C > >Specialization for ArcSortFst
fst::ArcIterator< ClosureFst< A > >Specialization for ClosureFst
fst::ArcIterator< CompactFst< A, C, U > >
fst::ArcIterator< ComplementFst< A > >Specialization for ComplementFst
fst::ArcIterator< ComposeFst< A > >Specialization for ComposeFst
fst::ArcIterator< ConcatFst< A > >Specialization for ConcatFst
fst::ArcIterator< ConstFst< A, U > >
fst::ArcIterator< DecodeFst< A > >Specialization for DecodeFst
fst::ArcIterator< DeterminizeFst< A > >Specialization for DeterminizeFst
fst::ArcIterator< DifferenceFst< A > >Specialization for DifferenceFst
fst::ArcIterator< EncodeFst< A > >Specialization for EncodeFst
fst::ArcIterator< ExpandFst< A > >Specialization for ExpandFst
fst::ArcIterator< FactorWeightFst< A, F > >Specialization for FactorWeightFst
fst::ArcIterator< IntersectFst< A > >Specialization for IntersectFst
fst::ArcIterator< InvertFst< A > >Specialization for InvertFst
fst::ArcIterator< MapFst< A, B, C > >Specialization for MapFst
fst::ArcIterator< MatcherFst< F, M, N, I > >Specialization for MatcherFst
fst::ArcIterator< ProjectFst< A > >Specialization for ProjectFst
fst::ArcIterator< RationalFst< A > >Specialization for RationalFst
fst::ArcIterator< RelabelFst< A > >Specialization for RelabelFst
fst::ArcIterator< ReplaceFst< A, T > >
fst::ArcIterator< RmEpsilonFst< A > >Specialization for RmEpsilonFst
fst::ArcIterator< SynchronizeFst< A > >Specialization for SynchronizeFst
fst::ArcIterator< UnionFst< A > >Specialization for UnionFst
fst::ArcIterator< VectorFst< A > >
fst::ArcIteratorBase< A >
fst::ArcIteratorData< A >ArcIterator initialization data
fst::ArcLookAheadMatcher< M, F >
fst::ArcMergeCompare< A >
fst::ArcMergeEqual< A >
fst::ArcSortFst< A, C >
fst::ArcSortFstImpl< A, C >Implementation of delayed ArcSortFst
fst::ArcSumCompare< A >
fst::ArcSumEqual< A >
fst::ArcTpl< W >
fst::AStarWeightCompare< S, L, E >
fst::AutoQueue< S >
fst::CacheArcIterator< F >
fst::CacheBaseImpl< S >
fst::CacheImpl< A >A CacheBaseImpl with a commonly used CacheState
fst::CacheLogAccumulator< A >
fst::CacheLogAccumulatorData< A >
fst::CacheOptions
fst::CacheState< A >
fst::CacheStateIterator< F >
fst::CcVisitor< A >Finds and returns connected components. Use with Visit()
fst::CheckSummerCheck sums
fst::ClosureFst< A >
fst::ClosureFstOptions
fst::CompactFst< A, C, U >
fst::CompactFstData< A, C, U >
fst::CompactFstImpl< A, C, U >
fst::CompactFstOptions
fst::CompactHashStateTable< T, H >
fst::CompactSet< Key, NoKey >
fst::ComplementFst< A >
fst::ComplementFstImpl< A >
fst::ComposeFingerprint< S, F >Fingerprint for general composition tuples
fst::ComposeFst< A >
fst::ComposeFstImpl< M1, M2, F, T >
fst::ComposeFstImplBase< A >
fst::ComposeFstImplOptions< M1, M2, F, T >
fst::ComposeFstOptions< A, M, F, T >
fst::ComposeHash< S, F >Hashing of composition state tuples
fst::ComposeOptions
fst::ComposeState1Fingerprint< S, F >Useful when the first composition state determines the tuple
fst::ComposeState2Fingerprint< S, F >Useful when the second composition state determines the tuple
fst::ComposeStateTuple< S, F >Represents the composition state
fst::ConcatFst< A >
fst::ConstFst< A, U >
fst::ConstFstImpl< A, U >
fst::CopyVisitor< A >Copies input FST to mutable FST following queue order
fst::CustomArcA user-defined arc type
fst::CustomCompactor< A >A user-defined compactor for test FST
fst::CyclicMinimizer< A, Queue >
fst::DecodeFst< A >
fst::DefaultAccumulator< A >This class accumulates arc weights using the semiring Plus()
fst::DefaultCommonDivisor< W >The default common divisor uses the semiring Plus
fst::DefaultLookAhead< A, type >MATCH_NONE
fst::DefaultLookAhead< A, MATCH_INPUT >Specializes for MATCH_INPUT to allow lookahead
fst::DefaultLookAhead< A, MATCH_OUTPUT >Specializes for MATCH_OUTPUT to allow lookahead
fst::DefaultLookAhead< LogArc, MATCH_INPUT >Specializes for LogArc to allow weight and label pushing
fst::DefaultLookAhead< LogArc, MATCH_OUTPUT >Specializes for LogArc to allow weight and label pushing
fst::DefaultLookAhead< StdArc, MATCH_INPUT >Specializes for StdArc to allow weight and label pushing
fst::DefaultLookAhead< StdArc, MATCH_OUTPUT >Specializes for StdArc to allow weight and label pushing
fst::DefaultReplaceStateTable< A, P >
deque
fst::DeterminizeFsaImpl< A, D >
fst::DeterminizeFst< A >
fst::DeterminizeFstImpl< A, S >
fst::DeterminizeFstImplBase< A >
fst::DeterminizeFstOptions< Arc >Options for finite-state transducer determinization
fst::script::DeterminizeOptions
fst::DeterminizeOptions< Arc >
fst::DetStringComposeStateTable< A, F >
fst::DfsState< Arc >An Fst state's DFS stack state
fst::DifferenceFst< A >
fst::DifferenceFstOptions< A, M, F, T >
fst::EditFst< A >END EditFstImpl IMPLEMENTATION
fst::EditFstImpl< A, MutableFstT >
fst::FactorWeightFstImpl< A, F >::Element
fst::DeterminizeFsaImpl< A, D >::Element
fst::SynchronizeFstImpl< A >::Element
fst::EncodeFst< A >
fst::EncodeMapper< A >
fst::EncodeTable< A >
fst::EpsilonArcFilter< A >True for (input/output) epsilon arcs
fst::EpsMapper< A >
fst::EquivalenceUtil< Arc >
fst::ErasableComposeStateTable< A, F >
fst::ErasableStateTable< T, F >
fst::ExpandedFst< A >A generic FST plus state count
fst::ExpandFst< A >
fst::ExpandFstImpl< A >Implementation class for ExpandFst
fst::ExpandFstOptions< Arc >
fst::ExpectationArc< A, X2 >
fst::ExpectationWeight< X1, X2 >
fst::FactorWeightFst< A, F >
fst::FactorWeightFstImpl< A, F >Implementation class for FactorWeight
fst::FactorWeightOptions< Arc >
fst::script::FarCompileStringsArgs
fst::script::FarCreateArgs
fst::FarHeaderFST archive header class
fst::script::FarPrintStringsArgs
fst::FarReader< A >This class iterates through an existing archive of FSTs
fst::FarWriter< A >This class creates an archive of FSTs
fst::FastLogAccumulator< A >
fst::FastLogAccumulatorDataStores shareable data for fast log accumulator copies
fst::FastLogProbArcSelector< A >
fst::script::FastLogProbArcSelectorGuard< A >
fst::script::FastLogProbArcSelectorGuard< ArcTpl< LogWeightTpl< T > > >
fst::script::FastLogProbArcSelectorGuard< ArcTpl< TropicalWeightTpl< T > > >
fst::FifoQueue< S >First-in, first-out queue discipline, templated on the StateId
FlagDescription< T >
FlagRegister< T >
FlagRegisterer< T >
fst::FloatLimits< T >Numeric limits class
fst::FloatWeightTpl< T >Weight class to be templated on floating-points types
fst::FromGallicMapper< A, S >Mapper from GallicArc to A
fst::Fst< A >
fst::script::FstClass
fst::script::FstClassBase
fst::script::FstClassImpl< Arc >
fst::script::FstClassImplBase
fst::script::FstClassIORegister< Reader, Creator, Converter >
fst::script::FstClassRegEntry< Reader, Creator, Converter >
fst::script::FstCompileArgs
fst::FstCompiler< A >
fst::FstDrawer< A >
fst::script::FstDrawerArgs
fst::FstHeader
fst::FstImpl< A >
fst::FstInfo< A >
fst::FstPrinter< A >
fst::script::FstPrinterArgs
fst::FstReader< A >
fst::FstReadOptions
fst::FstRegister< A >
fst::FstRegisterEntry< A >This class represents a single entry in a FstRegister
fst::FstRegisterer< F >
fst::FstTester< F >
fst::FstWriteOptions
fst::FstWriter< A >
fst::GallicArc< A, S >
fst::GallicCommonDivisor< L, W, S, D >
fst::GallicFactor< L, W, S >Factor a GallicWeight using StringFactor
fst::GallicToNewSymbolsMapper< A, S >Mapper from GallicArc to A
fst::GallicWeight< L, W, S >Product of string weight and an arbitray weight
fst::GallicWeightGenerator< L, G, S >
fst::GenericComposeStateTable< A, F, H >A HashStateTable over composition tuples
fst::script::GenericOperationRegister< OperationSignature >
fst::GenericRegister< KeyType, EntryType, RegisterType >
fst::GenericRegisterer< RegisterType >
std::tr1::hash< uint64 >
fst::HashStateTable< T, H >
fst::Heap< T, Compare, max >A templated heap implementation that support in-place update of values
IcuErrorCodeIcu.h
fst::IdentityFactor< W >Factor trivially
fst::IdentityMapper< A >Mapper that returns its input
fst::ILabelCompare< A >Compare class for comparing input labels of arcs
fst::ImplToExpandedFst< I, F >
fst::ImplToFst< I, F >
fst::ImplToMutableFst< I, F >
fst::InputEpsilonArcFilter< A >True for input epsilon arcs
fst::IntegerFilterState< T >Filter state that is a signed integral type
fst::IntersectFst< A >
fst::IntersectFstOptions< A, M, F, T >
fst::IntervalSet< T >::Interval
fst::IntervalReachVisitor< A, I >
fst::IntervalSet< T >
fst::InvertFst< A >
fst::InvertMapper< A >Mapper to implement inversion of an arc
fst::InvertWeightMapper< A >Mapper to reciprocate all non-Zero() weights
fst::script::IORegistration< FstClassType >
fst::KeyInfo
fst::LabelCommonDivisor< L, S >
fst::LabelLookAheadMatcher< M, F, S >
fst::LabelLookAheadRelabeler< A >Label-lookahead relabeling class
fst::LabelReachable< A, S >
fst::LabelReachableData< L >Stores shareable data for label reachable class copies
fst::LexicographicArc< W1, W2 >Arc with integer labels and state Ids and lexicographic weights
fst::LexicographicWeight< W1, W2 >
fst::LexicographicWeightGenerator< G1, G2 >
fst::LifoQueue< S >Last-in, first-out queue discipline, templated on the StateId
fst::LogAccumulator< A >
LogMessage
fst::LogProbArcSelector< A >
fst::script::LogProbArcSelectorGuard< A >
fst::script::LogProbArcSelectorGuard< ArcTpl< LogWeightTpl< T > > >
fst::script::LogProbArcSelectorGuard< ArcTpl< TropicalWeightTpl< T > > >
fst::LogWeightGenerator_< T >
fst::LogWeightTpl< T >Log semiring: (log(e^-x + e^y), +, inf, 0)
fst::LookAheadComposeFilter< F, M1, M2, MT >
fst::LookAheadMatcher< F >
fst::LookAheadMatcher< MatcherFst< F, M, N, I > >Specialization for MatcherFst
fst::LookAheadMatcherBase< A >
fst::LookAheadSelector< M1, M2, MT >
fst::LookAheadSelector< M, M, MT >
fst::LookAheadSelector< M1, M2, MATCH_INPUT >
fst::LookAheadSelector< M1, M2, MATCH_OUTPUT >
fst::MapFst< A, B, C >
fst::MapFstImpl< A, B, C >Implementation of delayed MapFst
fst::MapFstOptions
fst::MatchComposeFilter< M1, M2 >
fst::Matcher< F >
fst::Matcher< MatcherFst< F, M, N, I > >Specialization for MatcherFst
fst::MatcherBase< A >
fst::MatcherFst< F, M, N, I >
fst::MinMaxWeightGenerator_< T >
fst::MinMaxWeightTpl< T >MinMax semiring: (min, max, inf, -inf)
fst::MultiEpsFilter< F >
fst::MultiEpsMatcher< M >
fst::MultiLabelArcFilter< A >
fst::MutableArcIterator< F >
fst::MutableArcIterator< VectorFst< A > >
fst::MutableArcIteratorBase< A >
fst::MutableArcIteratorData< A >
fst::MutableFst< A >An expanded FST plus mutators (use MutableArcIterator to modify arcs)
fst::script::MutableFstClass
fst::Mutex
fst::MutexLock
fst::NaturalAStarQueue< S, W, E >
fst::NaturalLess< W >
fst::NaturalPruneQueue< Q, W, C >
fst::NaturalShortestFirstQueue< S, W >
fst::script::args::none_typeSentinel value that means "no arg here."
fst::NullAddOnNothing to save
fst::NullMatcherFstInit< M >Default MatcherFst initializer - does nothing
fst::OLabelCompare< A >Compare class for comparing output labels of arcs
fst::script::Operation< ArgPack >Operation package - everything you need to register a new type of operation
fst::OutputEpsilonArcFilter< A >True for output epsilon arcs
fst::script::args::Package< T1, T2, T3, T4, T5, T6, T7, T8, T9 >9 args (max)
fst::script::args::Package< T1, T2, none_type, none_type, none_type, none_type, none_type, none_type, none_type >2 args (minimum)
fst::script::args::Package< T1, T2, T3, none_type, none_type, none_type, none_type, none_type, none_type >3 args
fst::script::args::Package< T1, T2, T3, T4, none_type, none_type, none_type, none_type, none_type >4 args
fst::script::args::Package< T1, T2, T3, T4, T5, none_type, none_type, none_type, none_type >5 args
fst::script::args::Package< T1, T2, T3, T4, T5, T6, none_type, none_type, none_type >6 args
fst::script::args::Package< T1, T2, T3, T4, T5, T6, T7, none_type, none_type >7 args
fst::script::args::Package< T1, T2, T3, T4, T5, T6, T7, T8, none_type >8 args
fst::PairFilterState< F1, F2 >Filter state that is the combination of two filter states
fst::PairWeight< W1, W2 >
fst::PdtBalanceData< Arc >::ParenHashHash for paren multimap
fst::PdtBalanceData< Arc >::ParenKeyOpen paren key
fst::PdtShortestPathData< Arc >::ParenSpec
fst::PartialVisitor< A >Visits input FST up to a state limit following queue order
fst::Partition< T >Defines a partitioning of states. Typically used to represent equivalence classes for Fst operations like minimization
fst::PartitionIterator< T >Iterate over members of a class in a partition
fst::PdtBalanceData< Arc >Store balancing parenthesis data for a PDT
fst::PdtComposeOptions< Arc, left_pdt >
fst::PdtComposeOptions< Arc, false >
fst::PdtInfo< A >Compute various information about PDTs, helper class for pdtinfo.cc
fst::PdtShortestPath< Arc, Queue >
fst::PdtShortestPathData< Arc >
fst::script::PdtShortestPathOptionsPDT SHORTESTPATH
fst::PdtShortestPathOptions< Arc, Queue >
fst::PdtStack< K, L >
fst::PdtStateHash< T >Hash function object for PDT state tuples
fst::PdtStateTable< S, K >Tuple to PDT state bijection
fst::PdtStateTuple< S, K >State tuple for PDT expansion
fst::PhiMatcher< M >
fst::PlusMapper< A >Mapper to add a constant to all weights
fst::PowerArc< A, n >
fst::PowerWeight< W, n >
fst::PowerWeightGenerator< G, n >
fst::ProductArc< W1, W2 >Arc with integer labels and state Ids and product weights
fst::ProductComposeStateTable< A, F >
fst::ProductWeight< W1, W2 >Product semiring: W1 * W2
fst::ProductWeightGenerator< G1, G2, W >
fst::ProjectFst< A >
fst::ProjectMapper< A >Mapper to implement projection per arc
fst::PruneCompare< S, W >
fst::PruneOptions< A, ArcFilter >
fst::script::PruneOptions
fst::PruneQueue< Q, L, C >
fst::PushLabelsComposeFilter< F, M1, M2, MT >
fst::PushWeightsComposeFilter< F, M1, M2, MT >
fst::QuantizeMapper< A, B >Mapper to quantize all weights
fst::QueueBase< S >
fst::script::QueueConstructor< Queue, Arc, ArcFilter >
fst::script::QueueConstructor< AutoQueue< typename Arc::StateId >, Arc, ArcFilter >
fst::script::QueueConstructor< NaturalShortestFirstQueue< typename Arc::StateId, typename Arc::Weight >, Arc, ArcFilter >
fst::script::QueueConstructor< TopOrderQueue< typename Arc::StateId >, Arc, ArcFilter >
fst::RandGenOptions< S >Options for random path generation
fst::RationalFst< A >
fst::RationalFstImpl< A >Implementation class for delayed unions, concatenations and closures
fst::RefCounterReference counting - single-thread implementation
fst::RelabelFst< A >Delayed implementation of arc relabeling
fst::RelabelFstImpl< A >Implementation for delayed relabeling
fst::ReplaceAccumulator< Accumulator, T >
fst::ReplaceAccumulatorData< Accumulator, T >Stores shareable data for replace accumulator copies
fst::ReplaceFingerprint< S, P >
fst::ReplaceFst< A, T >Recursivively replaces arcs in the root Fst with other Fsts. This version is a delayed Fst
fst::ReplaceFstImpl< A, T >Implementation class for replace class Fst
fst::ReplaceFstOptions< A, T >
fst::ReplaceFstStateFingerprint< S, P >
fst::ReplaceHash< S, P >
fst::ReplaceParenHash< S >Hash to paren IDs
fst::ReplaceRootSelector< S, P >
fst::ReplaceStateTuple< S, P >Tuple of information that uniquely defines a state in replace
fst::ReplaceUtil< Arc >
fst::ReverseArc< A >Arc with the reverse of the weight found in its template arg
fst::ReverseWeightMapper< A, B >
fst::RhoMatcher< M >
fst::RmEpsilonFst< A >
fst::RmEpsilonFstImpl< A >Implementation of delayed RmEpsilonFst
fst::RmEpsilonFstOptions
fst::RmEpsilonOptions< Arc, Queue >
fst::script::RmEpsilonOptions
fst::RmEpsilonState< Arc, Queue >Computation state of the epsilon-removal algorithm
fst::RmWeightMapper< A, B >Mapper to map all non-Zero() weights to One()
fst::SccQueue< S, Q >
fst::SccVisitor< A >
fst::PdtShortestPathData< Arc >::SearchData
fst::PdtShortestPathData< Arc >::SearchState
fst::SequenceComposeFilter< M1, M2 >This filter requires epsilons on FST1 to be read before epsilons on FST2
fst::ShortestDistanceOptions< Arc, Queue, ArcFilter >
fst::script::ShortestDistanceOptions
fst::ShortestDistanceState< Arc, Queue, ArcFilter >
fst::ShortestFirstQueue< S, C, update >
fst::ShortestPathCompare< S, W >
fst::ShortestPathOptions< Arc, Queue, ArcFilter >
fst::script::ShortestPathOptions
fst::SigmaMatcher< M >
fst::SignedLogWeightGenerator_< T >
fst::SignedLogWeightTpl< T >
fst::SortedMatcher< F >
fst::SparsePowerArc< A, K >
fst::SparsePowerWeight< W, K >
fst::SparsePowerWeightGenerator< G, K, n >
fst::SparseTupleWeight< W, K >
fst::SparseTupleWeightApproxMapper< W, K >
fst::SparseTupleWeightDivideMapper< W, K >
fst::SparseTupleWeightIterator< W, K >
fst::SparseTupleWeightPlusMapper< W, K >
fst::SparseTupleWeightTimesMapper< W, K >
fst::PdtStack< K, L >::StackNode
fst::StateComparator< A >
fst::StateIterator< F >
fst::StateIterator< ClosureFst< A > >Specialization for ClosureFst
fst::StateIterator< CompactFst< A, C, U > >
fst::StateIterator< ComplementFst< A > >Specialization for ComplementFst
fst::StateIterator< ComposeFst< A > >Specialization for ComposeFst
fst::StateIterator< ConcatFst< A > >Specialization for ConcatFst
fst::StateIterator< ConstFst< A, U > >
fst::StateIterator< DecodeFst< A > >Specialization for DecodeFst
fst::StateIterator< DeterminizeFst< A > >Specialization for DeterminizeFst
fst::StateIterator< DifferenceFst< A > >Specialization for DifferenceFst
fst::StateIterator< EncodeFst< A > >Specialization for EncodeFst
fst::StateIterator< ExpandFst< A > >Specialization for ExpandFst
fst::StateIterator< FactorWeightFst< A, F > >Specialization for FactorWeightFst
fst::StateIterator< IntersectFst< A > >Specialization for IntersectFst
fst::StateIterator< InvertFst< A > >Specialization for InvertFst
fst::StateIterator< MapFst< A, B, C > >Specialization for MapFst
fst::StateIterator< MatcherFst< F, M, N, I > >Specialization fo MatcherFst
fst::StateIterator< ProjectFst< A > >Specialization for ProjectFst
fst::StateIterator< RationalFst< A > >Specialization for RationalFst
fst::StateIterator< RelabelFst< A > >Specialization for RelabelFst
fst::StateIterator< ReplaceFst< A, T > >Specialization for ReplaceFst
fst::StateIterator< RmEpsilonFst< A > >Specialization for RmEpsilonFst
fst::StateIterator< SynchronizeFst< A > >Specialization for SynchronizeFst
fst::StateIterator< UnionFst< A > >Specialization for UnionFst
fst::StateIterator< VectorFst< A > >
fst::StateIteratorBase< A >
fst::StateIteratorData< A >StateIterator initialization data
fst::StateOrderQueue< S >
fst::StateReachable< A, I >
fst::StateWeightCompare< S, L >
fst::StdArcSortFst< C >Useful aliases when using StdArc
fst::StringArc< S >Arc with integer labels and state Ids and string weights
fst::StringCompactor< A >Bool Done() const { return pos_ >= num_arcs_; }
fst::StringCompiler< A >Functor compiling a string in an FST
fst::StringDetComposeStateTable< A, F >
fst::StringFactor< L, S >Factor a StringWeight w as 'ab' where 'a' is a label
fst::StringPrinter< A >Functor to print a string FST as a string
fst::StringReader< A >
fst::StringWeight< L, S >String semiring: (longest_common_prefix/suffix, ., Infinity, Epsilon)
fst::StringWeightGenerator< L, S >
fst::StringWeightIterator< L, S >Traverses string in forward direction
fst::StringWeightReverseIterator< L, S >Traverses string in forward direction
fst::STTableFarReader< A >
fst::STTableFarWriter< A >
fst::STTableReader< T, R >
fst::STTableWriter< T, W >
fst::SuperFinalMapper< A >
fst::SymbolTableSymbol (string) to int and reverse mapping
fst::SymbolTableImpl
fst::SymbolTableIteratorIterator class for symbols in a symbol table
fst::SymbolTableReadOptions
fst::SynchronizeFst< A >
fst::SynchronizeFstImpl< A >Implementation class for SynchronizeFst
fst::TimesMapper< A >Mapper to (right) multiply a constant to all weights
fst::ToGallicMapper< A, S >Mapper from A to GallicArc
fst::TopOrderQueue< S >
fst::TopOrderVisitor< A >DFS visitor class to return topological ordering
fst::TrivialAStarEstimate< S, W >
fst::TrivialLookAheadMatcher< M >Don't really lookahead, just declare future looks good regardless
fst::TrivialQueue< S >
fst::TrivialStateEquivClass< S >
fst::TropicalWeightGenerator_< T >
fst::TropicalWeightTpl< T >Tropical semiring: (min, +, inf, 0)
fst::EncodeTable< A >::TupleEncoded data consists of arc input/output labels and arc weight
fst::EncodeTable< A >::TupleEqualComparison object for hashing EncodeTable Tuple(s)
fst::EncodeTable< A >::TupleKey
fst::TupleWeight< W, n >N-tuple weight, element of the n-th catersian power of W
fst::UniformArcSelector< A >Randomly selects a transition using the uniform distribution
fst::UnionFind< T >
fst::UnionFst< A >
fst::UnweightedAcceptorCompactor< A >Compactor for unweighted acceptor FSTs
fst::UnweightedCompactor< A >Compactor for unweighted FSTs
fst::UnweightedTester< Arc >
fst::UnweightedTester< StdArc >
fst::VectorFst< A >
fst::VectorFstBaseImpl< State >
fst::script::VectorFstClass
fst::VectorFstImpl< A >
fst::VectorHashReplaceStateTable< A, P >
fst::VectorHashStateTable< T, S, FP, H >
fst::VectorState< A >Arcs implemented by an STL vector per state
fst::VectorStateTable< T, FP >
fst::script::WeightClass
fst::script::WeightClassImpl< W >
fst::script::WeightClassRegister
fst::WeightConvertMapper< FromArc, ToArc >
fst::WeightedStringCompactor< A >Compactor for weighted string FSTs
fst::WeightedTester< Arc, WeightGenerator >
fst::WeightFilterState< W >Filter state that is a weight (class)
fst::WeightFromString< W >Converts a string into a weight
fst::script::WeightImplBase
fst::WeightTester< Weight, WeightGenerator >
fst::script::args::WithReturnValue< Retval, ArgPackage >
fst::script::args::WithReturnValue< Retval, ArgPackage & >
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines