From: jkeenan Date: Sun, 20 Nov 2011 00:23:00 +0000 (-0500) Subject: [RT #36079] Convert ` to '. X-Git-Tag: accepted/trunk/20130322.191538~2001^2~19 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=882ce58311c12cbb8ddfaeaaf1c718a77e62c5b9;p=platform%2Fupstream%2Fperl.git [RT #36079] Convert ` to '. --- diff --git a/dist/if/t/if.t b/dist/if/t/if.t index 25bf09a..e55bca3 100644 --- a/dist/if/t/if.t +++ b/dist/if/t/if.t @@ -26,7 +26,7 @@ is( eval "use if ($v_plus > \$]), strict => 'refs'; \${'f'} = 12", undef, '"use if" with a true condition and a pragma'); like( $@, qr/while "strict refs" in use/, 'expected error message'), -# Old version had problems with the module name `open', which is a keyword too +# Old version had problems with the module name 'open', which is a keyword too # Use 'open' =>, since pre-5.6.0 could interpret differently is( (eval "use if ($v_plus > \$]), 'open' => IN => ':crlf'; 12" || 0), 12, '"use if" with open'); diff --git a/ext/File-Glob/Glob.pm b/ext/File-Glob/Glob.pm index 842100a..3f86ddc 100644 --- a/ext/File-Glob/Glob.pm +++ b/ext/File-Glob/Glob.pm @@ -359,7 +359,7 @@ following copyright: may be used to endorse or promote products derived from this software without specific prior written permission. - THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND + THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE diff --git a/ext/File-Glob/bsd_glob.c b/ext/File-Glob/bsd_glob.c index 89d51af..5019af1 100644 --- a/ext/File-Glob/bsd_glob.c +++ b/ext/File-Glob/bsd_glob.c @@ -17,7 +17,7 @@ * may be used to endorse or promote products derived from this software * without specific prior written permission. * - * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND + * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS" AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE diff --git a/ext/File-Glob/bsd_glob.h b/ext/File-Glob/bsd_glob.h index af92c04..c913cff 100644 --- a/ext/File-Glob/bsd_glob.h +++ b/ext/File-Glob/bsd_glob.h @@ -17,7 +17,7 @@ * may be used to endorse or promote products derived from this software * without specific prior written permission. * - * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND + * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS" AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE diff --git a/ext/SDBM_File/sdbm/README b/ext/SDBM_File/sdbm/README index cd7312c..2013504 100644 --- a/ext/SDBM_File/sdbm/README +++ b/ext/SDBM_File/sdbm/README @@ -32,7 +32,7 @@ derived from any licensed, proprietary or copyrighted software. The sdbm implementation is based on a 1978 algorithm -[Lar78] by P.-A. (Paul) Larson known as ``Dynamic Hashing''. +[Lar78] by P.-A. (Paul) Larson known as "Dynamic Hashing". In the course of searching for a substitute for ndbm, I pro- totyped three different external-hashing algorithms [Lar78, Fag79, Lit80] and ultimately chose Larson's algorithm as a @@ -70,7 +70,7 @@ _________________________ - 2 - -store operation will not ``wander away'' trying to split its +store operation will not "wander away" trying to split its data pages to insert a datum that cannot (due to elaborate worst-case situations) be inserted. (It will fail after a pre-defined number of attempts.) @@ -298,30 +298,30 @@ References [Lar78] - P.-A. Larson, ``Dynamic Hashing'', BIT, vol. 18, pp. + P.-A. Larson, "Dynamic Hashing", BIT, vol. 18, pp. 184-201, 1978. [Tho90] Ken Thompson, private communication, Nov. 1990 [Lit80] - W. Litwin, `` Linear Hashing: A new tool for file and + W. Litwin, '' Linear Hashing: A new tool for file and table addressing'', Proceedings of the 6th Conference on Very Large Dabatases (Montreal), pp. 212-223, Very Large Database Foundation, Saratoga, Calif., 1980. [Fag79] R. Fagin, J. Nievergelt, N. Pippinger, and H. R. - Strong, ``Extendible Hashing - A Fast Access Method for + Strong, ''Extendible Hashing - A Fast Access Method for Dynamic Files'', ACM Trans. Database Syst., vol. 4, no.3, pp. 315-344, Sept. 1979. [Wal84] - Rich Wales, ``Discussion of "dbm" data base system'', + Rich Wales, ''Discussion of "dbm" data base system'', USENET newsgroup unix.wizards, Jan. 1984. [Tor87] - Chris Torek, ``Re: dbm.a and ndbm.a archives'', + Chris Torek, "Re: dbm.a and ndbm.a archives", @@ -337,12 +337,12 @@ References USENET newsgroup comp.unix, 1987. [Mar79] - G. N. Martin, ``Spiral Storage: Incrementally Augment- + G. N. Martin, ''Spiral Storage: Incrementally Augment- able Hash Addressed Storage'', Technical Report #27, University of Varwick, Coventry, U.K., 1979. [Enb88] - R. J. Enbody and H. C. Du, ``Dynamic Hashing + R. J. Enbody and H. C. Du, ''Dynamic Hashing Schemes'',ACM Computing Surveys, vol. 20, no. 2, pp. 85-113, June 1988. diff --git a/ext/SDBM_File/sdbm/readme.ms b/ext/SDBM_File/sdbm/readme.ms index 01ca17c..6e8137c 100644 --- a/ext/SDBM_File/sdbm/readme.ms +++ b/ext/SDBM_File/sdbm/readme.ms @@ -70,7 +70,7 @@ The \fIsdbm\fP library is not derived from any licensed, proprietary or copyrighted software. .PP The \fIsdbm\fP implementation is based on a 1978 algorithm -[Lar78] by P.-A. (Paul) Larson known as ``Dynamic Hashing''. +[Lar78] by P.-A. (Paul) Larson known as "Dynamic Hashing". In the course of searching for a substitute for \fIndbm\fP, I prototyped three different external-hashing algorithms [Lar78, Fag79, Lit80] and ultimately chose Larson's algorithm as a basis of the \fIsdbm\fP @@ -94,7 +94,7 @@ smaller. The \fIsdbm\fP implementation is also faster than \fIndbm\fP in database creation. Unlike the \fIndbm\fP, the \fIsdbm\fP .CW store -operation will not ``wander away'' trying to split its +operation will not "wander away" trying to split its data pages to insert a datum that \fIcannot\fP (due to elaborate worst-case situations) be inserted. (It will fail after a pre-defined number of attempts.) .SH @@ -323,31 +323,31 @@ References .LP .IP [Lar78] 4m P.-A. Larson, -``Dynamic Hashing'', \fIBIT\fP, vol. 18, pp. 184-201, 1978. +"Dynamic Hashing", \fIBIT\fP, vol. 18, pp. 184-201, 1978. .IP [Tho90] 4m Ken Thompson, \fIprivate communication\fP, Nov. 1990 .IP [Lit80] 4m W. Litwin, -`` Linear Hashing: A new tool for file and table addressing'', +" Linear Hashing: A new tool for file and table addressing", \fIProceedings of the 6th Conference on Very Large Dabatases (Montreal)\fP, pp. 212-223, Very Large Database Foundation, Saratoga, Calif., 1980. .IP [Fag79] 4m R. Fagin, J. Nievergelt, N. Pippinger, and H. R. Strong, -``Extendible Hashing - A Fast Access Method for Dynamic Files'', +"Extendible Hashing - A Fast Access Method for Dynamic Files", \fIACM Trans. Database Syst.\fP, vol. 4, no.3, pp. 315-344, Sept. 1979. .IP [Wal84] 4m Rich Wales, -``Discussion of "dbm" data base system'', \fIUSENET newsgroup unix.wizards\fP, +"Discussion of "dbm" data base system", \fIUSENET newsgroup unix.wizards\fP, Jan. 1984. .IP [Tor87] 4m Chris Torek, -``Re: dbm.a and ndbm.a archives'', \fIUSENET newsgroup comp.unix\fP, +"Re: dbm.a and ndbm.a archives", \fIUSENET newsgroup comp.unix\fP, 1987. .IP [Mar79] 4m G. N. Martin, -``Spiral Storage: Incrementally Augmentable Hash Addressed Storage'', +"Spiral Storage: Incrementally Augmentable Hash Addressed Storage", \fITechnical Report #27\fP, University of Varwick, Coventry, U.K., 1979. .IP [Enb88] 4m R. J. Enbody and H. C. Du, -``Dynamic Hashing Schemes'',\fIACM Computing Surveys\fP, +"Dynamic Hashing Schemes",\fIACM Computing Surveys\fP, vol. 20, no. 2, pp. 85-113, June 1988. diff --git a/ext/Socket/Socket.xs b/ext/Socket/Socket.xs index 2c67c3a..e164e67 100644 --- a/ext/Socket/Socket.xs +++ b/ext/Socket/Socket.xs @@ -96,7 +96,7 @@ my_inet_aton(register const char *cp, struct in_addr *addr) return 0; for (;;) { /* - * Collect number up to ``.''. + * Collect number up to ".". * Values are specified as for C: * 0x=hex, 0=octal, other=decimal. */ diff --git a/ext/Sys-Hostname/t/Hostname.t b/ext/Sys-Hostname/t/Hostname.t index 8e012b4..40352ba 100644 --- a/ext/Sys-Hostname/t/Hostname.t +++ b/ext/Sys-Hostname/t/Hostname.t @@ -18,6 +18,6 @@ if ($@) { print "1..0\n" if $@ =~ /Cannot get host name/; } else { print "1..1\n"; - print "# \$host = `$host'\n"; + print "# \$host = '$host'\n"; print "ok 1\n"; }