summaryrefslogtreecommitdiffstats
path: root/vendor/regex-automata/TODO
diff options
context:
space:
mode:
Diffstat (limited to 'vendor/regex-automata/TODO')
-rw-r--r--vendor/regex-automata/TODO10
1 files changed, 10 insertions, 0 deletions
diff --git a/vendor/regex-automata/TODO b/vendor/regex-automata/TODO
new file mode 100644
index 000000000..bc3b7aab9
--- /dev/null
+++ b/vendor/regex-automata/TODO
@@ -0,0 +1,10 @@
+* Remove the `empty` constructors for DFAs and replace them with
+ `never_match` and `always_match` constructors.
+* Consider refactoring the NFA representation such that it can be instantly
+ loaded from a `&[u8]`, just like a sparse DFA. Main downside is that this
+ could negatively impact using the NFA with deserialization costs. Before
+ doing this, we should write PikeVM and backtracking implementations so that
+ they can be benchmarked.
+* Add captures and anchors to NFA.
+* Once we're happy, re-organize the public API such that NFAs are exported
+ and usable on their own.