Skip to content
Snippets Groups Projects

Repository graph

You can move around the graph by using the arrow keys.
Select Git revision
  • QuantumLeap
  • ZAutomata-rebase
  • backup-jt
  • clang-tidy-fixes
  • compileTimeTypeRetrievalTest
  • conversions-tests-wip
  • dejmeto1-dp-fta2rte
  • dev-jt
  • dev-tp
  • dev-tp-mp-borderarray-one-indexed
  • dev-tp2
  • dp-doupajak-fta2rteEquations-v2
  • experimental
  • experimentalToSinglePopPDA
  • issue-132-seed
  • libc++
  • libc++-17
  • master default protected
  • merge-jt
  • merge-tp
  • BP-shushiri
  • DP-doupajak
  • esf2018-doc
  • v0.0.0 protected
  • v0.0.1 protected
  • BP-uhlikja2
  • DP-travnja3
  • BP_capekto4
  • BP_cvachmic
  • BP-parmajan
  • BP_shatrale
  • DP_plachste
  • DP-peckatom
  • BP-brozjan5
  • BP-doupajak
  • BP-vozabluk
  • BP-kocicma3
  • BP-cervera3
  • BP-roscadav2
  • BP-plachste
40 results
Created with Raphaël 2.2.013Jan121110987432130Dec2827242221201918161514131098765432130Nov262421201918141311984230Oct281711108427Sep21161514131286532125Aug2423222119111096532131Jul29282726232221201918108754223Jun222016141331May3029282725242322201918151413765432130Apr292827262119181514131211109876421simplify ExactNonlinearTreePatternAutomaton algotemplate subtree repeats naive algorithmtemplate remaining algorithms from stringologyreplace last occurrence of LabelSetLabel with Settemplate some more stringology algorithmsmake compare functors statictemplate exact factor automaton algorithmrefer to some default type in indexesdelete some not needed classes + cleanup includesParse from string as Objectstatic compare functor 3static compare functor 2static compare functorsimplify suffix array querynaive suffix array construction and queryingnaive suffix array construction and queryingadd unimplemented methodsuse proper container typeSymbolType -> Input and PushdownStore SymbolTypesimplify compare binarySymbolType to Input and PushdownStore SymbolTypesfix operator << resultcallbacks for forgotten labels in toStringComposertemplate normalize algorithmtemplate AutomataUnionCartesianProduct algorithmtemplate automata intersection cartesian productfix promoting double dispatchbash tests for suffix trie factorsoptimize variant comparingallow size_t as element of variantintroduce index query binaryfix construction of suffix triesimplify string examplessimplify examples of grammarssimplify regexp examplessimplify examples of automataadd xml formatting scriptallow disable xml optimize in echouse trie in construction of suffix trieallow parsing and composing of void in variant