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.031May291615141087543228Apr27252414131211108765432127Mar222120181716157627Feb1513986130Jan2827262518171210986324Dec222113121182128Nov252422212015109872131Oct28242221201916151098764328Sep2422212018161312111098765330Aug2928272625242322212019181716151413121198765432housekeeping of parsermerge Parameters and Statements in clisimplify cli parser and astadd multi initial state epsilon nfa datatypeupdate programmer documentationdecouple xml api of indexes from data structuresadd 'first' static function to xml api of automata, grammars and treesdecouple tree xmlApi from tree data structuresdecouple grammars xmlApi from grammars datadecouple xml api from SparseBoolVectorglushkovrte: debug submap, add bad cplx examplestatic registration of xml parse wrapperwip on the documentationdecouple automata and their xml apifix reference in documentationfix invalid reference in documentationdocument tree indexesupdate construction of approximate matching automataRemove stringology::matching::HammingMatchingAutomaton::construct_unclean() and ajdust tests accordingly.BP_capekto4BP_capekto4Refactor stringology::simulations::HammingDynamicProgramming, so it usesImplements randomized testing for stringology::simulationsRegister all simulations form stringology::simulations.Implement simulation for aproximate string matching using dynamic programming and General Levenshtein distance.Rework simulation of Levenshtein searching automaton.Change return value in simulations to ext::set<unsigned int>.add registration and call sampleImplement simulation for aproximate string matching using dynamic programming and Levenshtein distance.Fix incorectly implemented position reporting in BitParalelism.Implement simulation for aproximate string matching using dynamic programming and Levenshtein distance.Implement simulation for aproximate string matching using dynamic programming and Hamming distance.Implement simulation for aproximate string matching using bit paralelism and Generalized Levenshtein distance.Implement simulation for aproximate string matching using bit paralelism and Levenshtein distance.Implements simulation for aproximate string matching using bit paralelism and Hamming distance.Implements simulation for exact string matching using bit paralelism.Add registrations of all WildcardLinearString implementations in stringology::matching::*Automaton classes.Implement WildcardLinearString into GeneralizedLevenshteinSequenceMatchingAutomatonImplement WildcardLinearString into LevenshteinSequenceMatchingAutomatonImplement WildcardLinearString into HammingSequenceMatchingAutomatonImplement WildcardLinearString into GeneralizedLevenshteinMatchingAutomaton.Implement WildcardLinearString into LevenshteinMatchingAutomaton