A new all Haskell "tagged" DFA regex engine, inspired by libtre
- New maintainer.
- Now we don't reexport the problematic
Showinstance for functions.
Updated dependency versions.
"Almost ghc-7.8" with the array 0.4 changes for
Make ghc-7.0.2 on platorm 2011.2.0.0.0 happy
fix url below
Fix bug preventing
] [-] [^]] [^-] (thanks to Maxime Henrion)
POr in CorePattern.hs, try
toAdvice b for
BROKEN after 100 characters the
add gnu escapes
NewDFA code working
make NewDFA directory and String_NC
try NewDFATest_SBS with
uncons on SBS
try repaired NewDFATest_SBS
- np13: try to improve readability with the
- np12: expand
oin the case where
Nothing? Yes – this is the fix!?
- np11: break multi to not look at
oand just return
True? Yes !!!!
- np10: Peel off
IntMapand DFA/DT with pattern matching? No
- np8: np6 and
- np7: just return
- np6: comment out ans check? No
- np5: comment out all
- np4: comment out all
!offthe multi? No
- np2: comment out all Testing code? No
try to alter
matchTest to not have the
Bool args? No
arg, the prof is fast and the normal slow!
go to many vs single?
try for pre-comparison of orbit-logs!
try alternate lazy/strict strategy in NewDFA. Fix offset laziness.
radical removal of flag array and adding of
SetVal to handle groups
performance? up to v15
get string with NewDFA testing, unit tests and 1000 random regex pass
start changing to the new real DFA
try to debug 0.99.11: fixed
improve above fix and make stuff work better – HAS BUG, along with old TDFA!
((.?)*)* patterns by changing
PStar nullView when
choose to include
(a*)* is canonical problem
(PGroup Nothing) in
Pattern to decompose
change to nested
nonEmpty calls for
pnonempty' = \ p -> POr [ PEmpty, p ] instead of