0d996efe | 14-Nov-2018 |
jD91mZM2 <me@krake.one> |
Fix group 0 with inexact matches |
51369b25 | 14-Nov-2018 |
jD91mZM2 <me@krake.one> |
Stabilize the number of groups being returned |
bf7d93bb | 14-Nov-2018 |
jD91mZM2 <me@krake.one> |
Fix issue with nested repeated groups |
eccf8447 | 08-Nov-2018 |
Jeremy Soller <jeremy@system76.com> |
Fix path to BTreeMap on nightly |
f4b19fb1 | 05-Oct-2018 |
jD91mZM2 <me@krake.one> |
crates.io shield |
583b8bc1 | 05-Oct-2018 |
jD91mZM2 <me@krake.one> |
Prepare for crates.io |
2e761fe6 | 05-Oct-2018 |
jD91mZM2 <me@krake.one> |
Downgrade rust to fix no_std compilation |
cc3599c3 | 05-Oct-2018 |
jD91mZM2 <me@krake.one> |
Fix compilation error of tests |
eefcccb4 | 04-Oct-2018 |
jD91mZM2 <me@krake.one> |
More last minute interface changes |
e88e0d77 | 04-Oct-2018 |
jD91mZM2 <me@krake.one> |
Fix no_std |
8f752491 | 03-Oct-2018 |
jD91mZM2 <me@krake.one> |
Finish up & fix huge last minute bug :| |
9efe1bdd | 02-Oct-2018 |
jD91mZM2 <me@krake.one> |
Benchmarks |
2ee1054b | 02-Oct-2018 |
jD91mZM2 <me@krake.one> |
Fix no_std build |
4014cb7b | 02-Oct-2018 |
jD91mZM2 <me@krake.one> |
Use less RCs in matcher |
ca7fee91 | 02-Oct-2018 |
jD91mZM2 <me@krake.one> |
Clean up matcher |
c8f82a17 | 02-Oct-2018 |
jD91mZM2 <me@krake.one> |
Word boundaries |
5a488503 | 02-Oct-2018 |
jD91mZM2 <me@krake.one> |
Support start/end |
73db326b | 01-Oct-2018 |
jD91mZM2 <me@krake.one> |
Update README TODO |
440a304f | 01-Oct-2018 |
jD91mZM2 <me@krake.one> |
Set up CI |
d0d26187 | 01-Oct-2018 |
jD91mZM2 <me@krake.one> |
Return group offsets |
8c5e7d9d | 01-Oct-2018 |
jD91mZM2 <me@krake.one> |
Fix offset tests |
738ff146 | 01-Oct-2018 |
jD91mZM2 <me@krake.one> |
Fix no_std |
2fb23e39 | 01-Oct-2018 |
jD91mZM2 <me@krake.one> |
Initial support for groups
I had to sell my soul to satan for this. Don't mind the reference counters... They were a part of the deal. |
e2ed6257 | 30-Sep-2018 |
jD91mZM2 <me@krake.one> |
Rewrite matcher
The idea is that it'll keep a list of all possible branches, exploring each one. Then it keeps feeding them, until either all branches end up dead ends (counts as a failure), or one
Rewrite matcher
The idea is that it'll keep a list of all possible branches, exploring each one. Then it keeps feeding them, until either all branches end up dead ends (counts as a failure), or one of the branches got explored all the way until the end (counts as a success).
Thanks to @tbodt for hinting me how to do this! It's hopefully going to make implementing groups easier too :)
This may or may not be called NFA or DFA or something cool like that.
show more ...
|
7648b78f | 30-Sep-2018 |
jD91mZM2 <me@krake.one> |
Initial commit |