Namespace List

Here is a list of all namespaces with brief descriptions:

[detail level 1234]

►Nabstraction
Ndetail
CAlgorithmAbstraction
CAlgorithmBaseInfo
CAlgorithmCategories
CAlgorithmFullInfo
►CAlgorithmRegistry
CEntry
CAnyaryOperationAbstraction
CAnyaryOperationAbstractionImpl
CBaseRegistryEntry
CCastAbstraction
CCastHelper
►CCastRegistry
CEntry
►CContainerRegistry
CEntry
CEvalHelper
CInputFileRegistry
CMemberAbstraction
CNaryOperationAbstraction
CNaryOperationAbstractionImpl
CNormalizeAbstraction
►CNormalizeRegistry
CEntry
COperationAbstraction
►COperatorRegistry
CBinaryEntry
CPostfixEntry
CPrefixEntry
COperators
COutputFileRegistry
CPackingAbstraction
►CPackingAbstractionImpl
CConnectionTarget
CLazyValue
CRawAbstraction
CRawReaderAbstraction
►CRawReaderRegistry
CEntry
CRawWriterAbstraction
►CRawWriterRegistry
CEntry
CReferenceAbstraction
CReferenceImpl
CRegistry
CSetAbstraction
CStringReaderAbstraction
►CStringReaderRegistry
CEntry
CStringWriterAbstraction
►CStringWriterRegistry
CEntry
CTemporariesHolder
CTypeQualifiers
CUnspecifiedType
CValue
CValueHolder
CValueHolderInterface
CValueImpl
CValueOperationAbstraction
CValueOperationAbstraction< void >
CValuePrinterAbstraction
CValuePrinterAbstraction< void >
►CValuePrinterRegistry
CEntry
CValueReference
CVoid
CWrapperAbstraction
CWrapperAbstractionImpl
CXmlComposerAbstraction
►CXmlComposerRegistry
CEntry
►CXmlContainerParserRegistry
CEntry
CXmlParserAbstraction
►CXmlParserRegistry
CEntry
CXmlRegistry
CXmlTokensComposerAbstraction
CXmlTokensParserAbstraction
►Nalib
►CBinomialHeap
CNode
CCppHeap	Heap build using C++ algorithm features
►CExceptionHandler
CNestedExceptionContainer
►CFibonacciHeap
CNode
►Nalphabet
CBarSymbol	Represents bar symbol used in tree linearization
CBlankSymbol	Represents blank symbol used in the turing machine
CBottomOfTheStackSymbol	Represents bottom of the stack symbol used in the visibly pushdown automata
CEndSymbol	Represents end symbol used as termation symbol of a string
CGapSymbol	Represents a wildcard used as representation of anything here in a string or a tree
CInitialSymbol	Represents initial symbol used as an initial symbol of a grammar
CNodeWildcardSymbol	Represents a wildcard used as representation of anything here in a string or a tree
CNonlinearVariableSymbol	Represents the nonlinear variable symbol used in a nonlinear tree pattern
CStartSymbol	Represents start symbol used as initializing symbol of a string
CSymbolNormalize
CVariablesBarSymbol	Represents variables bar symbol used in tree linearization
CWildcardSymbol	Represents a wildcard used as representation of anything here in a string or a tree
►Narbology
►Nexact
CBoyerMooreHorspool
CDeadZoneUsingBadCharacterShiftAndBorderArray
CExactNonlinearTreePatternAutomaton
CExactPatternMatch
CExactPatternMatchingAutomaton
CExactSubtreeAutomaton
CExactSubtreeMatch
CExactSubtreeMatchingAutomaton
CExactTreePatternAutomaton
CKnuthMorrisPratt
CQuickSearch
CReversedBoyerMooreHorspool
CReversedQuickSearch
►Nindexing
CCompressedBitParallelIndexConstruction
CFullAndLinearIndexConstruction
CNonlinearCompressedBitParallelIndexConstruction
CNonlinearFullAndLinearIndexConstruction
►Nproperties
CExactSubtreeRepeatsFromSubtreeAutomaton
►Nquery
CCompressedBitParallelismPatterns
CFullAndLinearIndexPatterns
CNonlinearCompressedBitParallelismPatterns
CNonlinearFullAndLinearIndexPatterns
►Ntransform
CBeginToEndIndex
►Nautomaton
►Nconvert
CToGrammar
CToGrammarLeftRG
CToGrammarRightRG
CToPostfixPushdownAutomaton
CToPrefixPushdownAutomaton
CToRegExp
CToRegExpAlgebraic
CToRegExpKleene
CToRegExpStateElimination
CToRTEStateElimination
►Ndeterminize
CDeterminize
►Ngenerate
CMinimizeGenerator
CNumberModuloAutomaton
CNumberOfSymbolsAutomaton
CRandomAutomatonFactory
CRandomAutomatonFactory2
CRandomAutomatonFactory3
CRandomizeAutomaton
CRandomTreeAutomatonFactory
►Nproperties
►Nefficient
CAllEpsilonClosure
CReachableStates
CUsefulStates
CAllEpsilonClosure
CBackwardBisimulation
CDistinguishableStates
CEpsilonClosure
CForwardBisimulation
CInfiniteLanguage
CReachableStates
CSynchronizingWordExistence
CUndistinguishableStates
CUsefulStates
►Nrun
CAccept	Implementation of test whether automaton accepts its input
COccurrences	Implementation of automaton run over its input reporting occurrences
CResult	Implementation of automaton run over its input returning the reached state
CRun	Implementation of automaton run over its input
CTranslate	Implementation of transducer run over its input
►Nsimplify
►Nefficient
CEpsilonRemoverIncoming
CEpsilonRemoverOutgoing
CTrim
CUnreachableStatesRemover
CUselessStatesRemover
CEpsilonRemoverIncoming
CEpsilonRemoverOutgoing
CMinimize
CMinimizeBrzozowski
CMinimizeByPartitioning
CMinimizeVerbose
CNormalize
CRemoveUnused
CRename
CSingleInitialState
CSingleInitialStateEpsilonTransition
CToArcFactored
CTotal
CTrim
CUnreachableStatesRemover
CUselessStatesRemover
►Ntransform
CAutomataConcatenation
CAutomataConcatenationEpsilonTransition
CAutomataIntersectionCartesianProduct
CAutomataLeftQuotientCartesianProduct
CAutomataUnion
CAutomataUnionCartesianProduct
CAutomataUnionEpsilonTransition
CAutomataUnionMultipleInitialStates
CAutomatonComplement
CAutomatonIteration
CAutomatonIterationEpsilonTransition
CCompaction
CPDAToRHPDA
CReverse
CRHPDAToPDA
CArcFactoredDeterministicZAutomaton	Deterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree languages
CArcFactoredNondeterministicZAutomaton	Nondeterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree languages
CAutomatonException
CAutomatonFromStringLexer
CAutomatonFromStringParserCommon
CAutomatonFromXMLParser
CAutomatonNormalize
CAutomatonToStringComposerCommon
CAutomatonToXMLComposer
CCompactDFA	Compact deterministic finite automaton. Accepts regular languages. The automaton has a list of symbols on transitions
CCompactNFA	Compact nondeterministic finite automaton. Accepts regular languages. The automaton has a list of symbols on transitions
CDFA	Deterministic finite automaton. Accepts regular languages
CDFTA	Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages
CDPDA	Deterministic pushdown automaton. Accepts subset of context free languages
CEpsilonNFA	Epsilon nondeterministic finite automaton. Accepts regular languages
CEpsilonNFTA	Epsilon nondeterministic finite tree automaton. Accepts regular tree languages
CExtendedNFA	Extended nondeterministic finite automaton. Accepts regular languages. The automaton has a regular expression on transitions
CExtendedNFTA	Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages
CInputDrivenDPDA	Deterministic input driven pushdown automaton. Accepts subset of context free languages
CInputDrivenNPDA	Nondeterministic input driven pushdown automaton. Accepts subset of context free languages
CisAFDZA_impl
CisAFDZA_impl< ArcFactoredDeterministicZAutomaton< SymbolType, StateType > >
CisAFNZA_impl
CisAFNZA_impl< ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > >
CisCompactDFA_impl
CisCompactDFA_impl< CompactDFA< SymbolType, StateType > >
CisCompactNFA_impl
CisCompactNFA_impl< CompactNFA< SymbolType, StateType > >
CisDFA_impl
CisDFA_impl< DFA< SymbolType, StateType > >
CisDFTA_impl
CisDFTA_impl< DFTA< SymbolType, StateType > >
CisEpsilonNFA_impl
CisEpsilonNFA_impl< EpsilonNFA< SymbolType, StateType > >
CisEpsilonNFTA_impl
CisEpsilonNFTA_impl< EpsilonNFTA< SymbolType, StateType > >
CisExtendedNFA_impl
CisExtendedNFA_impl< ExtendedNFA< SymbolType, StateType > >
CisMultiInitialStateEpsilonNFA_impl
CisMultiInitialStateEpsilonNFA_impl< MultiInitialStateEpsilonNFA< SymbolType, StateType > >
CisMultiInitialStateNFA_impl
CisMultiInitialStateNFA_impl< MultiInitialStateNFA< SymbolType, StateType > >
CisNFA_impl
CisNFA_impl< NFA< SymbolType, StateType > >
CisNFTA_impl
CisNFTA_impl< NFTA< SymbolType, StateType > >
CisUnorderedDFTA_impl
CisUnorderedDFTA_impl< UnorderedDFTA< SymbolType, StateType > >
CisUnorderedNFTA_impl
CisUnorderedNFTA_impl< UnorderedNFTA< SymbolType, StateType > >
CMultiInitialStateEpsilonNFA	Epsilon nondeterministic finite automaton. Accepts regular languages
CMultiInitialStateNFA	Nondeterministic finite automaton with multiple initial states. Accepts regular languages
CNFA	Nondeterministic finite automaton. Accepts regular languages
CNFTA	Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages
CNondeterministicZAutomaton	Nondeterministic Z-Automaton. Computation model for unranked regular tree languages
CNPDA
CNPDTA
COneTapeDTM	Deterministic single tape turing machine. Accepts recursive languages
CRealTimeHeightDeterministicDPDA	Deterministic real time height deterministic pushdown automaton. Accepts subset of context free languages
CRealTimeHeightDeterministicNPDA	Nondeterministic real time height deterministic pushdown automaton. Accepts subset of context free languages
CSinglePopDPDA	Deterministic pushdown automaton requiring a symbol pop from pushdown store on each transition use. Accepts subset of context free languages
CSinglePopNPDA
CUnorderedDFTA	Deterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree languages
CUnorderedNFTA	Nondeterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree languages
CVisiblyPushdownDPDA	Deterministic visibly pushdown automaton. Accepts subset of context free languages
CVisiblyPushdownNPDA	Nondeterministic visibly pushdown automaton. Accepts subset of context free languages
►Ncli
►Nbuiltin
CDot
CMove
CReadFile
CWriteFile
CAlgorithmsIntrospectionCommand
CArg
CBatchExpression
CBinaryExpression
CBindedArg
CBindingsIntrospectionCommand
CBlockCommand
CBreakCommand
CCalcCommand
CCastExpression
CCastsIntrospectionCommand
CCastStatement
CCategoryOption
CCharSequence
CClearMeasurements
CCommand
CCommandList
CContainerStatement
CContinueCommand
CDataTypesIntrospectionCommand
CDeclareRunnableCommand
CEnvironment
CEOTCommand
CEvalCommand
CExecuteCommand
CExpression
CFileStatement
CFunctionCallExpression
CHelpCommand
CIfCommand
CImmediateArg
CImmediateExpression
CImmediateStatement
CInterpretCommand
CIstreamLineInterface
►CLexer
CToken
CLibraryLoader
CLineInterface
CLoadCommand
CMethodCallExpression
COperatorsIntrospectionCommand
COption
COverloadsIntrospectionCommand
CParser
CPostfixExpression
CPrefixExpression
CPreviousResultStatement
CPrintCommand
CQuitCommand
CResultFileStatement
CResultInterpret
CResultVariableStatement
CReturnCommand
CSetCommand
CShowMeasurements
CSingleStatement
CStartMeasurementFrame
CStatement
CStatementList
CStopMeasurementFrame
CStringLineInterface
CTypeExpression
CTypeOption
CUnloadCommand
CValueStatement
CVarDeclareCommand
CVariableExpression
CVariablesIntrospectionCommand
CVariableStatement
CWhileCommand
►Ncommon
CGlobalData	Class to represent some global modifiers and data
CPermutation
Cranked_symbol
►CSparseBoolVector
Celement
CSparseBoolVectorOnesIterator
CStreams	Aggregation class for various standard streams defined by the library
Csymbol_or_epsilon
►Ncompare
CAutomatonCompare
CAutomatonDiff
CDiffAux
CGrammarCompare
CGrammarDiff
CPrimitiveCompare
CSetCompare
CStringCompare
CStringDiff
CTreeCompare
CTrieCompare
CVectorCompare
Ncomponent
►Ncontainer
CContainerFromStringLexer
►Nconvert
CDotConverter
►CDotConverterRTE
CFormal
CDotConverterTree
CGasTexConverter
CLatexConverter
►CTikZConverter
CFormalRTEVisitor
►Ncore
CComponent
CComponent< Derived, ComponentType, component::Set, ComponentName >
CComponent< Derived, ComponentType, component::Value, ComponentName >
CComponents
CComponents< Derived, ComponentType, ComponentCategory, ComponentName, Next ... >
CComponents< Derived, ComponentType, ComponentCategory, std::tuple< >, Next ... >
CComponents< Derived, ComponentType, ComponentCategory, std::tuple< ComponentName, ComponentNames ... >, Next ... >
CElementConstraint
CElementConstraint< automaton::CompactDFA< SymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::DFA< SymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol >
CElementConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol >
CElementConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol >
CElementConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol >
CElementConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol >
CElementConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::OneTapeDTM< SymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::OneTapeDTM< SymbolType, StateType >, SymbolType, automaton::BlankSymbol >
CElementConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol >
CElementConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol >
CElementConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol >
CElementConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::InitialSymbol >
CElementConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol >
CElementConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialState >
CElementConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::BottomOfTheStackSymbol >
CElementConstraint< grammar::CFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::CNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::ContextPreservingUnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::CSG< SymbolType >, SymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::GNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::LG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::NonContractingGrammar< SymbolType >, SymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::InitialSymbol >
CElementConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol >
CElementConstraint< indexes::SuffixTrieTerminatingSymbol, DefaultSymbolType, indexes::TerminatingSymbol >
CElementConstraint< string::LinearStringTerminatingSymbol, DefaultSymbolType, string::TerminatingSymbol >
CElementConstraint< string::WildcardLinearString< SymbolType >, SymbolType, string::WildcardSymbol >
CElementConstraint< tree::PrefixBarTree< SymbolType >, SymbolType, tree::BarSymbol >
CElementConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::VariablesBarSymbol >
CElementConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::VariablesBarSymbol >
CElementConstraint< tree::PrefixRankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::PrefixRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::RankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::RankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::RankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::UnorderedRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard >
CElementConstraint< tree::UnorderedUnrankedPattern< SymbolType >, SymbolType, tree::SubtreeGap >
CElementConstraint< tree::UnorderedUnrankedPattern< SymbolType >, SymbolType, tree::SubtreeWildcard >
CElementConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::NodeWildcard >
CElementConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::SubtreeGap >
CElementConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::SubtreeWildcard >
CElementConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::SubtreeGap >
CElementConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::SubtreeWildcard >
CElementConstraint< tree::UnrankedPattern< SymbolType >, SymbolType, tree::SubtreeGap >
CElementConstraint< tree::UnrankedPattern< SymbolType >, SymbolType, tree::SubtreeWildcard >
Chas_eval	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
Cnormalize
Cnormalize< alphabet::NonlinearVariableSymbol< SymbolType > >
Cnormalize< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > >
Cnormalize< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > >
Cnormalize< automaton::CompactDFA< SymbolType, StateType > >
Cnormalize< automaton::CompactNFA< SymbolType, StateType > >
Cnormalize< automaton::DFA< SymbolType, StateType > >
Cnormalize< automaton::DFTA< SymbolType, StateType > >
Cnormalize< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::EpsilonNFA< SymbolType, StateType > >
Cnormalize< automaton::EpsilonNFTA< SymbolType, StateType > >
Cnormalize< automaton::ExtendedNFA< SymbolType, StateType > >
Cnormalize< automaton::ExtendedNFTA< SymbolType, StateType > >
Cnormalize< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType > >
Cnormalize< automaton::MultiInitialStateNFA< SymbolType, StateType > >
Cnormalize< automaton::NFA< SymbolType, StateType > >
Cnormalize< automaton::NFTA< SymbolType, StateType > >
Cnormalize< automaton::NondeterministicZAutomaton< SymbolType, StateType > >
Cnormalize< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::OneTapeDTM< SymbolType, StateType > >
Cnormalize< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::UnorderedDFTA< SymbolType, StateType > >
Cnormalize< automaton::UnorderedNFTA< SymbolType, StateType > >
Cnormalize< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
Cnormalize< common::ranked_symbol< SymbolType > >
Cnormalize< grammar::CFG< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::CNF< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::ContextPreservingUnrestrictedGrammar< SymbolType > >
Cnormalize< grammar::CSG< SymbolType > >
Cnormalize< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::GNF< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::LG< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::NonContractingGrammar< SymbolType > >
Cnormalize< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > >
Cnormalize< grammar::UnrestrictedGrammar< SymbolType > >
Cnormalize< graph::DirectedGraph< TNode, TEdge > >
Cnormalize< graph::DirectedMultiGraph< TNode, TEdge > >
Cnormalize< graph::MixedGraph< TNode, TEdge > >
Cnormalize< graph::MixedMultiGraph< TNode, TEdge > >
Cnormalize< graph::UndirectedGraph< TNode, TEdge > >
Cnormalize< graph::UndirectedMultiGraph< TNode, TEdge > >
Cnormalize< graph::WeightedDirectedGraph< TNode, TEdge > >
Cnormalize< graph::WeightedDirectedMultiGraph< TNode, TEdge > >
Cnormalize< graph::WeightedMixedGraph< TNode, TEdge > >
Cnormalize< graph::WeightedMixedMultiGraph< TNode, TEdge > >
Cnormalize< graph::WeightedUndirectedGraph< TNode, TEdge > >
Cnormalize< graph::WeightedUndirectedMultiGraph< TNode, TEdge > >
Cnormalize< grid::SquareGrid4< TCoordinate, TEdge > >
Cnormalize< grid::SquareGrid8< TCoordinate, TEdge > >
Cnormalize< grid::WeightedSquareGrid4< TCoordinate, TEdge > >
Cnormalize< grid::WeightedSquareGrid8< TCoordinate, TEdge > >
Cnormalize< indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > >
Cnormalize< indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > >
Cnormalize< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType > >
Cnormalize< indexes::arbology::NonlinearFullAndLinearIndex< SymbolType, StringIndex > >
Cnormalize< indexes::stringology::BitParallelIndex< SymbolType > >
Cnormalize< indexes::stringology::BitSetIndex< SymbolType, BitmaskBitCount > >
Cnormalize< indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType > >
Cnormalize< indexes::stringology::CompressedBitParallelIndex< SymbolType > >
Cnormalize< indexes::stringology::FactorOracleAutomaton< SymbolType > >
Cnormalize< indexes::stringology::PositionHeap< common::ranked_symbol< SymbolType > > >
Cnormalize< indexes::stringology::PositionHeap< SymbolType > >
Cnormalize< indexes::stringology::SuffixArray< SymbolType > >
Cnormalize< indexes::stringology::SuffixAutomaton< SymbolType > >
Cnormalize< indexes::stringology::SuffixTrie< SymbolType > >
Cnormalize< regexp::FormalRegExp< SymbolType > >
Cnormalize< regexp::UnboundedRegExp< SymbolType > >
Cnormalize< rte::FormalRTE< SymbolType > >
Cnormalize< string::CyclicString< SymbolType > >
Cnormalize< string::LinearString< common::ranked_symbol< SymbolType > > >
Cnormalize< string::LinearString< SymbolType > >
Cnormalize< string::WildcardLinearString< SymbolType > >
Cnormalize< tree::PostfixRankedTree< SymbolType > >
Cnormalize< tree::PrefixBarTree< SymbolType > >
Cnormalize< tree::PrefixRankedBarNonlinearPattern< SymbolType > >
Cnormalize< tree::PrefixRankedBarPattern< SymbolType > >
Cnormalize< tree::PrefixRankedBarTree< SymbolType > >
Cnormalize< tree::PrefixRankedExtendedPattern< SymbolType > >
Cnormalize< tree::PrefixRankedNonlinearPattern< SymbolType > >
Cnormalize< tree::PrefixRankedPattern< SymbolType > >
Cnormalize< tree::PrefixRankedTree< SymbolType > >
Cnormalize< tree::RankedExtendedPattern< SymbolType > >
Cnormalize< tree::RankedNonlinearPattern< SymbolType > >
Cnormalize< tree::RankedPattern< SymbolType > >
Cnormalize< tree::RankedTree< SymbolType > >
Cnormalize< tree::UnorderedRankedPattern< SymbolType > >
Cnormalize< tree::UnorderedRankedTree< SymbolType > >
Cnormalize< tree::UnorderedUnrankedPattern< SymbolType > >
Cnormalize< tree::UnorderedUnrankedTree< SymbolType > >
Cnormalize< tree::UnrankedExtendedPattern< SymbolType > >
Cnormalize< tree::UnrankedNonlinearPattern< SymbolType > >
Cnormalize< tree::UnrankedPattern< SymbolType > >
Cnormalize< tree::UnrankedTree< SymbolType > >
CrawApi
CrawApi< string::LinearString< SymbolType > >
CrawApi< tree::UnrankedTree< SymbolType > >
CSetComponent
CSetConstraint
CSetConstraint< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::CompactDFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::CompactDFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::CompactDFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::CompactNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::DFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::DFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::DFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::DFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
CSetConstraint< automaton::DFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::DFTA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::EpsilonNFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
CSetConstraint< automaton::EpsilonNFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::EpsilonNFTA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
CSetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialStates >
CSetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, StateType, automaton::InitialStates >
CSetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::MultiInitialStateNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::NFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::NFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
CSetConstraint< automaton::NFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::NFTA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::NondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::NondeterministicZAutomaton< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::NondeterministicZAutomaton< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, OutputSymbolType, automaton::OutputAlphabet >
CSetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::OneTapeDTM< SymbolType, StateType >, SymbolType, automaton::TapeAlphabet >
CSetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialStates >
CSetConstraint< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::InputAlphabet >
CSetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
CSetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::UnorderedNFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
CSetConstraint< automaton::UnorderedNFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::UnorderedNFTA< SymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::CallAlphabet >
CSetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::LocalAlphabet >
CSetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::ReturnAlphabet >
CSetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::CallAlphabet >
CSetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::LocalAlphabet >
CSetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, InputSymbolType, automaton::ReturnAlphabet >
CSetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, PushdownStoreSymbolType, automaton::PushdownStoreAlphabet >
CSetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::FinalStates >
CSetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::InitialStates >
CSetConstraint< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType >, StateType, automaton::States >
CSetConstraint< grammar::CFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::CFG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::CNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::CNF< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::ContextPreservingUnrestrictedGrammar< SymbolType >, SymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::ContextPreservingUnrestrictedGrammar< SymbolType >, SymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::CSG< SymbolType >, SymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::CSG< SymbolType >, SymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::GNF< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::GNF< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::LG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::LG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::NonContractingGrammar< SymbolType >, SymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::NonContractingGrammar< SymbolType >, SymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType >, NonterminalSymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType >, TerminalSymbolType, grammar::TerminalAlphabet >
CSetConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::NonterminalAlphabet >
CSetConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::TerminalAlphabet >
CSetConstraint< indexes::arbology::CompressedBitParallelTreeIndex< SymbolType >, common::ranked_symbol< SymbolType >, indexes::arbology::GeneralAlphabet >
CSetConstraint< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType >, common::ranked_symbol< SymbolType >, indexes::arbology::GeneralAlphabet >
CSetConstraint< indexes::stringology::BitParallelIndex< SymbolType >, SymbolType, indexes::stringology::GeneralAlphabet >
CSetConstraint< indexes::stringology::CompressedBitParallelIndex< SymbolType >, SymbolType, indexes::stringology::GeneralAlphabet >
CSetConstraint< indexes::stringology::SuffixTrie< SymbolType >, SymbolType, indexes::stringology::GeneralAlphabet >
CSetConstraint< indexes::SuffixTrieTerminatingSymbol, DefaultSymbolType, indexes::GeneralAlphabet >
CSetConstraint< regexp::FormalRegExp< SymbolType >, SymbolType, regexp::GeneralAlphabet >
CSetConstraint< regexp::UnboundedRegExp< SymbolType >, SymbolType, regexp::GeneralAlphabet >
CSetConstraint< rte::FormalRTE< SymbolType >, common::ranked_symbol< SymbolType >, rte::ConstantAlphabet >
CSetConstraint< rte::FormalRTE< SymbolType >, common::ranked_symbol< SymbolType >, rte::GeneralAlphabet >
CSetConstraint< string::CyclicString< SymbolType >, SymbolType, string::GeneralAlphabet >
CSetConstraint< string::LinearString< SymbolType >, SymbolType, string::GeneralAlphabet >
CSetConstraint< string::LinearStringTerminatingSymbol, DefaultSymbolType, string::GeneralAlphabet >
CSetConstraint< string::WildcardLinearString< SymbolType >, SymbolType, string::GeneralAlphabet >
CSetConstraint< tree::PostfixRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixBarTree< SymbolType >, SymbolType, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::BarSymbols >
CSetConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixRankedBarNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NonlinearAlphabet >
CSetConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::BarSymbols >
CSetConstraint< tree::PrefixRankedBarPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixRankedBarTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::BarSymbols >
CSetConstraint< tree::PrefixRankedBarTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixRankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixRankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NodeWildcards >
CSetConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NonlinearAlphabet >
CSetConstraint< tree::PrefixRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::PrefixRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::RankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::RankedExtendedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NodeWildcards >
CSetConstraint< tree::RankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::RankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NonlinearAlphabet >
CSetConstraint< tree::RankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::RankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::UnorderedRankedPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::UnorderedRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
CSetConstraint< tree::UnorderedUnrankedPattern< SymbolType >, SymbolType, tree::GeneralAlphabet >
CSetConstraint< tree::UnorderedUnrankedTree< SymbolType >, SymbolType, tree::GeneralAlphabet >
CSetConstraint< tree::UnrankedExtendedPattern< SymbolType >, SymbolType, tree::GeneralAlphabet >
CSetConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::GeneralAlphabet >
CSetConstraint< tree::UnrankedNonlinearPattern< SymbolType >, SymbolType, tree::NonlinearAlphabet >
CSetConstraint< tree::UnrankedPattern< SymbolType >, SymbolType, tree::GeneralAlphabet >
CSetConstraint< tree::UnrankedTree< SymbolType >, SymbolType, tree::GeneralAlphabet >
CstringApi
CstringApi< alphabet::BarSymbol >
CstringApi< alphabet::BlankSymbol >
CstringApi< alphabet::BottomOfTheStackSymbol >
CstringApi< alphabet::EndSymbol >
CstringApi< alphabet::GapSymbol >
CstringApi< alphabet::InitialSymbol >
CstringApi< alphabet::NonlinearVariableSymbol< SymbolType > >
CstringApi< alphabet::StartSymbol >
CstringApi< alphabet::VariablesBarSymbol >
CstringApi< alphabet::WildcardSymbol >
CstringApi< automaton::DFA< SymbolType, StateType > >
CstringApi< automaton::DFTA< SymbolType, StateType > >
CstringApi< automaton::EpsilonNFA< SymbolType, StateType > >
CstringApi< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType > >
CstringApi< automaton::MultiInitialStateNFA< SymbolType, StateType > >
CstringApi< automaton::NFA< SymbolType, StateType > >
CstringApi< automaton::NFTA< SymbolType, StateType > >
CstringApi< bool >
CstringApi< char >
CstringApi< common::ranked_symbol< SymbolType > >
CstringApi< common::symbol_or_epsilon< SymbolType > >
CstringApi< ext::pair< FirstType, SecondType > >
CstringApi< ext::set< ValueType > >
CstringApi< ext::variant< Types ... > >
CstringApi< ext::vector< ValueType > >
CstringApi< grammar::CFG< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::CNF< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::ContextPreservingUnrestrictedGrammar< SymbolType > >
CstringApi< grammar::CSG< SymbolType > >
CstringApi< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::GNF< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::LG< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::NonContractingGrammar< SymbolType > >
CstringApi< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > >
CstringApi< grammar::UnrestrictedGrammar< SymbolType > >
CstringApi< int >
CstringApi< label::FailStateLabel >
CstringApi< label::FinalStateLabel >
CstringApi< label::InitialStateLabel >
►CstringApi< object::Object >
CGroupReader
CGroupWriter
CstringApi< object::Void >
CstringApi< regexp::FormalRegExp< SymbolType > >
CstringApi< regexp::FormalRegExpStructure< SymbolType > >
CstringApi< regexp::UnboundedRegExp< SymbolType > >
CstringApi< regexp::UnboundedRegExpStructure< SymbolType > >
CstringApi< rte::FormalRTE< SymbolType > >
CstringApi< rte::FormalRTEStructure< SymbolType > >
CstringApi< std::pair< FirstType, SecondType > >
CstringApi< std::string >
CstringApi< string::CyclicString< SymbolType > >
CstringApi< string::LinearString< SymbolType > >
CstringApi< tree::RankedExtendedPattern< SymbolType > >
CstringApi< tree::RankedNonlinearPattern< SymbolType > >
CstringApi< tree::RankedPattern< SymbolType > >
CstringApi< tree::RankedTree< SymbolType > >
CstringApi< tree::UnrankedExtendedPattern< SymbolType > >
CstringApi< tree::UnrankedNonlinearPattern< SymbolType > >
CstringApi< tree::UnrankedPattern< SymbolType > >
CstringApi< tree::UnrankedTree< SymbolType > >
CstringApi< unsigned >
CstringApi< unsigned long >
CVisitorContextAux	Class implementing an actual visitor interface to the visitor
CVisitorContextAux< void, Visitor, Params ... >	Class implementing an actual visitor interface to the visitor
CxmlApi
CxmlApi< abstraction::AlgorithmCategories::AlgorithmCategory >
CxmlApi< abstraction::TypeQualifiers::TypeQualifierSet >
CxmlApi< alphabet::BarSymbol >
CxmlApi< alphabet::BlankSymbol >
CxmlApi< alphabet::BottomOfTheStackSymbol >
CxmlApi< alphabet::EndSymbol >
CxmlApi< alphabet::GapSymbol >
CxmlApi< alphabet::InitialSymbol >
CxmlApi< alphabet::NonlinearVariableSymbol< T > >
CxmlApi< alphabet::StartSymbol >
CxmlApi< alphabet::VariablesBarSymbol >
CxmlApi< alphabet::WildcardSymbol >
CxmlApi< automaton::CompactNFA< SymbolType, StateType > >
CxmlApi< automaton::DFA< SymbolType, StateType > >
CxmlApi< automaton::DFTA< SymbolType, StateType > >
CxmlApi< automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::EpsilonNFA< SymbolType, StateType > >
CxmlApi< automaton::ExtendedNFA< SymbolType, StateType > >
CxmlApi< automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::InputDrivenNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType > >
CxmlApi< automaton::MultiInitialStateNFA< SymbolType, StateType > >
CxmlApi< automaton::NFA< SymbolType, StateType > >
CxmlApi< automaton::NFTA< SymbolType, StateType > >
CxmlApi< automaton::NondeterministicZAutomaton< SymbolType, StateType > >
CxmlApi< automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::OneTapeDTM< SymbolType, StateType > >
CxmlApi< automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::RealTimeHeightDeterministicNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::SinglePopDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::SinglePopNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::UnorderedNFTA< SymbolType, StateType > >
CxmlApi< automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< automaton::VisiblyPushdownNPDA< InputSymbolType, PushdownStoreSymbolType, StateType > >
CxmlApi< bool >
CxmlApi< char >
CxmlApi< common::ranked_symbol< T > >
CxmlApi< common::SparseBoolVector >
CxmlApi< common::symbol_or_epsilon< T > >
CxmlApi< double >
CxmlApi< example::DataType >
CxmlApi< ext::bitset< N > >
CxmlApi< ext::deque< T > >
CxmlApi< ext::list< T > >
CxmlApi< ext::map< T, R > >
CxmlApi< ext::multimap< T, R > >
CxmlApi< ext::pair< T, R > >
CxmlApi< ext::set< T > >
CxmlApi< ext::tree< T > >
CxmlApi< ext::trie< T, R > >
CxmlApi< ext::tuple< Ts ... > >
CxmlApi< ext::variant< Ts ... > >
CxmlApi< ext::vector< T > >
CxmlApi< grammar::CFG< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::CNF< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::ContextPreservingUnrestrictedGrammar< SymbolType > >
CxmlApi< grammar::CSG< SymbolType > >
CxmlApi< grammar::EpsilonFreeCFG< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::GNF< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::LeftLG< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::LG< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::NonContractingGrammar< SymbolType > >
CxmlApi< grammar::RightLG< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > >
CxmlApi< grammar::UnrestrictedGrammar< SymbolType > >
CxmlApi< indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > >
CxmlApi< indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > >
CxmlApi< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType > >
CxmlApi< indexes::arbology::NonlinearFullAndLinearIndex< SymbolType, StringIndex > >
CxmlApi< indexes::stringology::BitParallelIndex< SymbolType > >
CxmlApi< indexes::stringology::BitSetIndex< SymbolType, BitmaskBitCount > >
CxmlApi< indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType > >
CxmlApi< indexes::stringology::CompressedBitParallelIndex< SymbolType > >
CxmlApi< indexes::stringology::FactorOracleAutomaton< SymbolType > >
CxmlApi< indexes::stringology::PositionHeap< SymbolType > >
CxmlApi< indexes::stringology::SuffixArray< SymbolType > >
CxmlApi< indexes::stringology::SuffixAutomaton< SymbolType > >
CxmlApi< indexes::stringology::SuffixTrie< SymbolType > >
CxmlApi< indexes::SuffixTrieTerminatingSymbol >
CxmlApi< int >
CxmlApi< label::FailStateLabel >
CxmlApi< label::FinalStateLabel >
CxmlApi< label::InitialStateLabel >
CxmlApi< measurements::MeasurementResults >
►CxmlApi< object::Object >
CGroupComposer
CGroupParser
CxmlApi< object::Void >
CxmlApi< regexp::FormalRegExp< SymbolType > >
CxmlApi< regexp::FormalRegExpStructure< SymbolType > >	Specialisation of the xmlApi class for formal regular expression
CxmlApi< regexp::UnboundedRegExp< SymbolType > >
CxmlApi< regexp::UnboundedRegExpStructure< SymbolType > >	Specialisation of the xmlApi class for unbounded regular expression
CxmlApi< rte::FormalRTE< SymbolType > >
CxmlApi< rte::FormalRTEStructure< SymbolType > >	Specialisation of the xmlApi class for formal regular expression
CxmlApi< std::optional< T > >
CxmlApi< std::pair< T, R > >
CxmlApi< std::string >
CxmlApi< string::CyclicString< SymbolType > >
CxmlApi< string::LinearString< SymbolType > >
CxmlApi< string::LinearStringTerminatingSymbol >
CxmlApi< string::WildcardLinearString< SymbolType > >
CxmlApi< tree::PostfixRankedTree< SymbolType > >
CxmlApi< tree::PrefixBarTree< SymbolType > >
CxmlApi< tree::PrefixRankedBarNonlinearPattern< SymbolType > >
CxmlApi< tree::PrefixRankedBarPattern< SymbolType > >
CxmlApi< tree::PrefixRankedBarTree< SymbolType > >
CxmlApi< tree::PrefixRankedNonlinearPattern< SymbolType > >
CxmlApi< tree::PrefixRankedPattern< SymbolType > >
CxmlApi< tree::PrefixRankedTree< SymbolType > >
CxmlApi< tree::RankedNonlinearPattern< SymbolType > >
CxmlApi< tree::RankedPattern< SymbolType > >
CxmlApi< tree::RankedTree< SymbolType > >
CxmlApi< tree::UnrankedNonlinearPattern< SymbolType > >
CxmlApi< tree::UnrankedPattern< SymbolType > >
CxmlApi< tree::UnrankedTree< SymbolType > >
CxmlApi< unsigned >
CxmlApi< unsigned long >
CxmlApi< void >
CxmlApiInputContext
CxmlApiOutputContext
►NdataAccess
CPairSetFirst
CPairSetSecond
►Ndebug
CRandom
►Nedge
CCapacityEdge
CEdge
CEdgeBase
CWeightedEdge
►Nequations
CLeftRegularEquationSolver
CRegularEquationSolver
CRightRegularEquationSolver
►Nexample
CCreateDataType
CCreateDataType2
CDataType
►Nexception
CCommonException	Basic exception from which all other exceptions are derived
►Next
Ndetail
►Ninternal
Cbinder
Cbound
Clogical_tuple
Clogical_tuple_base
Cprintable
Cprintable< std::tuple< Ts... >, std::void_t< decltype(std::declval< std::ostream & >()<< std::declval< const Ts & >())... > >
Call_of
Cany_of
CAnyaryNode	Tree node with any but fixed number of children
Carray	Class extending the array class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
CBaseNode	Base class for hierarchy of tree node types. The tree node types can be used to construct tree structures of different types of nodes
CBasicLexer
CBinaryNode	Binary node is specialisation of Anyary node to two children
Cbitset	Class extending the bitset class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Ccallback_iterator	Output iterator calling a callback function on assignment
Ccasional
Ccasional< >
Ccasional< std::false_type, R, Ts ... >
Ccasional< std::true_type, R, Ts ... >
Ccasional< T >
Cconst_tuple_foreach	Class providing begin and end methods to allow simple use of packed iterators in foreach variant of the for loop
Cconst_tuple_foreach_iterator	A class for packing a tuple of iterators and synchronizing them. All are incremented, decremented, dereferenced together
Ccow_shared_ptr	Specialisation of copy on write pointer for classes based with copy on write pointer base
Cdeque	Class extending the deque class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Cdereferencing_iterator	Adaptor iterator to additionally call second dereference on the iterator dereference result
Cfdaccessor	A class determining the used file descriptor from prefered (if available) and fallback file descriptor
Cfdstreambuf	Class representing buffered stream designed to work on defined file descriptor instead of usual file name
CFixedaryNode	Fixedary node is tree node that when initialized does not permit change of the number of its children
Cforward_list	Class extending the forward_list class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
►Cforward_tree	Class introducing a forward_tree with interface trying to be close to the interface of standard library containers
Cconst_postfix_iterator	The iterator type over structure of the tree following postorder traversal
Cconst_prefix_iterator	The iterator type over structure of the tree following preorder traversal
Cconst_structure_iterator	The iterator type over structure of the tree representing nodes and node_ends
Chas_clone	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
Cifdstream	A class implementing an input stream interface, with destination specified by file descriptor
Cifstream
Cindex_in	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
Cindex_in< T >	Specialisation for empty pack, in which case the field is set to false
Cindex_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
Cindex_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
CInit	Class responsible for initialisation of std extensions and standard library changes
Cistream
Cistringstream
Citerator_range	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
Ckey_iterator
►CLexer
CToken
Clinear_set	Implementation of set mimicking the iterface of the standard library set. The inner representation is using sorted vector of unique value
Clist	Class extending the list class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Cmanaged_linear_set	Implementation of set mimicking the iterface of the standard library set. The inner representation is using sorted vector of unique value
Cmanaged_value	Implementation of managed value mimicking the behavior of the underlying value. The class is designed to fire change events when the value is modified
Cmap	Class extending the map class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Cmap_move_iterator	Adaptor iterator to allow values to be moved from a map. Internaly calls reinterpret cast to dereference result of underlying map iterator
Cmultimap	Class extending the multimap class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Cmultiset
Cnone_of
CNullaryNode	Nullary node is specialisation of Anyary node to no children
Cofdstream	A class implementing an output stream interface, with destination specified by file descriptor
Cofstream
Coptional_ref
Costream
Costringstream
Cpair	Class extending the pair class from the standard library. Original reason is to allow printing of the pair with overloaded operator <<
CPolyComp
Cptr_array	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
Cptr_tuple	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
Cptr_value	Class representing wrapper of dynamically allocated object behaving like rvalue reference
Cptr_vector	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
Crandom_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
Creference_mover	Adaptor class to change begin and end behavior for rvalue qualified begin and end. This class keeps rvalue reference of the adapted instance
Creference_wrapper	Class extending the reference wrapper class from the standard library. Original reason is to allow its use with standard stream aggregation class
CRegister
CRegister< void >
Creverser	Adaptor class to change begin and end behavior for reverse begin and reverse end and vise versa
Csequence	Representation of integer sequence usable in foreach form of for loop
Cset
Cset_move_iterator	Adaptor iterator to allow values to be moved from a set. Internaly calls const cast to dereference result of underlying set iterator
CSigHandler	Singleton class providing interupt or segmentation fault signal handler
CSliceComp
Csmart_ptr	Managed pointer simulating value like behavior
Cstring
Cstrip_reference_wrapper
Cstrip_reference_wrapper< std::reference_wrapper< T > >
Csupports
Csupports< F(Ts ...) >
CTernaryNode	Ternany node is specialisation of Anyary node to three children
►Ctree	Class introducing a tree with interface trying to be close to the interface of standard library containers
Cconst_postfix_iterator	The iterator type over structure of the tree following postorder traversal
Cconst_prefix_iterator	The iterator type over structure of the tree following preorder traversal
Cconst_structure_iterator	The iterator type over structure of the tree representing nodes and node_ends
Ctrie	Class introducing a trie with interface trying to be close to the interface of standard library containers
Ctuple	Class extending the tuple class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Ctype_index
CUnaryNode	Unary node is specialisation of Anyary node to one child
Cunordered_map	Class extending the unordered_map class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Cvalue_iterator
Cvalue_mover	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
CVararyNode	Varary node is tree node that can hold any number of children
Cvariant	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
Cvariant_builder_impl	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
Cvariant_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
Cvariant_builder_impl< std::variant< ResTs ... >, T, Ts ... >	Recursive step of class to build the variant type
Cvariant_builder_start
Cvector	Class extending the vector class from the standard library. Original reason is to allow printing of the container with overloaded operator <<
Cvirtual_pointer_to_integer	Class wrapping an integral type, but with pointer iterface
RIncluded	Concept 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
►Nfactory
►CNormalizeFactory
Cnormalizer
►CRawDataFactory
CfromFile
CfromRaw
CfromStdin
CfromStream
CfromString
►CStringDataFactory
CfromFile
CfromStdin
CfromStream
CfromString
►CXmlDataFactory
CfromFile
CfromStdin
CfromStream
CfromString
CfromTokens
►Ngrammar
►Nconvert
CToAutomaton
CToAutomatonBottomUp
CToAutomatonTopDown
CToGrammarLeftRG
CToGrammarRightRG
CToRegExp
CToRegExpAlgebraic
►Ngenerate
CCockeYoungerKasami
CCockeYoungerKasamiVerbose
CGenerateUpToLength
CRandomGrammarFactory
CRandomizeGrammar
►Nparsing
CAbsorbTerminalSymbol
CCornerSubstitution
CDeterministicLL1Grammar
CDeterministicLL1ParseTable
CExtractRightContext
CFirst
CFollow
CHandleFirstFirstConflict
CHandleFirstFollowConflict
CLeftFactorize
CLL1ParseTable
CLR0Parser
CLRParser
CSLR1ParseTable
CSubstitute
►Nproperties
CIsFITDefinition
CIsLanguageEmpty
CIsLanguageGeneratingEpsilon
CNonterminalUnitRuleCycle
CNullableNonterminals
CProductiveNonterminals
CReachableSymbols
CRecursiveNonterminal
►Nsimplify
CEpsilonRemover
CLeftRecursionRemover
CMakeFITDefinition
CRename
CSimpleRulesRemover
CToCNF
CToGNF
CTrim
CUnproductiveSymbolsRemover
CUnreachableSymbolsRemover
►Ntransform
CGrammarAlternation
CGrammarConcatenation
CGrammarIteration
CAddRawRule
CCFG	Context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages
CCNF	Chomsky normal form of a context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages
CContextPreservingUnrestrictedGrammar	Context preserving unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages
CCSG	Context sensitive grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages
CEpsilonFreeCFG	Context free grammar without epsilon rules in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages
CGNF	Greibach normal form of a context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages
CGrammarException
CGrammarFromStringLexer
CGrammarFromStringParserCommon
CGrammarFromXMLParser
CGrammarNormalize
CGrammarToStringComposerCommon
CGrammarToXMLComposer
CLeftLG	Left linear grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages
CLeftRG	Left regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages
CLG	Context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages
CNonContractingGrammar	Noncontracting grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages
CRawRules
CRightLG	Right linear grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages
CRightRG	Right regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages
CUnrestrictedGrammar	Unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages
►Ngraph
►Ncommon
CReconstructPath
CSupportFunction
►Ngenerate
CFixedUndirectedGraph
CFixedWeightedSquareGrid8
CFixedWeightedUndirectedGraph
CRandomGraphFactory
CRandomGridFactory
►Nheuristic
CChebyshevDistance
CDiagonalDistance
CEuclideanDistance
CEuclideanDistanceNoSQRT
CManhattenDistance
►Nmaximum_flow
CContext
CFordFulkerson
►Nminimum_cut
CFordFulkerson
►Nparser
CSquareGridMapParser
►Nshortest_path
CAStar
CAStarBidirectional
CBellmanFord
CDijkstra
CDijkstraBidirectional
CFloydWarshall
CGreedyBestFS
CIDAStar
CMM
CSPFA
►Nspanning_tree
CJarnikPrim
►Ntraverse
CBFS
CBFSBidirectional
CDFS
CIDDFS
CIDDFSBidirectional
CDirectedGraph
CDirectedMultiGraph
CGraphBase
CGraphInterface
CGraphNormalize
CMixedGraph
CMixedMultiGraph
CUndirectedGraph
CUndirectedMultiGraph
CWeightedDirectedGraph
CWeightedDirectedMultiGraph
CWeightedMixedGraph
CWeightedMixedMultiGraph
CWeightedUndirectedGraph
CWeightedUndirectedMultiGraph
►Ngrid
CGridBase
CGridFunction
CGridInterface
CSqaureGrid
CSquareGrid
CSquareGrid4
CSquareGrid8
CWeightedSquareGrid4
CWeightedSquareGrid8
►Nindexes
►Narbology
CCompressedBitParallelTreeIndex	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
CFullAndLinearIndex	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
CNonlinearCompressedBitParallelTreeIndex	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
CNonlinearFullAndLinearIndex	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
►Nstringology
CBitParallelIndex	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
CBitSetIndex	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
CCompactSuffixAutomatonTerminatingSymbol
CCompressedBitParallelIndex	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
CFactorOracleAutomaton	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
CPositionHeap	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
CSuffixArray	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
CSuffixAutomaton	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
CSuffixTrie	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
CIndexesNormalize
CIndexFromXMLParser
CIndexToXMLComposer
CSuffixTrieNodeTerminatingSymbol
CSuffixTrieTerminatingSymbol
►Nlabel
CFailStateLabel	Represents label of the fail state of an automaton
CFinalStateLabel	Represents label of the final state of an automaton
CInitialStateLabel	Represents label of the final state of an automaton
►Nmeasurements
CCounterDataFrame
CCounterHint
CMeasurementEngine
CMeasurementFrame
CMeasurementResults
CMeasurementXalloc
CMemoryDataFrame
CMemoryHint
►Cstealth_allocator
Crebind
CTimeDataFrame
►Nnode
CNode
CNodeBase
►Nobject
CAnyObject	Represents an adaptor of any type to a class in type hierarchy of objects in the algorithms library
CAnyObjectBase
CObject
CVoid	Represents void object
►Nprimitive
CPrimitiveFromStringLexer
►Nraw
CCompose
CParse
►Nregexp
►Nconvert
CToAutomaton
CToAutomatonDerivation
CToAutomatonGlushkov
►CToAutomatonThompson
CFormal
CUnbounded
CToGrammar
CToGrammarRightRGDerivation
CToGrammarRightRGGlushkov
►Ngenerate
CRandomRegExpFactory
►Nproperties
►CRegExpEmpty
CFormal
CUnbounded
►CRegExpEpsilon
CFormal
CUnbounded
►Nsimplify
CRegExpOptimize
►Ntransform
CRegExpAlternate
CRegExpConcatenate
CRegExpDerivation
CRegExpIntegral
CRegExpIterate
CFormalRegExp	Formal regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes:
CFormalRegExpAlternation	Represents the alternation operator in the regular expression. The node must have exactly two children
CFormalRegExpConcatenation	Represents the concatenation operator in the regular expression. The node must have exactly two children
►CFormalRegExpElement
CVisitor
CVisitorContext
CFormalRegExpEmpty	Represents the empty expression in the regular expression. The node can't have any children
CFormalRegExpEpsilon	Represents the epsilon expression in the regular expression. The node can't have any children
CFormalRegExpIteration	Represents the iteration operator in the regular expression. The node has exactly one child
CFormalRegExpStructure	Represents formal regular expression structure. Regular expression is stored as a tree of FormalRegExpElements
CFormalRegExpSymbol	Represents the symbol in the regular expression. The can't have any children
►CGlushkovFirst
CFormal
CUnbounded
►CGlushkovFollow
CFormal
CUnbounded
►CGlushkovIndexate
CFormal
CUnbounded
►CGlushkovLast
CFormal
CUnbounded
►CGlushkovPos
CUnbounded
CRegExpFromStringLexer
CRegExpFromXmlParser
►CRegExpToXmlComposer
CFormal
CUnbounded
CUnboundedRegExp	Unbounded regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes:
CUnboundedRegExpAlternation	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
CUnboundedRegExpConcatenation	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
►CUnboundedRegExpElement
CRvalueVisitor
CRvalueVisitorContext
CVisitor
CVisitorContext
CUnboundedRegExpEmpty	Represents the empty expression in the regular expression. The node can't have any children
CUnboundedRegExpEpsilon	Represents the epsilon expression in the regular expression. The node can't have any children
CUnboundedRegExpIteration	Represents the iteration operator in the regular expression. The node has exactly one child
CUnboundedRegExpStructure	Represents unbounded regular expression structure. Regular expression is stored as a tree of UnboundedRegExpElements
CUnboundedRegExpSymbol	Represents the symbol in the regular expression. The can't have any children
►Nregistration
CAbstractRegister
CAlgoRegisterHelper
CBinaryOperatorRegister
CCastRegister
CComponentRegister
CInputFileRegister
CMethodRegister
CMethodRegister< Algorithm, ReturnType, const ObjectType, ParameterTypes ... >
CNormalizationRegisterEmpty
CNormalizationRegisterImpl
COutputFileRegister
CPostfixOperatorRegister
CPrefixOperatorRegister
CRawReaderRegister
CRawWriterRegister
CSetRegister
CStringReaderGroupRegister
CStringReaderRegister
CStringReaderRegisterTypeInGroup
CStringWriterRegister
CStringWriterRegisterTypeInGroup
CValuePrinterRegister
CWrapperRegister
CXmlReaderRegister
CXmlRegisterTypeInGroup
CXmlWriterRegister
►Nrelation
CInducedEquivalence
CIsReflexive
CIsSymmetric
CIsTransitive
CRelationComplement
►Nrte
►Nconvert
CToFTAGlushkov
►CToFTAThompson
CFormal
CToPostfixPushdownAutomaton
CToPostfixPushdownAutomatonGlushkov
CToPostfixPushdownAutomatonGlushkovNaive
►Nsimplify
CRTEOptimize
CFormalRTE	Formal regular tree expression represents regular tree expression. It describes regular tree languages. The expression consists of the following nodes:
CFormalRTEAlternation	Represents the alternation operator in the regular tree expression. The node must have exactly two children
►CFormalRTEElement
CConstVisitor
CConstVisitorContext
CVisitor
CVisitorContext
CFormalRTEEmpty	Represents the empty expression in the regular tree expression. The node can't have any children
CFormalRTEIteration	Represents the iteration operator in the regular tree expression. The node has exactly one child
CFormalRTEStructure	Represents unbounded regular expression structure. Regular expression is stored as a tree of UnboundedRegExpElements
CFormalRTESubstitution	Represents the concatenation operator in the regular tree expression. The node must have exactly two children
CFormalRTESymbol	Represents the common part of SubstitutionSymbol and TerminalSymbol
CFormalRTESymbolAlphabet	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
CFormalRTESymbolSubst	Represents the substitution symbol in the regular tree expression. The node can't have any children
►CGlushkovFirst
CFormal
►CGlushkovFollow
CFormal
►CGlushkovFollowNaive
CFormal
►CGlushkovIndexate
CFormal
►CGlushkovPos
CFormal
CRTEFromStringLexer
CRTEFromXmlParser
►CRTEToXmlComposer
CFormal
►Nsax
CComposerException
CFromXMLParserHelper
CParserException
CSaxComposeInterface
CSaxParseInterface
CToken
►Nstats
CSizeStat
►Nstd
►Nexperimental
►Ndetails
Creturn_type_helper
Creturn_type_helper< void, Types... >
Chash< node::Node >
Chash< std::pair< node::Node, node::Node > >
Ctuple_element< I, ext::pair< First, Second > >	Specialisation of tuple_element for extended pair
Ctuple_element< I, ext::ptr_tuple< Types... > >	Specialisation of tuple_element for extended tuple
Ctuple_element< I, ext::tuple< Types... > >	Specialisation of tuple_element for extended tuple
Ctuple_size< ext::pair< First, Second > >	Specialisation of tuple_size for extended pair
Ctuple_size< ext::ptr_tuple< Types ... > >	Specialisation of tuple_size for extended tuple
Ctuple_size< ext::tuple< Types ... > >	Specialisation of tuple_size for extended tuple
Cvariant_alternative< Np, ext::variant< Types ... > >
Cvariant_size< ext::variant< Types ... > >
►Nstring
►Ngenerate
CRandomStringFactory
CRandomSubstringFactory
►Nnaive
CExactCompare
CExactEqual
►Nproperties
CBadCharacterShiftTable
CBorderArray
CGoodSuffixShiftTable
CMaximalSuffix
CPeriodicPrefix
CQuickSearchBadCharacterShiftTable
CRepetition
CReversedBadCharacterShiftTable
►Nsimplify
CNormalizeAlphabet
CNormalizeRotation
►Ntransform
CStringConcatenate
CStringReverse
CCompose
CCyclicString	Cyclic string
CLinearString	Linear string
CLinearStringTerminatingSymbol
CParse
CStringFromStringLexer
CStringFromStringParserCommon
CStringFromXmlParserCommon
CStringToStringComposerCommon
CStringToXmlComposerCommon
CWildcardLinearString	Linear wildcard string
►Nstringology
►Ncompression
CAdaptiveIntegerArithmeticCompression
CAdaptiveIntegerArithmeticDecompression
CArithmeticCoder
CArithmeticDecoder
CLZ77Compression
CLZ77Decompression
►Ncover
CApproximateCoversComputation
►CApproximateEnhancedCoversCommon
CElement
CState
CApproximateEnhancedCoversComputation
CExactCoversComputation
CRelaxedApproximateEnhancedCoversComputation
CRestrictedApproximateCoversComputation
►Nexact
CBoyerMoore
CBoyerMooreHorspool
CCGR
CDeadZoneUsingBadCharacterShift
CDogaru
CExactFactorMatch
CGalilSeiferas
CKnuthMorrisPratt
CNotSoNaive
CQuickSearch
CQuiteNaive
CReversedBoyerMooreHorspool
CSequentialSampling
CTailedSubstring
►Nindexing
CBitParallelIndexConstruction
CCompressedBitParallelIndexConstruction
CExactFactorOracleAutomaton
CExactMultiNondeterministicSubsequenceAutomaton
CExactNondeterministicSubsequenceAutomaton
CExactSubsequenceAutomaton
CExactSuffixAutomaton
CExperimentalCompactSuffixAutomatonConstruct
CExperimentalSuffixTrie
CNondeterministicApproximateSuffixAutomatonForHammingDistance
CNondeterministicApproximateSuffixEpsilonAutomatonForHammingDistance
CNondeterministicExactFactorAutomaton
CNondeterministicExactSuffixAutomaton
CNondeterministicExactSuffixEpsilonAutomaton
CPositionHeapNaive
CSuffixArrayNaive
CSuffixTrieNaive
►Nmatching
CBNDMMatcherConstruction
CDAWGMatcherConstruction
CExactMatchingAutomaton
CGeneralizedLevenshteinMatchingAutomaton
CGeneralizedLevenshteinSequenceMatchingAutomaton
CHammingMatchingAutomaton
CHammingSequenceMatchingAutomaton
CLevenshteinMatchingAutomaton
CLevenshteinSequenceMatchingAutomaton
CNaiveDAWGMatcherConstruction
COracleMatcherConstruction
CSequenceMatchingAutomaton
CWideBNDMMatcherConstruction
►Nproperties
►CBackboneLength
CBackboneLengthLess
CLyndonFactoring
CNyldonFactoring
►Nquery
CBackwardDAWGMatching
CBackwardOracleMatching
CBitParallelismFactors
CBNDMOccurrences
CCompactSuffixAutomatonFactors
CCompressedBitParallelismFactors
CPositionHeapFactors
CSuffixArrayFactors
CSuffixAutomatonFactors
CSuffixTrieFactors
CWideBNDMOccurrences
►Nseed
CApproximateSeedComputation
CDeterministicApproximateSuffixAutomatonForHammingDistanceFactory
CExactSeedComputation
CRestrictedApproximateSeedComputation
►Nsimulations
CBitParalelism
CExactBitParalelism
CGeneralizedLevenshteinBitParalelism
CGeneralizedLevenshteinDynamicProgramming
CHammingBitParalelism
CHammingDynamicProgramming
CLevenshteinBitParalelism
CLevenshteinDynamicProgramming
►Ntransform
CBeginToEndIndex
►NTCLAP
CArgTraits< std::pair< T, U > >
►Ntree
►Nexact
CBackwardOccurrenceTest
CForwardOccurrenceTest
►Ngenerate
CNode
CRandomRankedExtendedPatternFactory
CRandomRankedNonlinearPatternFactory
CRandomRankedPatternFactory
CRandomRankedTreeFactory
CRandomUnrankedExtendedPatternFactory
CRandomUnrankedPatternFactory
CRandomUnrankedTreeFactory
►Nproperties
CBadCharacterShiftTable
CBorderArray
CBorderArrayNaive
CExactSubtreeRepeats
CExactSubtreeRepeatsNaive
CFirstVariableOffsetFront
CLastVariableOffsetBack
CQuickSearchBadCharacterShiftTable
CReversedBadCharacterShiftTable
CReversedQuickSearchBadCharacterShiftTable
CSubtreeJumpTable
►Nsimplify
CNormalizeTreeLabels
►Ntransform
CFirstChildNextSibling
CPostfixRankedTree	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
CPrefixBarTree	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
CPrefixRankedBarNonlinearPattern	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
CPrefixRankedBarPattern	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
CPrefixRankedBarTree	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
CPrefixRankedExtendedPattern	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
CPrefixRankedNonlinearPattern	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)
CPrefixRankedPattern	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
CPrefixRankedTree	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
CRankedExtendedPattern	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
CRankedNonlinearPattern	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)
CRankedPattern	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
CRankedTree	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
CTreeAuxiliary
CTreeException
CTreeFromStringLexer
CTreeFromStringParserCommon
CTreeFromXMLParser
CTreeNormalize
CTreeToStringComposerCommon
CTreeToXMLComposer
CUnorderedRankedPattern	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
CUnorderedRankedTree	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
CUnorderedUnrankedPattern	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
CUnorderedUnrankedTree	Tree pattern represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols
CUnrankedExtendedPattern	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
CUnrankedNonlinearPattern	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)
CUnrankedPattern	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
CUnrankedTree	Tree represented in its natural representation. The representation is so called unranked, therefore it consists of unranked symbols
►Nxml
CCompose
CParse