Deterministic finite automata for Unicode code points.

The type of a compiled regular expression.

Use of_text s to make a regular expression denoted by s. Raises Invalid_argment if s does not denote a valid regular expression.

Use of_uchars s to make a regular expression denoted by the Unicode codepoints in s. Raises Invalid_argment if the characters do not denote a valid regular expression.

Use of_dfa_term s to make a regular expression for recognizing the language term s.

Use test r t to test whether the text t matches the regular expression r.

Use contains r t to test whether r recognizes any substring of t.

Use search r s to search with r in a confluently persistent sequence s for the first accepted subsequence. Returns None if s does not contain a matching subsequence. Otherwise, returns Some (start, limit) where start is the index of the first matching subsequence, and limit is the index after the end of the longest matching subsequence.

Use split r s to split s into a sequence of slices comprising the substrings in s that are separated by disjoint substrings matching r, which are found by searching from left to right. If r does not match any substring in s, then a sequence containing just s is returned, even if s is an empty slice.

Use quote s to make a copy of s by converting all the special characters into escape sequences.

Use unquote s to make a copy of s by converting all the escape sequences into ordinary characters.