summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorKarl Williamson <public@khwilliamson.com>2011-07-10 14:29:37 -0600
committerKarl Williamson <public@khwilliamson.com>2011-07-10 15:35:01 -0600
commit76b056786330ed54fe2be2eafa1948578a124a8a (patch)
tree9568f643eff11c336fa40c266fde5781ad50d4d1
parent5bff20359f7addcab31aec658577ac9469f6191a (diff)
downloadperl-76b056786330ed54fe2be2eafa1948578a124a8a.tar.gz
Unicode::UCD: nits in comments and pod
-rw-r--r--lib/Unicode/UCD.pm15
1 files changed, 7 insertions, 8 deletions
diff --git a/lib/Unicode/UCD.pm b/lib/Unicode/UCD.pm
index 30acd503b8..6b42ff563c 100644
--- a/lib/Unicode/UCD.pm
+++ b/lib/Unicode/UCD.pm
@@ -6,7 +6,7 @@ no warnings 'surrogate'; # surrogates can be inputs to this
use charnames ();
use Unicode::Normalize qw(getCombinClass NFKD);
-our $VERSION = '0.32';
+our $VERSION = '0.33';
use Storable qw(dclone);
@@ -344,10 +344,9 @@ sub charinfo {
# those. We can't use NFKD() for everything, as it does a complete
# recursive decomposition, and what this function has always done is to
# return what's in UnicodeData.txt which doesn't have the recursivenss
- # specified.
- # in the decomposition types. No decomposition implies an empty field;
- # otherwise, all but "Canonical" imply a compatible decomposition, and
- # the type is prefixed to that, as it is in UnicodeData.txt
+ # specified in the decomposition types. No decomposition implies an empty
+ # field; otherwise, all but "Canonical" imply a compatible decomposition,
+ # and the type is prefixed to that, as it is in UnicodeData.txt
if ($char =~ /\p{Block=Hangul_Syllables}/) {
# The code points of the decomposition are output in standard Unicode
# hex format, separated by blanks.
@@ -771,9 +770,9 @@ or even
my $compexcl = chr(0x09dc) =~ /\p{Composition_Exclusion};
The first two forms return B<true> if the L</code point argument> should not
-be produced by composition normalization. The final two forms
-additionally require that this fact not otherwise be determinable from
-the Unicode data base for them to return B<true>.
+be produced by composition normalization. For the final two forms to return
+B<true>, it is additionally required that this fact not otherwise be
+determinable from the Unicode data base.
This routine behaves identically to the final two forms. That is,
it does not return B<true> if the code point has a decomposition