Fix group 0 with inexact matches

Stabilize the number of groups being returned

Fix issue with nested repeated groups

Fix path to BTreeMap on nightly

Fix compilation error of tests

More last minute interface changes

Fix no_std

Finish up & fix huge last minute bug :|

Benchmarks

Fix no_std build

Use less RCs in matcher

Clean up matcher

Word boundaries

Support start/end

Return group offsets

Fix offset tests

Fix no_std

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.

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 ...

Initial commit