boostorg/regex
1
0
Fork 1
mirror of https://github.com/boostorg/regex.git synced 2025-07-25 18:17:27 +02:00
Code Issues Packages Projects Releases Wiki Activity

Add checked constructors to the Unicode iterators that need them.

Browse Source 
Update icu support code to use the new checking-constructors.
Update tests to check the full Unicode character range (as of Unicode V6).
Add minimal docs describing the iterators.

[SVN r73271]
This commit is contained in:
John Maddock
2011-07-21 10:01:09 +00:00
parent 03ef9626ba
commit d08bfeff25
89 changed files with 1426 additions and 1088 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
doc/html/boost_regex/syntax/leftmost_longest_rule.html
View File

@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The Leftmost Longest Rule</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
<link rel="home" href="../../index.html" title="Boost.Regex">
<link rel="up" href="../syntax.html" title="Regular Expression Syntax">
<link rel="prev" href="collating_names/named_unicode.html" title="Named Unicode Characters">
@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="collating_names/named_unicode.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../syntax.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../format.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_regex.syntax.leftmost_longest_rule"></a><a class="link" href="leftmost_longest_rule.html" title="The Leftmost Longest Rule">The Leftmost
Longest Rule</a>
@ -32,32 +32,32 @@
location, for POSIX basic and extended regular expressions, the "best"
match is determined as follows:
</p>
<div class="orderedlist"><ol type="1">
<li>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
Find the leftmost match, if there is only one match possible at this
location then return it.
</li>
<li>
<li class="listitem">
Find the longest of the possible matches, along with any ties. If there
is only one such possible match then return it.
</li>
<li>
<li class="listitem">
If there are no marked sub-expressions, then all the remaining alternatives
are indistinguishable; return the first of these found.
</li>
<li>
<li class="listitem">
Find the match which has matched the first sub-expression in the leftmost
position, along with any ties. If there is only on such match possible
then return it.
</li>
<li>
<li class="listitem">
Find the match which has the longest match for the first sub-expression,
along with any ties. If there is only one such match then return it.
</li>
<li>
<li class="listitem">
Repeat steps 4 and 5 for each additional marked sub-expression.
</li>
<li>
<li class="listitem">
If there is still more than one possible match remaining, then they are
indistinguishable; return the first one found.
</li>
@ -65,7 +65,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 1998 -2010 John Maddock<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 1998-2010 John Maddock<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>