mirror of https://github.com/rust-lang/rust.git
88a86794b9
The previous implementation was inconsistent about transitions that apply for an init byte. For example, when answering a query, an init byte could use corresponding init transition. Init byte could also use uninit transition, but only when the corresponding init transition was absent. This behaviour was incompatible with DFA union construction. Define an uninit transition to match an uninit byte only and update implementation accordingly. To describe that `Tree::uninit` is valid for any value, build an automaton that accepts any byte value. Additionally, represent byte ranges uniformly as a pair of integers to avoid special case for uninit byte. |
||
|---|---|---|
| .. | ||
| repr | ||
| boolish.rs | ||
| extension.rs | ||
| extension.stderr | ||
| init_as_uninit.rs | ||
| should_pad_variants.rs | ||
| should_pad_variants.stderr | ||
| should_permit_intersecting_if_validity_is_assumed.rs | ||
| should_reject_contraction.rs | ||
| should_reject_contraction.stderr | ||
| should_reject_disjoint.rs | ||
| should_reject_disjoint.stderr | ||
| should_reject_intersecting.rs | ||
| should_reject_intersecting.stderr | ||