diff options
| author | Karl Williamson <public@khwilliamson.com> | 2012-05-11 09:37:37 -0600 |
|---|---|---|
| committer | Karl Williamson <public@khwilliamson.com> | 2012-05-11 10:02:13 -0600 |
| commit | fd85cc123809ade53410187e9c57a3ae63402e24 (patch) | |
| tree | db83c18676f726b51198f7e706802ce7ed2c360c | |
| parent | 88132a12f68fbbafce95c14cb4e5aa3ebe667a4d (diff) | |
| download | perl-fd85cc123809ade53410187e9c57a3ae63402e24.tar.gz | |
perldelta: Correct statement
It was pointed out to me after I wrote the text in an earlier perldelta
that this one is extracted from, that it is extremely unlikely to run
out of memory; I had not bothered to really do the math.
| -rw-r--r-- | pod/perldelta.pod | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/pod/perldelta.pod b/pod/perldelta.pod index 3360af464e..d31948017f 100644 --- a/pod/perldelta.pod +++ b/pod/perldelta.pod @@ -859,7 +859,7 @@ property in each regular expression. Thus, C<qr/\p{foo}abc\p{foo}/> would generate two hashes. Any probes in one instance would be unknown to the other, and the hashes could expand separately to be quite large if the regular expression were used on many different widely-separated -code points. This can lead to running out of memory in extreme cases. +code points. Now, however, there is just one hash shared by all instances of a given property. This means that if C<\p{foo}> is matched against "A" in one regular expression in a thread, the result will be known immediately to |