summaryrefslogtreecommitdiff
path: root/doc/html/pcre2build.html
diff options
context:
space:
mode:
authorph10 <ph10@6239d852-aaf2-0410-a92c-79f79f948069>2018-06-18 14:03:33 +0000
committerph10 <ph10@6239d852-aaf2-0410-a92c-79f79f948069>2018-06-18 14:03:33 +0000
commit219fa022fe95b36dbdd162b8a9e94f543cba07a6 (patch)
tree8ae059b4bf5da3a0f42040c95525015dbac0bf18 /doc/html/pcre2build.html
parent1326caa549bd96e614b91db87fffee2a4de07dfc (diff)
downloadpcre2-219fa022fe95b36dbdd162b8a9e94f543cba07a6.tar.gz
More typos and changes to "Kibibytes" for "Kilobytes".
git-svn-id: svn://vcs.exim.org/pcre2/code/trunk@937 6239d852-aaf2-0410-a92c-79f79f948069
Diffstat (limited to 'doc/html/pcre2build.html')
-rw-r--r--doc/html/pcre2build.html24
1 files changed, 12 insertions, 12 deletions
diff --git a/doc/html/pcre2build.html b/doc/html/pcre2build.html
index 3ce64f6..fc56808 100644
--- a/doc/html/pcre2build.html
+++ b/doc/html/pcre2build.html
@@ -252,10 +252,10 @@ Within a compiled pattern, offset values are used to point from one part to
another (for example, from an opening parenthesis to an alternation
metacharacter). By default, in the 8-bit and 16-bit libraries, two-byte values
are used for these offsets, leading to a maximum size for a compiled pattern of
-around 64K code units. This is sufficient to handle all but the most gigantic
-patterns. Nevertheless, some people do want to process truly enormous patterns,
-so it is possible to compile PCRE2 to use three-byte or four-byte offsets by
-adding a setting such as
+around 64 thousand code units. This is sufficient to handle all but the most
+gigantic patterns. Nevertheless, some people do want to process truly enormous
+patterns, so it is possible to compile PCRE2 to use three-byte or four-byte
+offsets by adding a setting such as
<pre>
--with-link-size=3
</pre>
@@ -282,7 +282,7 @@ to the <b>configure</b> command. This setting also applies to the
counting is done differently).
</P>
<P>
-The <b>pcre2_match()</b> function starts out using a 20K vector on the system
+The <b>pcre2_match()</b> function starts out using a 20KiB vector on the system
stack to record backtracking points. The more nested backtracking points there
are (that is, the deeper the search tree), the more memory is needed. If the
initial vector is not large enough, heap memory is used, up to a certain limit,
@@ -399,13 +399,13 @@ they are not.
<P>
<b>pcre2grep</b> uses an internal buffer to hold a "window" on the file it is
scanning, in order to be able to output "before" and "after" lines when it
-finds a match. The starting size of the buffer is controlled by a parameter
-whose default value is 20K. The buffer itself is three times this size, but
-because of the way it is used for holding "before" lines, the longest line that
-is guaranteed to be processable is the parameter size. If a longer line is
-encountered, <b>pcre2grep</b> automatically expands the buffer, up to a
-specified maximum size, whose default is 1M or the starting size, whichever is
-the larger. You can change the default parameter values by adding, for example,
+finds a match. The default starting size of the buffer is 20KiB. The buffer
+itself is three times this size, but because of the way it is used for holding
+"before" lines, the longest line that is guaranteed to be processable is the
+notional buffer size. If a longer line is encountered, <b>pcre2grep</b>
+automatically expands the buffer, up to a specified maximum size, whose default
+is 1MiB or the starting size, whichever is the larger. You can change the
+default parameter values by adding, for example,
<pre>
--with-pcre2grep-bufsize=51200
--with-pcre2grep-max-bufsize=2097152