diff options
| author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-17 12:18:25 +0000 |
|---|---|---|
| committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-17 12:18:25 +0000 |
| commit | 5363f350887b1e5b5dd21a86f88c8af9d7fea6da (patch) | |
| tree | 35ca005eb6e0e9a1ba3bb5dbc033209ad445dc17 /vendor/regex-automata/TODO | |
| parent | Adding debian version 1.66.0+dfsg1-1. (diff) | |
| download | rustc-5363f350887b1e5b5dd21a86f88c8af9d7fea6da.tar.xz rustc-5363f350887b1e5b5dd21a86f88c8af9d7fea6da.zip | |
Merging upstream version 1.67.1+dfsg1.
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'vendor/regex-automata/TODO')
| -rw-r--r-- | vendor/regex-automata/TODO | 9 |
1 files changed, 6 insertions, 3 deletions
diff --git a/vendor/regex-automata/TODO b/vendor/regex-automata/TODO index bc3b7aab9..68f018799 100644 --- a/vendor/regex-automata/TODO +++ b/vendor/regex-automata/TODO @@ -1,10 +1,13 @@ -* 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. +* 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. |