Produces the sorted, minimal set of ranges to represent the Atom. Example: ``` use ere_core::parse_tree::Atom; assert_eq!( "[a-z2-9A-X0-1YZ[:xdigit:]

Finds the number of capture groups in this NFA

Goes until a non-nested `)` or the end of the string (does not consume).

return 0 if there are no capture groups

We only need to retain states with outgoing symbol transitions As well as the initial and accept states

If the offsets are fixed, returns them for each capture group. Value is [`usize::MAX`] if a capture group never matches (usually shouldn't happen)

Tries to pick the best engine that doesn't rely on sub-engines. Returns a stream that evaluates to a pair `(test_fn, exec_fn)`

Tries to pick the best engine that doesn't rely on sub-engines. Returns a stream that evaluates to a pair `(test_fn, exec_fn)`

Helper function for removing a set of states. These states should have no incoming transitions.

Helper function for removing a set of states. These states should have no incoming transitions.

Uses the `test` function from an inner engine for the exec and extracts capture groups with fixed offsets

Converts a [`WorkingNFA`] into a format that, when returned by a proc macro, will create the corresponding engine. Will evaluate to a `const` pair `(

Converts a [`U8NFA`] into a format that, when returned by a proc macro, will create the corresponding engine.

If the NFA is [one-pass](https://swtch.com/~rsc/regexp/regexp3.html#:~:text=Use%20a%20one%2Dpass%20NFA%20if%20possible), this function will serialize

Converts a [`U8TDFA`] into a format that, when returned by a proc macro, will create the corresponding engine. Will use [`U8DFA`] as an intermediate

Splits overlapping ranges so they are fully overlapping and/or non-overlapping. This essentially makes the ranges disjoint, while maintaining the asso

Tries to find a [topological ordering](https://en.wikipedia.org/wiki/Topological_sorting) from the start node to the accept node. If successful (the

Tries to pick the best engine.

Always uses the [`dfa_u8`] engine

Always uses the [`fixed_offset`] Will return a compiler error if regex was not fixed offset.

Always uses the [`flat_lockstep_nfa`] engine

Always uses the [`flat_lockstep_nfa_u8`] engine

Always uses the [`one_pass_u8`] Will return a compiler error if regex was not one-pass and could not be optimized to become one-pass.

Returns the capture group number this tag is associated with.

Returns whether each there is any matching path where the capture group is unused

Checks matches to the char classes.

Removes end anchors that will never be satisfied (basically turning them into a `Never` to allow further optimization)

Removes start anchors that will never be satisfied (basically turning them into a `Never` to allow further optimization)

Will evaluate to a `const` pair `(test_fn, exec_fn)`. ## Params - `nfa` is the original nfa - `num_captures` is the calculated number of capture grou

Will evaluate to a `const` pair `(test_fn, exec_fn)`.

Since we are shortcutting the epsilon transitions, we can skip printing states that have only epsilon transitions and are not the start/end states

Since we are shortcutting the epsilon transitions, we can skip printing states that have only epsilon transitions and are not the start/end states

## Parameters - `symbol_transitions`: for each state, a list of ranges to match with their corresponding thread updates (the changes to apply if it ma

De-duplicates identical transitions (`a -e> b`, `a -e> b`) -> (`a -e> b`) Returns `true` if changes were made. The highest-priority transition will b

De-duplicates identical transitions (`a -e> b`, `a -e> b`) -> (`a -e> b`) Returns `true` if changes were made. The highest-priority transition will b

Given a state with `nfa_states` set but empty transitions and no accept, expands the state to include all possible transitions. ## Params - `nfa` is

Merge two states, changing all transitions into `merge` to transitions to `keep`, and removing `merge` state (changing all higher indices as well) ##

Finds all nodes that are only ever visited after a `$`.

Finds all nodes that are only ever visited after a `$`.

Finds all nodes that are only ever visited before a `^`.

Finds all nodes that are only ever visited before a `^`.

Optimizes the NFA graph. Returns `true` if changes were made (meaning another pass should be tried).

Various operations to optimize the NFA graph. Returns `true` if changes were made (meaning another pass should be tried).

Removes all nodes that cannot be reached or cannot reach the end. Ignores special epsilon types (so should be called after they have been resolved)

Removes all nodes that cannot be reached or cannot reach the end. Ignores special epsilon types (so should be called after they have been resolved)

Finds the states that can reach the end via any path

Finds the states that can reach the end via any path

Finds the states that can be reached from the start via any path

Finds the states that can be reached from the start via any path

Updates the accept transitions with more transitions that take lower priority. This is basically equivalent to [`Self::from_epsilon_prop`] with the c

Only intended for internal use by macros.

Only intended for internal use by macros.

Converts from a char-based NFA Does not include any optimizations