| Cgrammar::parsing::AbsorbTerminalSymbol | |
| Cautomaton::run::Accept | Implementation of test whether automaton accepts its input |
| Cstringology::compression::AdaptiveIntegerArithmeticCompression | |
| Cstringology::compression::AdaptiveIntegerArithmeticDecompression | |
| Cgrammar::AddRawRule | |
| Cregistration::AlgoRegisterHelper | |
| ►Cabstraction::AlgorithmBaseInfo | |
| Cabstraction::AlgorithmFullInfo | |
| Cabstraction::AlgorithmCategories | |
| Cabstraction::AlgorithmRegistry | |
| Cautomaton::properties::AllEpsilonClosure | |
| Cautomaton::properties::efficient::AllEpsilonClosure | |
| ►CAllocFix | |
| Cext::forward_list< T, Alloc > | Class extending the forward_list class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| ►Cobject::AnyObjectBase | |
| Cobject::AnyObject< T > | Represents an adaptor of any type to a class in type hierarchy of objects in the algorithms library |
| Cstringology::cover::ApproximateCoversComputation | |
| ►Cstringology::cover::ApproximateEnhancedCoversCommon | |
| Cstringology::cover::ApproximateEnhancedCoversComputation | |
| Cstringology::cover::RelaxedApproximateEnhancedCoversComputation | |
| Cstringology::seed::ApproximateSeedComputation | |
| ►Ccli::Arg | |
| Ccli::BindedArg | |
| Ccli::ImmediateArg | |
| CTCLAP::ArgTraits< std::pair< T, U > > | |
| Cstringology::compression::ArithmeticCoder< SymbolType, Model > | |
| Cstringology::compression::ArithmeticDecoder< SymbolType, Model > | |
| CArithmeticModel< SymbolType > | |
| ►Cstd::array | |
| Cext::array< T, N > | Class extending the array class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Cgraph::shortest_path::AStar | |
| Cgraph::shortest_path::AStarBidirectional | |
| Cautomaton::transform::AutomataConcatenation | |
| Cautomaton::transform::AutomataConcatenationEpsilonTransition | |
| Cautomaton::transform::AutomataIntersectionCartesianProduct | |
| Cautomaton::transform::AutomataLeftQuotientCartesianProduct | |
| Cautomaton::transform::AutomataUnion | |
| Cautomaton::transform::AutomataUnionCartesianProduct | |
| Cautomaton::transform::AutomataUnionEpsilonTransition | |
| Cautomaton::transform::AutomataUnionMultipleInitialStates | |
| Ccompare::AutomatonCompare | |
| Cautomaton::transform::AutomatonComplement | |
| Ccompare::AutomatonDiff | |
| Cautomaton::AutomatonFromStringParserCommon | |
| Cautomaton::AutomatonFromXMLParser | |
| Cautomaton::transform::AutomatonIteration | |
| Cautomaton::transform::AutomatonIterationEpsilonTransition | |
| Cautomaton::AutomatonNormalize | |
| Cautomaton::AutomatonToStringComposerCommon | |
| Cautomaton::AutomatonToXMLComposer | |
| Cstringology::properties::BackboneLength | |
| Cstringology::properties::BackboneLength::BackboneLengthLess< StateType > | |
| Cautomaton::properties::BackwardBisimulation | |
| Cstringology::query::BackwardDAWGMatching | |
| Ctree::exact::BackwardOccurrenceTest | |
| Cstringology::query::BackwardOracleMatching | |
| Cstring::properties::BadCharacterShiftTable | |
| Ctree::properties::BadCharacterShiftTable | |
| Calphabet::BarSymbol | Represents bar symbol used in tree linearization |
| Cext::BaseNode< Data > | Base class for hierarchy of tree node types. The tree node types can be used to construct tree structures of different types of nodes |
| ►Cext::BaseNode< FormalRegExpElement< SymbolType > > | |
| Cregexp::FormalRegExpElement< SymbolType > | |
| ►Cext::BaseNode< FormalRTEElement< SymbolType > > | |
| Crte::FormalRTEElement< SymbolType > | |
| ►Cext::BaseNode< UnboundedRegExpElement< SymbolType > > | |
| Cregexp::UnboundedRegExpElement< SymbolType > | |
| ►Cabstraction::BaseRegistryEntry | |
| Cabstraction::AlgorithmRegistry::Entry | |
| Cabstraction::CastRegistry::Entry | |
| Cabstraction::ContainerRegistry::Entry | |
| Cabstraction::NormalizeRegistry::Entry | |
| Cabstraction::OperatorRegistry::BinaryEntry | |
| Cabstraction::OperatorRegistry::PostfixEntry | |
| Cabstraction::OperatorRegistry::PrefixEntry | |
| Cabstraction::ValuePrinterRegistry::Entry | |
| ►Cext::BasicLexer | |
| ►Cext::Lexer< AutomatonFromStringLexer > | |
| Cautomaton::AutomatonFromStringLexer | |
| ►Cext::Lexer< ContainerFromStringLexer > | |
| Ccontainer::ContainerFromStringLexer | |
| ►Cext::Lexer< GrammarFromStringLexer > | |
| Cgrammar::GrammarFromStringLexer | |
| ►Cext::Lexer< PrimitiveFromStringLexer > | |
| Cprimitive::PrimitiveFromStringLexer | |
| ►Cext::Lexer< RegExpFromStringLexer > | |
| Cregexp::RegExpFromStringLexer | |
| ►Cext::Lexer< RTEFromStringLexer > | |
| Crte::RTEFromStringLexer | |
| ►Cext::Lexer< StringFromStringLexer > | |
| Cstring::StringFromStringLexer | |
| ►Cext::Lexer< TreeFromStringLexer > | |
| Ctree::TreeFromStringLexer | |
| Cext::Lexer< SuperLexer > | |
| Carbology::transform::BeginToEndIndex | |
| Cstringology::transform::BeginToEndIndex | |
| Cgraph::shortest_path::BellmanFord | |
| Cgraph::traverse::BFS | |
| Cgraph::traverse::BFSBidirectional | |
| Cext::internal::binder< Ts > | |
| Calib::BinomialHeap< T, Comparator > | |
| Cstringology::simulations::BitParalelism | |
| Cstringology::indexing::BitParallelIndexConstruction | |
| Cstringology::query::BitParallelismFactors | |
| ►Cstd::bitset | |
| Cext::bitset< N > | Class extending the bitset class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Calphabet::BlankSymbol | Represents blank symbol used in the turing machine |
| Cstringology::matching::BNDMMatcherConstruction | |
| Cstringology::query::BNDMOccurrences | |
| Cstring::properties::BorderArray | |
| Ctree::properties::BorderArray | |
| Ctree::properties::BorderArrayNaive | |
| Calphabet::BottomOfTheStackSymbol | Represents bottom of the stack symbol used in the visibly pushdown automata |
| Cext::internal::bound< F, Args > | |
| Cstringology::exact::BoyerMoore | |
| Carbology::exact::BoyerMooreHorspool | |
| Cstringology::exact::BoyerMooreHorspool | |
| Cext::callback_iterator< T > | Output iterator calling a callback function on assignment |
| Cext::casional< Ts > | |
| Cext::casional< > | |
| ►Cext::casional< R > | |
| Cext::casional< std::true_type, R, Ts ... > | |
| Cext::casional< T > | |
| ►Cext::casional< Ts ... > | |
| Cext::casional< std::false_type, R, Ts ... > | |
| Cabstraction::CastHelper | |
| Cregistration::CastRegister< To, From > | |
| Cabstraction::CastRegistry | |
| Cstringology::exact::CGR | |
| Ccli::CharSequence | |
| Cgraph::heuristic::ChebyshevDistance | |
| Cgrammar::generate::CockeYoungerKasami | |
| Cgrammar::generate::CockeYoungerKasamiVerbose | |
| ►Ccli::Command | |
| Ccli::AlgorithmsIntrospectionCommand | |
| Ccli::BindingsIntrospectionCommand | |
| Ccli::BlockCommand | |
| Ccli::BreakCommand | |
| Ccli::CalcCommand | |
| Ccli::CastsIntrospectionCommand | |
| Ccli::ClearMeasurements | |
| Ccli::CommandList | |
| Ccli::ContinueCommand | |
| Ccli::DataTypesIntrospectionCommand | |
| Ccli::DeclareRunnableCommand | |
| Ccli::EOTCommand | |
| Ccli::EvalCommand | |
| Ccli::ExecuteCommand | |
| Ccli::HelpCommand | |
| Ccli::IfCommand | |
| Ccli::InterpretCommand | |
| Ccli::LoadCommand | |
| Ccli::OperatorsIntrospectionCommand | |
| Ccli::OverloadsIntrospectionCommand | |
| Ccli::PrintCommand | |
| Ccli::QuitCommand | |
| Ccli::ReturnCommand | |
| Ccli::SetCommand | |
| Ccli::ShowMeasurements | |
| Ccli::StartMeasurementFrame | |
| Ccli::StopMeasurementFrame | |
| Ccli::UnloadCommand | |
| Ccli::VarDeclareCommand | |
| Ccli::VariablesIntrospectionCommand | |
| Ccli::WhileCommand | |
| ►Cstd::common_type | |
| Cstd::experimental::details::return_type_helper< void, Types... > | |
| Cautomaton::transform::Compaction | |
| Cstringology::query::CompactSuffixAutomatonFactors | |
| Cindexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType > | |
| ►Ccore::Component< Derived, ComponentType, ComponentCategory, ComponentName > | |
| Ccore::Components< Derived, ComponentType, ComponentCategory, ComponentName, Next ... > | |
| Ccore::Components< Derived, ComponentType, ComponentCategory, std::tuple< ComponentName, ComponentNames ... >, Next ... > | |
| Ccore::Component< Derived, ComponentType, component::Value, ComponentName > | |
| Cregistration::ComponentRegister< ObjectType > | |
| Ccore::Components< Data > | |
| ►Ccore::Components< ArcFactoredDeterministicZAutomaton< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::ArcFactoredDeterministicZAutomaton< SymbolTypeT, StateTypeT > | Deterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree languages |
| ►Ccore::Components< ArcFactoredNondeterministicZAutomaton< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::ArcFactoredNondeterministicZAutomaton< SymbolTypeT, StateTypeT > | Nondeterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree languages |
| ►Ccore::Components< BitParallelIndex< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| Cindexes::stringology::BitParallelIndex< SymbolType > | Bit parallel string index. Stores a bit vector for each symbol of the alphabet. The bit vector of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit vectors actually represent valid index |
| ►Ccore::Components< BitSetIndex< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| Cindexes::stringology::BitSetIndex< SymbolType, BitmaskBitCount > | Bit set string index. Stores a bit set for each symbol of the alphabet. The bit set of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit sets actually represent valid index |
| ►Ccore::Components< CFG< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::CFG< TerminalSymbolType, NonterminalSymbolType > | Context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages |
| ►Ccore::Components< CNF< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::CNF< TerminalSymbolType, NonterminalSymbolType > | Chomsky normal form of a context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages |
| ►Ccore::Components< CompactDFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::CompactDFA< SymbolTypeT, StateTypeT > | Compact deterministic finite automaton. Accepts regular languages. The automaton has a list of symbols on transitions |
| ►Ccore::Components< CompactNFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::CompactNFA< SymbolTypeT, StateTypeT > | Compact nondeterministic finite automaton. Accepts regular languages. The automaton has a list of symbols on transitions |
| ►Ccore::Components< CompressedBitParallelIndex< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| Cindexes::stringology::CompressedBitParallelIndex< SymbolType > | Compressed bit parallel string index. Stores a bit vector for each symbol of the alphabet. The bit vector of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit vectors actually represent valid index. The bit vectors are compressed with run length encoding packing runs of false values |
| ►Ccore::Components< CompressedBitParallelTreeIndex< DefaultSymbolType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, GeneralAlphabet > | |
| Cindexes::arbology::CompressedBitParallelTreeIndex< SymbolType > | Compressed bit parallel tree index. Stores a bit vector for each symbol of the alphabet. The bit vector of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit vectors actually represent valid index. The bit vectors are compressed with run length encoding packing runs of false values. Additionally the index contains a subtree jump table representing positions after a jump over a subtree |
| ►Ccore::Components< ContextPreservingUnrestrictedGrammar< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< TerminalAlphabet, NonterminalAlphabet >, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::ContextPreservingUnrestrictedGrammar< SymbolType > | Context preserving unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages |
| ►Ccore::Components< CSG< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< TerminalAlphabet, NonterminalAlphabet >, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::CSG< SymbolType > | Context sensitive grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages |
| ►Ccore::Components< CyclicString< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| Cstring::CyclicString< SymbolType > | Cyclic string |
| ►Ccore::Components< Derived, ComponentType, ComponentCategory, std::tuple< ComponentNames ... >, Next ... > | |
| Ccore::Components< Derived, ComponentType, ComponentCategory, std::tuple< ComponentName, ComponentNames ... >, Next ... > | |
| ►Ccore::Components< Derived, Next ... > | |
| Ccore::Components< Derived, ComponentType, ComponentCategory, ComponentName, Next ... > | |
| Ccore::Components< Derived, ComponentType, ComponentCategory, std::tuple< >, Next ... > | |
| ►Ccore::Components< DFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::DFA< SymbolTypeT, StateTypeT > | Deterministic finite automaton. Accepts regular languages |
| ►Ccore::Components< DFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::DFTA< SymbolTypeT, StateTypeT > | Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages |
| ►Ccore::Components< DPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, InitialSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::DPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Deterministic pushdown automaton. Accepts subset of context free languages |
| ►Ccore::Components< EpsilonFreeCFG< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType > | Context free grammar without epsilon rules in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages |
| ►Ccore::Components< EpsilonNFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::EpsilonNFA< SymbolTypeT, StateTypeT > | Epsilon nondeterministic finite automaton. Accepts regular languages |
| ►Ccore::Components< EpsilonNFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::EpsilonNFTA< SymbolTypeT, StateTypeT > | Epsilon nondeterministic finite tree automaton. Accepts regular tree languages |
| ►Ccore::Components< ExtendedNFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::ExtendedNFA< SymbolTypeT, StateTypeT > | Extended nondeterministic finite automaton. Accepts regular languages. The automaton has a regular expression on transitions |
| ►Ccore::Components< ExtendedNFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::ExtendedNFTA< SymbolType, StateType > | Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages |
| ►Ccore::Components< FormalRegExp< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet > | |
| Cregexp::FormalRegExp< SymbolType > | Formal regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes: |
| ►Ccore::Components< FormalRTE< DefaultSymbolType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, std::tuple< GeneralAlphabet, ConstantAlphabet > > | |
| Crte::FormalRTE< SymbolType > | Formal regular tree expression represents regular tree expression. It describes regular tree languages. The expression consists of the following nodes: |
| ►Ccore::Components< GNF< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::GNF< TerminalSymbolType, NonterminalSymbolType > | Greibach normal form of a context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages |
| ►Ccore::Components< InputDrivenDPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, InitialSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::InputDrivenDPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Deterministic input driven pushdown automaton. Accepts subset of context free languages |
| ►Ccore::Components< InputDrivenNPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, InitialSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::InputDrivenNPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Nondeterministic input driven pushdown automaton. Accepts subset of context free languages |
| ►Ccore::Components< LeftLG< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::LeftLG< TerminalSymbolType, NonterminalSymbolType > | Left linear grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages |
| ►Ccore::Components< LeftRG< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::LeftRG< TerminalSymbolType, NonterminalSymbolType > | Left regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages |
| ►Ccore::Components< LG< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::LG< TerminalSymbolType, NonterminalSymbolType > | Context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages |
| ►Ccore::Components< LinearString< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| Cstring::LinearString< SymbolType > | Linear string |
| ►Ccore::Components< LinearStringTerminatingSymbol, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet, DefaultSymbolType, component::Value, TerminatingSymbol > | |
| Cstring::LinearStringTerminatingSymbol | |
| ►Ccore::Components< MultiInitialStateEpsilonNFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, InitialStates, FinalStates > > | |
| Cautomaton::MultiInitialStateEpsilonNFA< SymbolTypeT, StateTypeT > | Epsilon nondeterministic finite automaton. Accepts regular languages |
| ►Ccore::Components< MultiInitialStateNFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, InitialStates, FinalStates > > | |
| Cautomaton::MultiInitialStateNFA< SymbolTypeT, StateTypeT > | Nondeterministic finite automaton with multiple initial states. Accepts regular languages |
| ►Ccore::Components< NFA< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::NFA< SymbolTypeT, StateTypeT > | Nondeterministic finite automaton. Accepts regular languages |
| ►Ccore::Components< NFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::NFTA< SymbolTypeT, StateTypeT > | Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages |
| ►Ccore::Components< NonContractingGrammar< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< TerminalAlphabet, NonterminalAlphabet >, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::NonContractingGrammar< SymbolType > | Noncontracting grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages |
| ►Ccore::Components< NondeterministicZAutomaton< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::NondeterministicZAutomaton< SymbolTypeT, StateTypeT > | Nondeterministic Z-Automaton. Computation model for unranked regular tree languages |
| ►Ccore::Components< NonlinearCompressedBitParallelTreeIndex< DefaultSymbolType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, GeneralAlphabet > | |
| Cindexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType > | Compressed bit parallel nonlinear tree index. Stores a bit vector for each symbol of the alphabet. The bit vector of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit vectors actually represent valid index. The bit vectors are compressed with run length encoding packing runs of false values. Additionally the index contains a subtree jump table representing positions after a jump over a subtree. The index is supposed to be able to provide data to search for nonlinear tree patterns. Therefore it also contains representation of subtree repeats |
| ►Ccore::Components< NPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, InitialSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::NPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | |
| ►Ccore::Components< NPDTA< DefaultSymbolType, DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, OutputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, InitialSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::NPDTA< InputSymbolTypeT, OutputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | |
| ►Ccore::Components< OneTapeDTM< DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< TapeAlphabet, InputAlphabet >, DefaultSymbolType, component::Value, BlankSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::OneTapeDTM< SymbolTypeT, StateTypeT > | Deterministic single tape turing machine. Accepts recursive languages |
| ►Ccore::Components< PostfixRankedTree< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, GeneralAlphabet > | |
| Ctree::PostfixRankedTree< SymbolType > | Tree structure represented as linear sequece as result of postorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer |
| ►Ccore::Components< PrefixBarTree< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet, SymbolType, component::Value, BarSymbol > | |
| Ctree::PrefixBarTree< SymbolType > | Tree structure represented as linear sequece as result of preorder traversal with additional bar symbols. The representation is so called unranked, therefore it consists of unranked symbols bars are unranked as well |
| ►Ccore::Components< PrefixRankedBarNonlinearPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, NonlinearAlphabet, BarSymbols >, common::ranked_symbol< SymbolType >, component::Value, std::tuple< SubtreeWildcard, VariablesBarSymbol > > | |
| Ctree::PrefixRankedBarNonlinearPattern< SymbolType > | Nonlinear tree pattern represented as linear sequece as result of preorder traversal with additional bar symbols. The representation is so called ranked, therefore it consists of ranked symbols (bars are ranked as well). The rank of the ranked symbol needs be to compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree and nonlinear variables each to represent same subtree (in the particular occurrence in a tree). To match the wildcard and nonlinear variable, special bar symbol called variables bar is present as well |
| ►Ccore::Components< PrefixRankedBarPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, BarSymbols >, common::ranked_symbol< SymbolType >, component::Value, std::tuple< SubtreeWildcard, VariablesBarSymbol > > | |
| Ctree::PrefixRankedBarPattern< SymbolType > | Tree pattern represented as linear sequece as result of preorder traversal with additional bar symbols. The representation is so called ranked, therefore it consists of ranked symbols (bars are ranked as well). The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree. To match the wildcard, special bar symbol called variables bar is present as well |
| ►Ccore::Components< PrefixRankedBarTree< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, BarSymbols > > | |
| Ctree::PrefixRankedBarTree< SymbolType > | Tree structure represented as linear sequece as result of preorder traversal with additional bar symbols. The representation is so called ranked, therefore it consists of ranked symbols (bars are ranked as well). The rank of the ranked symbol needs to be compatible with unsigned integer |
| ►Ccore::Components< PrefixRankedExtendedPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, NodeWildcards >, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard > | |
| Ctree::PrefixRankedExtendedPattern< SymbolType > | Tree pattern represented as linear sequece as result of preorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree |
| ►Ccore::Components< PrefixRankedNonlinearPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, NonlinearAlphabet >, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard > | |
| Ctree::PrefixRankedNonlinearPattern< SymbolType > | Nonlinear tree pattern represented as linear sequece as result of preorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree and nonlinear variables each to represent same subtree (in the particular occurrence in a tree) |
| ►Ccore::Components< PrefixRankedPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, GeneralAlphabet, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard > | |
| Ctree::PrefixRankedPattern< SymbolType > | Tree pattern represented as linear sequece as result of preorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree |
| ►Ccore::Components< PrefixRankedTree< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, GeneralAlphabet > | |
| Ctree::PrefixRankedTree< SymbolType > | Tree structure represented as linear sequece as result of preorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer |
| ►Ccore::Components< RankedExtendedPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, NodeWildcards >, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard > | |
| Ctree::RankedExtendedPattern< SymbolType > | Extended tree pattern represented in its natural representation. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree and other special wildcard symbols representing any label at the corresponding node in the match |
| ►Ccore::Components< RankedNonlinearPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, NonlinearAlphabet >, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard > | |
| Ctree::RankedNonlinearPattern< SymbolType > | Nonlinear tree pattern represented in its natural representation. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree and nonlinear variables each to represent same subtree (in the particular occurrence in a tree) |
| ►Ccore::Components< RankedPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, GeneralAlphabet, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard > | |
| Ctree::RankedPattern< SymbolType > | Tree pattern represented in its natural representation. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree |
| ►Ccore::Components< RankedTree< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, GeneralAlphabet > | |
| Ctree::RankedTree< SymbolType > | Tree structure represented in its natural representation. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer |
| ►Ccore::Components< RealTimeHeightDeterministicDPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, BottomOfTheStackSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::RealTimeHeightDeterministicDPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Deterministic real time height deterministic pushdown automaton. Accepts subset of context free languages |
| ►Ccore::Components< RealTimeHeightDeterministicNPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, BottomOfTheStackSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, InitialStates, FinalStates > > | |
| Cautomaton::RealTimeHeightDeterministicNPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Nondeterministic real time height deterministic pushdown automaton. Accepts subset of context free languages |
| ►Ccore::Components< RightLG< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::RightLG< TerminalSymbolType, NonterminalSymbolType > | Right linear grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages |
| ►Ccore::Components< RightRG< DefaultSymbolType, DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, TerminalAlphabet, ext::set< DefaultSymbolType >, component::Set, NonterminalAlphabet, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::RightRG< TerminalSymbolType, NonterminalSymbolType > | Right regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages |
| ►Ccore::Components< SinglePopDPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, InitialSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::SinglePopDPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Deterministic pushdown automaton requiring a symbol pop from pushdown store on each transition use. Accepts subset of context free languages |
| ►Ccore::Components< SinglePopNPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, InputAlphabet, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, InitialSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::SinglePopNPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | |
| ►Ccore::Components< SuffixTrie< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| Cindexes::stringology::SuffixTrie< SymbolType > | Suffix trie string index. Tree like representation of all suffixes. Nodes of the trie are optionally containing index of the suffix. The parent child relationship of nodes is represented by single symbol. The class does not checks whether the trie actually is suffix trie |
| ►Ccore::Components< SuffixTrieTerminatingSymbol, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet, DefaultSymbolType, component::Value, TerminatingSymbol > | |
| Cindexes::SuffixTrieTerminatingSymbol | |
| ►Ccore::Components< UnboundedRegExp< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet > | |
| Cregexp::UnboundedRegExp< SymbolType > | Unbounded regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes: |
| ►Ccore::Components< UnorderedDFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::UnorderedDFTA< SymbolTypeT, StateTypeT > | Deterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree languages |
| ►Ccore::Components< UnorderedNFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > > | |
| Cautomaton::UnorderedNFTA< SymbolTypeT, StateTypeT > | Nondeterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree languages |
| ►Ccore::Components< UnorderedRankedPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, GeneralAlphabet, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard > | |
| Ctree::UnorderedRankedPattern< SymbolType > | Tree pattern represented in its natural representation. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree |
| ►Ccore::Components< UnorderedRankedTree< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, GeneralAlphabet > | |
| Ctree::UnorderedRankedTree< SymbolType > | Tree structure represented in its natural representation. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer |
| ►Ccore::Components< UnorderedUnrankedPattern< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet, SymbolType, component::Value, std::tuple< SubtreeWildcard, SubtreeGap > > | |
| Ctree::UnorderedUnrankedPattern< SymbolType > | Tree pattern represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols. Additionally the pattern contains a special wildcard symbol representing any subtree |
| ►Ccore::Components< UnorderedUnrankedTree< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet > | |
| Ctree::UnorderedUnrankedTree< SymbolType > | Tree pattern represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols |
| ►Ccore::Components< UnrankedExtendedPattern< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet, SymbolType, component::Value, std::tuple< NodeWildcard, SubtreeWildcard, SubtreeGap > > | |
| Ctree::UnrankedExtendedPattern< SymbolType > | Extended tree pattern represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols. Additionally the pattern contains a special wildcard symbol representing any subtree and other special wildcard symbols representing any label at the corresponding node in the match |
| ►Ccore::Components< UnrankedNonlinearPattern< SymbolType >, ext::set< SymbolType >, component::Set, std::tuple< GeneralAlphabet, NonlinearAlphabet >, SymbolType, component::Value, std::tuple< SubtreeWildcard, SubtreeGap > > | |
| Ctree::UnrankedNonlinearPattern< SymbolType > | Nonlinear tree pattern represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols. Additionally the pattern contains a special wildcard symbol representing any subtree and nonlinear variables each to represent same subtree (in the particular occurrence in a tree) |
| ►Ccore::Components< UnrankedPattern< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet, SymbolType, component::Value, std::tuple< SubtreeWildcard, SubtreeGap > > | |
| Ctree::UnrankedPattern< SymbolType > | Tree pattern represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols. Additionally the pattern contains a special wildcard symbol representing any subtree |
| ►Ccore::Components< UnrankedTree< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet > | |
| Ctree::UnrankedTree< SymbolType > | Tree represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols |
| ►Ccore::Components< UnrestrictedGrammar< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< TerminalAlphabet, NonterminalAlphabet >, DefaultSymbolType, component::Value, InitialSymbol > | |
| Cgrammar::UnrestrictedGrammar< SymbolType > | Unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages |
| ►Ccore::Components< VisiblyPushdownDPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< CallAlphabet, ReturnAlphabet, LocalAlphabet >, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, BottomOfTheStackSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates >, DefaultStateType, component::Value, InitialState > | |
| Cautomaton::VisiblyPushdownDPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Deterministic visibly pushdown automaton. Accepts subset of context free languages |
| ►Ccore::Components< VisiblyPushdownNPDA< DefaultSymbolType, DefaultSymbolType, DefaultStateType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< CallAlphabet, ReturnAlphabet, LocalAlphabet >, ext::set< DefaultSymbolType >, component::Set, PushdownStoreAlphabet, DefaultSymbolType, component::Value, BottomOfTheStackSymbol, ext::set< DefaultStateType >, component::Set, std::tuple< States, InitialStates, FinalStates > > | |
| Cautomaton::VisiblyPushdownNPDA< InputSymbolTypeT, PushdownStoreSymbolTypeT, StateTypeT > | Nondeterministic visibly pushdown automaton. Accepts subset of context free languages |
| ►Ccore::Components< WildcardLinearString< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet, DefaultSymbolType, component::Value, WildcardSymbol > | |
| Cstring::WildcardLinearString< SymbolType > | Linear wildcard string |
| Craw::Compose | |
| Cstring::Compose | |
| Cxml::Compose | |
| Carbology::indexing::CompressedBitParallelIndexConstruction | |
| Cstringology::indexing::CompressedBitParallelIndexConstruction | |
| Cstringology::query::CompressedBitParallelismFactors | |
| Carbology::query::CompressedBitParallelismPatterns | |
| ►Cstd::conditional_t | |
| Cabstraction::ValueHolder< Type > | |
| Cabstraction::PackingAbstractionImpl::ConnectionTarget | |
| ►Cmap_type::const_iterator | |
| Cext::key_iterator< map_type > | |
| Cext::value_iterator< map_type > | |
| Cext::forward_tree< T >::const_postfix_iterator | The iterator type over structure of the tree following postorder traversal |
| Cext::tree< T >::const_postfix_iterator | The iterator type over structure of the tree following postorder traversal |
| Cext::forward_tree< T >::const_prefix_iterator | The iterator type over structure of the tree following preorder traversal |
| Cext::tree< T >::const_prefix_iterator | The iterator type over structure of the tree following preorder traversal |
| Cext::forward_tree< T >::const_structure_iterator | The iterator type over structure of the tree representing nodes and node_ends |
| Cext::tree< T >::const_structure_iterator | The iterator type over structure of the tree representing nodes and node_ends |
| Cext::const_tuple_foreach< Types > | Class providing begin and end methods to allow simple use of packed iterators in foreach variant of the for loop |
| Cext::const_tuple_foreach_iterator< Iterators > | A class for packing a tuple of iterators and synchronizing them. All are incremented, decremented, dereferenced together |
| ►Crte::FormalRTEElement< SymbolType >::ConstVisitor | |
| Crte::FormalRTEElement< SymbolType >::ConstVisitorContext< ReturnType, Visitorr, Params > | |
| Cabstraction::ContainerRegistry | |
| Cgraph::maximum_flow::Context | |
| Cgrammar::parsing::CornerSubstitution | |
| Cmeasurements::CounterDataFrame | |
| Cmeasurements::CounterHint | |
| Calib::CppHeap< T, Comparator > | Heap build using C++ algorithm features |
| Cexample::CreateDataType | |
| Cexample::CreateDataType2 | |
| ►CData | |
| ►Cext::AnyaryNode< Data, 2, Data > | |
| Cext::BinaryNode< Data, Base > | Binary node is specialisation of Anyary node to two children |
| ►Cext::AnyaryNode< Data, 0, Data > | |
| Cext::NullaryNode< Data, Base > | Nullary node is specialisation of Anyary node to no children |
| ►Cext::AnyaryNode< Data, 3, Data > | |
| Cext::TernaryNode< Data, Base > | Ternany node is specialisation of Anyary node to three children |
| ►Cext::AnyaryNode< Data, 1, Data > | |
| Cext::UnaryNode< Data, Base > | Unary node is specialisation of Anyary node to one child |
| ►Cext::AnyaryNode< Data, arity, Base > | Tree node with any but fixed number of children |
| ►Cext::BinaryNode< FormalRegExpElement< SymbolType > > | |
| Cregexp::FormalRegExpAlternation< SymbolType > | Represents the alternation operator in the regular expression. The node must have exactly two children |
| Cregexp::FormalRegExpConcatenation< SymbolType > | Represents the concatenation operator in the regular expression. The node must have exactly two children |
| ►Cext::BinaryNode< FormalRTEElement< SymbolType > > | |
| Crte::FormalRTEAlternation< SymbolType > | Represents the alternation operator in the regular tree expression. The node must have exactly two children |
| Crte::FormalRTESubstitution< SymbolType > | Represents the concatenation operator in the regular tree expression. The node must have exactly two children |
| ►Cext::NullaryNode< FormalRegExpElement< SymbolType > > | |
| Cregexp::FormalRegExpEmpty< SymbolType > | Represents the empty expression in the regular expression. The node can't have any children |
| Cregexp::FormalRegExpEpsilon< SymbolType > | Represents the epsilon expression in the regular expression. The node can't have any children |
| Cregexp::FormalRegExpSymbol< SymbolType > | Represents the symbol in the regular expression. The can't have any children |
| ►Cext::NullaryNode< UnboundedRegExpElement< SymbolType > > | |
| Cregexp::UnboundedRegExpEmpty< SymbolType > | Represents the empty expression in the regular expression. The node can't have any children |
| Cregexp::UnboundedRegExpEpsilon< SymbolType > | Represents the epsilon expression in the regular expression. The node can't have any children |
| Cregexp::UnboundedRegExpSymbol< SymbolType > | Represents the symbol in the regular expression. The can't have any children |
| ►Cext::NullaryNode< FormalRTEElement< SymbolType > > | |
| Crte::FormalRTEEmpty< SymbolType > | Represents the empty expression in the regular tree expression. The node can't have any children |
| Crte::FormalRTESymbolSubst< SymbolType > | Represents the substitution symbol in the regular tree expression. The node can't have any children |
| ►Cext::UnaryNode< FormalRegExpElement< SymbolType > > | |
| Cregexp::FormalRegExpIteration< SymbolType > | Represents the iteration operator in the regular expression. The node has exactly one child |
| ►Cext::UnaryNode< UnboundedRegExpElement< SymbolType > > | |
| Cregexp::UnboundedRegExpIteration< SymbolType > | Represents the iteration operator in the regular expression. The node has exactly one child |
| ►Cext::UnaryNode< FormalRTEElement< SymbolType > > | |
| Crte::FormalRTEIteration< SymbolType > | Represents the iteration operator in the regular tree expression. The node has exactly one child |
| Cext::FixedaryNode< Data, Base > | Fixedary node is tree node that when initialized does not permit change of the number of its children |
| Cext::VararyNode< Data, Base > | Varary node is tree node that can hold any number of children |
| Cexample::DataType | |
| Cstringology::matching::DAWGMatcherConstruction | |
| Cstringology::exact::DeadZoneUsingBadCharacterShift | |
| Carbology::exact::DeadZoneUsingBadCharacterShiftAndBorderArray | |
| ►Cdecltype supports_test std::declval | |
| Cext::supports< F(Ts ...) > | |
| ►Cstd::declval | |
| Cext::supports< F(Ts ...) > | |
| ►Cstd::deque | |
| ►Cext::deque< sax::Token > | |
| Ccore::xmlApiOutputContext | |
| Cext::deque< T, Alloc > | Class extending the deque class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Cext::dereferencing_iterator< Iterator > | Adaptor iterator to additionally call second dereference on the iterator dereference result |
| Cstringology::seed::DeterministicApproximateSuffixAutomatonForHammingDistanceFactory | |
| Cgrammar::parsing::DeterministicLL1Grammar | |
| Cgrammar::parsing::DeterministicLL1ParseTable | |
| Cautomaton::determinize::Determinize | |
| Cgraph::traverse::DFS | |
| Cgraph::heuristic::DiagonalDistance | |
| Ccompare::DiffAux | |
| Cgraph::shortest_path::Dijkstra | |
| Cgraph::shortest_path::DijkstraBidirectional | |
| Cautomaton::properties::DistinguishableStates | |
| Cstringology::exact::Dogaru | |
| Ccli::builtin::Dot | |
| Cconvert::DotConverter | |
| Cconvert::DotConverterRTE | |
| Cconvert::DotConverterTree | |
| ►Cedge::EdgeBase | |
| Cedge::CapacityEdge< TNode, TCapacity > | |
| Cedge::Edge< TNode > | |
| Cedge::WeightedEdge< TNode, TWeight > | |
| Cautomaton::run::Run::graphStructuredStack< SymbolType >::Element | |
| Ccommon::SparseBoolVector::element | |
| Cstringology::cover::ApproximateEnhancedCoversCommon::Element | |
| Ccore::ElementConstraint< Derived, ComponentType, ComponentName > | |
| Ccore::ElementConstraint< automaton::CompactDFA< SymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::DFA< SymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol > | |
| Ccore::ElementConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol > | |
| Ccore::ElementConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol > | |
| Ccore::ElementConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol > | |
| Ccore::ElementConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol > | |
| Ccore::ElementConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::OneTapeDTM< SymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::OneTapeDTM< SymbolType, StateType >, SymbolType, automaton::BlankSymbol > | |
| Ccore::ElementConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol > | |
| Ccore::ElementConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol > | |
| Ccore::ElementConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol > | |
| Ccore::ElementConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol > | |
| Ccore::ElementConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol > | |
| Ccore::ElementConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState > | |
| Ccore::ElementConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol > | |
| Ccore::ElementConstraint< grammar::CFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::CNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::ContextPreservingUnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::CSG< SymbolType >, SymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::GNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::LG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::NonContractingGrammar< SymbolType >, SymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol > | |
| Ccore::ElementConstraint< indexes::SuffixTrieTerminatingSymbol, DefaultSymbolType, indexes::TerminatingSymbol > | |
| Ccore::ElementConstraint< string::LinearStringTerminatingSymbol, DefaultSymbolType, string::TerminatingSymbol > | |
| Ccore::ElementConstraint< string::WildcardLinearString< SymbolType >, SymbolType, string::WildcardSymbol > | |
| Ccore::ElementConstraint< tree::PrefixBarTree< SymbolType >, SymbolType, tree::BarSymbol > | |
| Ccore::ElementConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::VariablesBarSymbol > | |
| Ccore::ElementConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::VariablesBarSymbol > | |
| Ccore::ElementConstraint< tree::PrefixRankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::PrefixRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::RankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::RankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::RankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::UnorderedRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::UnorderedUnrankedPattern< SymbolType >, SymbolType, tree::SubtreeGap > | |
| Ccore::ElementConstraint< tree::UnorderedUnrankedPattern< SymbolType >, SymbolType, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::NodeWildcard > | |
| Ccore::ElementConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::SubtreeGap > | |
| Ccore::ElementConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::SubtreeGap > | |
| Ccore::ElementConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::SubtreeWildcard > | |
| Ccore::ElementConstraint< tree::UnrankedPattern< SymbolType >, SymbolType, tree::SubtreeGap > | |
| Ccore::ElementConstraint< tree::UnrankedPattern< SymbolType >, SymbolType, tree::SubtreeWildcard > | |
| ►Cstd::enable_shared_from_this | |
| ►Cabstraction::OperationAbstraction | |
| ►Cabstraction::NaryOperationAbstractionImpl< sizeof ...(ParamTypes) > | |
| ►Cabstraction::NaryOperationAbstraction< ParamTypes ... > | |
| Cabstraction::AlgorithmAbstraction< ReturnType, ParamTypes > | |
| ►Cabstraction::NaryOperationAbstraction< const ParamType & > | |
| Cabstraction::CastAbstraction< ReturnType, ParamType > | |
| Cabstraction::RawWriterAbstraction< ParamType > | |
| Cabstraction::StringWriterAbstraction< ParamType > | |
| Cabstraction::XmlComposerAbstraction< ParamType > | |
| ►Cabstraction::NaryOperationAbstraction< ObjectType &, ParamTypes ... > | |
| Cabstraction::MemberAbstraction< ObjectType, ReturnType, ParamTypes > | |
| ►Cabstraction::NaryOperationAbstraction< ParamType && > | |
| Cabstraction::NormalizeAbstraction< ReturnType, ParamType > | |
| ►Cabstraction::NaryOperationAbstraction< std::string && > | |
| Cabstraction::RawReaderAbstraction< ReturnType > | |
| Cabstraction::StringReaderAbstraction< ReturnType > | |
| ►Cabstraction::NaryOperationAbstraction< Type & > | |
| Cabstraction::ReferenceAbstraction< Type > | |
| ►Cabstraction::NaryOperationAbstraction< ParamType, ext::ostream & > | |
| Cabstraction::ValuePrinterAbstraction< ParamType > | |
| ►Cabstraction::NaryOperationAbstraction< > | |
| Cabstraction::ValuePrinterAbstraction< void > | |
| ►Cabstraction::NaryOperationAbstraction< ext::deque< sax::Token > && > | |
| Cabstraction::XmlParserAbstraction< ReturnType > | |
| ►Cabstraction::NaryOperationAbstraction< const ext::deque< sax::Token > &, const std::string & > | |
| Cabstraction::XmlTokensComposerAbstraction | |
| ►Cabstraction::NaryOperationAbstraction< const std::string & > | |
| Cabstraction::XmlTokensParserAbstraction | |
| Cabstraction::NaryOperationAbstraction< ParamTypes > | |
| ►Cabstraction::ValueOperationAbstraction< std::string > | |
| Cabstraction::RawWriterAbstraction< ParamType > | |
| Cabstraction::StringWriterAbstraction< ParamType > | |
| ►Cabstraction::ValueOperationAbstraction< Type * > | |
| Cabstraction::ReferenceAbstraction< Type > | |
| ►Cabstraction::ValueOperationAbstraction< ext::set< ParamType > > | |
| Cabstraction::SetAbstraction< ParamType > | |
| ►Cabstraction::ValueOperationAbstraction< ext::deque< sax::Token > > | |
| Cabstraction::XmlComposerAbstraction< ParamType > | |
| Cabstraction::XmlTokensParserAbstraction | |
| ►Cabstraction::WrapperAbstractionImpl< sizeof ...(ParamTypes) > | |
| Cabstraction::WrapperAbstraction< ParamTypes > | |
| ►Cabstraction::AnyaryOperationAbstractionImpl | |
| ►Cabstraction::AnyaryOperationAbstraction< ParamType > | |
| Cabstraction::SetAbstraction< ParamType > | |
| Cabstraction::NaryOperationAbstractionImpl< NumberOfParams > | |
| ►Cabstraction::PackingAbstractionImpl | |
| Cabstraction::PackingAbstraction< NumberOfParams > | |
| Cabstraction::RawAbstraction | |
| ►Cabstraction::ValueOperationAbstraction< ReturnType > | |
| Cabstraction::AlgorithmAbstraction< ReturnType, ParamTypes > | |
| Cabstraction::CastAbstraction< ReturnType, ParamType > | |
| Cabstraction::MemberAbstraction< ObjectType, ReturnType, ParamTypes > | |
| Cabstraction::NormalizeAbstraction< ReturnType, ParamType > | |
| Cabstraction::RawReaderAbstraction< ReturnType > | |
| Cabstraction::StringReaderAbstraction< ReturnType > | |
| Cabstraction::XmlParserAbstraction< ReturnType > | |
| ►Cabstraction::ValueOperationAbstraction< void > | |
| Cabstraction::ValuePrinterAbstraction< ParamType > | |
| Cabstraction::ValuePrinterAbstraction< void > | |
| Cabstraction::XmlTokensComposerAbstraction | |
| Cabstraction::WrapperAbstractionImpl< NumberOfParams > | |
| ►Cabstraction::Value | |
| ►Cabstraction::ValueHolderInterface< std::decay_t< Type > > | |
| Cabstraction::ValueImpl< Type > | |
| Cabstraction::PackingAbstractionImpl::LazyValue | |
| ►Cabstraction::ValueHolderInterface< Type > | |
| Cabstraction::ReferenceImpl< Type > | |
| Cabstraction::ValueReference | |
| Cabstraction::Void | |
| ►Ccli::Statement | |
| Ccli::CastStatement | |
| Ccli::ContainerStatement | |
| Ccli::FileStatement | |
| Ccli::ImmediateStatement< Type > | |
| Ccli::PreviousResultStatement | |
| Ccli::ResultFileStatement | |
| Ccli::ResultVariableStatement | |
| Ccli::SingleStatement | |
| Ccli::StatementList | |
| Ccli::ValueStatement | |
| Ccli::VariableStatement | |
| Calphabet::EndSymbol | Represents end symbol used as termation symbol of a string |
| Cabstraction::RawReaderRegistry::Entry | |
| Cabstraction::RawWriterRegistry::Entry | |
| Cabstraction::StringReaderRegistry::Entry | |
| Cabstraction::StringWriterRegistry::Entry | |
| Cabstraction::XmlComposerRegistry::Entry | |
| Cabstraction::XmlContainerParserRegistry::Entry | |
| Cabstraction::XmlParserRegistry::Entry | |
| Cautomaton::properties::EpsilonClosure | |
| Cgrammar::simplify::EpsilonRemover | |
| Cautomaton::simplify::efficient::EpsilonRemoverIncoming | |
| Cautomaton::simplify::EpsilonRemoverIncoming | |
| Cautomaton::simplify::efficient::EpsilonRemoverOutgoing | |
| Cautomaton::simplify::EpsilonRemoverOutgoing | |
| Cgraph::heuristic::EuclideanDistance | |
| Cgraph::heuristic::EuclideanDistanceNoSQRT | |
| Cabstraction::EvalHelper | |
| Cstringology::simulations::ExactBitParalelism | |
| Cstring::naive::ExactCompare | |
| Cstringology::cover::ExactCoversComputation | |
| Cstring::naive::ExactEqual | |
| Cstringology::exact::ExactFactorMatch | |
| Cstringology::indexing::ExactFactorOracleAutomaton | |
| Cstringology::matching::ExactMatchingAutomaton | |
| Cstringology::indexing::ExactMultiNondeterministicSubsequenceAutomaton | |
| Cstringology::indexing::ExactNondeterministicSubsequenceAutomaton | |
| Carbology::exact::ExactNonlinearTreePatternAutomaton | |
| Carbology::exact::ExactPatternMatch | |
| Carbology::exact::ExactPatternMatchingAutomaton | |
| Cstringology::seed::ExactSeedComputation | |
| Cstringology::indexing::ExactSubsequenceAutomaton | |
| Carbology::exact::ExactSubtreeAutomaton | |
| Carbology::exact::ExactSubtreeMatch | |
| Carbology::exact::ExactSubtreeMatchingAutomaton | |
| Ctree::properties::ExactSubtreeRepeats | |
| Carbology::properties::ExactSubtreeRepeatsFromSubtreeAutomaton | |
| Ctree::properties::ExactSubtreeRepeatsNaive | |
| Cstringology::indexing::ExactSuffixAutomaton | |
| Carbology::exact::ExactTreePatternAutomaton | |
| ►Cstd::exception | |
| ►Cexception::CommonException | Basic exception from which all other exceptions are derived |
| Cautomaton::AutomatonException | |
| Cgrammar::GrammarException | |
| Csax::ComposerException | |
| Csax::ParserException | |
| Ctree::TreeException | |
| Calib::ExceptionHandler | |
| Cstringology::indexing::ExperimentalCompactSuffixAutomatonConstruct | |
| Cstringology::indexing::ExperimentalSuffixTrie | |
| ►Ccli::Expression | |
| Ccli::BatchExpression | |
| Ccli::BinaryExpression | |
| Ccli::CastExpression | |
| Ccli::FunctionCallExpression | |
| Ccli::ImmediateExpression< Type > | |
| Ccli::MethodCallExpression | |
| Ccli::PostfixExpression | |
| Ccli::PrefixExpression | |
| Ccli::TypeExpression | |
| Ccli::VariableExpression | |
| Cgrammar::parsing::ExtractRightContext | |
| Cindexes::stringology::FactorOracleAutomaton< SymbolType > | Factor oracle automaton string index. Stores a deterministic finite automaton. The automaton is of exactly linear size as the indexed string. The automaton represents at least all factors of the indexed string. The class does not check whether the automaton represent valid index |
| Clabel::FailStateLabel | Represents label of the fail state of an automaton |
| ►Cstd::false_type | |
| Cautomaton::isAFDZA_impl< T > | |
| Cautomaton::isAFNZA_impl< T > | |
| Cautomaton::isCompactDFA_impl< T > | |
| Cautomaton::isCompactNFA_impl< T > | |
| Cautomaton::isDFA_impl< T > | |
| Cautomaton::isDFTA_impl< T > | |
| Cautomaton::isEpsilonNFA_impl< T > | |
| Cautomaton::isEpsilonNFTA_impl< T > | |
| Cautomaton::isExtendedNFA_impl< T > | |
| Cautomaton::isMultiInitialStateEpsilonNFA_impl< T > | |
| Cautomaton::isMultiInitialStateNFA_impl< T > | |
| Cautomaton::isNFA_impl< T > | |
| Cautomaton::isNFTA_impl< T > | |
| Cautomaton::isUnorderedDFTA_impl< T > | |
| Cautomaton::isUnorderedNFTA_impl< T > | |
| Cext::fdaccessor | A class determining the used file descriptor from prefered (if available) and fallback file descriptor |
| Calib::FibonacciHeap< T, Comparator > | |
| Clabel::FinalStateLabel | Represents label of the final state of an automaton |
| Cgrammar::parsing::First | |
| Ctree::transform::FirstChildNextSibling | |
| Ctree::properties::FirstVariableOffsetFront | |
| Cgraph::generate::FixedUndirectedGraph | |
| Cgraph::generate::FixedWeightedSquareGrid8 | |
| Cgraph::generate::FixedWeightedUndirectedGraph | |
| Cgraph::shortest_path::FloydWarshall | |
| Cgrammar::parsing::Follow | |
| Cgraph::maximum_flow::FordFulkerson | |
| Cgraph::minimum_cut::FordFulkerson | |
| Cconvert::DotConverterRTE::Formal< SymbolType > | |
| Cregexp::convert::ToAutomatonThompson::Formal | |
| Cregexp::GlushkovFirst::Formal< SymbolType > | |
| Cregexp::GlushkovFollow::Formal< SymbolType > | |
| Cregexp::GlushkovIndexate::Formal< SymbolType > | |
| Cregexp::GlushkovLast::Formal< SymbolType > | |
| Cregexp::properties::RegExpEmpty::Formal< SymbolType > | |
| Cregexp::properties::RegExpEpsilon::Formal< SymbolType > | |
| Cregexp::RegExpToXmlComposer::Formal | |
| Crte::convert::ToFTAThompson::Formal< SymbolType > | |
| Crte::GlushkovFirst::Formal< SymbolType > | |
| Crte::GlushkovFollow::Formal< SymbolType > | |
| Crte::GlushkovFollowNaive::Formal< SymbolType > | |
| Crte::GlushkovIndexate::Formal< SymbolType > | |
| Crte::GlushkovPos::Formal< SymbolType > | |
| Crte::RTEToXmlComposer::Formal | |
| Cregexp::FormalRegExpStructure< SymbolType > | Represents formal regular expression structure. Regular expression is stored as a tree of FormalRegExpElements |
| ►CFormalRTEElement | |
| ►Cext::VararyNode< FormalRTEElement< SymbolType > > | |
| Crte::FormalRTESymbolAlphabet< SymbolType > | Represents the terminal symbol in the regular tree expression. The number of children must be the same as the arity of the symbol of the node |
| Crte::FormalRTEStructure< SymbolType > | Represents unbounded regular expression structure. Regular expression is stored as a tree of UnboundedRegExpElements |
| ►Crte::FormalRTESymbol< SymbolType > | Represents the common part of SubstitutionSymbol and TerminalSymbol |
| Crte::FormalRTESymbolAlphabet< SymbolType > | Represents the terminal symbol in the regular tree expression. The number of children must be the same as the arity of the symbol of the node |
| Crte::FormalRTESymbolSubst< SymbolType > | Represents the substitution symbol in the regular tree expression. The node can't have any children |
| Cconvert::TikZConverter::FormalRTEVisitor< SymbolType > | |
| ►Cstd::forward_list | |
| Cext::forward_list< T, Alloc > | Class extending the forward_list class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Cext::forward_tree< T > | Class introducing a forward_tree with interface trying to be close to the interface of standard library containers |
| Cautomaton::properties::ForwardBisimulation | |
| Ctree::exact::ForwardOccurrenceTest | |
| Cfactory::RawDataFactory::fromFile | |
| Cfactory::StringDataFactory::fromFile | |
| Cfactory::XmlDataFactory::fromFile | |
| Cfactory::RawDataFactory::fromRaw | |
| Cfactory::RawDataFactory::fromStdin | |
| Cfactory::StringDataFactory::fromStdin | |
| Cfactory::XmlDataFactory::fromStdin | |
| Cfactory::RawDataFactory::fromStream | |
| Cfactory::StringDataFactory::fromStream | |
| Cfactory::XmlDataFactory::fromStream | |
| Cfactory::RawDataFactory::fromString | |
| Cfactory::StringDataFactory::fromString | |
| Cfactory::XmlDataFactory::fromString | |
| Cfactory::XmlDataFactory::fromTokens | |
| Csax::FromXMLParserHelper | |
| Cindexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > | Full and linear tree index. The index serves as a adaptor of string index so that searching for tree patterns is possible. The representation of the index stores a string index and a subtree jump table. The implementation since parametrized with the string index represents a family of indexes |
| Carbology::indexing::FullAndLinearIndexConstruction | |
| Carbology::query::FullAndLinearIndexPatterns | |
| Cstringology::exact::GalilSeiferas | |
| Calphabet::GapSymbol | Represents a wildcard used as representation of anything here in a string or a tree |
| Cconvert::GasTexConverter | |
| Cstringology::simulations::GeneralizedLevenshteinBitParalelism | |
| Cstringology::simulations::GeneralizedLevenshteinDynamicProgramming | |
| Cstringology::matching::GeneralizedLevenshteinMatchingAutomaton | |
| Cstringology::matching::GeneralizedLevenshteinSequenceMatchingAutomaton | |
| Cgrammar::generate::GenerateUpToLength | |
| Ccommon::GlobalData | Class to represent some global modifiers and data |
| Cregexp::GlushkovFirst | |
| Crte::GlushkovFirst | |
| Cregexp::GlushkovFollow | |
| Crte::GlushkovFollow | |
| Crte::GlushkovFollowNaive | |
| Cregexp::GlushkovIndexate | |
| Crte::GlushkovIndexate | |
| Cregexp::GlushkovLast | |
| Cregexp::GlushkovPos | |
| Crte::GlushkovPos | |
| Cstring::properties::GoodSuffixShiftTable | |
| Cgrammar::transform::GrammarAlternation | |
| Ccompare::GrammarCompare | |
| Cgrammar::transform::GrammarConcatenation | |
| Ccompare::GrammarDiff | |
| Cgrammar::GrammarFromStringParserCommon | |
| Cgrammar::GrammarFromXMLParser | |
| Cgrammar::transform::GrammarIteration | |
| Cgrammar::GrammarNormalize | |
| Cgrammar::GrammarToStringComposerCommon | |
| Cgrammar::GrammarToXMLComposer | |
| ►Cgraph::GraphBase | |
| ►Cgraph::GraphInterface< TNode, TEdge > | |
| ►Cgraph::DirectedGraph< DefaultNodeType, DefaultWeightedEdgeType > | |
| Cgraph::WeightedDirectedGraph< TNode, TEdge > | |
| ►Cgraph::DirectedMultiGraph< DefaultNodeType, DefaultWeightedEdgeType > | |
| Cgraph::WeightedDirectedMultiGraph< TNode, TEdge > | |
| ►Cgraph::MixedGraph< DefaultNodeType, DefaultWeightedEdgeType > | |
| Cgraph::WeightedMixedGraph< TNode, TEdge > | |
| ►Cgraph::MixedMultiGraph< DefaultNodeType, DefaultWeightedEdgeType > | |
| Cgraph::WeightedMixedMultiGraph< TNode, TEdge > | |
| ►Cgraph::UndirectedGraph< DefaultNodeType, DefaultWeightedEdgeType > | |
| Cgraph::WeightedUndirectedGraph< TNode, TEdge > | |
| ►Cgraph::UndirectedMultiGraph< DefaultNodeType, DefaultWeightedEdgeType > | |
| Cgraph::WeightedUndirectedMultiGraph< TNode, TEdge > | |
| Cgraph::DirectedGraph< TNode, TEdge > | |
| Cgraph::DirectedMultiGraph< TNode, TEdge > | |
| Cgraph::MixedGraph< TNode, TEdge > | |
| Cgraph::MixedMultiGraph< TNode, TEdge > | |
| Cgraph::UndirectedGraph< TNode, TEdge > | |
| Cgraph::UndirectedMultiGraph< TNode, TEdge > | |
| Cgraph::GraphNormalize | |
| Cgraph::shortest_path::GreedyBestFS | |
| ►Cgrid::GridBase | |
| ►Cgrid::GridInterface< TCoordinate, TEdge > | |
| ►Cgrid::SquareGrid< TCoordinate, TEdge > | |
| Cgrid::SquareGrid4< TCoordinate, TEdge > | |
| Cgrid::SquareGrid8< TCoordinate, TEdge > | |
| Cgrid::WeightedSquareGrid4< TCoordinate, TEdge > | |
| Cgrid::WeightedSquareGrid8< TCoordinate, TEdge > | |
| Cgrid::GridFunction | |
| Ccore::xmlApi< object::Object >::GroupComposer | |
| Ccore::xmlApi< object::Object >::GroupParser | |
| Ccore::stringApi< object::Object >::GroupReader | |
| Ccore::stringApi< object::Object >::GroupWriter | |
| Cstringology::simulations::HammingBitParalelism | |
| Cstringology::simulations::HammingDynamicProgramming | |
| Cstringology::matching::HammingMatchingAutomaton | |
| Cstringology::matching::HammingSequenceMatchingAutomaton | |
| Cgrammar::parsing::HandleFirstFirstConflict | |
| Cgrammar::parsing::HandleFirstFollowConflict | |
| Cext::has_clone< T > | Type trait to determine existence of clone method. A boolean field namd value is set to true if provided class (possibly cv-qualified and via reference) has clone method |
| Ccore::has_eval< T > | Type trait to determine existence of eval static method. A boolean field namd value is set to true if provided class (possibly cv-qualified and via reference) has eval static method |
| Cstd::hash< node::Node > | |
| Cstd::hash< std::pair< node::Node, node::Node > > | |
| Cgraph::shortest_path::IDAStar | |
| Cgraph::traverse::IDDFS | |
| Cgraph::traverse::IDDFSBidirectional | |
| Cext::index_in< T, Ts > | Trait to get index of type T is in a types pack. The trait provides field value set to an integral value equal to the position of type T is in the pack of types Ts ..., sizeof ... ( Ts ) otherwise |
| Cindexes::IndexesNormalize | |
| Cindexes::IndexFromXMLParser | |
| Cindexes::IndexToXMLComposer | |
| Crelation::InducedEquivalence | |
| Cautomaton::properties::InfiniteLanguage | |
| Cext::Init | Class responsible for initialisation of std extensions and standard library changes |
| Clabel::InitialStateLabel | Represents label of the final state of an automaton |
| Calphabet::InitialSymbol | Represents initial symbol used as an initial symbol of a grammar |
| Cregistration::InputFileRegister | |
| Cabstraction::InputFileRegistry | |
| ►Cstd::integral_constant | |
| Cext::index_in< T > | Specialisation for empty pack, in which case the field is set to false |
| Cext::index_in< T, T, Ts ... > | Trait to test whether type T is in a types pack. The trait provides field value set to true if the type T is in pack of types Ts ..., false othervise |
| Cext::index_in< T, U, Ts ... > | Specialisation for non-empty pack where the first type in the pack is different from the tested type, in which case the field is set to result of the recursive test on shorter pack |
| Cstd::tuple_size< ext::pair< First, Second > > | Specialisation of tuple_size for extended pair |
| Cstd::tuple_size< ext::ptr_tuple< Types ... > > | Specialisation of tuple_size for extended tuple |
| Cstd::tuple_size< ext::tuple< Types ... > > | Specialisation of tuple_size for extended tuple |
| Cgrammar::properties::IsFITDefinition | |
| Cgrammar::properties::IsLanguageEmpty | |
| Cgrammar::properties::IsLanguageGeneratingEpsilon | |
| Crelation::IsReflexive | |
| Crelation::IsSymmetric | |
| Crelation::IsTransitive | |
| ►Cext::istream | |
| Cext::ifstream | |
| Cext::istringstream | |
| ►Cstd::istream | |
| Cext::ifdstream | A class implementing an input stream interface, with destination specified by file descriptor |
| ►Cext::deque< T, Alloc >::iterator | |
| Ccore::xmlApiInputContext | |
| Cext::iterator_range< Iterator > | Implementation of iterator_range, i.e. pair of iterators. The class provides most notably begin and end methods to allow the class be used in foreach context |
| Cgraph::spanning_tree::JarnikPrim | |
| Carbology::exact::KnuthMorrisPratt | |
| Cstringology::exact::KnuthMorrisPratt | |
| Ctree::properties::LastVariableOffsetBack | |
| Cconvert::LatexConverter | |
| Cgrammar::parsing::LeftFactorize | |
| Cgrammar::simplify::LeftRecursionRemover | |
| Cstringology::simulations::LevenshteinBitParalelism | |
| Cstringology::simulations::LevenshteinDynamicProgramming | |
| Cstringology::matching::LevenshteinMatchingAutomaton | |
| Cstringology::matching::LevenshteinSequenceMatchingAutomaton | |
| Ccli::Lexer | |
| Ccli::LibraryLoader | |
| Cext::linear_set< T, Compare, Alloc > | Implementation of set mimicking the iterface of the standard library set. The inner representation is using sorted vector of unique value |
| ►Ccli::LineInterface | |
| CReadlineLineInterface | |
| Ccli::IstreamLineInterface< Stream > | |
| Ccli::StringLineInterface | |
| ►Cstd::list | |
| Cext::list< T, Alloc > | Class extending the list class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Cgrammar::parsing::LL1ParseTable | |
| ►Cext::internal::logical_tuple_base | |
| ►Cext::internal::logical_tuple< T... > | |
| Cext::all_of< T > | |
| Cext::any_of< T > | |
| Cext::none_of< T > | |
| Cext::internal::logical_tuple< Ts > | |
| Cgrammar::parsing::LR0Parser | |
| Cgrammar::parsing::LRParser | |
| Cstringology::properties::LyndonFactoring | |
| Cstringology::compression::LZ77Compression | |
| Cstringology::compression::LZ77Decompression | |
| Cgrammar::simplify::MakeFITDefinition | |
| Cext::managed_linear_set< T, Compare, Alloc > | Implementation of set mimicking the iterface of the standard library set. The inner representation is using sorted vector of unique value |
| Cext::managed_value< T > | Implementation of managed value mimicking the behavior of the underlying value. The class is designed to fire change events when the value is modified |
| Cgraph::heuristic::ManhattenDistance | |
| ►Cstd::map | |
| Cext::map< T, R, Cmp, Alloc > | Class extending the map class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Cext::map_move_iterator< Iterator, KeyType, ValueType > | Adaptor iterator to allow values to be moved from a map. Internaly calls reinterpret cast to dereference result of underlying map iterator |
| Cstring::properties::MaximalSuffix | |
| Cmeasurements::MeasurementEngine | |
| Cmeasurements::MeasurementFrame | |
| Cmeasurements::MeasurementResults | |
| Cmeasurements::MeasurementXalloc | |
| Cmeasurements::MemoryDataFrame | |
| Cmeasurements::MemoryHint | |
| Cautomaton::simplify::Minimize | |
| Cautomaton::simplify::MinimizeBrzozowski | |
| Cautomaton::simplify::MinimizeByPartitioning | |
| Cautomaton::generate::MinimizeGenerator | |
| Cautomaton::simplify::MinimizeVerbose | |
| Cgraph::shortest_path::MM | |
| Ccli::builtin::Move | |
| ►Cstd::multimap | |
| Cext::multimap< T, R, Cmp, Alloc > | Class extending the multimap class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| ►Cstd::multiset | |
| Cext::multiset< T, Cmp, Alloc > | |
| Cstringology::matching::NaiveDAWGMatcherConstruction | |
| Calib::ExceptionHandler::NestedExceptionContainer | |
| Calib::BinomialHeap< T, Comparator >::Node | |
| Calib::FibonacciHeap< T, Comparator >::Node | |
| Ctree::generate::Node | |
| ►Cnode::NodeBase | |
| Cnode::Node | |
| Calphabet::NodeWildcardSymbol | Represents a wildcard used as representation of anything here in a string or a tree |
| Cstringology::indexing::NondeterministicApproximateSuffixAutomatonForHammingDistance | |
| Cstringology::indexing::NondeterministicApproximateSuffixEpsilonAutomatonForHammingDistance | |
| Cstringology::indexing::NondeterministicExactFactorAutomaton | |
| Cstringology::indexing::NondeterministicExactSuffixAutomaton | |
| Cstringology::indexing::NondeterministicExactSuffixEpsilonAutomaton | |
| Carbology::indexing::NonlinearCompressedBitParallelIndexConstruction | |
| Carbology::query::NonlinearCompressedBitParallelismPatterns | |
| Cindexes::arbology::NonlinearFullAndLinearIndex< SymbolType, StringIndex > | Full and linear tree index. The index serves as a adaptor of string index so that searching for tree patterns is possible. The representation of the index stores a string index and a subtree jump table. The implementation since parametrized with the string index represents a family of indexes. The index is supposed to be able to provide data to search for nonlinear tree patterns. Therefore it also contains representation of subtree repeats |
| Carbology::indexing::NonlinearFullAndLinearIndexConstruction | |
| Carbology::query::NonlinearFullAndLinearIndexPatterns | |
| Calphabet::NonlinearVariableSymbol< SymbolType > | Represents the nonlinear variable symbol used in a nonlinear tree pattern |
| Cgrammar::properties::NonterminalUnitRuleCycle | |
| Cregistration::NormalizationRegisterEmpty | |
| ►CNormalizationRegisterImplBase | |
| Cregistration::NormalizationRegisterImpl< ReturnType > | |
| Cautomaton::simplify::Normalize | |
| Ccore::normalize< T > | |
| Ccore::normalize< alphabet::NonlinearVariableSymbol< SymbolType > > | |
| Ccore::normalize< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > > | |
| Ccore::normalize< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > > | |
| Ccore::normalize< automaton::CompactDFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::CompactNFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::DFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::DFTA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::EpsilonNFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::EpsilonNFTA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::ExtendedNFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::ExtendedNFTA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::MultiInitialStateNFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::NFA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::NFTA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::NondeterministicZAutomaton< SymbolType, StateType > > | |
| Ccore::normalize< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::OneTapeDTM< SymbolType, StateType > > | |
| Ccore::normalize< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::UnorderedDFTA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::UnorderedNFTA< SymbolType, StateType > > | |
| Ccore::normalize< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::normalize< common::ranked_symbol< SymbolType > > | |
| Ccore::normalize< grammar::CFG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::CNF< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::ContextPreservingUnrestrictedGrammar< SymbolType > > | |
| Ccore::normalize< grammar::CSG< SymbolType > > | |
| Ccore::normalize< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::GNF< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::LG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::NonContractingGrammar< SymbolType > > | |
| Ccore::normalize< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::normalize< grammar::UnrestrictedGrammar< SymbolType > > | |
| Ccore::normalize< graph::DirectedGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::DirectedMultiGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::MixedGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::MixedMultiGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::UndirectedGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::UndirectedMultiGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::WeightedDirectedGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::WeightedDirectedMultiGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::WeightedMixedGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::WeightedMixedMultiGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::WeightedUndirectedGraph< TNode, TEdge > > | |
| Ccore::normalize< graph::WeightedUndirectedMultiGraph< TNode, TEdge > > | |
| Ccore::normalize< grid::SquareGrid4< TCoordinate, TEdge > > | |
| Ccore::normalize< grid::SquareGrid8< TCoordinate, TEdge > > | |
| Ccore::normalize< grid::WeightedSquareGrid4< TCoordinate, TEdge > > | |
| Ccore::normalize< grid::WeightedSquareGrid8< TCoordinate, TEdge > > | |
| Ccore::normalize< indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > > | |
| Ccore::normalize< indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > > | |
| Ccore::normalize< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType > > | |
| Ccore::normalize< indexes::arbology::NonlinearFullAndLinearIndex< SymbolType, StringIndex > > | |
| Ccore::normalize< indexes::stringology::BitParallelIndex< SymbolType > > | |
| Ccore::normalize< indexes::stringology::BitSetIndex< SymbolType, BitmaskBitCount > > | |
| Ccore::normalize< indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType > > | |
| Ccore::normalize< indexes::stringology::CompressedBitParallelIndex< SymbolType > > | |
| Ccore::normalize< indexes::stringology::FactorOracleAutomaton< SymbolType > > | |
| Ccore::normalize< indexes::stringology::PositionHeap< common::ranked_symbol< SymbolType > > > | |
| Ccore::normalize< indexes::stringology::PositionHeap< SymbolType > > | |
| Ccore::normalize< indexes::stringology::SuffixArray< SymbolType > > | |
| Ccore::normalize< indexes::stringology::SuffixAutomaton< SymbolType > > | |
| Ccore::normalize< indexes::stringology::SuffixTrie< SymbolType > > | |
| Ccore::normalize< regexp::FormalRegExp< SymbolType > > | |
| Ccore::normalize< regexp::UnboundedRegExp< SymbolType > > | |
| Ccore::normalize< rte::FormalRTE< SymbolType > > | |
| Ccore::normalize< string::CyclicString< SymbolType > > | |
| Ccore::normalize< string::LinearString< common::ranked_symbol< SymbolType > > > | |
| Ccore::normalize< string::LinearString< SymbolType > > | |
| Ccore::normalize< string::WildcardLinearString< SymbolType > > | |
| Ccore::normalize< tree::PostfixRankedTree< SymbolType > > | |
| Ccore::normalize< tree::PrefixBarTree< SymbolType > > | |
| Ccore::normalize< tree::PrefixRankedBarNonlinearPattern< SymbolType > > | |
| Ccore::normalize< tree::PrefixRankedBarPattern< SymbolType > > | |
| Ccore::normalize< tree::PrefixRankedBarTree< SymbolType > > | |
| Ccore::normalize< tree::PrefixRankedExtendedPattern< SymbolType > > | |
| Ccore::normalize< tree::PrefixRankedNonlinearPattern< SymbolType > > | |
| Ccore::normalize< tree::PrefixRankedPattern< SymbolType > > | |
| Ccore::normalize< tree::PrefixRankedTree< SymbolType > > | |
| Ccore::normalize< tree::RankedExtendedPattern< SymbolType > > | |
| Ccore::normalize< tree::RankedNonlinearPattern< SymbolType > > | |
| Ccore::normalize< tree::RankedPattern< SymbolType > > | |
| Ccore::normalize< tree::RankedTree< SymbolType > > | |
| Ccore::normalize< tree::UnorderedRankedPattern< SymbolType > > | |
| Ccore::normalize< tree::UnorderedRankedTree< SymbolType > > | |
| Ccore::normalize< tree::UnorderedUnrankedPattern< SymbolType > > | |
| Ccore::normalize< tree::UnorderedUnrankedTree< SymbolType > > | |
| Ccore::normalize< tree::UnrankedExtendedPattern< SymbolType > > | |
| Ccore::normalize< tree::UnrankedNonlinearPattern< SymbolType > > | |
| Ccore::normalize< tree::UnrankedPattern< SymbolType > > | |
| Ccore::normalize< tree::UnrankedTree< SymbolType > > | |
| Cstring::simplify::NormalizeAlphabet | |
| Cfactory::NormalizeFactory | |
| Cfactory::NormalizeFactory::normalizer< SourceType > | |
| Cabstraction::NormalizeRegistry | |
| Cstring::simplify::NormalizeRotation | |
| Ctree::simplify::NormalizeTreeLabels | |
| Cstringology::exact::NotSoNaive | |
| Cgrammar::properties::NullableNonterminals | |
| Cautomaton::generate::NumberModuloAutomaton | |
| Cautomaton::generate::NumberOfSymbolsAutomaton | |
| Cstringology::properties::NyldonFactoring | |
| Cobject::Object | |
| Cautomaton::run::Occurrences | Implementation of automaton run over its input reporting occurrences |
| Cabstraction::OperatorRegistry | |
| Cabstraction::Operators | |
| ►Ccli::Option | |
| Ccli::CategoryOption | |
| Ccli::TypeOption | |
| Cext::optional_ref< T > | |
| Cstringology::matching::OracleMatcherConstruction | |
| ►Cext::ostream | |
| Cext::ofdstream | A class implementing an output stream interface, with destination specified by file descriptor |
| Cext::ofstream | |
| Cext::ostringstream | |
| Cregistration::OutputFileRegister | |
| Cabstraction::OutputFileRegistry | |
| ►Cstd::pair | |
| ►Cext::pair< TNode, TNode > | |
| Cedge::CapacityEdge< TNode, TCapacity > | |
| Cedge::Edge< TNode > | |
| Cedge::WeightedEdge< TNode, TWeight > | |
| Cext::pair< T, R > | Class extending the pair class from the standard library. Original reason is to allow printing of the pair with overloaded operator << |
| CdataAccess::PairSetFirst | |
| CdataAccess::PairSetSecond | |
| Craw::Parse< Type > | |
| Cstring::Parse< Group > | |
| Cxml::Parse | |
| Ccli::Parser | |
| Cautomaton::transform::PDAToRHPDA | |
| Cstring::properties::PeriodicPrefix | |
| Ccommon::Permutation | |
| Cext::PolyComp< T > | |
| Cindexes::stringology::PositionHeap< SymbolType > | Position heap string index. Tree like representation of all suffixes. The suffixes are themselves represented by their prefixes. The prefix of each suffix needs to be unique from all representants (prefixes again) of shorter suffixes. Nodes of the trie contain index of the suffix. The parent child relationship of nodes is represented by single symbol. The class does not checks whether the trie structure actually is position heap |
| Cstringology::query::PositionHeapFactors | |
| Cstringology::indexing::PositionHeapNaive | |
| Ccompare::PrimitiveCompare | |
| Cext::internal::printable< typename, typename > | |
| Cext::internal::printable< std::tuple< Ts... >, std::void_t< decltype(std::declval< std::ostream & >()<< std::declval< const Ts & >())... > > | |
| Cgrammar::properties::ProductiveNonterminals | |
| CPrompt | |
| Cext::ptr_array< T, N > | Implementation of array storing dynamicaly allocated instances of given type. The class mimicks the iterface of the standard library array, but effectively allows polymorphic objects to be stored inside |
| Cext::ptr_tuple< Types > | Implementation of tuple storing dynamicaly allocated instances of given type. The class mimicks the iterface of the standard library tuple, but effectively allows polymorphic objects to be stored inside |
| Cext::ptr_value< T > | Class representing wrapper of dynamically allocated object behaving like rvalue reference |
| Cext::ptr_vector< T > | Implementation of vector storing dynamicaly allocated instances of given type. The class mimicks the iterface of the standard library vector, but effectively allows polymorphic objects to be stored inside |
| Carbology::exact::QuickSearch | |
| Cstringology::exact::QuickSearch | |
| Cstring::properties::QuickSearchBadCharacterShiftTable | |
| Ctree::properties::QuickSearchBadCharacterShiftTable | |
| Cstringology::exact::QuiteNaive | |
| Cdebug::Random< T > | |
| Cext::random_devices | Definition of randomness sources. Provided sources are c++ builtin random_device and own semirandom_device. The random device is the best randomness source but its generation is slow. Semirandom device is good enough and it provices random values fast. Given a seed the semirandom device can also provide reproducible sequence any number of times |
| Cautomaton::generate::RandomAutomatonFactory | |
| Cautomaton::generate::RandomAutomatonFactory2 | |
| Cautomaton::generate::RandomAutomatonFactory3 | |
| Cgrammar::generate::RandomGrammarFactory | |
| Cgraph::generate::RandomGraphFactory | |
| Cgraph::generate::RandomGridFactory | |
| Cautomaton::generate::RandomizeAutomaton | |
| Cgrammar::generate::RandomizeGrammar | |
| Ctree::generate::RandomRankedExtendedPatternFactory | |
| Ctree::generate::RandomRankedNonlinearPatternFactory | |
| Ctree::generate::RandomRankedPatternFactory | |
| Ctree::generate::RandomRankedTreeFactory | |
| Cregexp::generate::RandomRegExpFactory | |
| Cstring::generate::RandomStringFactory | |
| Cstring::generate::RandomSubstringFactory | |
| Cautomaton::generate::RandomTreeAutomatonFactory | |
| Ctree::generate::RandomUnrankedExtendedPatternFactory | |
| Ctree::generate::RandomUnrankedPatternFactory | |
| Ctree::generate::RandomUnrankedTreeFactory | |
| Ccommon::ranked_symbol< SymbolType > | |
| Ccore::rawApi< T > | |
| Ccore::rawApi< string::LinearString< SymbolType > > | |
| Ccore::rawApi< tree::UnrankedTree< SymbolType > > | |
| Cfactory::RawDataFactory | |
| Cregistration::RawReaderRegister< Type > | |
| Cabstraction::RawReaderRegistry | |
| Cgrammar::RawRules | |
| Cregistration::RawWriterRegister< Type > | |
| Cabstraction::RawWriterRegistry | |
| Cautomaton::properties::efficient::ReachableStates | |
| Cautomaton::properties::ReachableStates | |
| Cgrammar::properties::ReachableSymbols | |
| Ccli::builtin::ReadFile | |
| CReadlinePromptCompletion | |
| CReadlinePromptHistory | |
| Cmeasurements::stealth_allocator< T >::rebind< U > | |
| Cgraph::common::ReconstructPath | |
| Cgrammar::properties::RecursiveNonterminal | |
| Cext::reference_mover< T > | Adaptor class to change begin and end behavior for rvalue qualified begin and end. This class keeps rvalue reference of the adapted instance |
| ►Cstd::reference_wrapper | |
| Cext::reference_wrapper< T > | Class extending the reference wrapper class from the standard library. Original reason is to allow its use with standard stream aggregation class |
| Cregexp::transform::RegExpAlternate | |
| Cregexp::transform::RegExpConcatenate | |
| Cregexp::transform::RegExpDerivation | |
| Cregexp::properties::RegExpEmpty | |
| Cregexp::properties::RegExpEpsilon | |
| Cregexp::RegExpFromXmlParser | |
| Cregexp::transform::RegExpIntegral | |
| Cregexp::transform::RegExpIterate | |
| Cregexp::simplify::RegExpOptimize | |
| Cregexp::RegExpToXmlComposer | |
| Cext::Register< T > | |
| ►Cext::Register< void > | |
| Cregistration::AbstractRegister< Algorithm, ReturnType, ParameterTypes > | |
| Cregistration::BinaryOperatorRegister< Type, FirstParamType, SecondParamType > | |
| Cregistration::MethodRegister< Algorithm, ReturnType, ObjectType, ParameterTypes > | |
| Cregistration::MethodRegister< Algorithm, ReturnType, const ObjectType, ParameterTypes ... > | |
| Cregistration::PostfixOperatorRegister< Type, ParamType > | |
| Cregistration::PrefixOperatorRegister< Type, ParamType > | |
| Cregistration::WrapperRegister< Algorithm, ReturnType, ParameterTypes > | |
| Cabstraction::Registry | |
| ►Cequations::RegularEquationSolver< TerminalSymbolType, VariableSymbolType > | |
| Cequations::LeftRegularEquationSolver< TerminalSymbolType, VariableSymbolType > | |
| Cequations::RightRegularEquationSolver< TerminalSymbolType, VariableSymbolType > | |
| Crelation::RelationComplement | |
| Cautomaton::simplify::RemoveUnused | |
| Cautomaton::simplify::Rename | |
| Cgrammar::simplify::Rename | |
| Cstring::properties::Repetition | |
| Cstringology::cover::RestrictedApproximateCoversComputation | |
| Cstringology::seed::RestrictedApproximateSeedComputation | |
| Cautomaton::run::Result | Implementation of automaton run over its input returning the reached state |
| Ccli::ResultInterpret | |
| Cstd::experimental::details::return_type_helper< D,... > | |
| Cautomaton::transform::Reverse | |
| Cstring::properties::ReversedBadCharacterShiftTable | |
| Ctree::properties::ReversedBadCharacterShiftTable | |
| Carbology::exact::ReversedBoyerMooreHorspool | |
| Cstringology::exact::ReversedBoyerMooreHorspool | |
| Carbology::exact::ReversedQuickSearch | |
| Ctree::properties::ReversedQuickSearchBadCharacterShiftTable | |
| Cext::reverser< T > | Adaptor class to change begin and end behavior for reverse begin and reverse end and vise versa |
| Cautomaton::transform::RHPDAToPDA | |
| Crte::RTEFromXmlParser | |
| Crte::simplify::RTEOptimize | |
| Crte::RTEToXmlComposer | |
| Cautomaton::run::Run | Implementation of automaton run over its input |
| ►Cregexp::UnboundedRegExpElement< SymbolType >::RvalueVisitor | |
| Cregexp::UnboundedRegExpElement< SymbolType >::RvalueVisitorContext< ReturnType, Visitorr, Params > | |
| Csax::SaxComposeInterface | |
| Csax::SaxParseInterface | |
| Cext::sequence< IntegralType > | Representation of integer sequence usable in foreach form of for loop |
| Cstringology::matching::SequenceMatchingAutomaton | |
| Cstringology::exact::SequentialSampling | |
| ►Cstd::set | |
| Cext::set< T, Cmp, Alloc > | |
| Cext::set_move_iterator< Iterator > | Adaptor iterator to allow values to be moved from a set. Internaly calls const cast to dereference result of underlying set iterator |
| Ccompare::SetCompare | |
| Ccore::SetComponent< Derived, SetComponentType, ComponentType, ComponentName > | |
| ►Ccore::SetComponent< Derived, ComponentType, ComponentType::value_type, ComponentName > | |
| Ccore::Component< Derived, ComponentType, component::Set, ComponentName > | |
| Ccore::SetConstraint< Derived, ComponentType, ComponentName > | |
| Ccore::SetConstraint< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::CompactDFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::CompactDFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::CompactDFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::CompactNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::DFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::DFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::DFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::DFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::DFTA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::DFTA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::EpsilonNFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::EpsilonNFTA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::EpsilonNFTA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialStates > | |
| Ccore::SetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, StateType, automaton::InitialStates > | |
| Ccore::SetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::NFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::NFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::NFTA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::NFTA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::NondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::NondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::NondeterministicZAutomaton< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, OutputSymbolType, automaton::OutputAlphabet > | |
| Ccore::SetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, SymbolType, automaton::TapeAlphabet > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialStates > | |
| Ccore::SetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::UnorderedNFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > | |
| Ccore::SetConstraint< automaton::UnorderedNFTA< SymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::UnorderedNFTA< SymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::CallAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::LocalAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::ReturnAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::CallAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::LocalAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::ReturnAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialStates > | |
| Ccore::SetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States > | |
| Ccore::SetConstraint< grammar::CFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::CFG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::CNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::CNF< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::ContextPreservingUnrestrictedGrammar< SymbolType >, SymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::ContextPreservingUnrestrictedGrammar< SymbolType >, SymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::CSG< SymbolType >, SymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::CSG< SymbolType >, SymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::GNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::GNF< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::LG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::LG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::NonContractingGrammar< SymbolType >, SymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::NonContractingGrammar< SymbolType >, SymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::NonterminalAlphabet > | |
| Ccore::SetConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::TerminalAlphabet > | |
| Ccore::SetConstraint< indexes::arbology::CompressedBitParallelTreeIndex< SymbolType >, common::ranked_symbol< SymbolType >, indexes::arbology::GeneralAlphabet > | |
| Ccore::SetConstraint< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType >, common::ranked_symbol< SymbolType >, indexes::arbology::GeneralAlphabet > | |
| Ccore::SetConstraint< indexes::stringology::BitParallelIndex< SymbolType >, SymbolType, indexes::stringology::GeneralAlphabet > | |
| Ccore::SetConstraint< indexes::stringology::CompressedBitParallelIndex< SymbolType >, SymbolType, indexes::stringology::GeneralAlphabet > | |
| Ccore::SetConstraint< indexes::stringology::SuffixTrie< SymbolType >, SymbolType, indexes::stringology::GeneralAlphabet > | |
| Ccore::SetConstraint< indexes::SuffixTrieTerminatingSymbol, DefaultSymbolType, indexes::GeneralAlphabet > | |
| Ccore::SetConstraint< regexp::FormalRegExp< SymbolType >, SymbolType, regexp::GeneralAlphabet > | |
| Ccore::SetConstraint< regexp::UnboundedRegExp< SymbolType >, SymbolType, regexp::GeneralAlphabet > | |
| Ccore::SetConstraint< rte::FormalRTE< SymbolType >, common::ranked_symbol< SymbolType >, rte::ConstantAlphabet > | |
| Ccore::SetConstraint< rte::FormalRTE< SymbolType >, common::ranked_symbol< SymbolType >, rte::GeneralAlphabet > | |
| Ccore::SetConstraint< string::CyclicString< SymbolType >, SymbolType, string::GeneralAlphabet > | |
| Ccore::SetConstraint< string::LinearString< SymbolType >, SymbolType, string::GeneralAlphabet > | |
| Ccore::SetConstraint< string::LinearStringTerminatingSymbol, DefaultSymbolType, string::GeneralAlphabet > | |
| Ccore::SetConstraint< string::WildcardLinearString< SymbolType >, SymbolType, string::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PostfixRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixBarTree< SymbolType >, SymbolType, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::BarSymbols > | |
| Ccore::SetConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NonlinearAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::BarSymbols > | |
| Ccore::SetConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedBarTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::BarSymbols > | |
| Ccore::SetConstraint< tree::PrefixRankedBarTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NodeWildcards > | |
| Ccore::SetConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NonlinearAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::PrefixRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::RankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::RankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NodeWildcards > | |
| Ccore::SetConstraint< tree::RankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::RankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NonlinearAlphabet > | |
| Ccore::SetConstraint< tree::RankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::RankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnorderedRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnorderedRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnorderedUnrankedPattern< SymbolType >, SymbolType, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnorderedUnrankedTree< SymbolType >, SymbolType, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::NonlinearAlphabet > | |
| Ccore::SetConstraint< tree::UnrankedPattern< SymbolType >, SymbolType, tree::GeneralAlphabet > | |
| Ccore::SetConstraint< tree::UnrankedTree< SymbolType >, SymbolType, tree::GeneralAlphabet > | |
| Cregistration::SetRegister< Param > | |
| ►Cstd::shared_ptr | |
| Cext::cow_shared_ptr< T > | Specialisation of copy on write pointer for classes based with copy on write pointer base |
| Cext::SigHandler | Singleton class providing interupt or segmentation fault signal handler |
| Cgrammar::simplify::SimpleRulesRemover | |
| Cautomaton::simplify::SingleInitialState | |
| Cautomaton::simplify::SingleInitialStateEpsilonTransition | |
| Cstats::SizeStat | |
| Cext::SliceComp< Ts > | |
| Cgrammar::parsing::SLR1ParseTable | |
| Cext::smart_ptr< T > | Managed pointer simulating value like behavior |
| Ccommon::SparseBoolVector | |
| Ccommon::SparseBoolVector::SparseBoolVectorOnesIterator | |
| Cgraph::shortest_path::SPFA | |
| Cgrid::SqaureGrid< TCoordinate, TEdge > | |
| Cgraph::parser::SquareGridMapParser | |
| Calphabet::StartSymbol | Represents start symbol used as initializing symbol of a string |
| Cstringology::cover::ApproximateEnhancedCoversCommon::State | |
| ►Cstd_variant | |
| Cext::variant< Ts > | Implementation of the variant class allowing to store any type of those listed in the template parameters. Void type is allowed, multiply specified same type is irrelevant |
| Cmeasurements::stealth_allocator< T > | |
| ►Cstd::streambuf | |
| Cext::fdstreambuf | Class representing buffered stream designed to work on defined file descriptor instead of usual file name |
| Ccommon::Streams | Aggregation class for various standard streams defined by the library |
| ►Cstd::string | |
| Cext::string | |
| Ccore::stringApi< T > | |
| Ccore::stringApi< alphabet::BarSymbol > | |
| Ccore::stringApi< alphabet::BlankSymbol > | |
| Ccore::stringApi< alphabet::BottomOfTheStackSymbol > | |
| Ccore::stringApi< alphabet::EndSymbol > | |
| Ccore::stringApi< alphabet::GapSymbol > | |
| Ccore::stringApi< alphabet::InitialSymbol > | |
| Ccore::stringApi< alphabet::NonlinearVariableSymbol< SymbolType > > | |
| Ccore::stringApi< alphabet::StartSymbol > | |
| Ccore::stringApi< alphabet::VariablesBarSymbol > | |
| Ccore::stringApi< alphabet::WildcardSymbol > | |
| Ccore::stringApi< automaton::DFA< SymbolType, StateType > > | |
| Ccore::stringApi< automaton::DFTA< SymbolType, StateType > > | |
| Ccore::stringApi< automaton::EpsilonNFA< SymbolType, StateType > > | |
| Ccore::stringApi< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType > > | |
| Ccore::stringApi< automaton::MultiInitialStateNFA< SymbolType, StateType > > | |
| Ccore::stringApi< automaton::NFA< SymbolType, StateType > > | |
| Ccore::stringApi< automaton::NFTA< SymbolType, StateType > > | |
| Ccore::stringApi< bool > | |
| Ccore::stringApi< char > | |
| Ccore::stringApi< common::ranked_symbol< SymbolType > > | |
| Ccore::stringApi< common::symbol_or_epsilon< SymbolType > > | |
| Ccore::stringApi< ext::pair< FirstType, SecondType > > | |
| Ccore::stringApi< ext::set< ValueType > > | |
| Ccore::stringApi< ext::variant< Types ... > > | |
| Ccore::stringApi< ext::vector< ValueType > > | |
| Ccore::stringApi< grammar::CFG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::CNF< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::ContextPreservingUnrestrictedGrammar< SymbolType > > | |
| Ccore::stringApi< grammar::CSG< SymbolType > > | |
| Ccore::stringApi< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::GNF< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::LG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::NonContractingGrammar< SymbolType > > | |
| Ccore::stringApi< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::stringApi< grammar::UnrestrictedGrammar< SymbolType > > | |
| Ccore::stringApi< int > | |
| Ccore::stringApi< label::FailStateLabel > | |
| Ccore::stringApi< label::FinalStateLabel > | |
| Ccore::stringApi< label::InitialStateLabel > | |
| Ccore::stringApi< object::Object > | |
| Ccore::stringApi< object::Void > | |
| Ccore::stringApi< regexp::FormalRegExp< SymbolType > > | |
| Ccore::stringApi< regexp::FormalRegExpStructure< SymbolType > > | |
| Ccore::stringApi< regexp::UnboundedRegExp< SymbolType > > | |
| Ccore::stringApi< regexp::UnboundedRegExpStructure< SymbolType > > | |
| Ccore::stringApi< rte::FormalRTE< SymbolType > > | |
| Ccore::stringApi< rte::FormalRTEStructure< SymbolType > > | |
| Ccore::stringApi< std::pair< FirstType, SecondType > > | |
| Ccore::stringApi< std::string > | |
| Ccore::stringApi< string::CyclicString< SymbolType > > | |
| Ccore::stringApi< string::LinearString< SymbolType > > | |
| Ccore::stringApi< tree::RankedExtendedPattern< SymbolType > > | |
| Ccore::stringApi< tree::RankedNonlinearPattern< SymbolType > > | |
| Ccore::stringApi< tree::RankedPattern< SymbolType > > | |
| Ccore::stringApi< tree::RankedTree< SymbolType > > | |
| Ccore::stringApi< tree::UnrankedExtendedPattern< SymbolType > > | |
| Ccore::stringApi< tree::UnrankedNonlinearPattern< SymbolType > > | |
| Ccore::stringApi< tree::UnrankedPattern< SymbolType > > | |
| Ccore::stringApi< tree::UnrankedTree< SymbolType > > | |
| Ccore::stringApi< unsigned > | |
| Ccore::stringApi< unsigned long > | |
| Ccompare::StringCompare | |
| Cstring::transform::StringConcatenate | |
| Cfactory::StringDataFactory | |
| Ccompare::StringDiff | |
| Cstring::StringFromStringParserCommon | |
| Cstring::StringFromXmlParserCommon | |
| Cregistration::StringReaderGroupRegister< Group > | |
| Cregistration::StringReaderRegister< Group, Type > | |
| Cregistration::StringReaderRegisterTypeInGroup< Group, Type > | |
| Cabstraction::StringReaderRegistry | |
| Cstring::transform::StringReverse | |
| Cstring::StringToStringComposerCommon | |
| Cstring::StringToXmlComposerCommon | |
| Cregistration::StringWriterRegister< Type > | |
| Cregistration::StringWriterRegisterTypeInGroup< Group, Type > | |
| Cabstraction::StringWriterRegistry | |
| Cext::strip_reference_wrapper< T > | |
| Cext::strip_reference_wrapper< std::reference_wrapper< T > > | |
| Cgrammar::parsing::Substitute | |
| Ctree::properties::SubtreeJumpTable | |
| Cindexes::stringology::SuffixArray< SymbolType > | Suffix array string index. Linear representation of all suffixes ordered lexicographically. Suffixes are represented as indexes to the indexed string and alphabet is stored within the string as well. Therefore the string is stored allong with Tree like representation of all suffixes. The class does not checks whether the suffixes order is correct |
| Cstringology::query::SuffixArrayFactors | |
| Cstringology::indexing::SuffixArrayNaive | |
| Cindexes::stringology::SuffixAutomaton< SymbolType > | Suffix automaton string index. Automaton representation of all suffixes. The automaton is general deterministic automaton. The class does not checks whether the automaton actually is a suffix automaton. The index alphabet is stored within the automaton |
| Cstringology::query::SuffixAutomatonFactors | |
| Cstringology::query::SuffixTrieFactors | |
| Cstringology::indexing::SuffixTrieNaive | |
| Cindexes::SuffixTrieNodeTerminatingSymbol | |
| Cgraph::common::SupportFunction | |
| Cext::supports< class > | |
| Ccommon::symbol_or_epsilon< SymbolType > | |
| Calphabet::SymbolNormalize | |
| Cautomaton::properties::SynchronizingWordExistence | |
| Cstringology::exact::TailedSubstring | |
| ►Cabstraction::TemporariesHolder | |
| Ccli::Environment | |
| Cconvert::TikZConverter | |
| Cmeasurements::TimeDataFrame | |
| Cautomaton::simplify::ToArcFactored | |
| Cgrammar::convert::ToAutomaton | |
| Cregexp::convert::ToAutomaton | |
| Cgrammar::convert::ToAutomatonBottomUp | |
| Cregexp::convert::ToAutomatonDerivation | |
| Cregexp::convert::ToAutomatonGlushkov | |
| Cregexp::convert::ToAutomatonThompson | |
| Cgrammar::convert::ToAutomatonTopDown | |
| Cgrammar::simplify::ToCNF | |
| Crte::convert::ToFTAGlushkov | |
| Crte::convert::ToFTAThompson | |
| Cgrammar::simplify::ToGNF | |
| Cautomaton::convert::ToGrammar | |
| Cregexp::convert::ToGrammar | |
| Cautomaton::convert::ToGrammarLeftRG | |
| Cgrammar::convert::ToGrammarLeftRG | |
| Cautomaton::convert::ToGrammarRightRG | |
| Cgrammar::convert::ToGrammarRightRG | |
| Cregexp::convert::ToGrammarRightRGDerivation | |
| Cregexp::convert::ToGrammarRightRGGlushkov | |
| Ccli::Lexer::Token | |
| Cext::Lexer< SuperLexer >::Token | |
| Csax::Token | |
| Cautomaton::convert::ToPostfixPushdownAutomaton | |
| Crte::convert::ToPostfixPushdownAutomaton | |
| Crte::convert::ToPostfixPushdownAutomatonGlushkov | |
| Crte::convert::ToPostfixPushdownAutomatonGlushkovNaive | |
| Cautomaton::convert::ToPrefixPushdownAutomaton | |
| Cautomaton::convert::ToRegExp | |
| Cgrammar::convert::ToRegExp | |
| Cautomaton::convert::ToRegExpAlgebraic | |
| Cgrammar::convert::ToRegExpAlgebraic | |
| Cautomaton::convert::ToRegExpKleene | |
| Cautomaton::convert::ToRegExpStateElimination | |
| Cautomaton::convert::ToRTEStateElimination | |
| Cautomaton::simplify::Total | |
| Cautomaton::run::Translate | Implementation of transducer run over its input |
| Cext::tree< T > | Class introducing a tree with interface trying to be close to the interface of standard library containers |
| Ctree::TreeAuxiliary | |
| Ccompare::TreeCompare | |
| Ctree::TreeFromStringParserCommon | |
| Ctree::TreeFromXMLParser | |
| Ctree::TreeNormalize | |
| Ctree::TreeToStringComposerCommon | |
| Ctree::TreeToXMLComposer | |
| Cext::trie< Key, Value > | Class introducing a trie with interface trying to be close to the interface of standard library containers |
| Ccompare::TrieCompare | |
| Cautomaton::simplify::efficient::Trim | |
| Cautomaton::simplify::Trim | |
| Cgrammar::simplify::Trim | |
| ►Cstd::true_type | |
| Cautomaton::isAFDZA_impl< ArcFactoredDeterministicZAutomaton< SymbolType, StateType > > | |
| Cautomaton::isAFNZA_impl< ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > > | |
| Cautomaton::isCompactDFA_impl< CompactDFA< SymbolType, StateType > > | |
| Cautomaton::isCompactNFA_impl< CompactNFA< SymbolType, StateType > > | |
| Cautomaton::isDFA_impl< DFA< SymbolType, StateType > > | |
| Cautomaton::isDFTA_impl< DFTA< SymbolType, StateType > > | |
| Cautomaton::isEpsilonNFA_impl< EpsilonNFA< SymbolType, StateType > > | |
| Cautomaton::isEpsilonNFTA_impl< EpsilonNFTA< SymbolType, StateType > > | |
| Cautomaton::isExtendedNFA_impl< ExtendedNFA< SymbolType, StateType > > | |
| Cautomaton::isMultiInitialStateEpsilonNFA_impl< MultiInitialStateEpsilonNFA< SymbolType, StateType > > | |
| Cautomaton::isMultiInitialStateNFA_impl< MultiInitialStateNFA< SymbolType, StateType > > | |
| Cautomaton::isNFA_impl< NFA< SymbolType, StateType > > | |
| Cautomaton::isNFTA_impl< NFTA< SymbolType, StateType > > | |
| Cautomaton::isUnorderedDFTA_impl< UnorderedDFTA< SymbolType, StateType > > | |
| Cautomaton::isUnorderedNFTA_impl< UnorderedNFTA< SymbolType, StateType > > | |
| ►Cstd::tuple | |
| Cext::internal::logical_tuple< T... > | |
| Cext::internal::logical_tuple< Ts > | |
| Cext::tuple< Ts > | Class extending the tuple class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Cstd::tuple_element< I, ext::pair< First, Second > > | Specialisation of tuple_element for extended pair |
| Cstd::tuple_element< I, ext::ptr_tuple< Types... > > | Specialisation of tuple_element for extended tuple |
| Cstd::tuple_element< I, ext::tuple< Types... > > | Specialisation of tuple_element for extended tuple |
| ►Cstd::type_index | |
| Cext::type_index | |
| Cabstraction::TypeQualifiers | |
| Cregexp::convert::ToAutomatonThompson::Unbounded | |
| Cregexp::GlushkovFirst::Unbounded< SymbolType > | |
| Cregexp::GlushkovFollow::Unbounded< SymbolType > | |
| Cregexp::GlushkovIndexate::Unbounded< SymbolType > | |
| Cregexp::GlushkovLast::Unbounded< SymbolType > | |
| Cregexp::GlushkovPos::Unbounded< SymbolType > | |
| Cregexp::properties::RegExpEmpty::Unbounded< SymbolType > | |
| Cregexp::properties::RegExpEpsilon::Unbounded< SymbolType > | |
| Cregexp::RegExpToXmlComposer::Unbounded | |
| ►CUnboundedRegExpElement | |
| ►Cext::VararyNode< UnboundedRegExpElement< SymbolType > > | |
| Cregexp::UnboundedRegExpAlternation< SymbolType > | Represents the alternation operator in the regular expression. The node can have 0 to n children in list of UnboundedRegExpElement as operands of the alternation |
| Cregexp::UnboundedRegExpConcatenation< SymbolType > | Represents the concatenation operator in the regular expression. The node can have 0 to n children in list of UnboundedRegExpElement as operands of the concatenation |
| Cregexp::UnboundedRegExpStructure< SymbolType > | Represents unbounded regular expression structure. Regular expression is stored as a tree of UnboundedRegExpElements |
| Cautomaton::properties::UndistinguishableStates | |
| ►Cstd::unordered_map | |
| Cext::unordered_map< node::Node, ext::unordered_map< node::Node, int > > | |
| Cext::unordered_map< T, R, Hash, KeyEqual, Alloc > | Class extending the unordered_map class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Cgrammar::simplify::UnproductiveSymbolsRemover | |
| Cautomaton::simplify::efficient::UnreachableStatesRemover | |
| Cautomaton::simplify::UnreachableStatesRemover | |
| Cgrammar::simplify::UnreachableSymbolsRemover | |
| Cabstraction::UnspecifiedType | |
| Cautomaton::properties::efficient::UsefulStates | |
| Cautomaton::properties::UsefulStates | |
| Cautomaton::simplify::efficient::UselessStatesRemover | |
| Cautomaton::simplify::UselessStatesRemover | |
| Cext::value_mover< T > | Adaptor class to change begin and end behavior for rvalue qualified begin and end. This class takes ownership of the adapted instance by move construction |
| Cregistration::ValuePrinterRegister< Type > | |
| Cabstraction::ValuePrinterRegistry | |
| Calphabet::VariablesBarSymbol | Represents variables bar symbol used in tree linearization |
| Cstd::variant_alternative< Np, ext::variant< Types ... > > | |
| Cext::variant_builder_impl< Res, Ts > | Class to help building of the variant type or, in case variant is requested to be constructed from single type or more types but all the same, that concrete type |
| ►Cext::variant_builder_impl< std::conditional< is_in< T, ResTs ... >::value, std::variant< ResTs ... >, std::variant< ResTs ..., T > >::type, Ts ... > | |
| Cext::variant_builder_impl< std::variant< ResTs ... >, T, Ts ... > | Recursive step of class to build the variant type |
| Cext::variant_builder_impl< std::variant< ResTs ... > > | Recursion ending specialisation of the helper class to build the variant type. The last type T is added as last type to the variant parameters |
| ►Cext::variant_builder_impl< std::variant< T >, Ts ... > | |
| Cext::variant_builder_start< T, Ts > | |
| ►Cvariant_size | |
| Cstd::variant_size< ext::variant< Types ... > > | |
| ►Cstd::vector | |
| Cext::vector< T, Alloc > | Class extending the vector class from the standard library. Original reason is to allow printing of the container with overloaded operator << |
| Ccompare::VectorCompare | |
| Cext::virtual_pointer_to_integer< IntegralType > | Class wrapping an integral type, but with pointer iterface |
| ►Cregexp::FormalRegExpElement< SymbolType >::Visitor | |
| Cregexp::FormalRegExpElement< SymbolType >::VisitorContext< ReturnType, Visitor, Params > | |
| ►Cregexp::UnboundedRegExpElement< SymbolType >::Visitor | |
| Cregexp::UnboundedRegExpElement< SymbolType >::VisitorContext< ReturnType, Visitorr, Params > | |
| ►Crte::FormalRTEElement< SymbolType >::Visitor | |
| Crte::FormalRTEElement< SymbolType >::VisitorContext< ReturnType, Visitorr, Params > | |
| ►CTCLAP::Visitor | |
| CInteractiveVisitor | |
| ►CMultiArgVisitor | |
| CFileVisitor | |
| CQueriesVisitor | |
| Ccore::VisitorContextAux< ReturnType, Visitor, Params > | Class implementing an actual visitor interface to the visitor |
| ►Ccore::VisitorContextAux< ReturnType, Visitor, Params ... > | |
| Cregexp::FormalRegExpElement< SymbolType >::VisitorContext< ReturnType, Visitor, Params > | |
| ►Ccore::VisitorContextAux< ReturnType, Visitorr, Params ... > | |
| Cregexp::UnboundedRegExpElement< SymbolType >::RvalueVisitorContext< ReturnType, Visitorr, Params > | |
| Cregexp::UnboundedRegExpElement< SymbolType >::VisitorContext< ReturnType, Visitorr, Params > | |
| Crte::FormalRTEElement< SymbolType >::ConstVisitorContext< ReturnType, Visitorr, Params > | |
| Crte::FormalRTEElement< SymbolType >::VisitorContext< ReturnType, Visitorr, Params > | |
| Ccore::VisitorContextAux< void, Visitor, Params ... > | Class implementing an actual visitor interface to the visitor |
| Cobject::Void | Represents void object |
| Cstringology::matching::WideBNDMMatcherConstruction | |
| Cstringology::query::WideBNDMOccurrences | |
| Calphabet::WildcardSymbol | Represents a wildcard used as representation of anything here in a string or a tree |
| Ccli::builtin::WriteFile | |
| Ccore::xmlApi< T > | |
| Ccore::xmlApi< abstraction::AlgorithmCategories::AlgorithmCategory > | |
| Ccore::xmlApi< abstraction::TypeQualifiers::TypeQualifierSet > | |
| Ccore::xmlApi< alphabet::BarSymbol > | |
| Ccore::xmlApi< alphabet::BlankSymbol > | |
| Ccore::xmlApi< alphabet::BottomOfTheStackSymbol > | |
| Ccore::xmlApi< alphabet::EndSymbol > | |
| Ccore::xmlApi< alphabet::GapSymbol > | |
| Ccore::xmlApi< alphabet::InitialSymbol > | |
| Ccore::xmlApi< alphabet::NonlinearVariableSymbol< T > > | |
| Ccore::xmlApi< alphabet::StartSymbol > | |
| Ccore::xmlApi< alphabet::VariablesBarSymbol > | |
| Ccore::xmlApi< alphabet::WildcardSymbol > | |
| Ccore::xmlApi< automaton::CompactNFA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::DFA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::DFTA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::EpsilonNFA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::ExtendedNFA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::MultiInitialStateNFA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::NFA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::NFTA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::NondeterministicZAutomaton< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::OneTapeDTM< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::UnorderedNFTA< SymbolType, StateType > > | |
| Ccore::xmlApi< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > > | |
| Ccore::xmlApi< bool > | |
| Ccore::xmlApi< char > | |
| Ccore::xmlApi< common::ranked_symbol< T > > | |
| Ccore::xmlApi< common::SparseBoolVector > | |
| Ccore::xmlApi< common::symbol_or_epsilon< T > > | |
| Ccore::xmlApi< double > | |
| Ccore::xmlApi< example::DataType > | |
| Ccore::xmlApi< ext::bitset< N > > | |
| Ccore::xmlApi< ext::deque< T > > | |
| Ccore::xmlApi< ext::list< T > > | |
| Ccore::xmlApi< ext::map< T, R > > | |
| Ccore::xmlApi< ext::multimap< T, R > > | |
| Ccore::xmlApi< ext::pair< T, R > > | |
| Ccore::xmlApi< ext::set< T > > | |
| Ccore::xmlApi< ext::tree< T > > | |
| Ccore::xmlApi< ext::trie< T, R > > | |
| Ccore::xmlApi< ext::tuple< Ts ... > > | |
| Ccore::xmlApi< ext::variant< Ts ... > > | |
| Ccore::xmlApi< ext::vector< T > > | |
| Ccore::xmlApi< grammar::CFG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::CNF< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::ContextPreservingUnrestrictedGrammar< SymbolType > > | |
| Ccore::xmlApi< grammar::CSG< SymbolType > > | |
| Ccore::xmlApi< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::GNF< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::LG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::NonContractingGrammar< SymbolType > > | |
| Ccore::xmlApi< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > > | |
| Ccore::xmlApi< grammar::UnrestrictedGrammar< SymbolType > > | |
| Ccore::xmlApi< indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > > | |
| Ccore::xmlApi< indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > > | |
| Ccore::xmlApi< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType > > | |
| Ccore::xmlApi< indexes::arbology::NonlinearFullAndLinearIndex< SymbolType, StringIndex > > | |
| Ccore::xmlApi< indexes::stringology::BitParallelIndex< SymbolType > > | |
| Ccore::xmlApi< indexes::stringology::BitSetIndex< SymbolType, BitmaskBitCount > > | |
| Ccore::xmlApi< indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType > > | |
| Ccore::xmlApi< indexes::stringology::CompressedBitParallelIndex< SymbolType > > | |
| Ccore::xmlApi< indexes::stringology::FactorOracleAutomaton< SymbolType > > | |
| Ccore::xmlApi< indexes::stringology::PositionHeap< SymbolType > > | |
| Ccore::xmlApi< indexes::stringology::SuffixArray< SymbolType > > | |
| Ccore::xmlApi< indexes::stringology::SuffixAutomaton< SymbolType > > | |
| Ccore::xmlApi< indexes::stringology::SuffixTrie< SymbolType > > | |
| Ccore::xmlApi< indexes::SuffixTrieTerminatingSymbol > | |
| Ccore::xmlApi< int > | |
| Ccore::xmlApi< label::FailStateLabel > | |
| Ccore::xmlApi< label::FinalStateLabel > | |
| Ccore::xmlApi< label::InitialStateLabel > | |
| Ccore::xmlApi< measurements::MeasurementResults > | |
| Ccore::xmlApi< object::Object > | |
| Ccore::xmlApi< object::Void > | |
| Ccore::xmlApi< regexp::FormalRegExp< SymbolType > > | |
| Ccore::xmlApi< regexp::FormalRegExpStructure< SymbolType > > | Specialisation of the xmlApi class for formal regular expression |
| Ccore::xmlApi< regexp::UnboundedRegExp< SymbolType > > | |
| Ccore::xmlApi< regexp::UnboundedRegExpStructure< SymbolType > > | Specialisation of the xmlApi class for unbounded regular expression |
| Ccore::xmlApi< rte::FormalRTE< SymbolType > > | |
| Ccore::xmlApi< rte::FormalRTEStructure< SymbolType > > | Specialisation of the xmlApi class for formal regular expression |
| Ccore::xmlApi< std::optional< T > > | |
| Ccore::xmlApi< std::pair< T, R > > | |
| Ccore::xmlApi< std::string > | |
| Ccore::xmlApi< string::CyclicString< SymbolType > > | |
| Ccore::xmlApi< string::LinearString< SymbolType > > | |
| Ccore::xmlApi< string::LinearStringTerminatingSymbol > | |
| Ccore::xmlApi< string::WildcardLinearString< SymbolType > > | |
| Ccore::xmlApi< tree::PostfixRankedTree< SymbolType > > | |
| Ccore::xmlApi< tree::PrefixBarTree< SymbolType > > | |
| Ccore::xmlApi< tree::PrefixRankedBarNonlinearPattern< SymbolType > > | |
| Ccore::xmlApi< tree::PrefixRankedBarPattern< SymbolType > > | |
| Ccore::xmlApi< tree::PrefixRankedBarTree< SymbolType > > | |
| Ccore::xmlApi< tree::PrefixRankedNonlinearPattern< SymbolType > > | |
| Ccore::xmlApi< tree::PrefixRankedPattern< SymbolType > > | |
| Ccore::xmlApi< tree::PrefixRankedTree< SymbolType > > | |
| Ccore::xmlApi< tree::RankedNonlinearPattern< SymbolType > > | |
| Ccore::xmlApi< tree::RankedPattern< SymbolType > > | |
| Ccore::xmlApi< tree::RankedTree< SymbolType > > | |
| Ccore::xmlApi< tree::UnrankedNonlinearPattern< SymbolType > > | |
| Ccore::xmlApi< tree::UnrankedPattern< SymbolType > > | |
| Ccore::xmlApi< tree::UnrankedTree< SymbolType > > | |
| Ccore::xmlApi< unsigned > | |
| Ccore::xmlApi< unsigned long > | |
| Ccore::xmlApi< void > | |
| Cabstraction::XmlComposerRegistry | |
| Cabstraction::XmlContainerParserRegistry | |
| Cfactory::XmlDataFactory | |
| Cabstraction::XmlParserRegistry | |
| Cregistration::XmlReaderRegister< Type > | |
| Cregistration::XmlRegisterTypeInGroup< Group, Type > | |
| Cabstraction::XmlRegistry | |
| Cregistration::XmlWriterRegister< Type > | |
