<main><divclass="width-limiter"><navclass="sub"><formclass="search-form"><span></span><divid="sidebar-button"tabindex="-1"><ahref="../../../regex_automata/all.html"title="show sidebar"></a></div><inputclass="search-input"name="search"aria-label="Run search in the documentation"autocomplete="off"spellcheck="false"placeholder="Click or press ‘S’ to search, ‘?’ for more options…"type="search"><divid="help-button"tabindex="-1"><ahref="../../../help.html"title="help">?</a></div><divid="settings-menu"tabindex="-1"><ahref="../../../settings.html"title="settings"><imgwidth="22"height="22"alt="Change settings"src="../../../static.files/wheel-7b819b6101059cd0.svg"></a></div></form></nav><sectionid="main-content"class="content"><divclass="main-heading"><h1>Module <ahref="../../index.html">regex_automata</a>::<wbr><ahref="../index.html">hybrid</a>::<wbr><aclass="mod"href="#">regex</a><buttonid="copy-path"title="Copy item path to clipboard"><imgsrc="../../../static.files/clipboard-7571035ce49a181d.svg"width="19"height="18"alt="Copy item path"></button></h1><spanclass="out-of-band"><aclass="src"href="../../../src/regex_automata/hybrid/regex.rs.html#1-895">source</a> · <buttonid="toggle-all-docs"title="collapse all docs">[<span>−</span>]</button></span></div><detailsclass="toggle top-doc"open><summaryclass="hideme"><span>Expand description</span></summary><divclass="docblock"><p>A lazy DFA backed <code>Regex</code>.</p>
<p>This module provides a <ahref="struct.Regex.html"title="struct regex_automata::hybrid::regex::Regex"><code>Regex</code></a> backed by a lazy DFA. A <code>Regex</code> implements
convenience routines you might have come to expect, such as finding a match
and iterating over all non-overlapping matches. This <code>Regex</code> type is limited
in its capabilities to what a lazy DFA can provide. Therefore, APIs involving
capturing groups, for example, are not provided.</p>
<p>Internally, a <code>Regex</code> is composed of two DFAs. One is a “forward” DFA that
finds the end offset of a match, where as the other is a “reverse” DFA that
find the start offset of a match.</p>
<p>See the <ahref="../index.html"title="mod regex_automata::hybrid">parent module</a> for examples.</p>
</div></details><h2id="structs"class="section-header"><ahref="#structs">Structs</a></h2><ulclass="item-table"><li><divclass="item-name"><aclass="struct"href="struct.Builder.html"title="struct regex_automata::hybrid::regex::Builder">Builder</a></div><divclass="desc docblock-short">A builder for a regex based on a hybrid NFA/DFA.</div></li><li><divclass="item-name"><aclass="struct"href="struct.Cache.html"title="struct regex_automata::hybrid::regex::Cache">Cache</a></div><divclass="desc docblock-short">A cache represents a partially computed forward and reverse DFA.</div></li><li><divclass="item-name"><aclass="struct"href="struct.FindMatches.html"title="struct regex_automata::hybrid::regex::FindMatches">FindMatches</a></div><divclass="desc docblock-short">An iterator over all non-overlapping matches for an infallible search.</div></li><li><divclass="item-name"><aclass="struct"href="struct.Regex.html"title="struct regex_automata::hybrid::regex::Regex">Regex</a></div><divclass="desc docblock-short">A regular expression that uses hybrid NFA/DFAs (also called “lazy DFAs”)
for searching.</div></li></ul></section></div></main></body></html>
