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.08Apr765432127Mar222120181716157627Feb1513986130Jan2827262518171210986324Dec222113121182128Nov252422212015109872131Oct28242221201916151098764328Sep2422212018161312111098765330Aug2928272625242322212019181716151413121198765432131Jul30242120191611754327Jun2623222120196523May19begin documentation of unbounded regexp elementsfix documentation of regexpssimplify grammar Renamefix documentation and stream output operator for grammarsdocument formal regexp and fix unboundedmove templated code to header file derivativesmore precise construction of automaton by derivativesdocument main unbounded regexp classfix parameter documentation in automatadocument turing machinedetect transitions from final state of turing machineadd missing specialisation of comparevariadic min and max functionsrefactor work of matching automataImplement GeneralizedLevenshteinSequenceMatchingAutomaton.Implement LevenshteinSequenceMatchingAutomaton.Implement HammingSequenceMatchingAutomaton.Implement SequenceMatchingAutomaton.Refactor GeneralizedLevenshteinMatchingAutomaton - change style of main cycle.Refactor LevenshteinMatchingAutomaton - change main cycle.Implement algorithm for construction of matching automata using Generalized Levenshtein method.Refactor LevenshteinMatchingAutomaton.Refactor HammingMatchingAutomaton.Implement algorithm for construction of matching automata using Levenshtein method.Add new type into PrimitiveRegistrator.Implement algorithm for construciton of matching automata using Hamming method.finish documentation of tree automatafix some S |S pattern related issues in BCS like algosfix S |S related issues in use of compressed bit parallel indextune tree backward pattern matchingdocument NFTA automatonExtended ext::map with insert_or_assign member funciton.some comments on Reversed BCS constructionadapt changes to ReversedQuickSearchadapt changes to QuickSearchAdded Reversed Quick Search arbology algorithm + some code polishingBP_cvachmicBP_cvachmicAdded QuickSearch arbology algorithm for tree pattern matching. Added into tests and working according to randomized tests.Added Quick Search exact stringology matching algorithm.simplify computation of BCS tabletake out searching sbar and variable in pattern