summaryrefslogtreecommitdiffstats
path: root/doc/html/qregexp.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/qregexp.html')
-rw-r--r--doc/html/qregexp.html4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/html/qregexp.html b/doc/html/qregexp.html
index 5c0cb578..089a42f8 100644
--- a/doc/html/qregexp.html
+++ b/doc/html/qregexp.html
@@ -159,7 +159,7 @@ maximum level of nesting it is possible to create a regexp that
will match correctly, but for an unknown level of nesting, regexps
will fail.
<p> We'll start by writing a regexp to match integers in the range 0
-to 99. We will retquire at least one digit so we will start with
+to 99. We will require at least one digit so we will start with
<b>[0-9]{1,1}</b> which means match a digit exactly once. This
regexp alone will match integers in the range 0 to 9. To match one
or two digits we can increase the maximum number of occurrences so
@@ -486,7 +486,7 @@ TQRegExp always signifies the end of the string.
<p> TQRegExp's quantifiers are the same as Perl's greedy quantifiers.
Non-greedy matching cannot be applied to individual quantifiers,
but can be applied to all the quantifiers in the pattern. For
-example, to match the Perl regexp <b>ro+?m</b> retquires:
+example, to match the Perl regexp <b>ro+?m</b> requires:
<pre>
TQRegExp rx( "ro+m" );
rx.<a href="#setMinimal">setMinimal</a>( TRUE );