summaryrefslogtreecommitdiffstats
path: root/vendor/regex-automata-0.2.0/TODO
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-05-30 18:31:36 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-05-30 18:31:36 +0000
commite02c5b5930c2c9ba3e5423fe12e2ef0155017297 (patch)
treefd60ebbbb5299e16e5fca8c773ddb74f764760db /vendor/regex-automata-0.2.0/TODO
parentAdding debian version 1.73.0+dfsg1-1. (diff)
downloadrustc-e02c5b5930c2c9ba3e5423fe12e2ef0155017297.tar.xz
rustc-e02c5b5930c2c9ba3e5423fe12e2ef0155017297.zip
Merging upstream version 1.74.1+dfsg1.
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'vendor/regex-automata-0.2.0/TODO')
-rw-r--r--vendor/regex-automata-0.2.0/TODO13
1 files changed, 13 insertions, 0 deletions
diff --git a/vendor/regex-automata-0.2.0/TODO b/vendor/regex-automata-0.2.0/TODO
new file mode 100644
index 000000000..68f018799
--- /dev/null
+++ b/vendor/regex-automata-0.2.0/TODO
@@ -0,0 +1,13 @@
+* 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 to NFA.
+* Once we're happy, re-organize the public API such that NFAs are exported
+ and usable on their own.
+
+* Investigate why NFA shrinking seems to produce bigger DFAs after
+ determinization, even though it makes determinization substantially
+ faster. This might be because of its use of sparse NFA states, which have
+ a lower constant overhead associated with them.