Initial commit of OpenSPARC T2 architecture model.

[OpenSPARC-T2-SAM] / sam-t2 / devtools / v9 / man / man1 / perlfaq4.1

.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.32
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sh \" Subsection heading
.br
.if t .Sp
.ne 5
.PP
\fB\\$1\fR
.PP
..
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  | will give a
.\" real vertical bar.  \*(C+ will give a nicer C++.  Capital omega is used to
.\" do unbreakable dashes and therefore won't be available.  \*(C` and \*(C'
.\" expand to `' in nroff, nothing in troff, for use with C<>.
.tr \(*W-|\(bv\*(Tr
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
'br\}
.\"
.\" If the F register is turned on, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.if \nF \{\
.    de IX
.    tm Index:\\$1\t\\n%\t"\\$2"
..
.    nr % 0
.    rr F
.\}
.\"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.hy 0
.if n .na
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "PERLFAQ4 1"
.TH PERLFAQ4 1 "2006-01-07" "perl v5.8.8" "Perl Programmers Reference Guide"
.SH "NAME"
perlfaq4 \- Data Manipulation ($Revision: 1.73 $, $Date: 2005/12/31 00:54:37 $)
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
This section of the \s-1FAQ\s0 answers questions related to manipulating
numbers, dates, strings, arrays, hashes, and miscellaneous data issues.
.SH "Data: Numbers"
.IX Header "Data: Numbers"
.Sh "Why am I getting long decimals (eg, 19.9499999999999) instead of the numbers I should be getting (eg, 19.95)?"
.IX Subsection "Why am I getting long decimals (eg, 19.9499999999999) instead of the numbers I should be getting (eg, 19.95)?"
Internally, your computer represents floating-point numbers
in binary. Digital (as in powers of two) computers cannot
store all numbers exactly.  Some real numbers lose precision
in the process.  This is a problem with how computers store
numbers and affects all computer languages, not just Perl.
.PP
perlnumber show the gory details of number
representations and conversions.
.PP
To limit the number of decimal places in your numbers, you
can use the printf or sprintf function.  See the
\&\*(L"Floating Point Arithmetic\*(R" for more details.
.PP
.Vb 1
\&        printf "%.2f", 10/3;
.Ve
.PP
.Vb 1
\&        my $number = sprintf "%.2f", 10/3;
.Ve
.Sh "Why is \fIint()\fP broken?"
.IX Subsection "Why is int() broken?"
Your \fIint()\fR is most probably working just fine.  It's the numbers that
aren't quite what you think.
.PP
First, see the above item \*(L"Why am I getting long decimals
(eg, 19.9499999999999) instead of the numbers I should be getting
(eg, 19.95)?\*(R".
.PP
For example, this
.PP
.Vb 1
\&    print int(0.6/0.2-2), "\en";
.Ve
.PP
will in most computers print 0, not 1, because even such simple
numbers as 0.6 and 0.2 cannot be presented exactly by floating-point
numbers.  What you think in the above as 'three' is really more like
2.9999999999999995559.
.Sh "Why isn't my octal data interpreted correctly?"
.IX Subsection "Why isn't my octal data interpreted correctly?"
Perl only understands octal and hex numbers as such when they occur as
literals in your program.  Octal literals in perl must start with a
leading \*(L"0\*(R" and hexadecimal literals must start with a leading \*(L"0x\*(R".
If they are read in from somewhere and assigned, no automatic
conversion takes place.  You must explicitly use \fIoct()\fR or \fIhex()\fR if you
want the values converted to decimal.  \fIoct()\fR interprets hex (\*(L"0x350\*(R"),
octal (\*(L"0350\*(R" or even without the leading \*(L"0\*(R", like \*(L"377\*(R") and binary
(\*(L"0b1010\*(R") numbers, while \fIhex()\fR only converts hexadecimal ones, with
or without a leading \*(L"0x\*(R", like \*(L"0x255\*(R", \*(L"3A\*(R", \*(L"ff\*(R", or \*(L"deadbeef\*(R".
The inverse mapping from decimal to octal can be done with either the
\&\*(L"%o\*(R" or \*(L"%O\*(R" \fIsprintf()\fR formats.
.PP
This problem shows up most often when people try using \fIchmod()\fR, \fImkdir()\fR,
\&\fIumask()\fR, or \fIsysopen()\fR, which by widespread tradition typically take
permissions in octal.
.PP
.Vb 2
\&    chmod(644,  $file); # WRONG
\&    chmod(0644, $file); # right
.Ve
.PP
Note the mistake in the first line was specifying the decimal literal
644, rather than the intended octal literal 0644.  The problem can
be seen with:
.PP
.Vb 1
\&    printf("%#o",644); # prints 01204
.Ve
.PP
Surely you had not intended \f(CW\*(C`chmod(01204, $file);\*(C'\fR \- did you?  If you
want to use numeric literals as arguments to \fIchmod()\fR et al. then please
try to express them as octal constants, that is with a leading zero and
with the following digits restricted to the set 0..7.
.Sh "Does Perl have a \fIround()\fP function?  What about \fIceil()\fP and \fIfloor()\fP?  Trig functions?"
.IX Subsection "Does Perl have a round() function?  What about ceil() and floor()?  Trig functions?"
Remember that \fIint()\fR merely truncates toward 0.  For rounding to a
certain number of digits, \fIsprintf()\fR or \fIprintf()\fR is usually the easiest
route.
.PP
.Vb 1
\&    printf("%.3f", 3.1415926535);       # prints 3.142
.Ve
.PP
The \s-1POSIX\s0 module (part of the standard Perl distribution) implements
\&\fIceil()\fR, \fIfloor()\fR, and a number of other mathematical and trigonometric
functions.
.PP
.Vb 3
\&    use POSIX;
\&    $ceil   = ceil(3.5);                        # 4
\&    $floor  = floor(3.5);                       # 3
.Ve
.PP
In 5.000 to 5.003 perls, trigonometry was done in the Math::Complex
module.  With 5.004, the Math::Trig module (part of the standard Perl
distribution) implements the trigonometric functions. Internally it
uses the Math::Complex module and some functions can break out from
the real axis into the complex plane, for example the inverse sine of
2.
.PP
Rounding in financial applications can have serious implications, and
the rounding method used should be specified precisely.  In these
cases, it probably pays not to trust whichever system rounding is
being used by Perl, but to instead implement the rounding function you
need yourself.
.PP
To see why, notice how you'll still have an issue on half-way-point
alternation:
.PP
.Vb 1
\&    for ($i = 0; $i < 1.01; $i += 0.05) { printf "%.1f ",$i}
.Ve
.PP
.Vb 2
\&    0.0 0.1 0.1 0.2 0.2 0.2 0.3 0.3 0.4 0.4 0.5 0.5 0.6 0.7 0.7
\&    0.8 0.8 0.9 0.9 1.0 1.0
.Ve
.PP
Don't blame Perl.  It's the same as in C.  \s-1IEEE\s0 says we have to do this.
Perl numbers whose absolute values are integers under 2**31 (on 32 bit
machines) will work pretty much like mathematical integers.  Other numbers
are not guaranteed.
.Sh "How do I convert between numeric representations/bases/radixes?"
.IX Subsection "How do I convert between numeric representations/bases/radixes?"
As always with Perl there is more than one way to do it.  Below
are a few examples of approaches to making common conversions
between number representations.  This is intended to be representational
rather than exhaustive.
.PP
Some of the examples below use the Bit::Vector module from \s-1CPAN\s0.
The reason you might choose Bit::Vector over the perl built in
functions is that it works with numbers of \s-1ANY\s0 size, that it is
optimized for speed on some operations, and for at least some
programmers the notation might be familiar.
.IP "How do I convert hexadecimal into decimal" 4
.IX Item "How do I convert hexadecimal into decimal"
Using perl's built in conversion of 0x notation:
.Sp
.Vb 1
\&    $dec = 0xDEADBEEF;
.Ve
.Sp
Using the hex function:
.Sp
.Vb 1
\&    $dec = hex("DEADBEEF");
.Ve
.Sp
Using pack:
.Sp
.Vb 1
\&    $dec = unpack("N", pack("H8", substr("0" x 8 . "DEADBEEF", -8)));
.Ve
.Sp
Using the \s-1CPAN\s0 module Bit::Vector:
.Sp
.Vb 3
\&    use Bit::Vector;
\&    $vec = Bit::Vector->new_Hex(32, "DEADBEEF");
\&    $dec = $vec->to_Dec();
.Ve
.IP "How do I convert from decimal to hexadecimal" 4
.IX Item "How do I convert from decimal to hexadecimal"
Using sprintf:
.Sp
.Vb 2
\&    $hex = sprintf("%X", 3735928559); # upper case A-F
\&    $hex = sprintf("%x", 3735928559); # lower case a-f
.Ve
.Sp
Using unpack:
.Sp
.Vb 1
\&    $hex = unpack("H*", pack("N", 3735928559));
.Ve
.Sp
Using Bit::Vector:
.Sp
.Vb 3
\&    use Bit::Vector;
\&    $vec = Bit::Vector->new_Dec(32, -559038737);
\&    $hex = $vec->to_Hex();
.Ve
.Sp
And Bit::Vector supports odd bit counts:
.Sp
.Vb 4
\&    use Bit::Vector;
\&    $vec = Bit::Vector->new_Dec(33, 3735928559);
\&    $vec->Resize(32); # suppress leading 0 if unwanted
\&    $hex = $vec->to_Hex();
.Ve
.IP "How do I convert from octal to decimal" 4
.IX Item "How do I convert from octal to decimal"
Using Perl's built in conversion of numbers with leading zeros:
.Sp
.Vb 1
\&    $dec = 033653337357; # note the leading 0!
.Ve
.Sp
Using the oct function:
.Sp
.Vb 1
\&    $dec = oct("33653337357");
.Ve
.Sp
Using Bit::Vector:
.Sp
.Vb 4
\&    use Bit::Vector;
\&    $vec = Bit::Vector->new(32);
\&    $vec->Chunk_List_Store(3, split(//, reverse "33653337357"));
\&    $dec = $vec->to_Dec();
.Ve
.IP "How do I convert from decimal to octal" 4
.IX Item "How do I convert from decimal to octal"
Using sprintf:
.Sp
.Vb 1
\&    $oct = sprintf("%o", 3735928559);
.Ve
.Sp
Using Bit::Vector:
.Sp
.Vb 3
\&    use Bit::Vector;
\&    $vec = Bit::Vector->new_Dec(32, -559038737);
\&    $oct = reverse join('', $vec->Chunk_List_Read(3));
.Ve
.IP "How do I convert from binary to decimal" 4
.IX Item "How do I convert from binary to decimal"
Perl 5.6 lets you write binary numbers directly with
the 0b notation:
.Sp
.Vb 1
\&    $number = 0b10110110;
.Ve
.Sp
Using oct:
.Sp
.Vb 2
\&    my $input = "10110110";
\&    $decimal = oct( "0b$input" );
.Ve
.Sp
Using pack and ord:
.Sp
.Vb 1
\&    $decimal = ord(pack('B8', '10110110'));
.Ve
.Sp
Using pack and unpack for larger strings:
.Sp
.Vb 3
\&    $int = unpack("N", pack("B32",
\&        substr("0" x 32 . "11110101011011011111011101111", -32)));
\&    $dec = sprintf("%d", $int);
.Ve
.Sp
.Vb 1
\&    # substr() is used to left pad a 32 character string with zeros.
.Ve
.Sp
Using Bit::Vector:
.Sp
.Vb 2
\&    $vec = Bit::Vector->new_Bin(32, "11011110101011011011111011101111");
\&    $dec = $vec->to_Dec();
.Ve
.IP "How do I convert from decimal to binary" 4
.IX Item "How do I convert from decimal to binary"
Using sprintf (perl 5.6+):
.Sp
.Vb 1
\&    $bin = sprintf("%b", 3735928559);
.Ve
.Sp
Using unpack:
.Sp
.Vb 1
\&    $bin = unpack("B*", pack("N", 3735928559));
.Ve
.Sp
Using Bit::Vector:
.Sp
.Vb 3
\&    use Bit::Vector;
\&    $vec = Bit::Vector->new_Dec(32, -559038737);
\&    $bin = $vec->to_Bin();
.Ve
.Sp
The remaining transformations (e.g. hex \-> oct, bin \-> hex, etc.)
are left as an exercise to the inclined reader.
.Sh "Why doesn't & work the way I want it to?"
.IX Subsection "Why doesn't & work the way I want it to?"
The behavior of binary arithmetic operators depends on whether they're
used on numbers or strings.  The operators treat a string as a series
of bits and work with that (the string \f(CW"3"\fR is the bit pattern
\&\f(CW00110011\fR).  The operators work with the binary form of a number
(the number \f(CW3\fR is treated as the bit pattern \f(CW00000011\fR).
.PP
So, saying \f(CW\*(C`11 & 3\*(C'\fR performs the \*(L"and\*(R" operation on numbers (yielding
\&\f(CW3\fR).  Saying \f(CW"11" & "3"\fR performs the \*(L"and\*(R" operation on strings
(yielding \f(CW"1"\fR).
.PP
Most problems with \f(CW\*(C`&\*(C'\fR and \f(CW\*(C`|\*(C'\fR arise because the programmer thinks
they have a number but really it's a string.  The rest arise because
the programmer says:
.PP
.Vb 3
\&    if ("\e020\e020" & "\e101\e101") {
\&        # ...
\&    }
.Ve
.PP
but a string consisting of two null bytes (the result of \f(CW\*(C`"\e020\e020"
& "\e101\e101"\*(C'\fR) is not a false value in Perl.  You need:
.PP
.Vb 3
\&    if ( ("\e020\e020" & "\e101\e101") !~ /[^\e000]/) {
\&        # ...
\&    }
.Ve
.Sh "How do I multiply matrices?"
.IX Subsection "How do I multiply matrices?"
Use the Math::Matrix or Math::MatrixReal modules (available from \s-1CPAN\s0)
or the \s-1PDL\s0 extension (also available from \s-1CPAN\s0).
.Sh "How do I perform an operation on a series of integers?"
.IX Subsection "How do I perform an operation on a series of integers?"
To call a function on each element in an array, and collect the
results, use:
.PP
.Vb 1
\&    @results = map { my_func($_) } @array;
.Ve
.PP
For example:
.PP
.Vb 1
\&    @triple = map { 3 * $_ } @single;
.Ve
.PP
To call a function on each element of an array, but ignore the
results:
.PP
.Vb 3
\&    foreach $iterator (@array) {
\&        some_func($iterator);
\&    }
.Ve
.PP
To call a function on each integer in a (small) range, you \fBcan\fR use:
.PP
.Vb 1
\&    @results = map { some_func($_) } (5 .. 25);
.Ve
.PP
but you should be aware that the \f(CW\*(C`..\*(C'\fR operator creates an array of
all integers in the range.  This can take a lot of memory for large
ranges.  Instead use:
.PP
.Vb 4
\&    @results = ();
\&    for ($i=5; $i < 500_005; $i++) {
\&        push(@results, some_func($i));
\&    }
.Ve
.PP
This situation has been fixed in Perl5.005. Use of \f(CW\*(C`..\*(C'\fR in a \f(CW\*(C`for\*(C'\fR
loop will iterate over the range, without creating the entire range.
.PP
.Vb 3
\&    for my $i (5 .. 500_005) {
\&        push(@results, some_func($i));
\&    }
.Ve
.PP
will not create a list of 500,000 integers.
.Sh "How can I output Roman numerals?"
.IX Subsection "How can I output Roman numerals?"
Get the http://www.cpan.org/modules/by\-module/Roman module.
.Sh "Why aren't my random numbers random?"
.IX Subsection "Why aren't my random numbers random?"
If you're using a version of Perl before 5.004, you must call \f(CW\*(C`srand\*(C'\fR
once at the start of your program to seed the random number generator.
.PP
.Vb 1
\&         BEGIN { srand() if $] < 5.004 }
.Ve
.PP
5.004 and later automatically call \f(CW\*(C`srand\*(C'\fR at the beginning.  Don't
call \f(CW\*(C`srand\*(C'\fR more than once\-\-\-you make your numbers less random, rather
than more.
.PP
Computers are good at being predictable and bad at being random
(despite appearances caused by bugs in your programs :\-).  see the
\&\fIrandom\fR article in the \*(L"Far More Than You Ever Wanted To Know\*(R"
collection in http://www.cpan.org/misc/olddoc/FMTEYEWTK.tgz , courtesy of
Tom Phoenix, talks more about this.  John von Neumann said, \*(L"Anyone
who attempts to generate random numbers by deterministic means is, of
course, living in a state of sin.\*(R"
.PP
If you want numbers that are more random than \f(CW\*(C`rand\*(C'\fR with \f(CW\*(C`srand\*(C'\fR
provides, you should also check out the Math::TrulyRandom module from
\&\s-1CPAN\s0.  It uses the imperfections in your system's timer to generate
random numbers, but this takes quite a while.  If you want a better
pseudorandom generator than comes with your operating system, look at
\&\*(L"Numerical Recipes in C\*(R" at http://www.nr.com/ .
.Sh "How do I get a random number between X and Y?"
.IX Subsection "How do I get a random number between X and Y?"
\&\f(CW\*(C`rand($x)\*(C'\fR returns a number such that
\&\f(CW\*(C`0 <= rand($x) < $x\*(C'\fR. Thus what you want to have perl
figure out is a random number in the range from 0 to the
difference between your \fIX\fR and \fIY\fR.
.PP
That is, to get a number between 10 and 15, inclusive, you
want a random number between 0 and 5 that you can then add
to 10.
.PP
.Vb 1
\&    my $number = 10 + int rand( 15-10+1 );
.Ve
.PP
Hence you derive the following simple function to abstract
that. It selects a random integer between the two given
integers (inclusive), For example: \f(CW\*(C`random_int_in(50,120)\*(C'\fR.
.PP
.Vb 7
\&   sub random_int_in ($$) {
\&     my($min, $max) = @_;
\&      # Assumes that the two arguments are integers themselves!
\&     return $min if $min == $max;
\&     ($min, $max) = ($max, $min)  if  $min > $max;
\&     return $min + int rand(1 + $max - $min);
\&   }
.Ve
.SH "Data: Dates"
.IX Header "Data: Dates"
.Sh "How do I find the day or week of the year?"
.IX Subsection "How do I find the day or week of the year?"
The localtime function returns the day of the year.  Without an
argument localtime uses the current time.
.PP
.Vb 1
\&        $day_of_year = (localtime)[7];
.Ve
.PP
The \s-1POSIX\s0 module can also format a date as the day of the year or
week of the year.
.PP
.Vb 3
\&        use POSIX qw/strftime/;
\&        my $day_of_year  = strftime "%j", localtime;
\&        my $week_of_year = strftime "%W", localtime;
.Ve
.PP
To get the day of year for any date, use the Time::Local module to get
a time in epoch seconds for the argument to localtime.
.PP
.Vb 4
\&        use POSIX qw/strftime/;
\&        use Time::Local;
\&        my $week_of_year = strftime "%W",
\&                localtime( timelocal( 0, 0, 0, 18, 11, 1987 ) );
.Ve
.PP
The Date::Calc module provides two functions to calculate these.
.PP
.Vb 3
\&        use Date::Calc;
\&        my $day_of_year  = Day_of_Year(  1987, 12, 18 );
\&        my $week_of_year = Week_of_Year( 1987, 12, 18 );
.Ve
.Sh "How do I find the current century or millennium?"
.IX Subsection "How do I find the current century or millennium?"
Use the following simple functions:
.PP
.Vb 3
\&    sub get_century    {
\&        return int((((localtime(shift || time))[5] + 1999))/100);
\&    }
.Ve
.PP
.Vb 3
\&    sub get_millennium {
\&        return 1+int((((localtime(shift || time))[5] + 1899))/1000);
\&    }
.Ve
.PP
On some systems, the \s-1POSIX\s0 module's \fIstrftime()\fR function has
been extended in a non-standard way to use a \f(CW%C\fR format,
which they sometimes claim is the \*(L"century\*(R".  It isn't,
because on most such systems, this is only the first two
digits of the four-digit year, and thus cannot be used to
reliably determine the current century or millennium.
.Sh "How can I compare two dates and find the difference?"
.IX Subsection "How can I compare two dates and find the difference?"
(contributed by brian d foy)
.PP
You could just store all your dates as a number and then subtract. Life
isn't always that simple though. If you want to work with formatted
dates, the Date::Manip, Date::Calc, or DateTime modules can help you.
.Sh "How can I take a string and turn it into epoch seconds?"
.IX Subsection "How can I take a string and turn it into epoch seconds?"
If it's a regular enough string that it always has the same format,
you can split it up and pass the parts to \f(CW\*(C`timelocal\*(C'\fR in the standard
Time::Local module.  Otherwise, you should look into the Date::Calc
and Date::Manip modules from \s-1CPAN\s0.
.Sh "How can I find the Julian Day?"
.IX Subsection "How can I find the Julian Day?"
(contributed by brian d foy and Dave Cross)
.PP
You can use the Time::JulianDay module available on \s-1CPAN\s0.  Ensure that
you really want to find a Julian day, though, as many people have
different ideas about Julian days.  See
http://www.hermetic.ch/cal_stud/jdn.htm for instance.
.PP
You can also try the DateTime module, which can convert a date/time
to a Julian Day.
.PP
.Vb 2
\&  $ perl -MDateTime -le'print DateTime->today->jd'
\&  2453401.5
.Ve
.PP
Or the modified Julian Day
.PP
.Vb 2
\&  $ perl -MDateTime -le'print DateTime->today->mjd'
\&  53401
.Ve
.PP
Or even the day of the year (which is what some people think of as a
Julian day)
.PP
.Vb 2
\&  $ perl -MDateTime -le'print DateTime->today->doy'
\&  31
.Ve
.Sh "How do I find yesterday's date?"
.IX Subsection "How do I find yesterday's date?"
(contributed by brian d foy)
.PP
Use one of the Date modules. The \f(CW\*(C`DateTime\*(C'\fR module makes it simple, and
give you the same time of day, only the day before.
.PP
.Vb 1
\&        use DateTime;
.Ve
.PP
.Vb 1
\&        my $yesterday = DateTime->now->subtract( days => 1 );
.Ve
.PP
.Vb 1
\&        print "Yesterday was $yesterday\en";
.Ve
.PP
You can also use the \f(CW\*(C`Date::Calc\*(C'\fR module using its Today_and_Now
function.
.PP
.Vb 1
\&        use Date::Calc qw( Today_and_Now Add_Delta_DHMS );
.Ve
.PP
.Vb 1
\&        my @date_time = Add_Delta_DHMS( Today_and_Now(), -1, 0, 0, 0 );
.Ve
.PP
.Vb 1
\&        print "@date\en";
.Ve
.PP
Most people try to use the time rather than the calendar to figure out
dates, but that assumes that days are twenty-four hours each.  For
most people, there are two days a year when they aren't: the switch to
and from summer time throws this off. Let the modules do the work.
.Sh "Does Perl have a Year 2000 problem?  Is Perl Y2K compliant?"
.IX Subsection "Does Perl have a Year 2000 problem?  Is Perl Y2K compliant?"
Short answer: No, Perl does not have a Year 2000 problem.  Yes, Perl is
Y2K compliant (whatever that means).  The programmers you've hired to
use it, however, probably are not.
.PP
Long answer: The question belies a true understanding of the issue.
Perl is just as Y2K compliant as your pencil\*(--no more, and no less.
Can you use your pencil to write a non\-Y2K\-compliant memo?  Of course
you can.  Is that the pencil's fault?  Of course it isn't.
.PP
The date and time functions supplied with Perl (gmtime and localtime)
supply adequate information to determine the year well beyond 2000
(2038 is when trouble strikes for 32\-bit machines).  The year returned
by these functions when used in a list context is the year minus 1900.
For years between 1910 and 1999 this \fIhappens\fR to be a 2\-digit decimal
number. To avoid the year 2000 problem simply do not treat the year as
a 2\-digit number.  It isn't.
.PP
When \fIgmtime()\fR and \fIlocaltime()\fR are used in scalar context they return
a timestamp string that contains a fully-expanded year.  For example,
\&\f(CW\*(C`$timestamp = gmtime(1005613200)\*(C'\fR sets \f(CW$timestamp\fR to \*(L"Tue Nov 13 01:00:00
2001\*(R".  There's no year 2000 problem here.
.PP
That doesn't mean that Perl can't be used to create non\-Y2K compliant
programs.  It can.  But so can your pencil.  It's the fault of the user,
not the language.  At the risk of inflaming the \s-1NRA:\s0 \*(L"Perl doesn't
break Y2K, people do.\*(R"  See http://www.perl.org/about/y2k.html for
a longer exposition.
.SH "Data: Strings"
.IX Header "Data: Strings"
.Sh "How do I validate input?"
.IX Subsection "How do I validate input?"
(contributed by brian d foy)
.PP
There are many ways to ensure that values are what you expect or
want to accept. Besides the specific examples that we cover in the
perlfaq, you can also look at the modules with \*(L"Assert\*(R" and \*(L"Validate\*(R"
in their names, along with other modules such as \f(CW\*(C`Regexp::Common\*(C'\fR.
.PP
Some modules have validation for particular types of input, such
as \f(CW\*(C`Business::ISBN\*(C'\fR, \f(CW\*(C`Business::CreditCard\*(C'\fR, \f(CW\*(C`Email::Valid\*(C'\fR,
and \f(CW\*(C`Data::Validate::IP\*(C'\fR.
.Sh "How do I unescape a string?"
.IX Subsection "How do I unescape a string?"
It depends just what you mean by \*(L"escape\*(R".  \s-1URL\s0 escapes are dealt
with in perlfaq9.  Shell escapes with the backslash (\f(CW\*(C`\e\*(C'\fR)
character are removed with
.PP
.Vb 1
\&    s/\e\e(.)/$1/g;
.Ve
.PP
This won't expand \f(CW"\en"\fR or \f(CW"\et"\fR or any other special escapes.
.Sh "How do I remove consecutive pairs of characters?"
.IX Subsection "How do I remove consecutive pairs of characters?"
(contributed by brian d foy)
.PP
You can use the substitution operator to find pairs of characters (or
runs of characters) and replace them with a single instance. In this
substitution, we find a character in \f(CW\*(C`(.)\*(C'\fR. The memory parentheses
store the matched character in the back-reference \f(CW\*(C`\e1\*(C'\fR and we use
that to require that the same thing immediately follow it. We replace
that part of the string with the character in \f(CW$1\fR.
.PP
.Vb 1
\&    s/(.)\e1/$1/g;
.Ve
.PP
We can also use the transliteration operator, \f(CW\*(C`tr///\*(C'\fR. In this
example, the search list side of our \f(CW\*(C`tr///\*(C'\fR contains nothing, but
the \f(CW\*(C`c\*(C'\fR option complements that so it contains everything. The
replacement list also contains nothing, so the transliteration is
almost a no-op since it won't do any replacements (or more exactly,
replace the character with itself). However, the \f(CW\*(C`s\*(C'\fR option squashes
duplicated and consecutive characters in the string so a character
does not show up next to itself
.PP
.Vb 2
\&        my $str = 'Haarlem';   # in the Netherlands
\&    $str =~ tr///cs;       # Now Harlem, like in New York
.Ve
.Sh "How do I expand function calls in a string?"
.IX Subsection "How do I expand function calls in a string?"
(contributed by brian d foy)
.PP
This is documented in perlref, and although it's not the easiest
thing to read, it does work. In each of these examples, we call the
function inside the braces used to dereference a reference. If we
have a more than one return value, we can construct and dereference an
anonymous array. In this case, we call the function in list context.
.PP
.Vb 1
\&        print "The time values are @{ [localtime] }.\en";
.Ve
.PP
If we want to call the function in scalar context, we have to do a bit
more work. We can really have any code we like inside the braces, so
we simply have to end with the scalar reference, although how you do
that is up to you, and you can use code inside the braces.
.PP
.Vb 1
\&        print "The time is ${\e(scalar localtime)}.\en"
.Ve
.PP
.Vb 1
\&        print "The time is ${ my $x = localtime; \e$x }.\en";
.Ve
.PP
If your function already returns a reference, you don't need to create
the reference yourself.
.PP
.Vb 1
\&        sub timestamp { my $t = localtime; \e$t }
.Ve
.PP
.Vb 1
\&        print "The time is ${ timestamp() }.\en";
.Ve
.PP
The \f(CW\*(C`Interpolation\*(C'\fR module can also do a lot of magic for you. You can
specify a variable name, in this case \f(CW\*(C`E\*(C'\fR, to set up a tied hash that
does the interpolation for you. It has several other methods to do this
as well.
.PP
.Vb 2
\&        use Interpolation E => 'eval';
\&        print "The time values are $E{localtime()}.\en";
.Ve
.PP
In most cases, it is probably easier to simply use string concatenation,
which also forces scalar context.
.PP
.Vb 1
\&        print "The time is " . localtime . ".\en";
.Ve
.Sh "How do I find matching/nesting anything?"
.IX Subsection "How do I find matching/nesting anything?"
This isn't something that can be done in one regular expression, no
matter how complicated.  To find something between two single
characters, a pattern like \f(CW\*(C`/x([^x]*)x/\*(C'\fR will get the intervening
bits in \f(CW$1\fR. For multiple ones, then something more like
\&\f(CW\*(C`/alpha(.*?)omega/\*(C'\fR would be needed.  But none of these deals with
nested patterns.  For balanced expressions using \f(CW\*(C`(\*(C'\fR, \f(CW\*(C`{\*(C'\fR, \f(CW\*(C`[\*(C'\fR or
\&\f(CW\*(C`<\*(C'\fR as delimiters, use the \s-1CPAN\s0 module Regexp::Common, or see
\&\*(L"(??{ code })\*(R" in perlre.  For other cases, you'll have to write a
parser.
.PP
If you are serious about writing a parser, there are a number of
modules or oddities that will make your life a lot easier.  There are
the \s-1CPAN\s0 modules Parse::RecDescent, Parse::Yapp, and Text::Balanced;
and the byacc program.   Starting from perl 5.8 the Text::Balanced is
part of the standard distribution.
.PP
One simple destructive, inside-out approach that you might try is to
pull out the smallest nesting parts one at a time:
.PP
.Vb 3
\&    while (s/BEGIN((?:(?!BEGIN)(?!END).)*)END//gs) {
\&        # do something with $1
\&    }
.Ve
.PP
A more complicated and sneaky approach is to make Perl's regular
expression engine do it for you.  This is courtesy Dean Inada, and
rather has the nature of an Obfuscated Perl Contest entry, but it
really does work:
.PP
.Vb 3
\&    # $_ contains the string to parse
\&    # BEGIN and END are the opening and closing markers for the
\&    # nested text.
.Ve
.PP
.Vb 5
\&    @( = ('(','');
\&    @) = (')','');
\&    ($re=$_)=~s/((BEGIN)|(END)|.)/$)[!$3]\eQ$1\eE$([!$2]/gs;
\&    @$ = (eval{/$re/},$@!~/unmatched/i);
\&    print join("\en",@$[0..$#$]) if( $$[-1] );
.Ve
.Sh "How do I reverse a string?"
.IX Subsection "How do I reverse a string?"
Use \fIreverse()\fR in scalar context, as documented in
\&\*(L"reverse\*(R" in perlfunc.
.PP
.Vb 1
\&    $reversed = reverse $string;
.Ve
.Sh "How do I expand tabs in a string?"
.IX Subsection "How do I expand tabs in a string?"
You can do it yourself:
.PP
.Vb 1
\&    1 while $string =~ s/\et+/' ' x (length($&) * 8 - length($`) % 8)/e;
.Ve
.PP
Or you can just use the Text::Tabs module (part of the standard Perl
distribution).
.PP
.Vb 2
\&    use Text::Tabs;
\&    @expanded_lines = expand(@lines_with_tabs);
.Ve
.Sh "How do I reformat a paragraph?"
.IX Subsection "How do I reformat a paragraph?"
Use Text::Wrap (part of the standard Perl distribution):
.PP
.Vb 2
\&    use Text::Wrap;
\&    print wrap("\et", '  ', @paragraphs);
.Ve
.PP
The paragraphs you give to Text::Wrap should not contain embedded
newlines.  Text::Wrap doesn't justify the lines (flush\-right).
.PP
Or use the \s-1CPAN\s0 module Text::Autoformat.  Formatting files can be easily
done by making a shell alias, like so:
.PP
.Vb 2
\&    alias fmt="perl -i -MText::Autoformat -n0777 \e
\&        -e 'print autoformat $_, {all=>1}' $*"
.Ve
.PP
See the documentation for Text::Autoformat to appreciate its many
capabilities.
.Sh "How can I access or change N characters of a string?"
.IX Subsection "How can I access or change N characters of a string?"
You can access the first characters of a string with \fIsubstr()\fR.
To get the first character, for example, start at position 0
and grab the string of length 1.
.PP
.Vb 2
\&        $string = "Just another Perl Hacker";
\&    $first_char = substr( $string, 0, 1 );  #  'J'
.Ve
.PP
To change part of a string, you can use the optional fourth
argument which is the replacement string.
.PP
.Vb 1
\&    substr( $string, 13, 4, "Perl 5.8.0" );
.Ve
.PP
You can also use \fIsubstr()\fR as an lvalue.
.PP
.Vb 1
\&    substr( $string, 13, 4 ) =  "Perl 5.8.0";
.Ve
.Sh "How do I change the Nth occurrence of something?"
.IX Subsection "How do I change the Nth occurrence of something?"
You have to keep track of N yourself.  For example, let's say you want
to change the fifth occurrence of \f(CW"whoever"\fR or \f(CW"whomever"\fR into
\&\f(CW"whosoever"\fR or \f(CW"whomsoever"\fR, case insensitively.  These
all assume that \f(CW$_\fR contains the string to be altered.
.PP
.Vb 6
\&    $count = 0;
\&    s{((whom?)ever)}{
\&        ++$count == 5           # is it the 5th?
\&            ? "${2}soever"      # yes, swap
\&            : $1                # renege and leave it there
\&    }ige;
.Ve
.PP
In the more general case, you can use the \f(CW\*(C`/g\*(C'\fR modifier in a \f(CW\*(C`while\*(C'\fR
loop, keeping count of matches.
.PP
.Vb 8
\&    $WANT = 3;
\&    $count = 0;
\&    $_ = "One fish two fish red fish blue fish";
\&    while (/(\ew+)\es+fish\eb/gi) {
\&        if (++$count == $WANT) {
\&            print "The third fish is a $1 one.\en";
\&        }
\&    }
.Ve
.PP
That prints out: \f(CW"The third fish is a red one."\fR  You can also use a
repetition count and repeated pattern like this:
.PP
.Vb 1
\&    /(?:\ew+\es+fish\es+){2}(\ew+)\es+fish/i;
.Ve
.Sh "How can I count the number of occurrences of a substring within a string?"
.IX Subsection "How can I count the number of occurrences of a substring within a string?"
There are a number of ways, with varying efficiency.  If you want a
count of a certain single character (X) within a string, you can use the
\&\f(CW\*(C`tr///\*(C'\fR function like so:
.PP
.Vb 3
\&    $string = "ThisXlineXhasXsomeXx'sXinXit";
\&    $count = ($string =~ tr/X//);
\&    print "There are $count X characters in the string";
.Ve
.PP
This is fine if you are just looking for a single character.  However,
if you are trying to count multiple character substrings within a
larger string, \f(CW\*(C`tr///\*(C'\fR won't work.  What you can do is wrap a \fIwhile()\fR
loop around a global pattern match.  For example, let's count negative
integers:
.PP
.Vb 3
\&    $string = "-9 55 48 -2 23 -76 4 14 -44";
\&    while ($string =~ /-\ed+/g) { $count++ }
\&    print "There are $count negative numbers in the string";
.Ve
.PP
Another version uses a global match in list context, then assigns the
result to a scalar, producing a count of the number of matches.
.PP
.Vb 1
\&        $count = () = $string =~ /-\ed+/g;
.Ve
.Sh "How do I capitalize all the words on one line?"
.IX Subsection "How do I capitalize all the words on one line?"
To make the first letter of each word upper case:
.PP
.Vb 1
\&        $line =~ s/\eb(\ew)/\eU$1/g;
.Ve
.PP
This has the strange effect of turning "\f(CW\*(C`don't do it\*(C'\fR\*(L" into \*(R"\f(CW\*(C`Don'T
Do It\*(C'\fR".  Sometimes you might want this.  Other times you might need a
more thorough solution (Suggested by brian d foy):
.PP
.Vb 7
\&    $string =~ s/ (
\&                 (^\ew)    #at the beginning of the line
\&                   |      # or
\&                 (\es\ew)   #preceded by whitespace
\&                   )
\&                /\eU$1/xg;
\&    $string =~ /([\ew']+)/\eu\eL$1/g;
.Ve
.PP
To make the whole line upper case:
.PP
.Vb 1
\&        $line = uc($line);
.Ve
.PP
To force each word to be lower case, with the first letter upper case:
.PP
.Vb 1
\&        $line =~ s/(\ew+)/\eu\eL$1/g;
.Ve
.PP
You can (and probably should) enable locale awareness of those
characters by placing a \f(CW\*(C`use locale\*(C'\fR pragma in your program.
See perllocale for endless details on locales.
.PP
This is sometimes referred to as putting something into \*(L"title
case\*(R", but that's not quite accurate.  Consider the proper
capitalization of the movie \fIDr. Strangelove or: How I Learned to
Stop Worrying and Love the Bomb\fR, for example.
.PP
Damian Conway's Text::Autoformat module provides some smart
case transformations:
.PP
.Vb 3
\&    use Text::Autoformat;
\&    my $x = "Dr. Strangelove or: How I Learned to Stop ".
\&      "Worrying and Love the Bomb";
.Ve
.PP
.Vb 5
\&    print $x, "\en";
\&    for my $style (qw( sentence title highlight ))
\&    {
\&        print autoformat($x, { case => $style }), "\en";
\&    }
.Ve
.Sh "How can I split a [character] delimited string except when inside [character]?"
.IX Subsection "How can I split a [character] delimited string except when inside [character]?"
Several modules can handle this sort of pasing\-\-\-Text::Balanced,
Text::CSV, Text::CSV_XS, and Text::ParseWords, among others.
.PP
Take the example case of trying to split a string that is
comma-separated into its different fields. You can't use \f(CW\*(C`split(/,/)\*(C'\fR
because you shouldn't split if the comma is inside quotes.  For
example, take a data line like this:
.PP
.Vb 1
\&    SAR001,"","Cimetrix, Inc","Bob Smith","CAM",N,8,1,0,7,"Error, Core Dumped"
.Ve
.PP
Due to the restriction of the quotes, this is a fairly complex
problem.  Thankfully, we have Jeffrey Friedl, author of
\&\fIMastering Regular Expressions\fR, to handle these for us.  He
suggests (assuming your string is contained in \f(CW$text\fR):
.PP
.Vb 7
\&     @new = ();
\&     push(@new, $+) while $text =~ m{
\&         "([^\e"\e\e]*(?:\e\e.[^\e"\e\e]*)*)",?  # groups the phrase inside the quotes
\&       | ([^,]+),?
\&       | ,
\&     }gx;
\&     push(@new, undef) if substr($text,-1,1) eq ',';
.Ve
.PP
If you want to represent quotation marks inside a
quotation-mark-delimited field, escape them with backslashes (eg,
\&\f(CW"like \e"this\e""\fR.
.PP
Alternatively, the Text::ParseWords module (part of the standard Perl
distribution) lets you say:
.PP
.Vb 2
\&    use Text::ParseWords;
\&    @new = quotewords(",", 0, $text);
.Ve
.PP
There's also a Text::CSV (Comma\-Separated Values) module on \s-1CPAN\s0.
.Sh "How do I strip blank space from the beginning/end of a string?"
.IX Subsection "How do I strip blank space from the beginning/end of a string?"
(contributed by brian d foy)
.PP
A substitution can do this for you. For a single line, you want to
replace all the leading or trailing whitespace with nothing. You
can do that with a pair of substitutions.
.PP
.Vb 2
\&        s/^\es+//;
\&        s/\es+$//;
.Ve
.PP
You can also write that as a single substitution, although it turns
out the combined statement is slower than the separate ones. That
might not matter to you, though.
.PP
.Vb 1
\&        s/^\es+|\es+$//g;
.Ve
.PP
In this regular expression, the alternation matches either at the
beginning or the end of the string since the anchors have a lower
precedence than the alternation. With the \f(CW\*(C`/g\*(C'\fR flag, the substitution
makes all possible matches, so it gets both. Remember, the trailing
newline matches the \f(CW\*(C`\es+\*(C'\fR, and  the \f(CW\*(C`$\*(C'\fR anchor can match to the
physical end of the string, so the newline disappears too. Just add
the newline to the output, which has the added benefit of preserving
\&\*(L"blank\*(R" (consisting entirely of whitespace) lines which the \f(CW\*(C`^\es+\*(C'\fR
would remove all by itself.
.PP
.Vb 5
\&        while( <> )
\&                {
\&                s/^\es+|\es+$//g;
\&                print "$_\en";
\&                }
.Ve
.PP
For a multi-line string, you can apply the regular expression
to each logical line in the string by adding the \f(CW\*(C`/m\*(C'\fR flag (for
\&\*(L"multi\-line\*(R"). With the \f(CW\*(C`/m\*(C'\fR flag, the \f(CW\*(C`$\*(C'\fR matches \fIbefore\fR an
embedded newline, so it doesn't remove it. It still removes the
newline at the end of the string.
.PP
.Vb 1
\&    $string =~ s/^\es+|\es+$//gm;
.Ve
.PP
Remember that lines consisting entirely of whitespace will disappear,
since the first part of the alternation can match the entire string
and replace it with nothing. If need to keep embedded blank lines,
you have to do a little more work. Instead of matching any whitespace
(since that includes a newline), just match the other whitespace.
.PP
.Vb 1
\&        $string =~ s/^[\et\ef ]+|[\et\ef ]+$//mg;
.Ve
.Sh "How do I pad a string with blanks or pad a number with zeroes?"
.IX Subsection "How do I pad a string with blanks or pad a number with zeroes?"
In the following examples, \f(CW$pad_len\fR is the length to which you wish
to pad the string, \f(CW$text\fR or \f(CW$num\fR contains the string to be padded,
and \f(CW$pad_char\fR contains the padding character. You can use a single
character string constant instead of the \f(CW$pad_char\fR variable if you
know what it is in advance. And in the same way you can use an integer in
place of \f(CW$pad_len\fR if you know the pad length in advance.
.PP
The simplest method uses the \f(CW\*(C`sprintf\*(C'\fR function. It can pad on the left
or right with blanks and on the left with zeroes and it will not
truncate the result. The \f(CW\*(C`pack\*(C'\fR function can only pad strings on the
right with blanks and it will truncate the result to a maximum length of
\&\f(CW$pad_len\fR.
.PP
.Vb 3
\&    # Left padding a string with blanks (no truncation):
\&        $padded = sprintf("%${pad_len}s", $text);
\&        $padded = sprintf("%*s", $pad_len, $text);  # same thing
.Ve
.PP
.Vb 3
\&    # Right padding a string with blanks (no truncation):
\&        $padded = sprintf("%-${pad_len}s", $text);
\&        $padded = sprintf("%-*s", $pad_len, $text); # same thing
.Ve
.PP
.Vb 3
\&    # Left padding a number with 0 (no truncation):
\&        $padded = sprintf("%0${pad_len}d", $num);
\&        $padded = sprintf("%0*d", $pad_len, $num); # same thing
.Ve
.PP
.Vb 2
\&    # Right padding a string with blanks using pack (will truncate):
\&    $padded = pack("A$pad_len",$text);
.Ve
.PP
If you need to pad with a character other than blank or zero you can use
one of the following methods.  They all generate a pad string with the
\&\f(CW\*(C`x\*(C'\fR operator and combine that with \f(CW$text\fR. These methods do
not truncate \f(CW$text\fR.
.PP
Left and right padding with any character, creating a new string:
.PP
.Vb 2
\&    $padded = $pad_char x ( $pad_len - length( $text ) ) . $text;
\&    $padded = $text . $pad_char x ( $pad_len - length( $text ) );
.Ve
.PP
Left and right padding with any character, modifying \f(CW$text\fR directly:
.PP
.Vb 2
\&    substr( $text, 0, 0 ) = $pad_char x ( $pad_len - length( $text ) );
\&    $text .= $pad_char x ( $pad_len - length( $text ) );
.Ve
.Sh "How do I extract selected columns from a string?"
.IX Subsection "How do I extract selected columns from a string?"
Use \fIsubstr()\fR or \fIunpack()\fR, both documented in perlfunc.
If you prefer thinking in terms of columns instead of widths,
you can use this kind of thing:
.PP
.Vb 3
\&    # determine the unpack format needed to split Linux ps output
\&    # arguments are cut columns
\&    my $fmt = cut2fmt(8, 14, 20, 26, 30, 34, 41, 47, 59, 63, 67, 72);
.Ve
.PP
.Vb 11
\&    sub cut2fmt {
\&        my(@positions) = @_;
\&        my $template  = '';
\&        my $lastpos   = 1;
\&        for my $place (@positions) {
\&            $template .= "A" . ($place - $lastpos) . " ";
\&            $lastpos   = $place;
\&        }
\&        $template .= "A*";
\&        return $template;
\&    }
.Ve
.Sh "How do I find the soundex value of a string?"
.IX Subsection "How do I find the soundex value of a string?"
(contributed by brian d foy)
.PP
You can use the Text::Soundex module. If you want to do fuzzy or close
matching, you might also try the String::Approx, and Text::Metaphone,
and Text::DoubleMetaphone modules.
.Sh "How can I expand variables in text strings?"
.IX Subsection "How can I expand variables in text strings?"
Let's assume that you have a string that contains placeholder
variables.
.PP
.Vb 1
\&    $text = 'this has a $foo in it and a $bar';
.Ve
.PP
You can use a substitution with a double evaluation.  The
first /e turns \f(CW$1\fR into \f(CW$foo\fR, and the second /e turns
\&\f(CW$foo\fR into its value.  You may want to wrap this in an
\&\f(CW\*(C`eval\*(C'\fR: if you try to get the value of an undeclared variable
while running under \f(CW\*(C`use strict\*(C'\fR, you get a fatal error.
.PP
.Vb 2
\&    eval { $text =~ s/(\e$\ew+)/$1/eeg };
\&    die if $@;
.Ve
.PP
It's probably better in the general case to treat those
variables as entries in some special hash.  For example:
.PP
.Vb 5
\&    %user_defs = (
\&        foo  => 23,
\&        bar  => 19,
\&    );
\&    $text =~ s/\e$(\ew+)/$user_defs{$1}/g;
.Ve
.ie n .Sh "What's wrong with always quoting ""$vars""?"
.el .Sh "What's wrong with always quoting ``$vars''?"
.IX Subsection "What's wrong with always quoting $vars?"
The problem is that those double-quotes force stringification\*(--
coercing numbers and references into strings\*(--even when you
don't want them to be strings.  Think of it this way: double-quote
expansion is used to produce new strings.  If you already
have a string, why do you need more?
.PP
If you get used to writing odd things like these:
.PP
.Vb 3
\&    print "$var";       # BAD
\&    $new = "$old";      # BAD
\&    somefunc("$var");   # BAD
.Ve
.PP
You'll be in trouble.  Those should (in 99.8% of the cases) be
the simpler and more direct:
.PP
.Vb 3
\&    print $var;
\&    $new = $old;
\&    somefunc($var);
.Ve
.PP
Otherwise, besides slowing you down, you're going to break code when
the thing in the scalar is actually neither a string nor a number, but
a reference:
.PP
.Vb 5
\&    func(\e@array);
\&    sub func {
\&        my $aref = shift;
\&        my $oref = "$aref";  # WRONG
\&    }
.Ve
.PP
You can also get into subtle problems on those few operations in Perl
that actually do care about the difference between a string and a
number, such as the magical \f(CW\*(C`++\*(C'\fR autoincrement operator or the
\&\fIsyscall()\fR function.
.PP
Stringification also destroys arrays.
.PP
.Vb 3
\&    @lines = `command`;
\&    print "@lines";             # WRONG - extra blanks
\&    print @lines;               # right
.Ve
.Sh "Why don't my <<\s-1HERE\s0 documents work?"
.IX Subsection "Why don't my <<HERE documents work?"
Check for these three things:
.IP "There must be no space after the << part." 4
.IX Item "There must be no space after the << part."
.PD 0
.IP "There (probably) should be a semicolon at the end." 4
.IX Item "There (probably) should be a semicolon at the end."
.IP "You can't (easily) have any space in front of the tag." 4
.IX Item "You can't (easily) have any space in front of the tag."
.PD
.PP
If you want to indent the text in the here document, you
can do this:
.PP
.Vb 5
\&    # all in one
\&    ($VAR = <<HERE_TARGET) =~ s/^\es+//gm;
\&        your text
\&        goes here
\&    HERE_TARGET
.Ve
.PP
But the \s-1HERE_TARGET\s0 must still be flush against the margin.
If you want that indented also, you'll have to quote
in the indentation.
.PP
.Vb 7
\&    ($quote = <<'    FINIS') =~ s/^\es+//gm;
\&            ...we will have peace, when you and all your works have
\&            perished--and the works of your dark master to whom you
\&            would deliver us. You are a liar, Saruman, and a corrupter
\&            of men's hearts.  --Theoden in /usr/src/perl/taint.c
\&        FINIS
\&    $quote =~ s/\es+--/\en--/;
.Ve
.PP
A nice general-purpose fixer-upper function for indented here documents
follows.  It expects to be called with a here document as its argument.
It looks to see whether each line begins with a common substring, and
if so, strips that substring off.  Otherwise, it takes the amount of leading
whitespace found on the first line and removes that much off each
subsequent line.
.PP
.Vb 11
\&    sub fix {
\&        local $_ = shift;
\&        my ($white, $leader);  # common whitespace and common leading string
\&        if (/^\es*(?:([^\ew\es]+)(\es*).*\en)(?:\es*\e1\e2?.*\en)+$/) {
\&            ($white, $leader) = ($2, quotemeta($1));
\&        } else {
\&            ($white, $leader) = (/^(\es+)/, '');
\&        }
\&        s/^\es*?$leader(?:$white)?//gm;
\&        return $_;
\&    }
.Ve
.PP
This works with leading special strings, dynamically determined:
.PP
.Vb 10
\&    $remember_the_main = fix<<'    MAIN_INTERPRETER_LOOP';
\&        @@@ int
\&        @@@ runops() {
\&        @@@     SAVEI32(runlevel);
\&        @@@     runlevel++;
\&        @@@     while ( op = (*op->op_ppaddr)() );
\&        @@@     TAINT_NOT;
\&        @@@     return 0;
\&        @@@ }
\&    MAIN_INTERPRETER_LOOP
.Ve
.PP
Or with a fixed amount of leading whitespace, with remaining
indentation correctly preserved:
.PP
.Vb 9
\&    $poem = fix<<EVER_ON_AND_ON;
\&       Now far ahead the Road has gone,
\&          And I must follow, if I can,
\&       Pursuing it with eager feet,
\&          Until it joins some larger way
\&       Where many paths and errands meet.
\&          And whither then? I cannot say.
\&                --Bilbo in /usr/src/perl/pp_ctl.c
\&    EVER_ON_AND_ON
.Ve
.SH "Data: Arrays"
.IX Header "Data: Arrays"
.Sh "What is the difference between a list and an array?"
.IX Subsection "What is the difference between a list and an array?"
An array has a changeable length.  A list does not.  An array is something
you can push or pop, while a list is a set of values.  Some people make
the distinction that a list is a value while an array is a variable.
Subroutines are passed and return lists, you put things into list
context, you initialize arrays with lists, and you \fIforeach()\fR across
a list.  \f(CW\*(C`@\*(C'\fR variables are arrays, anonymous arrays are arrays, arrays
in scalar context behave like the number of elements in them, subroutines
access their arguments through the array \f(CW@_\fR, and push/pop/shift only work
on arrays.
.PP
As a side note, there's no such thing as a list in scalar context.
When you say
.PP
.Vb 1
\&    $scalar = (2, 5, 7, 9);
.Ve
.PP
you're using the comma operator in scalar context, so it uses the scalar
comma operator.  There never was a list there at all!  This causes the
last value to be returned: 9.
.ie n .Sh "What is the difference between $array\fP[1] and \f(CW@array[1]?"
.el .Sh "What is the difference between \f(CW$array\fP[1] and \f(CW@array\fP[1]?"
.IX Subsection "What is the difference between $array[1] and @array[1]?"
The former is a scalar value; the latter an array slice, making
it a list with one (scalar) value.  You should use $ when you want a
scalar value (most of the time) and @ when you want a list with one
scalar value in it (very, very rarely; nearly never, in fact).
.PP
Sometimes it doesn't make a difference, but sometimes it does.
For example, compare:
.PP
.Vb 1
\&    $good[0] = `some program that outputs several lines`;
.Ve
.PP
with
.PP
.Vb 1
\&    @bad[0]  = `same program that outputs several lines`;
.Ve
.PP
The \f(CW\*(C`use warnings\*(C'\fR pragma and the \fB\-w\fR flag will warn you about these
matters.
.Sh "How can I remove duplicate elements from a list or array?"
.IX Subsection "How can I remove duplicate elements from a list or array?"
(contributed by brian d foy)
.PP
Use a hash. When you think the words \*(L"unique\*(R" or \*(L"duplicated\*(R", think
\&\*(L"hash keys\*(R".
.PP
If you don't care about the order of the elements, you could just
create the hash then extract the keys. It's not important how you
create that hash: just that you use \f(CW\*(C`keys\*(C'\fR to get the unique
elements.
.PP
.Vb 3
\&   my %hash   = map { $_, 1 } @array;
\&   # or a hash slice: @hash{ @array } = ();
\&   # or a foreach: $hash{$_} = 1 foreach ( @array );
.Ve
.PP
.Vb 1
\&   my @unique = keys %hash;
.Ve
.PP
You can also go through each element and skip the ones you've seen
before. Use a hash to keep track. The first time the loop sees an
element, that element has no key in \f(CW%Seen\fR. The \f(CW\*(C`next\*(C'\fR statement
creates the key and immediately uses its value, which is \f(CW\*(C`undef\*(C'\fR, so
the loop continues to the \f(CW\*(C`push\*(C'\fR and increments the value for that
key. The next time the loop sees that same element, its key exists in
the hash \fIand\fR the value for that key is true (since it's not 0 or
undef), so the next skips that iteration and the loop goes to the next
element.
.PP
.Vb 2
\&        my @unique = ();
\&        my %seen   = ();
.Ve
.PP
.Vb 5
\&        foreach my $elem ( @array )
\&                {
\&                next if $seen{ $elem }++;
\&                push @unique, $elem;
\&                }
.Ve
.PP
You can write this more briefly using a grep, which does the
same thing.
.PP
.Vb 2
\&   my %seen = ();
\&   my @unique = grep { ! $seen{ $_ }++ } @array;
.Ve
.Sh "How can I tell whether a certain element is contained in a list or array?"
.IX Subsection "How can I tell whether a certain element is contained in a list or array?"
(portions of this answer contributed by Anno Siegel)
.PP
Hearing the word \*(L"in\*(R" is an \fIin\fRdication that you probably should have
used a hash, not a list or array, to store your data.  Hashes are
designed to answer this question quickly and efficiently.  Arrays aren't.
.PP
That being said, there are several ways to approach this.  If you
are going to make this query many times over arbitrary string values,
the fastest way is probably to invert the original array and maintain a
hash whose keys are the first array's values.
.PP
.Vb 3
\&    @blues = qw/azure cerulean teal turquoise lapis-lazuli/;
\&    %is_blue = ();
\&    for (@blues) { $is_blue{$_} = 1 }
.Ve
.PP
Now you can check whether \f(CW$is_blue\fR{$some_color}.  It might have been a
good idea to keep the blues all in a hash in the first place.
.PP
If the values are all small integers, you could use a simple indexed
array.  This kind of an array will take up less space:
.PP
.Vb 4
\&    @primes = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31);
\&    @is_tiny_prime = ();
\&    for (@primes) { $is_tiny_prime[$_] = 1 }
\&    # or simply  @istiny_prime[@primes] = (1) x @primes;
.Ve
.PP
Now you check whether \f(CW$is_tiny_prime\fR[$some_number].
.PP
If the values in question are integers instead of strings, you can save
quite a lot of space by using bit strings instead:
.PP
.Vb 3
\&    @articles = ( 1..10, 150..2000, 2017 );
\&    undef $read;
\&    for (@articles) { vec($read,$_,1) = 1 }
.Ve
.PP
Now check whether \f(CW\*(C`vec($read,$n,1)\*(C'\fR is true for some \f(CW$n\fR.
.PP
These methods guarantee fast individual tests but require a re-organization
of the original list or array.  They only pay off if you have to test
multiple values against the same array.
.PP
If you are testing only once, the standard module List::Util exports
the function \f(CW\*(C`first\*(C'\fR for this purpose.  It works by stopping once it
finds the element. It's written in C for speed, and its Perl equivalant
looks like this subroutine:
.PP
.Vb 7
\&        sub first (&@) {
\&                my $code = shift;
\&                foreach (@_) {
\&                        return $_ if &{$code}();
\&                }
\&                undef;
\&        }
.Ve
.PP
If speed is of little concern, the common idiom uses grep in scalar context
(which returns the number of items that passed its condition) to traverse the
entire list. This does have the benefit of telling you how many matches it
found, though.
.PP
.Vb 1
\&        my $is_there = grep $_ eq $whatever, @array;
.Ve
.PP
If you want to actually extract the matching elements, simply use grep in
list context.
.PP
.Vb 1
\&        my @matches = grep $_ eq $whatever, @array;
.Ve
.Sh "How do I compute the difference of two arrays?  How do I compute the intersection of two arrays?"
.IX Subsection "How do I compute the difference of two arrays?  How do I compute the intersection of two arrays?"
Use a hash.  Here's code to do both and more.  It assumes that
each element is unique in a given array:
.PP
.Vb 7
\&    @union = @intersection = @difference = ();
\&    %count = ();
\&    foreach $element (@array1, @array2) { $count{$element}++ }
\&    foreach $element (keys %count) {
\&        push @union, $element;
\&        push @{ $count{$element} > 1 ? \e@intersection : \e@difference }, $element;
\&    }
.Ve
.PP
Note that this is the \fIsymmetric difference\fR, that is, all elements in
either A or in B but not in both.  Think of it as an xor operation.
.Sh "How do I test whether two arrays or hashes are equal?"
.IX Subsection "How do I test whether two arrays or hashes are equal?"
The following code works for single-level arrays.  It uses a stringwise
comparison, and does not distinguish defined versus undefined empty
strings.  Modify if you have other needs.
.PP
.Vb 1
\&    $are_equal = compare_arrays(\e@frogs, \e@toads);
.Ve
.PP
.Vb 9
\&    sub compare_arrays {
\&        my ($first, $second) = @_;
\&        no warnings;  # silence spurious -w undef complaints
\&        return 0 unless @$first == @$second;
\&        for (my $i = 0; $i < @$first; $i++) {
\&            return 0 if $first->[$i] ne $second->[$i];
\&        }
\&        return 1;
\&    }
.Ve
.PP
For multilevel structures, you may wish to use an approach more
like this one.  It uses the \s-1CPAN\s0 module FreezeThaw:
.PP
.Vb 2
\&    use FreezeThaw qw(cmpStr);
\&    @a = @b = ( "this", "that", [ "more", "stuff" ] );
.Ve
.PP
.Vb 4
\&    printf "a and b contain %s arrays\en",
\&        cmpStr(\e@a, \e@b) == 0
\&            ? "the same"
\&            : "different";
.Ve
.PP
This approach also works for comparing hashes.  Here
we'll demonstrate two different answers:
.PP
.Vb 1
\&    use FreezeThaw qw(cmpStr cmpStrHard);
.Ve
.PP
.Vb 3
\&    %a = %b = ( "this" => "that", "extra" => [ "more", "stuff" ] );
\&    $a{EXTRA} = \e%b;
\&    $b{EXTRA} = \e%a;
.Ve
.PP
.Vb 2
\&    printf "a and b contain %s hashes\en",
\&        cmpStr(\e%a, \e%b) == 0 ? "the same" : "different";
.Ve
.PP
.Vb 2
\&    printf "a and b contain %s hashes\en",
\&        cmpStrHard(\e%a, \e%b) == 0 ? "the same" : "different";
.Ve
.PP
The first reports that both those the hashes contain the same data,
while the second reports that they do not.  Which you prefer is left as
an exercise to the reader.
.Sh "How do I find the first array element for which a condition is true?"
.IX Subsection "How do I find the first array element for which a condition is true?"
To find the first array element which satisfies a condition, you can
use the \fIfirst()\fR function in the List::Util module, which comes with
Perl 5.8.  This example finds the first element that contains \*(L"Perl\*(R".
.PP
.Vb 1
\&        use List::Util qw(first);
.Ve
.PP
.Vb 1
\&        my $element = first { /Perl/ } @array;
.Ve
.PP
If you cannot use List::Util, you can make your own loop to do the
same thing.  Once you find the element, you stop the loop with last.
.PP
.Vb 5
\&        my $found;
\&        foreach ( @array )
\&                {
\&                if( /Perl/ ) { $found = $_; last }
\&                }
.Ve
.PP
If you want the array index, you can iterate through the indices
and check the array element at each index until you find one
that satisfies the condition.
.PP
.Vb 10
\&        my( $found, $index ) = ( undef, -1 );
\&        for( $i = 0; $i < @array; $i++ )
\&                {
\&                if( $array[$i] =~ /Perl/ )
\&                        {
\&                        $found = $array[$i];
\&                        $index = $i;
\&                        last;
\&                        }
\&                }
.Ve
.Sh "How do I handle linked lists?"
.IX Subsection "How do I handle linked lists?"
In general, you usually don't need a linked list in Perl, since with
regular arrays, you can push and pop or shift and unshift at either end,
or you can use splice to add and/or remove arbitrary number of elements at
arbitrary points.  Both pop and shift are both O(1) operations on Perl's
dynamic arrays.  In the absence of shifts and pops, push in general
needs to reallocate on the order every log(N) times, and unshift will
need to copy pointers each time.
.PP
If you really, really wanted, you could use structures as described in
perldsc or perltoot and do just what the algorithm book tells you
to do.  For example, imagine a list node like this:
.PP
.Vb 4
\&    $node = {
\&        VALUE => 42,
\&        LINK  => undef,
\&    };
.Ve
.PP
You could walk the list this way:
.PP
.Vb 5
\&    print "List: ";
\&    for ($node = $head;  $node; $node = $node->{LINK}) {
\&        print $node->{VALUE}, " ";
\&    }
\&    print "\en";
.Ve
.PP
You could add to the list this way:
.PP
.Vb 5
\&    my ($head, $tail);
\&    $tail = append($head, 1);       # grow a new head
\&    for $value ( 2 .. 10 ) {
\&        $tail = append($tail, $value);
\&    }
.Ve
.PP
.Vb 11
\&    sub append {
\&        my($list, $value) = @_;
\&        my $node = { VALUE => $value };
\&        if ($list) {
\&            $node->{LINK} = $list->{LINK};
\&            $list->{LINK} = $node;
\&        } else {
\&            $_[0] = $node;      # replace caller's version
\&        }
\&        return $node;
\&    }
.Ve
.PP
But again, Perl's built-in are virtually always good enough.
.Sh "How do I handle circular lists?"
.IX Subsection "How do I handle circular lists?"
Circular lists could be handled in the traditional fashion with linked
lists, or you could just do something like this with an array:
.PP
.Vb 2
\&    unshift(@array, pop(@array));  # the last shall be first
\&    push(@array, shift(@array));   # and vice versa
.Ve
.Sh "How do I shuffle an array randomly?"
.IX Subsection "How do I shuffle an array randomly?"
If you either have Perl 5.8.0 or later installed, or if you have
Scalar-List-Utils 1.03 or later installed, you can say:
.PP
.Vb 1
\&    use List::Util 'shuffle';
.Ve
.PP
.Vb 1
\&        @shuffled = shuffle(@list);
.Ve
.PP
If not, you can use a Fisher-Yates shuffle.
.PP
.Vb 8
\&    sub fisher_yates_shuffle {
\&        my $deck = shift;  # $deck is a reference to an array
\&        my $i = @$deck;
\&        while (--$i) {
\&            my $j = int rand ($i+1);
\&            @$deck[$i,$j] = @$deck[$j,$i];
\&        }
\&    }
.Ve
.PP
.Vb 5
\&    # shuffle my mpeg collection
\&    #
\&    my @mpeg = <audio/*/*.mp3>;
\&    fisher_yates_shuffle( \e@mpeg );    # randomize @mpeg in place
\&    print @mpeg;
.Ve
.PP
Note that the above implementation shuffles an array in place,
unlike the \fIList::Util::shuffle()\fR which takes a list and returns
a new shuffled list.
.PP
You've probably seen shuffling algorithms that work using splice,
randomly picking another element to swap the current element with
.PP
.Vb 6
\&    srand;
\&    @new = ();
\&    @old = 1 .. 10;  # just a demo
\&    while (@old) {
\&        push(@new, splice(@old, rand @old, 1));
\&    }
.Ve
.PP
This is bad because splice is already O(N), and since you do it N times,
you just invented a quadratic algorithm; that is, O(N**2).  This does
not scale, although Perl is so efficient that you probably won't notice
this until you have rather largish arrays.
.Sh "How do I process/modify each element of an array?"
.IX Subsection "How do I process/modify each element of an array?"
Use \f(CW\*(C`for\*(C'\fR/\f(CW\*(C`foreach\*(C'\fR:
.PP
.Vb 4
\&    for (@lines) {
\&                s/foo/bar/;     # change that word
\&                tr/XZ/ZX/;      # swap those letters
\&    }
.Ve
.PP
Here's another; let's compute spherical volumes:
.PP
.Vb 4
\&    for (@volumes = @radii) {   # @volumes has changed parts
\&                $_ **= 3;
\&                $_ *= (4/3) * 3.14159;  # this will be constant folded
\&    }
.Ve
.PP
which can also be done with \fImap()\fR which is made to transform
one list into another:
.PP
.Vb 1
\&        @volumes = map {$_ ** 3 * (4/3) * 3.14159} @radii;
.Ve
.PP
If you want to do the same thing to modify the values of the
hash, you can use the \f(CW\*(C`values\*(C'\fR function.  As of Perl 5.6
the values are not copied, so if you modify \f(CW$orbit\fR (in this
case), you modify the value.
.PP
.Vb 3
\&    for $orbit ( values %orbits ) {
\&                ($orbit **= 3) *= (4/3) * 3.14159;
\&    }
.Ve
.PP
Prior to perl 5.6 \f(CW\*(C`values\*(C'\fR returned copies of the values,
so older perl code often contains constructions such as
\&\f(CW@orbits{keys %orbits}\fR instead of \f(CW\*(C`values %orbits\*(C'\fR where
the hash is to be modified.
.Sh "How do I select a random element from an array?"
.IX Subsection "How do I select a random element from an array?"
Use the \fIrand()\fR function (see \*(L"rand\*(R" in perlfunc):
.PP
.Vb 2
\&    $index   = rand @array;
\&    $element = $array[$index];
.Ve
.PP
Or, simply:
    my \f(CW$element\fR = \f(CW$array\fR[ rand \f(CW@array\fR ];
.Sh "How do I permute N elements of a list?"
.IX Subsection "How do I permute N elements of a list?"
Use the List::Permutor module on \s-1CPAN\s0.  If the list is
actually an array, try the Algorithm::Permute module (also
on \s-1CPAN\s0).  It's written in \s-1XS\s0 code and is very efficient.
.PP
.Vb 6
\&        use Algorithm::Permute;
\&        my @array = 'a'..'d';
\&        my $p_iterator = Algorithm::Permute->new ( \e@array );
\&        while (my @perm = $p_iterator->next) {
\&           print "next permutation: (@perm)\en";
\&        }
.Ve
.PP
For even faster execution, you could do:
.PP
.Vb 5
\&   use Algorithm::Permute;
\&   my @array = 'a'..'d';
\&   Algorithm::Permute::permute {
\&      print "next permutation: (@array)\en";
\&   } @array;
.Ve
.PP
Here's a little program that generates all permutations of
all the words on each line of input. The algorithm embodied
in the \fIpermute()\fR function is discussed in Volume 4 (still
unpublished) of Knuth's \fIThe Art of Computer Programming\fR
and will work on any list:
.PP
.Vb 2
\&        #!/usr/bin/perl -n
\&        # Fischer-Kause ordered permutation generator
.Ve
.PP
.Vb 12
\&        sub permute (&@) {
\&                my $code = shift;
\&                my @idx = 0..$#_;
\&                while ( $code->(@_[@idx]) ) {
\&                        my $p = $#idx;
\&                        --$p while $idx[$p-1] > $idx[$p];
\&                        my $q = $p or return;
\&                        push @idx, reverse splice @idx, $p;
\&                        ++$q while $idx[$p-1] > $idx[$q];
\&                        @idx[$p-1,$q]=@idx[$q,$p-1];
\&                }
\&        }
.Ve
.PP
.Vb 1
\&        permute {print"@_\en"} split;
.Ve
.Sh "How do I sort an array by (anything)?"
.IX Subsection "How do I sort an array by (anything)?"
Supply a comparison function to \fIsort()\fR (described in \*(L"sort\*(R" in perlfunc):
.PP
.Vb 1
\&    @list = sort { $a <=> $b } @list;
.Ve
.PP
The default sort function is cmp, string comparison, which would
sort \f(CW\*(C`(1, 2, 10)\*(C'\fR into \f(CW\*(C`(1, 10, 2)\*(C'\fR.  \f(CW\*(C`<=>\*(C'\fR, used above, is
the numerical comparison operator.
.PP
If you have a complicated function needed to pull out the part you
want to sort on, then don't do it inside the sort function.  Pull it
out first, because the sort \s-1BLOCK\s0 can be called many times for the
same element.  Here's an example of how to pull out the first word
after the first number on each item, and then sort those words
case\-insensitively.
.PP
.Vb 6
\&    @idx = ();
\&    for (@data) {
\&        ($item) = /\ed+\es*(\eS+)/;
\&        push @idx, uc($item);
\&    }
\&    @sorted = @data[ sort { $idx[$a] cmp $idx[$b] } 0 .. $#idx ];
.Ve
.PP
which could also be written this way, using a trick
that's come to be known as the Schwartzian Transform:
.PP
.Vb 3
\&    @sorted = map  { $_->[0] }
\&              sort { $a->[1] cmp $b->[1] }
\&              map  { [ $_, uc( (/\ed+\es*(\eS+)/)[0]) ] } @data;
.Ve
.PP
If you need to sort on several fields, the following paradigm is useful.
.PP
.Vb 4
\&    @sorted = sort { field1($a) <=> field1($b) ||
\&                     field2($a) cmp field2($b) ||
\&                     field3($a) cmp field3($b)
\&                   }     @data;
.Ve
.PP
This can be conveniently combined with precalculation of keys as given
above.
.PP
See the \fIsort\fR article in the \*(L"Far More Than You Ever Wanted
To Know\*(R" collection in http://www.cpan.org/misc/olddoc/FMTEYEWTK.tgz for
more about this approach.
.PP
See also the question below on sorting hashes.
.Sh "How do I manipulate arrays of bits?"
.IX Subsection "How do I manipulate arrays of bits?"
Use \fIpack()\fR and \fIunpack()\fR, or else \fIvec()\fR and the bitwise operations.
.PP
For example, this sets \f(CW$vec\fR to have bit N set if \f(CW$ints\fR[N] was set:
.PP
.Vb 2
\&    $vec = '';
\&    foreach(@ints) { vec($vec,$_,1) = 1 }
.Ve
.PP
Here's how, given a vector in \f(CW$vec\fR, you can
get those bits into your \f(CW@ints\fR array:
.PP
.Vb 28
\&    sub bitvec_to_list {
\&        my $vec = shift;
\&        my @ints;
\&        # Find null-byte density then select best algorithm
\&        if ($vec =~ tr/\e0// / length $vec > 0.95) {
\&            use integer;
\&            my $i;
\&            # This method is faster with mostly null-bytes
\&            while($vec =~ /[^\e0]/g ) {
\&                $i = -9 + 8 * pos $vec;
\&                push @ints, $i if vec($vec, ++$i, 1);
\&                push @ints, $i if vec($vec, ++$i, 1);
\&                push @ints, $i if vec($vec, ++$i, 1);
\&                push @ints, $i if vec($vec, ++$i, 1);
\&                push @ints, $i if vec($vec, ++$i, 1);
\&                push @ints, $i if vec($vec, ++$i, 1);
\&                push @ints, $i if vec($vec, ++$i, 1);
\&                push @ints, $i if vec($vec, ++$i, 1);
\&            }
\&        } else {
\&            # This method is a fast general algorithm
\&            use integer;
\&            my $bits = unpack "b*", $vec;
\&            push @ints, 0 if $bits =~ s/^(\ed)// && $1;
\&            push @ints, pos $bits while($bits =~ /1/g);
\&        }
\&        return \e@ints;
\&    }
.Ve
.PP
This method gets faster the more sparse the bit vector is.
(Courtesy of Tim Bunce and Winfried Koenig.)
.PP
You can make the while loop a lot shorter with this suggestion
from Benjamin Goldberg:
.PP
.Vb 3
\&        while($vec =~ /[^\e0]+/g ) {
\&           push @ints, grep vec($vec, $_, 1), $-[0] * 8 .. $+[0] * 8;
\&        }
.Ve
.PP
Or use the \s-1CPAN\s0 module Bit::Vector:
.PP
.Vb 3
\&    $vector = Bit::Vector->new($num_of_bits);
\&    $vector->Index_List_Store(@ints);
\&    @ints = $vector->Index_List_Read();
.Ve
.PP
Bit::Vector provides efficient methods for bit vector, sets of small integers
and \*(L"big int\*(R" math.
.PP
Here's a more extensive illustration using \fIvec()\fR:
.PP
.Vb 7
\&    # vec demo
\&    $vector = "\exff\ex0f\exef\exfe";
\&    print "Ilya's string \e\exff\e\ex0f\e\exef\e\exfe represents the number ",
\&        unpack("N", $vector), "\en";
\&    $is_set = vec($vector, 23, 1);
\&    print "Its 23rd bit is ", $is_set ? "set" : "clear", ".\en";
\&    pvec($vector);
.Ve
.PP
.Vb 3
\&    set_vec(1,1,1);
\&    set_vec(3,1,1);
\&    set_vec(23,1,1);
.Ve
.PP
.Vb 6
\&    set_vec(3,1,3);
\&    set_vec(3,2,3);
\&    set_vec(3,4,3);
\&    set_vec(3,4,7);
\&    set_vec(3,8,3);
\&    set_vec(3,8,7);
.Ve
.PP
.Vb 2
\&    set_vec(0,32,17);
\&    set_vec(1,32,17);
.Ve
.PP
.Vb 7
\&    sub set_vec {
\&        my ($offset, $width, $value) = @_;
\&        my $vector = '';
\&        vec($vector, $offset, $width) = $value;
\&        print "offset=$offset width=$width value=$value\en";
\&        pvec($vector);
\&    }
.Ve
.PP
.Vb 5
\&    sub pvec {
\&        my $vector = shift;
\&        my $bits = unpack("b*", $vector);
\&        my $i = 0;
\&        my $BASE = 8;
.Ve
.PP
.Vb 4
\&        print "vector length in bytes: ", length($vector), "\en";
\&        @bytes = unpack("A8" x length($vector), $bits);
\&        print "bits are: @bytes\en\en";
\&    }
.Ve
.Sh "Why does \fIdefined()\fP return true on empty arrays and hashes?"
.IX Subsection "Why does defined() return true on empty arrays and hashes?"
The short story is that you should probably only use defined on scalars or
functions, not on aggregates (arrays and hashes).  See \*(L"defined\*(R" in perlfunc
in the 5.004 release or later of Perl for more detail.
.SH "Data: Hashes (Associative Arrays)"
.IX Header "Data: Hashes (Associative Arrays)"
.Sh "How do I process an entire hash?"
.IX Subsection "How do I process an entire hash?"
Use the \fIeach()\fR function (see \*(L"each\*(R" in perlfunc) if you don't care
whether it's sorted:
.PP
.Vb 3
\&    while ( ($key, $value) = each %hash) {
\&        print "$key = $value\en";
\&    }
.Ve
.PP
If you want it sorted, you'll have to use \fIforeach()\fR on the result of
sorting the keys as shown in an earlier question.
.Sh "What happens if I add or remove keys from a hash while iterating over it?"
.IX Subsection "What happens if I add or remove keys from a hash while iterating over it?"
(contributed by brian d foy)
.PP
The easy answer is \*(L"Don't do that!\*(R"
.PP
If you iterate through the hash with \fIeach()\fR, you can delete the key
most recently returned without worrying about it.  If you delete or add
other keys, the iterator may skip or double up on them since perl
may rearrange the hash table.  See the
entry for \f(CW\*(C`each()\*(C'\fR in perlfunc.
.Sh "How do I look up a hash element by value?"
.IX Subsection "How do I look up a hash element by value?"
Create a reverse hash:
.PP
.Vb 2
\&    %by_value = reverse %by_key;
\&    $key = $by_value{$value};
.Ve
.PP
That's not particularly efficient.  It would be more space-efficient
to use:
.PP
.Vb 3
\&    while (($key, $value) = each %by_key) {
\&        $by_value{$value} = $key;
\&    }
.Ve
.PP
If your hash could have repeated values, the methods above will only find
one of the associated keys.   This may or may not worry you.  If it does
worry you, you can always reverse the hash into a hash of arrays instead:
.PP
.Vb 3
\&     while (($key, $value) = each %by_key) {
\&         push @{$key_list_by_value{$value}}, $key;
\&     }
.Ve
.Sh "How can I know how many entries are in a hash?"
.IX Subsection "How can I know how many entries are in a hash?"
If you mean how many keys, then all you have to do is
use the \fIkeys()\fR function in a scalar context:
.PP
.Vb 1
\&    $num_keys = keys %hash;
.Ve
.PP
The \fIkeys()\fR function also resets the iterator, which means that you may
see strange results if you use this between uses of other hash operators
such as \fIeach()\fR.
.Sh "How do I sort a hash (optionally by value instead of key)?"
.IX Subsection "How do I sort a hash (optionally by value instead of key)?"
(contributed by brian d foy)
.PP
To sort a hash, start with the keys. In this example, we give the list of
keys to the sort function which then compares them ASCIIbetically (which
might be affected by your locale settings). The output list has the keys
in ASCIIbetical order. Once we have the keys, we can go through them to
create a report which lists the keys in ASCIIbetical order.
.PP
.Vb 1
\&        my @keys = sort { $a cmp $b } keys %hash;
.Ve
.PP
.Vb 4
\&        foreach my $key ( @keys )
\&                {
\&                printf "%-20s %6d\en", $key, $hash{$value};
\&                }
.Ve
.PP
We could get more fancy in the \f(CW\*(C`sort()\*(C'\fR block though. Instead of
comparing the keys, we can compute a value with them and use that
value as the comparison.
.PP
For instance, to make our report order case\-insensitive, we use
the \f(CW\*(C`\eL\*(C'\fR sequence in a double-quoted string to make everything
lowercase. The \f(CW\*(C`sort()\*(C'\fR block then compares the lowercased
values to determine in which order to put the keys.
.PP
.Vb 1
\&        my @keys = sort { "\eL$a" cmp "\eL$b" } keys %hash;
.Ve
.PP
Note: if the computation is expensive or the hash has many elements,
you may want to look at the Schwartzian Transform to cache the
computation results.
.PP
If we want to sort by the hash value instead, we use the hash key
to look it up. We still get out a list of keys, but this time they
are ordered by their value.
.PP
.Vb 1
\&        my @keys = sort { $hash{$a} <=> $hash{$b} } keys %hash;
.Ve
.PP
From there we can get more complex. If the hash values are the same,
we can provide a secondary sort on the hash key.
.PP
.Vb 5
\&        my @keys = sort {
\&                $hash{$a} <=> $hash{$b}
\&                        or
\&                "\eL$a" cmp "\eL$b"
\&                } keys %hash;
.Ve
.Sh "How can I always keep my hash sorted?"
.IX Subsection "How can I always keep my hash sorted?"
You can look into using the DB_File module and \fItie()\fR using the
\&\f(CW$DB_BTREE\fR hash bindings as documented in \*(L"In Memory Databases\*(R" in DB_File.
The Tie::IxHash module from \s-1CPAN\s0 might also be instructive.
.ie n .Sh "What's the difference between ""delete"" and ""undef"" with hashes?"
.el .Sh "What's the difference between ``delete'' and ``undef'' with hashes?"
.IX Subsection "What's the difference between delete and undef with hashes?"
Hashes contain pairs of scalars: the first is the key, the
second is the value.  The key will be coerced to a string,
although the value can be any kind of scalar: string,
number, or reference.  If a key \f(CW$key\fR is present in
\&\f(CW%hash\fR, \f(CW\*(C`exists($hash{$key})\*(C'\fR will return true.  The value
for a given key can be \f(CW\*(C`undef\*(C'\fR, in which case
\&\f(CW$hash{$key}\fR will be \f(CW\*(C`undef\*(C'\fR while \f(CW\*(C`exists $hash{$key}\*(C'\fR
will return true.  This corresponds to (\f(CW$key\fR, \f(CW\*(C`undef\*(C'\fR)
being in the hash.
.PP
Pictures help...  here's the \f(CW%hash\fR table:
.PP
.Vb 7
\&          keys  values
\&        +------+------+
\&        |  a   |  3   |
\&        |  x   |  7   |
\&        |  d   |  0   |
\&        |  e   |  2   |
\&        +------+------+
.Ve
.PP
And these conditions hold
.PP
.Vb 6
\&        $hash{'a'}                       is true
\&        $hash{'d'}                       is false
\&        defined $hash{'d'}               is true
\&        defined $hash{'a'}               is true
\&        exists $hash{'a'}                is true (Perl5 only)
\&        grep ($_ eq 'a', keys %hash)     is true
.Ve
.PP
If you now say
.PP
.Vb 1
\&        undef $hash{'a'}
.Ve
.PP
your table now reads:
.PP
.Vb 7
\&          keys  values
\&        +------+------+
\&        |  a   | undef|
\&        |  x   |  7   |
\&        |  d   |  0   |
\&        |  e   |  2   |
\&        +------+------+
.Ve
.PP
and these conditions now hold; changes in caps:
.PP
.Vb 6
\&        $hash{'a'}                       is FALSE
\&        $hash{'d'}                       is false
\&        defined $hash{'d'}               is true
\&        defined $hash{'a'}               is FALSE
\&        exists $hash{'a'}                is true (Perl5 only)
\&        grep ($_ eq 'a', keys %hash)     is true
.Ve
.PP
Notice the last two: you have an undef value, but a defined key!
.PP
Now, consider this:
.PP
.Vb 1
\&        delete $hash{'a'}
.Ve
.PP
your table now reads:
.PP
.Vb 6
\&          keys  values
\&        +------+------+
\&        |  x   |  7   |
\&        |  d   |  0   |
\&        |  e   |  2   |
\&        +------+------+
.Ve
.PP
and these conditions now hold; changes in caps:
.PP
.Vb 6
\&        $hash{'a'}                       is false
\&        $hash{'d'}                       is false
\&        defined $hash{'d'}               is true
\&        defined $hash{'a'}               is false
\&        exists $hash{'a'}                is FALSE (Perl5 only)
\&        grep ($_ eq 'a', keys %hash)     is FALSE
.Ve
.PP
See, the whole entry is gone!
.Sh "Why don't my tied hashes make the defined/exists distinction?"
.IX Subsection "Why don't my tied hashes make the defined/exists distinction?"
This depends on the tied hash's implementation of \s-1\fIEXISTS\s0()\fR.
For example, there isn't the concept of undef with hashes
that are tied to DBM* files. It also means that \fIexists()\fR and
\&\fIdefined()\fR do the same thing with a DBM* file, and what they
end up doing is not what they do with ordinary hashes.
.Sh "How do I reset an \fIeach()\fP operation part-way through?"
.IX Subsection "How do I reset an each() operation part-way through?"
Using \f(CW\*(C`keys %hash\*(C'\fR in scalar context returns the number of keys in
the hash \fIand\fR resets the iterator associated with the hash.  You may
need to do this if you use \f(CW\*(C`last\*(C'\fR to exit a loop early so that when you
re-enter it, the hash iterator has been reset.
.Sh "How can I get the unique keys from two hashes?"
.IX Subsection "How can I get the unique keys from two hashes?"
First you extract the keys from the hashes into lists, then solve
the \*(L"removing duplicates\*(R" problem described above.  For example:
.PP
.Vb 5
\&    %seen = ();
\&    for $element (keys(%foo), keys(%bar)) {
\&        $seen{$element}++;
\&    }
\&    @uniq = keys %seen;
.Ve
.PP
Or more succinctly:
.PP
.Vb 1
\&    @uniq = keys %{{%foo,%bar}};
.Ve
.PP
Or if you really want to save space:
.PP
.Vb 8
\&    %seen = ();
\&    while (defined ($key = each %foo)) {
\&        $seen{$key}++;
\&    }
\&    while (defined ($key = each %bar)) {
\&        $seen{$key}++;
\&    }
\&    @uniq = keys %seen;
.Ve
.Sh "How can I store a multidimensional array in a \s-1DBM\s0 file?"
.IX Subsection "How can I store a multidimensional array in a DBM file?"
Either stringify the structure yourself (no fun), or else
get the \s-1MLDBM\s0 (which uses Data::Dumper) module from \s-1CPAN\s0 and layer
it on top of either DB_File or GDBM_File.
.Sh "How can I make my hash remember the order I put elements into it?"
.IX Subsection "How can I make my hash remember the order I put elements into it?"
Use the Tie::IxHash from \s-1CPAN\s0.
.PP
.Vb 7
\&    use Tie::IxHash;
\&    tie my %myhash, 'Tie::IxHash';
\&    for (my $i=0; $i<20; $i++) {
\&        $myhash{$i} = 2*$i;
\&    }
\&    my @keys = keys %myhash;
\&    # @keys = (0,1,2,3,...)
.Ve
.Sh "Why does passing a subroutine an undefined element in a hash create it?"
.IX Subsection "Why does passing a subroutine an undefined element in a hash create it?"
If you say something like:
.PP
.Vb 1
\&    somefunc($hash{"nonesuch key here"});
.Ve
.PP
Then that element \*(L"autovivifies\*(R"; that is, it springs into existence
whether you store something there or not.  That's because functions
get scalars passed in by reference.  If \fIsomefunc()\fR modifies \f(CW$_[0]\fR,
it has to be ready to write it back into the caller's version.
.PP
This has been fixed as of Perl5.004.
.PP
Normally, merely accessing a key's value for a nonexistent key does
\&\fInot\fR cause that key to be forever there.  This is different than
awk's behavior.
.Sh "How can I make the Perl equivalent of a C structure/\*(C+ class/hash or array of hashes or arrays?"
.IX Subsection "How can I make the Perl equivalent of a C structure/ class/hash or array of hashes or arrays?"
Usually a hash ref, perhaps like this:
.PP
.Vb 8
\&    $record = {
\&        NAME   => "Jason",
\&        EMPNO  => 132,
\&        TITLE  => "deputy peon",
\&        AGE    => 23,
\&        SALARY => 37_000,
\&        PALS   => [ "Norbert", "Rhys", "Phineas"],
\&    };
.Ve
.PP
References are documented in perlref and the upcoming perlreftut.
Examples of complex data structures are given in perldsc and
perllol.  Examples of structures and object-oriented classes are
in perltoot.
.Sh "How can I use a reference as a hash key?"
.IX Subsection "How can I use a reference as a hash key?"
(contributed by brian d foy)
.PP
Hash keys are strings, so you can't really use a reference as the key.
When you try to do that, perl turns the reference into its stringified
form (for instance, \f(CW\*(C`HASH(0xDEADBEEF)\*(C'\fR). From there you can't get back
the reference from the stringified form, at least without doing some
extra work on your own. Also remember that hash keys must be unique, but
two different variables can store the same reference (and those variables
can change later).
.PP
The Tie::RefHash module, which is distributed with perl, might be what
you want. It handles that extra work.
.SH "Data: Misc"
.IX Header "Data: Misc"
.Sh "How do I handle binary data correctly?"
.IX Subsection "How do I handle binary data correctly?"
Perl is binary clean, so this shouldn't be a problem.  For example,
this works fine (assuming the files are found):
.PP
.Vb 3
\&    if (`cat /vmunix` =~ /gzip/) {
\&        print "Your kernel is GNU-zip enabled!\en";
\&    }
.Ve
.PP
On less elegant (read: Byzantine) systems, however, you have
to play tedious games with \*(L"text\*(R" versus \*(L"binary\*(R" files.  See
\&\*(L"binmode\*(R" in perlfunc or perlopentut.
.PP
If you're concerned about 8\-bit \s-1ASCII\s0 data, then see perllocale.
.PP
If you want to deal with multibyte characters, however, there are
some gotchas.  See the section on Regular Expressions.
.Sh "How do I determine whether a scalar is a number/whole/integer/float?"
.IX Subsection "How do I determine whether a scalar is a number/whole/integer/float?"
Assuming that you don't care about \s-1IEEE\s0 notations like \*(L"NaN\*(R" or
\&\*(L"Infinity\*(R", you probably just want to use a regular expression.
.PP
.Vb 8
\&   if (/\eD/)            { print "has nondigits\en" }
\&   if (/^\ed+$/)         { print "is a whole number\en" }
\&   if (/^-?\ed+$/)       { print "is an integer\en" }
\&   if (/^[+-]?\ed+$/)    { print "is a +/- integer\en" }
\&   if (/^-?\ed+\e.?\ed*$/) { print "is a real number\en" }
\&   if (/^-?(?:\ed+(?:\e.\ed*)?|\e.\ed+)$/) { print "is a decimal number\en" }
\&   if (/^([+-]?)(?=\ed|\e.\ed)\ed*(\e.\ed*)?([Ee]([+-]?\ed+))?$/)
\&                        { print "a C float\en" }
.Ve
.PP
There are also some commonly used modules for the task.
Scalar::Util (distributed with 5.8) provides access to perl's
internal function \f(CW\*(C`looks_like_number\*(C'\fR for determining
whether a variable looks like a number.  Data::Types
exports functions that validate data types using both the
above and other regular expressions. Thirdly, there is
\&\f(CW\*(C`Regexp::Common\*(C'\fR which has regular expressions to match
various types of numbers. Those three modules are available
from the \s-1CPAN\s0.
.PP
If you're on a \s-1POSIX\s0 system, Perl supports the \f(CW\*(C`POSIX::strtod\*(C'\fR
function.  Its semantics are somewhat cumbersome, so here's a \f(CW\*(C`getnum\*(C'\fR
wrapper function for more convenient access.  This function takes
a string and returns the number it found, or \f(CW\*(C`undef\*(C'\fR for input that
isn't a C float.  The \f(CW\*(C`is_numeric\*(C'\fR function is a front end to \f(CW\*(C`getnum\*(C'\fR
if you just want to say, \*(L"Is this a float?\*(R"
.PP
.Vb 13
\&    sub getnum {
\&        use POSIX qw(strtod);
\&        my $str = shift;
\&        $str =~ s/^\es+//;
\&        $str =~ s/\es+$//;
\&        $! = 0;
\&        my($num, $unparsed) = strtod($str);
\&        if (($str eq '') || ($unparsed != 0) || $!) {
\&            return undef;
\&        } else {
\&            return $num;
\&        }
\&    }
.Ve
.PP
.Vb 1
\&    sub is_numeric { defined getnum($_[0]) }
.Ve
.PP
Or you could check out the String::Scanf module on the \s-1CPAN\s0
instead. The \s-1POSIX\s0 module (part of the standard Perl distribution) provides
the \f(CW\*(C`strtod\*(C'\fR and \f(CW\*(C`strtol\*(C'\fR for converting strings to double and longs,
respectively.
.Sh "How do I keep persistent data across program calls?"
.IX Subsection "How do I keep persistent data across program calls?"
For some specific applications, you can use one of the \s-1DBM\s0 modules.
See AnyDBM_File.  More generically, you should consult the FreezeThaw
or Storable modules from \s-1CPAN\s0.  Starting from Perl 5.8 Storable is part
of the standard distribution.  Here's one example using Storable's \f(CW\*(C`store\*(C'\fR
and \f(CW\*(C`retrieve\*(C'\fR functions:
.PP
.Vb 2
\&    use Storable;
\&    store(\e%hash, "filename");
.Ve
.PP
.Vb 3
\&    # later on...
\&    $href = retrieve("filename");        # by ref
\&    %hash = %{ retrieve("filename") };   # direct to hash
.Ve
.Sh "How do I print out or copy a recursive data structure?"
.IX Subsection "How do I print out or copy a recursive data structure?"
The Data::Dumper module on \s-1CPAN\s0 (or the 5.005 release of Perl) is great
for printing out data structures.  The Storable module on \s-1CPAN\s0 (or the
5.8 release of Perl), provides a function called \f(CW\*(C`dclone\*(C'\fR that recursively
copies its argument.
.PP
.Vb 2
\&    use Storable qw(dclone);
\&    $r2 = dclone($r1);
.Ve
.PP
Where \f(CW$r1\fR can be a reference to any kind of data structure you'd like.
It will be deeply copied.  Because \f(CW\*(C`dclone\*(C'\fR takes and returns references,
you'd have to add extra punctuation if you had a hash of arrays that
you wanted to copy.
.PP
.Vb 1
\&    %newhash = %{ dclone(\e%oldhash) };
.Ve
.Sh "How do I define methods for every class/object?"
.IX Subsection "How do I define methods for every class/object?"
Use the \s-1UNIVERSAL\s0 class (see \s-1UNIVERSAL\s0).
.Sh "How do I verify a credit card checksum?"
.IX Subsection "How do I verify a credit card checksum?"
Get the Business::CreditCard module from \s-1CPAN\s0.
.Sh "How do I pack arrays of doubles or floats for \s-1XS\s0 code?"
.IX Subsection "How do I pack arrays of doubles or floats for XS code?"
The kgbpack.c code in the \s-1PGPLOT\s0 module on \s-1CPAN\s0 does just this.
If you're doing a lot of float or double processing, consider using
the \s-1PDL\s0 module from \s-1CPAN\s0 instead\*(--it makes number-crunching easy.
.SH "AUTHOR AND COPYRIGHT"
.IX Header "AUTHOR AND COPYRIGHT"
Copyright (c) 1997\-2006 Tom Christiansen, Nathan Torkington, and
other authors as noted. All rights reserved.
.PP
This documentation is free; you can redistribute it and/or modify it
under the same terms as Perl itself.
.PP
Irrespective of its distribution, all code examples in this file
are hereby placed into the public domain.  You are permitted and
encouraged to use this code in your own programs for fun
or for profit as you see fit.  A simple comment in the code giving
credit would be courteous but is not required.