This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
[patch pod/perlapio.pod] csh temp env setting
[perl5.git] / pod / perlop.pod
... / ...
CommitLineData
1=head1 NAME
2
3perlop - Perl operators and precedence
4
5=head1 SYNOPSIS
6
7Perl operators have the following associativity and precedence,
8listed from highest precedence to lowest. Operators borrowed from
9C keep the same precedence relationship with each other, even where
10C's precedence is slightly screwy. (This makes learning Perl easier
11for C folks.) With very few exceptions, these all operate on scalar
12values only, not array values.
13
14 left terms and list operators (leftward)
15 left ->
16 nonassoc ++ --
17 right **
18 right ! ~ \ and unary + and -
19 left =~ !~
20 left * / % x
21 left + - .
22 left << >>
23 nonassoc named unary operators
24 nonassoc < > <= >= lt gt le ge
25 nonassoc == != <=> eq ne cmp
26 left &
27 left | ^
28 left &&
29 left ||
30 nonassoc .. ...
31 right ?:
32 right = += -= *= etc.
33 left , =>
34 nonassoc list operators (rightward)
35 right not
36 left and
37 left or xor
38
39In the following sections, these operators are covered in precedence order.
40
41Many operators can be overloaded for objects. See L<overload>.
42
43=head1 DESCRIPTION
44
45=head2 Terms and List Operators (Leftward)
46
47A TERM has the highest precedence in Perl. They include variables,
48quote and quote-like operators, any expression in parentheses,
49and any function whose arguments are parenthesized. Actually, there
50aren't really functions in this sense, just list operators and unary
51operators behaving as functions because you put parentheses around
52the arguments. These are all documented in L<perlfunc>.
53
54If any list operator (print(), etc.) or any unary operator (chdir(), etc.)
55is followed by a left parenthesis as the next token, the operator and
56arguments within parentheses are taken to be of highest precedence,
57just like a normal function call.
58
59In the absence of parentheses, the precedence of list operators such as
60C<print>, C<sort>, or C<chmod> is either very high or very low depending on
61whether you are looking at the left side or the right side of the operator.
62For example, in
63
64 @ary = (1, 3, sort 4, 2);
65 print @ary; # prints 1324
66
67the commas on the right of the sort are evaluated before the sort,
68but the commas on the left are evaluated after. In other words,
69list operators tend to gobble up all arguments that follow, and
70then act like a simple TERM with regard to the preceding expression.
71Be careful with parentheses:
72
73 # These evaluate exit before doing the print:
74 print($foo, exit); # Obviously not what you want.
75 print $foo, exit; # Nor is this.
76
77 # These do the print before evaluating exit:
78 (print $foo), exit; # This is what you want.
79 print($foo), exit; # Or this.
80 print ($foo), exit; # Or even this.
81
82Also note that
83
84 print ($foo & 255) + 1, "\n";
85
86probably doesn't do what you expect at first glance. See
87L<Named Unary Operators> for more discussion of this.
88
89Also parsed as terms are the C<do {}> and C<eval {}> constructs, as
90well as subroutine and method calls, and the anonymous
91constructors C<[]> and C<{}>.
92
93See also L<Quote and Quote-like Operators> toward the end of this section,
94as well as L<"I/O Operators">.
95
96=head2 The Arrow Operator
97
98"C<< -> >>" is an infix dereference operator, just as it is in C
99and C++. If the right side is either a C<[...]>, C<{...}>, or a
100C<(...)> subscript, then the left side must be either a hard or
101symbolic reference to an array, a hash, or a subroutine respectively.
102(Or technically speaking, a location capable of holding a hard
103reference, if it's an array or hash reference being used for
104assignment.) See L<perlreftut> and L<perlref>.
105
106Otherwise, the right side is a method name or a simple scalar
107variable containing either the method name or a subroutine reference,
108and the left side must be either an object (a blessed reference)
109or a class name (that is, a package name). See L<perlobj>.
110
111=head2 Auto-increment and Auto-decrement
112
113"++" and "--" work as in C. That is, if placed before a variable, they
114increment or decrement the variable before returning the value, and if
115placed after, increment or decrement the variable after returning the value.
116
117The auto-increment operator has a little extra builtin magic to it. If
118you increment a variable that is numeric, or that has ever been used in
119a numeric context, you get a normal increment. If, however, the
120variable has been used in only string contexts since it was set, and
121has a value that is not the empty string and matches the pattern
122C</^[a-zA-Z]*[0-9]*\z/>, the increment is done as a string, preserving each
123character within its range, with carry:
124
125 print ++($foo = '99'); # prints '100'
126 print ++($foo = 'a0'); # prints 'a1'
127 print ++($foo = 'Az'); # prints 'Ba'
128 print ++($foo = 'zz'); # prints 'aaa'
129
130The auto-decrement operator is not magical.
131
132=head2 Exponentiation
133
134Binary "**" is the exponentiation operator. It binds even more
135tightly than unary minus, so -2**4 is -(2**4), not (-2)**4. (This is
136implemented using C's pow(3) function, which actually works on doubles
137internally.)
138
139=head2 Symbolic Unary Operators
140
141Unary "!" performs logical negation, i.e., "not". See also C<not> for a lower
142precedence version of this.
143
144Unary "-" performs arithmetic negation if the operand is numeric. If
145the operand is an identifier, a string consisting of a minus sign
146concatenated with the identifier is returned. Otherwise, if the string
147starts with a plus or minus, a string starting with the opposite sign
148is returned. One effect of these rules is that C<-bareword> is equivalent
149to C<"-bareword">.
150
151Unary "~" performs bitwise negation, i.e., 1's complement. For
152example, C<0666 & ~027> is 0640. (See also L<Integer Arithmetic> and
153L<Bitwise String Operators>.) Note that the width of the result is
154platform-dependent: ~0 is 32 bits wide on a 32-bit platform, but 64
155bits wide on a 64-bit platform, so if you are expecting a certain bit
156width, remember use the & operator to mask off the excess bits.
157
158Unary "+" has no effect whatsoever, even on strings. It is useful
159syntactically for separating a function name from a parenthesized expression
160that would otherwise be interpreted as the complete list of function
161arguments. (See examples above under L<Terms and List Operators (Leftward)>.)
162
163Unary "\" creates a reference to whatever follows it. See L<perlreftut>
164and L<perlref>. Do not confuse this behavior with the behavior of
165backslash within a string, although both forms do convey the notion
166of protecting the next thing from interpolation.
167
168=head2 Binding Operators
169
170Binary "=~" binds a scalar expression to a pattern match. Certain operations
171search or modify the string $_ by default. This operator makes that kind
172of operation work on some other string. The right argument is a search
173pattern, substitution, or transliteration. The left argument is what is
174supposed to be searched, substituted, or transliterated instead of the default
175$_. When used in scalar context, the return value generally indicates the
176success of the operation. Behavior in list context depends on the particular
177operator. See L</"Regexp Quote-Like Operators"> for details.
178
179If the right argument is an expression rather than a search pattern,
180substitution, or transliteration, it is interpreted as a search pattern at run
181time. This can be less efficient than an explicit search, because the
182pattern must be compiled every time the expression is evaluated.
183
184Binary "!~" is just like "=~" except the return value is negated in
185the logical sense.
186
187=head2 Multiplicative Operators
188
189Binary "*" multiplies two numbers.
190
191Binary "/" divides two numbers.
192
193Binary "%" computes the modulus of two numbers. Given integer
194operands C<$a> and C<$b>: If C<$b> is positive, then C<$a % $b> is
195C<$a> minus the largest multiple of C<$b> that is not greater than
196C<$a>. If C<$b> is negative, then C<$a % $b> is C<$a> minus the
197smallest multiple of C<$b> that is not less than C<$a> (i.e. the
198result will be less than or equal to zero).
199Note than when C<use integer> is in scope, "%" gives you direct access
200to the modulus operator as implemented by your C compiler. This
201operator is not as well defined for negative operands, but it will
202execute faster.
203
204Binary "x" is the repetition operator. In scalar context or if the left
205operand is not enclosed in parentheses, it returns a string consisting
206of the left operand repeated the number of times specified by the right
207operand. In list context, if the left operand is enclosed in
208parentheses, it repeats the list.
209
210 print '-' x 80; # print row of dashes
211
212 print "\t" x ($tab/8), ' ' x ($tab%8); # tab over
213
214 @ones = (1) x 80; # a list of 80 1's
215 @ones = (5) x @ones; # set all elements to 5
216
217
218=head2 Additive Operators
219
220Binary "+" returns the sum of two numbers.
221
222Binary "-" returns the difference of two numbers.
223
224Binary "." concatenates two strings.
225
226=head2 Shift Operators
227
228Binary "<<" returns the value of its left argument shifted left by the
229number of bits specified by the right argument. Arguments should be
230integers. (See also L<Integer Arithmetic>.)
231
232Binary ">>" returns the value of its left argument shifted right by
233the number of bits specified by the right argument. Arguments should
234be integers. (See also L<Integer Arithmetic>.)
235
236Note that both "<<" and ">>" in Perl are implemented directly using
237"<<" and ">>" in C. If C<use integer> (see L<Integer Arithmetic>) is
238in force then signed C integers are used, else unsigned C integers are
239used. Either way, the implementation isn't going to generate results
240larger than the size of the integer type Perl was built with (32 bits
241or 64 bits).
242
243The result of overflowing the range of the integers is undefined
244because it is undefined also in C. In other words, using 32-bit
245integers, C<< 1 << 32 >> is undefined. Shifting by a negative number
246of bits is also undefined.
247
248=head2 Named Unary Operators
249
250The various named unary operators are treated as functions with one
251argument, with optional parentheses. These include the filetest
252operators, like C<-f>, C<-M>, etc. See L<perlfunc>.
253
254If any list operator (print(), etc.) or any unary operator (chdir(), etc.)
255is followed by a left parenthesis as the next token, the operator and
256arguments within parentheses are taken to be of highest precedence,
257just like a normal function call. For example,
258because named unary operators are higher precedence than ||:
259
260 chdir $foo || die; # (chdir $foo) || die
261 chdir($foo) || die; # (chdir $foo) || die
262 chdir ($foo) || die; # (chdir $foo) || die
263 chdir +($foo) || die; # (chdir $foo) || die
264
265but, because * is higher precedence than named operators:
266
267 chdir $foo * 20; # chdir ($foo * 20)
268 chdir($foo) * 20; # (chdir $foo) * 20
269 chdir ($foo) * 20; # (chdir $foo) * 20
270 chdir +($foo) * 20; # chdir ($foo * 20)
271
272 rand 10 * 20; # rand (10 * 20)
273 rand(10) * 20; # (rand 10) * 20
274 rand (10) * 20; # (rand 10) * 20
275 rand +(10) * 20; # rand (10 * 20)
276
277See also L<"Terms and List Operators (Leftward)">.
278
279=head2 Relational Operators
280
281Binary "<" returns true if the left argument is numerically less than
282the right argument.
283
284Binary ">" returns true if the left argument is numerically greater
285than the right argument.
286
287Binary "<=" returns true if the left argument is numerically less than
288or equal to the right argument.
289
290Binary ">=" returns true if the left argument is numerically greater
291than or equal to the right argument.
292
293Binary "lt" returns true if the left argument is stringwise less than
294the right argument.
295
296Binary "gt" returns true if the left argument is stringwise greater
297than the right argument.
298
299Binary "le" returns true if the left argument is stringwise less than
300or equal to the right argument.
301
302Binary "ge" returns true if the left argument is stringwise greater
303than or equal to the right argument.
304
305=head2 Equality Operators
306
307Binary "==" returns true if the left argument is numerically equal to
308the right argument.
309
310Binary "!=" returns true if the left argument is numerically not equal
311to the right argument.
312
313Binary "<=>" returns -1, 0, or 1 depending on whether the left
314argument is numerically less than, equal to, or greater than the right
315argument. If your platform supports NaNs (not-a-numbers) as numeric
316values, using them with "<=>" returns undef. NaN is not "<", "==", ">",
317"<=" or ">=" anything (even NaN), so those 5 return false. NaN != NaN
318returns true, as does NaN != anything else. If your platform doesn't
319support NaNs then NaN is just a string with numeric value 0.
320
321 perl -le '$a = NaN; print "No NaN support here" if $a == $a'
322 perl -le '$a = NaN; print "NaN support here" if $a != $a'
323
324Binary "eq" returns true if the left argument is stringwise equal to
325the right argument.
326
327Binary "ne" returns true if the left argument is stringwise not equal
328to the right argument.
329
330Binary "cmp" returns -1, 0, or 1 depending on whether the left
331argument is stringwise less than, equal to, or greater than the right
332argument.
333
334"lt", "le", "ge", "gt" and "cmp" use the collation (sort) order specified
335by the current locale if C<use locale> is in effect. See L<perllocale>.
336
337=head2 Bitwise And
338
339Binary "&" returns its operators ANDed together bit by bit.
340(See also L<Integer Arithmetic> and L<Bitwise String Operators>.)
341
342=head2 Bitwise Or and Exclusive Or
343
344Binary "|" returns its operators ORed together bit by bit.
345(See also L<Integer Arithmetic> and L<Bitwise String Operators>.)
346
347Binary "^" returns its operators XORed together bit by bit.
348(See also L<Integer Arithmetic> and L<Bitwise String Operators>.)
349
350=head2 C-style Logical And
351
352Binary "&&" performs a short-circuit logical AND operation. That is,
353if the left operand is false, the right operand is not even evaluated.
354Scalar or list context propagates down to the right operand if it
355is evaluated.
356
357=head2 C-style Logical Or
358
359Binary "||" performs a short-circuit logical OR operation. That is,
360if the left operand is true, the right operand is not even evaluated.
361Scalar or list context propagates down to the right operand if it
362is evaluated.
363
364The C<||> and C<&&> operators differ from C's in that, rather than returning
3650 or 1, they return the last value evaluated. Thus, a reasonably portable
366way to find out the home directory (assuming it's not "0") might be:
367
368 $home = $ENV{'HOME'} || $ENV{'LOGDIR'} ||
369 (getpwuid($<))[7] || die "You're homeless!\n";
370
371In particular, this means that you shouldn't use this
372for selecting between two aggregates for assignment:
373
374 @a = @b || @c; # this is wrong
375 @a = scalar(@b) || @c; # really meant this
376 @a = @b ? @b : @c; # this works fine, though
377
378As more readable alternatives to C<&&> and C<||> when used for
379control flow, Perl provides C<and> and C<or> operators (see below).
380The short-circuit behavior is identical. The precedence of "and" and
381"or" is much lower, however, so that you can safely use them after a
382list operator without the need for parentheses:
383
384 unlink "alpha", "beta", "gamma"
385 or gripe(), next LINE;
386
387With the C-style operators that would have been written like this:
388
389 unlink("alpha", "beta", "gamma")
390 || (gripe(), next LINE);
391
392Using "or" for assignment is unlikely to do what you want; see below.
393
394=head2 Range Operators
395
396Binary ".." is the range operator, which is really two different
397operators depending on the context. In list context, it returns an
398array of values counting (up by ones) from the left value to the right
399value. If the left value is greater than the right value then it
400returns the empty array. The range operator is useful for writing
401C<foreach (1..10)> loops and for doing slice operations on arrays. In
402the current implementation, no temporary array is created when the
403range operator is used as the expression in C<foreach> loops, but older
404versions of Perl might burn a lot of memory when you write something
405like this:
406
407 for (1 .. 1_000_000) {
408 # code
409 }
410
411In scalar context, ".." returns a boolean value. The operator is
412bistable, like a flip-flop, and emulates the line-range (comma) operator
413of B<sed>, B<awk>, and various editors. Each ".." operator maintains its
414own boolean state. It is false as long as its left operand is false.
415Once the left operand is true, the range operator stays true until the
416right operand is true, I<AFTER> which the range operator becomes false
417again. It doesn't become false till the next time the range operator is
418evaluated. It can test the right operand and become false on the same
419evaluation it became true (as in B<awk>), but it still returns true once.
420If you don't want it to test the right operand till the next
421evaluation, as in B<sed>, just use three dots ("...") instead of
422two. In all other regards, "..." behaves just like ".." does.
423
424The right operand is not evaluated while the operator is in the
425"false" state, and the left operand is not evaluated while the
426operator is in the "true" state. The precedence is a little lower
427than || and &&. The value returned is either the empty string for
428false, or a sequence number (beginning with 1) for true. The
429sequence number is reset for each range encountered. The final
430sequence number in a range has the string "E0" appended to it, which
431doesn't affect its numeric value, but gives you something to search
432for if you want to exclude the endpoint. You can exclude the
433beginning point by waiting for the sequence number to be greater
434than 1. If either operand of scalar ".." is a constant expression,
435that operand is implicitly compared to the C<$.> variable, the
436current line number. Examples:
437
438As a scalar operator:
439
440 if (101 .. 200) { print; } # print 2nd hundred lines
441 next line if (1 .. /^$/); # skip header lines
442 s/^/> / if (/^$/ .. eof()); # quote body
443
444 # parse mail messages
445 while (<>) {
446 $in_header = 1 .. /^$/;
447 $in_body = /^$/ .. eof();
448 # do something based on those
449 } continue {
450 close ARGV if eof; # reset $. each file
451 }
452
453As a list operator:
454
455 for (101 .. 200) { print; } # print $_ 100 times
456 @foo = @foo[0 .. $#foo]; # an expensive no-op
457 @foo = @foo[$#foo-4 .. $#foo]; # slice last 5 items
458
459The range operator (in list context) makes use of the magical
460auto-increment algorithm if the operands are strings. You
461can say
462
463 @alphabet = ('A' .. 'Z');
464
465to get all normal letters of the alphabet, or
466
467 $hexdigit = (0 .. 9, 'a' .. 'f')[$num & 15];
468
469to get a hexadecimal digit, or
470
471 @z2 = ('01' .. '31'); print $z2[$mday];
472
473to get dates with leading zeros. If the final value specified is not
474in the sequence that the magical increment would produce, the sequence
475goes until the next value would be longer than the final value
476specified.
477
478=head2 Conditional Operator
479
480Ternary "?:" is the conditional operator, just as in C. It works much
481like an if-then-else. If the argument before the ? is true, the
482argument before the : is returned, otherwise the argument after the :
483is returned. For example:
484
485 printf "I have %d dog%s.\n", $n,
486 ($n == 1) ? '' : "s";
487
488Scalar or list context propagates downward into the 2nd
489or 3rd argument, whichever is selected.
490
491 $a = $ok ? $b : $c; # get a scalar
492 @a = $ok ? @b : @c; # get an array
493 $a = $ok ? @b : @c; # oops, that's just a count!
494
495The operator may be assigned to if both the 2nd and 3rd arguments are
496legal lvalues (meaning that you can assign to them):
497
498 ($a_or_b ? $a : $b) = $c;
499
500Because this operator produces an assignable result, using assignments
501without parentheses will get you in trouble. For example, this:
502
503 $a % 2 ? $a += 10 : $a += 2
504
505Really means this:
506
507 (($a % 2) ? ($a += 10) : $a) += 2
508
509Rather than this:
510
511 ($a % 2) ? ($a += 10) : ($a += 2)
512
513That should probably be written more simply as:
514
515 $a += ($a % 2) ? 10 : 2;
516
517=head2 Assignment Operators
518
519"=" is the ordinary assignment operator.
520
521Assignment operators work as in C. That is,
522
523 $a += 2;
524
525is equivalent to
526
527 $a = $a + 2;
528
529although without duplicating any side effects that dereferencing the lvalue
530might trigger, such as from tie(). Other assignment operators work similarly.
531The following are recognized:
532
533 **= += *= &= <<= &&=
534 -= /= |= >>= ||=
535 .= %= ^=
536 x=
537
538Although these are grouped by family, they all have the precedence
539of assignment.
540
541Unlike in C, the scalar assignment operator produces a valid lvalue.
542Modifying an assignment is equivalent to doing the assignment and
543then modifying the variable that was assigned to. This is useful
544for modifying a copy of something, like this:
545
546 ($tmp = $global) =~ tr [A-Z] [a-z];
547
548Likewise,
549
550 ($a += 2) *= 3;
551
552is equivalent to
553
554 $a += 2;
555 $a *= 3;
556
557Similarly, a list assignment in list context produces the list of
558lvalues assigned to, and a list assignment in scalar context returns
559the number of elements produced by the expression on the right hand
560side of the assignment.
561
562=head2 Comma Operator
563
564Binary "," is the comma operator. In scalar context it evaluates
565its left argument, throws that value away, then evaluates its right
566argument and returns that value. This is just like C's comma operator.
567
568In list context, it's just the list argument separator, and inserts
569both its arguments into the list.
570
571The => digraph is mostly just a synonym for the comma operator. It's useful for
572documenting arguments that come in pairs. As of release 5.001, it also forces
573any word to the left of it to be interpreted as a string.
574
575=head2 List Operators (Rightward)
576
577On the right side of a list operator, it has very low precedence,
578such that it controls all comma-separated expressions found there.
579The only operators with lower precedence are the logical operators
580"and", "or", and "not", which may be used to evaluate calls to list
581operators without the need for extra parentheses:
582
583 open HANDLE, "filename"
584 or die "Can't open: $!\n";
585
586See also discussion of list operators in L<Terms and List Operators (Leftward)>.
587
588=head2 Logical Not
589
590Unary "not" returns the logical negation of the expression to its right.
591It's the equivalent of "!" except for the very low precedence.
592
593=head2 Logical And
594
595Binary "and" returns the logical conjunction of the two surrounding
596expressions. It's equivalent to && except for the very low
597precedence. This means that it short-circuits: i.e., the right
598expression is evaluated only if the left expression is true.
599
600=head2 Logical or and Exclusive Or
601
602Binary "or" returns the logical disjunction of the two surrounding
603expressions. It's equivalent to || except for the very low precedence.
604This makes it useful for control flow
605
606 print FH $data or die "Can't write to FH: $!";
607
608This means that it short-circuits: i.e., the right expression is evaluated
609only if the left expression is false. Due to its precedence, you should
610probably avoid using this for assignment, only for control flow.
611
612 $a = $b or $c; # bug: this is wrong
613 ($a = $b) or $c; # really means this
614 $a = $b || $c; # better written this way
615
616However, when it's a list-context assignment and you're trying to use
617"||" for control flow, you probably need "or" so that the assignment
618takes higher precedence.
619
620 @info = stat($file) || die; # oops, scalar sense of stat!
621 @info = stat($file) or die; # better, now @info gets its due
622
623Then again, you could always use parentheses.
624
625Binary "xor" returns the exclusive-OR of the two surrounding expressions.
626It cannot short circuit, of course.
627
628=head2 C Operators Missing From Perl
629
630Here is what C has that Perl doesn't:
631
632=over 8
633
634=item unary &
635
636Address-of operator. (But see the "\" operator for taking a reference.)
637
638=item unary *
639
640Dereference-address operator. (Perl's prefix dereferencing
641operators are typed: $, @, %, and &.)
642
643=item (TYPE)
644
645Type-casting operator.
646
647=back
648
649=head2 Quote and Quote-like Operators
650
651While we usually think of quotes as literal values, in Perl they
652function as operators, providing various kinds of interpolating and
653pattern matching capabilities. Perl provides customary quote characters
654for these behaviors, but also provides a way for you to choose your
655quote character for any of them. In the following table, a C<{}> represents
656any pair of delimiters you choose.
657
658 Customary Generic Meaning Interpolates
659 '' q{} Literal no
660 "" qq{} Literal yes
661 `` qx{} Command yes*
662 qw{} Word list no
663 // m{} Pattern match yes*
664 qr{} Pattern yes*
665 s{}{} Substitution yes*
666 tr{}{} Transliteration no (but see below)
667 <<EOF here-doc yes*
668
669 * unless the delimiter is ''.
670
671Non-bracketing delimiters use the same character fore and aft, but the four
672sorts of brackets (round, angle, square, curly) will all nest, which means
673that
674
675 q{foo{bar}baz}
676
677is the same as
678
679 'foo{bar}baz'
680
681Note, however, that this does not always work for quoting Perl code:
682
683 $s = q{ if($a eq "}") ... }; # WRONG
684
685is a syntax error. The C<Text::Balanced> module (from CPAN, and
686starting from Perl 5.8 part of the standard distribution) is able
687to do this properly.
688
689There can be whitespace between the operator and the quoting
690characters, except when C<#> is being used as the quoting character.
691C<q#foo#> is parsed as the string C<foo>, while C<q #foo#> is the
692operator C<q> followed by a comment. Its argument will be taken
693from the next line. This allows you to write:
694
695 s {foo} # Replace foo
696 {bar} # with bar.
697
698The following escape sequences are available in constructs that interpolate
699and in transliterations.
700
701 \t tab (HT, TAB)
702 \n newline (NL)
703 \r return (CR)
704 \f form feed (FF)
705 \b backspace (BS)
706 \a alarm (bell) (BEL)
707 \e escape (ESC)
708 \033 octal char (ESC)
709 \x1b hex char (ESC)
710 \x{263a} wide hex char (SMILEY)
711 \c[ control char (ESC)
712 \N{name} named char
713
714The following escape sequences are available in constructs that interpolate
715but not in transliterations.
716
717 \l lowercase next char
718 \u uppercase next char
719 \L lowercase till \E
720 \U uppercase till \E
721 \E end case modification
722 \Q quote non-word characters till \E
723
724If C<use locale> is in effect, the case map used by C<\l>, C<\L>, C<\u>
725and C<\U> is taken from the current locale. See L<perllocale>. For
726documentation of C<\N{name}>, see L<charnames>.
727
728All systems use the virtual C<"\n"> to represent a line terminator,
729called a "newline". There is no such thing as an unvarying, physical
730newline character. It is only an illusion that the operating system,
731device drivers, C libraries, and Perl all conspire to preserve. Not all
732systems read C<"\r"> as ASCII CR and C<"\n"> as ASCII LF. For example,
733on a Mac, these are reversed, and on systems without line terminator,
734printing C<"\n"> may emit no actual data. In general, use C<"\n"> when
735you mean a "newline" for your system, but use the literal ASCII when you
736need an exact character. For example, most networking protocols expect
737and prefer a CR+LF (C<"\015\012"> or C<"\cM\cJ">) for line terminators,
738and although they often accept just C<"\012">, they seldom tolerate just
739C<"\015">. If you get in the habit of using C<"\n"> for networking,
740you may be burned some day.
741
742For constructs that do interpolate, variables beginning with "C<$>"
743or "C<@>" are interpolated. Subscripted variables such as C<$a[3]> or
744C<$href->{key}[0]> are also interpolated, as are array and hash slices.
745But method calls such as C<$obj->meth> are not.
746
747Interpolating an array or slice interpolates the elements in order,
748separated by the value of C<$">, so is equivalent to interpolating
749C<join $", @array>. "Punctuation" arrays such as C<@+> are only
750interpolated if the name is enclosed in braces C<@{+}>.
751
752You cannot include a literal C<$> or C<@> within a C<\Q> sequence.
753An unescaped C<$> or C<@> interpolates the corresponding variable,
754while escaping will cause the literal string C<\$> to be inserted.
755You'll need to write something like C<m/\Quser\E\@\Qhost/>.
756
757Patterns are subject to an additional level of interpretation as a
758regular expression. This is done as a second pass, after variables are
759interpolated, so that regular expressions may be incorporated into the
760pattern from the variables. If this is not what you want, use C<\Q> to
761interpolate a variable literally.
762
763Apart from the behavior described above, Perl does not expand
764multiple levels of interpolation. In particular, contrary to the
765expectations of shell programmers, back-quotes do I<NOT> interpolate
766within double quotes, nor do single quotes impede evaluation of
767variables when used within double quotes.
768
769=head2 Regexp Quote-Like Operators
770
771Here are the quote-like operators that apply to pattern
772matching and related activities.
773
774=over 8
775
776=item ?PATTERN?
777
778This is just like the C</pattern/> search, except that it matches only
779once between calls to the reset() operator. This is a useful
780optimization when you want to see only the first occurrence of
781something in each file of a set of files, for instance. Only C<??>
782patterns local to the current package are reset.
783
784 while (<>) {
785 if (?^$?) {
786 # blank line between header and body
787 }
788 } continue {
789 reset if eof; # clear ?? status for next file
790 }
791
792This usage is vaguely deprecated, which means it just might possibly
793be removed in some distant future version of Perl, perhaps somewhere
794around the year 2168.
795
796=item m/PATTERN/cgimosx
797
798=item /PATTERN/cgimosx
799
800Searches a string for a pattern match, and in scalar context returns
801true if it succeeds, false if it fails. If no string is specified
802via the C<=~> or C<!~> operator, the $_ string is searched. (The
803string specified with C<=~> need not be an lvalue--it may be the
804result of an expression evaluation, but remember the C<=~> binds
805rather tightly.) See also L<perlre>. See L<perllocale> for
806discussion of additional considerations that apply when C<use locale>
807is in effect.
808
809Options are:
810
811 c Do not reset search position on a failed match when /g is in effect.
812 g Match globally, i.e., find all occurrences.
813 i Do case-insensitive pattern matching.
814 m Treat string as multiple lines.
815 o Compile pattern only once.
816 s Treat string as single line.
817 x Use extended regular expressions.
818
819If "/" is the delimiter then the initial C<m> is optional. With the C<m>
820you can use any pair of non-alphanumeric, non-whitespace characters
821as delimiters. This is particularly useful for matching path names
822that contain "/", to avoid LTS (leaning toothpick syndrome). If "?" is
823the delimiter, then the match-only-once rule of C<?PATTERN?> applies.
824If "'" is the delimiter, no interpolation is performed on the PATTERN.
825
826PATTERN may contain variables, which will be interpolated (and the
827pattern recompiled) every time the pattern search is evaluated, except
828for when the delimiter is a single quote. (Note that C<$(>, C<$)>, and
829C<$|> are not interpolated because they look like end-of-string tests.)
830If you want such a pattern to be compiled only once, add a C</o> after
831the trailing delimiter. This avoids expensive run-time recompilations,
832and is useful when the value you are interpolating won't change over
833the life of the script. However, mentioning C</o> constitutes a promise
834that you won't change the variables in the pattern. If you change them,
835Perl won't even notice. See also L<"qr/STRING/imosx">.
836
837If the PATTERN evaluates to the empty string, the last
838I<successfully> matched regular expression is used instead.
839
840If the C</g> option is not used, C<m//> in list context returns a
841list consisting of the subexpressions matched by the parentheses in the
842pattern, i.e., (C<$1>, C<$2>, C<$3>...). (Note that here C<$1> etc. are
843also set, and that this differs from Perl 4's behavior.) When there are
844no parentheses in the pattern, the return value is the list C<(1)> for
845success. With or without parentheses, an empty list is returned upon
846failure.
847
848Examples:
849
850 open(TTY, '/dev/tty');
851 <TTY> =~ /^y/i && foo(); # do foo if desired
852
853 if (/Version: *([0-9.]*)/) { $version = $1; }
854
855 next if m#^/usr/spool/uucp#;
856
857 # poor man's grep
858 $arg = shift;
859 while (<>) {
860 print if /$arg/o; # compile only once
861 }
862
863 if (($F1, $F2, $Etc) = ($foo =~ /^(\S+)\s+(\S+)\s*(.*)/))
864
865This last example splits $foo into the first two words and the
866remainder of the line, and assigns those three fields to $F1, $F2, and
867$Etc. The conditional is true if any variables were assigned, i.e., if
868the pattern matched.
869
870The C</g> modifier specifies global pattern matching--that is,
871matching as many times as possible within the string. How it behaves
872depends on the context. In list context, it returns a list of the
873substrings matched by any capturing parentheses in the regular
874expression. If there are no parentheses, it returns a list of all
875the matched strings, as if there were parentheses around the whole
876pattern.
877
878In scalar context, each execution of C<m//g> finds the next match,
879returning true if it matches, and false if there is no further match.
880The position after the last match can be read or set using the pos()
881function; see L<perlfunc/pos>. A failed match normally resets the
882search position to the beginning of the string, but you can avoid that
883by adding the C</c> modifier (e.g. C<m//gc>). Modifying the target
884string also resets the search position.
885
886You can intermix C<m//g> matches with C<m/\G.../g>, where C<\G> is a
887zero-width assertion that matches the exact position where the previous
888C<m//g>, if any, left off. Without the C</g> modifier, the C<\G> assertion
889still anchors at pos(), but the match is of course only attempted once.
890Using C<\G> without C</g> on a target string that has not previously had a
891C</g> match applied to it is the same as using the C<\A> assertion to match
892the beginning of the string.
893
894Examples:
895
896 # list context
897 ($one,$five,$fifteen) = (`uptime` =~ /(\d+\.\d+)/g);
898
899 # scalar context
900 $/ = "";
901 while (defined($paragraph = <>)) {
902 while ($paragraph =~ /[a-z]['")]*[.!?]+['")]*\s/g) {
903 $sentences++;
904 }
905 }
906 print "$sentences\n";
907
908 # using m//gc with \G
909 $_ = "ppooqppqq";
910 while ($i++ < 2) {
911 print "1: '";
912 print $1 while /(o)/gc; print "', pos=", pos, "\n";
913 print "2: '";
914 print $1 if /\G(q)/gc; print "', pos=", pos, "\n";
915 print "3: '";
916 print $1 while /(p)/gc; print "', pos=", pos, "\n";
917 }
918 print "Final: '$1', pos=",pos,"\n" if /\G(.)/;
919
920The last example should print:
921
922 1: 'oo', pos=4
923 2: 'q', pos=5
924 3: 'pp', pos=7
925 1: '', pos=7
926 2: 'q', pos=8
927 3: '', pos=8
928 Final: 'q', pos=8
929
930Notice that the final match matched C<q> instead of C<p>, which a match
931without the C<\G> anchor would have done. Also note that the final match
932did not update C<pos> -- C<pos> is only updated on a C</g> match. If the
933final match did indeed match C<p>, it's a good bet that you're running an
934older (pre-5.6.0) Perl.
935
936A useful idiom for C<lex>-like scanners is C</\G.../gc>. You can
937combine several regexps like this to process a string part-by-part,
938doing different actions depending on which regexp matched. Each
939regexp tries to match where the previous one leaves off.
940
941 $_ = <<'EOL';
942 $url = new URI::URL "http://www/"; die if $url eq "xXx";
943 EOL
944 LOOP:
945 {
946 print(" digits"), redo LOOP if /\G\d+\b[,.;]?\s*/gc;
947 print(" lowercase"), redo LOOP if /\G[a-z]+\b[,.;]?\s*/gc;
948 print(" UPPERCASE"), redo LOOP if /\G[A-Z]+\b[,.;]?\s*/gc;
949 print(" Capitalized"), redo LOOP if /\G[A-Z][a-z]+\b[,.;]?\s*/gc;
950 print(" MiXeD"), redo LOOP if /\G[A-Za-z]+\b[,.;]?\s*/gc;
951 print(" alphanumeric"), redo LOOP if /\G[A-Za-z0-9]+\b[,.;]?\s*/gc;
952 print(" line-noise"), redo LOOP if /\G[^A-Za-z0-9]+/gc;
953 print ". That's all!\n";
954 }
955
956Here is the output (split into several lines):
957
958 line-noise lowercase line-noise lowercase UPPERCASE line-noise
959 UPPERCASE line-noise lowercase line-noise lowercase line-noise
960 lowercase lowercase line-noise lowercase lowercase line-noise
961 MiXeD line-noise. That's all!
962
963=item q/STRING/
964
965=item C<'STRING'>
966
967A single-quoted, literal string. A backslash represents a backslash
968unless followed by the delimiter or another backslash, in which case
969the delimiter or backslash is interpolated.
970
971 $foo = q!I said, "You said, 'She said it.'"!;
972 $bar = q('This is it.');
973 $baz = '\n'; # a two-character string
974
975=item qq/STRING/
976
977=item "STRING"
978
979A double-quoted, interpolated string.
980
981 $_ .= qq
982 (*** The previous line contains the naughty word "$1".\n)
983 if /\b(tcl|java|python)\b/i; # :-)
984 $baz = "\n"; # a one-character string
985
986=item qr/STRING/imosx
987
988This operator quotes (and possibly compiles) its I<STRING> as a regular
989expression. I<STRING> is interpolated the same way as I<PATTERN>
990in C<m/PATTERN/>. If "'" is used as the delimiter, no interpolation
991is done. Returns a Perl value which may be used instead of the
992corresponding C</STRING/imosx> expression.
993
994For example,
995
996 $rex = qr/my.STRING/is;
997 s/$rex/foo/;
998
999is equivalent to
1000
1001 s/my.STRING/foo/is;
1002
1003The result may be used as a subpattern in a match:
1004
1005 $re = qr/$pattern/;
1006 $string =~ /foo${re}bar/; # can be interpolated in other patterns
1007 $string =~ $re; # or used standalone
1008 $string =~ /$re/; # or this way
1009
1010Since Perl may compile the pattern at the moment of execution of qr()
1011operator, using qr() may have speed advantages in some situations,
1012notably if the result of qr() is used standalone:
1013
1014 sub match {
1015 my $patterns = shift;
1016 my @compiled = map qr/$_/i, @$patterns;
1017 grep {
1018 my $success = 0;
1019 foreach my $pat (@compiled) {
1020 $success = 1, last if /$pat/;
1021 }
1022 $success;
1023 } @_;
1024 }
1025
1026Precompilation of the pattern into an internal representation at
1027the moment of qr() avoids a need to recompile the pattern every
1028time a match C</$pat/> is attempted. (Perl has many other internal
1029optimizations, but none would be triggered in the above example if
1030we did not use qr() operator.)
1031
1032Options are:
1033
1034 i Do case-insensitive pattern matching.
1035 m Treat string as multiple lines.
1036 o Compile pattern only once.
1037 s Treat string as single line.
1038 x Use extended regular expressions.
1039
1040See L<perlre> for additional information on valid syntax for STRING, and
1041for a detailed look at the semantics of regular expressions.
1042
1043=item qx/STRING/
1044
1045=item `STRING`
1046
1047A string which is (possibly) interpolated and then executed as a
1048system command with C</bin/sh> or its equivalent. Shell wildcards,
1049pipes, and redirections will be honored. The collected standard
1050output of the command is returned; standard error is unaffected. In
1051scalar context, it comes back as a single (potentially multi-line)
1052string, or undef if the command failed. In list context, returns a
1053list of lines (however you've defined lines with $/ or
1054$INPUT_RECORD_SEPARATOR), or an empty list if the command failed.
1055
1056Because backticks do not affect standard error, use shell file descriptor
1057syntax (assuming the shell supports this) if you care to address this.
1058To capture a command's STDERR and STDOUT together:
1059
1060 $output = `cmd 2>&1`;
1061
1062To capture a command's STDOUT but discard its STDERR:
1063
1064 $output = `cmd 2>/dev/null`;
1065
1066To capture a command's STDERR but discard its STDOUT (ordering is
1067important here):
1068
1069 $output = `cmd 2>&1 1>/dev/null`;
1070
1071To exchange a command's STDOUT and STDERR in order to capture the STDERR
1072but leave its STDOUT to come out the old STDERR:
1073
1074 $output = `cmd 3>&1 1>&2 2>&3 3>&-`;
1075
1076To read both a command's STDOUT and its STDERR separately, it's easiest
1077and safest to redirect them separately to files, and then read from those
1078files when the program is done:
1079
1080 system("program args 1>/tmp/program.stdout 2>/tmp/program.stderr");
1081
1082Using single-quote as a delimiter protects the command from Perl's
1083double-quote interpolation, passing it on to the shell instead:
1084
1085 $perl_info = qx(ps $$); # that's Perl's $$
1086 $shell_info = qx'ps $$'; # that's the new shell's $$
1087
1088How that string gets evaluated is entirely subject to the command
1089interpreter on your system. On most platforms, you will have to protect
1090shell metacharacters if you want them treated literally. This is in
1091practice difficult to do, as it's unclear how to escape which characters.
1092See L<perlsec> for a clean and safe example of a manual fork() and exec()
1093to emulate backticks safely.
1094
1095On some platforms (notably DOS-like ones), the shell may not be
1096capable of dealing with multiline commands, so putting newlines in
1097the string may not get you what you want. You may be able to evaluate
1098multiple commands in a single line by separating them with the command
1099separator character, if your shell supports that (e.g. C<;> on many Unix
1100shells; C<&> on the Windows NT C<cmd> shell).
1101
1102Beginning with v5.6.0, Perl will attempt to flush all files opened for
1103output before starting the child process, but this may not be supported
1104on some platforms (see L<perlport>). To be safe, you may need to set
1105C<$|> ($AUTOFLUSH in English) or call the C<autoflush()> method of
1106C<IO::Handle> on any open handles.
1107
1108Beware that some command shells may place restrictions on the length
1109of the command line. You must ensure your strings don't exceed this
1110limit after any necessary interpolations. See the platform-specific
1111release notes for more details about your particular environment.
1112
1113Using this operator can lead to programs that are difficult to port,
1114because the shell commands called vary between systems, and may in
1115fact not be present at all. As one example, the C<type> command under
1116the POSIX shell is very different from the C<type> command under DOS.
1117That doesn't mean you should go out of your way to avoid backticks
1118when they're the right way to get something done. Perl was made to be
1119a glue language, and one of the things it glues together is commands.
1120Just understand what you're getting yourself into.
1121
1122See L<"I/O Operators"> for more discussion.
1123
1124=item qw/STRING/
1125
1126Evaluates to a list of the words extracted out of STRING, using embedded
1127whitespace as the word delimiters. It can be understood as being roughly
1128equivalent to:
1129
1130 split(' ', q/STRING/);
1131
1132the difference being that it generates a real list at compile time. So
1133this expression:
1134
1135 qw(foo bar baz)
1136
1137is semantically equivalent to the list:
1138
1139 'foo', 'bar', 'baz'
1140
1141Some frequently seen examples:
1142
1143 use POSIX qw( setlocale localeconv )
1144 @EXPORT = qw( foo bar baz );
1145
1146A common mistake is to try to separate the words with comma or to
1147put comments into a multi-line C<qw>-string. For this reason, the
1148C<use warnings> pragma and the B<-w> switch (that is, the C<$^W> variable)
1149produces warnings if the STRING contains the "," or the "#" character.
1150
1151=item s/PATTERN/REPLACEMENT/egimosx
1152
1153Searches a string for a pattern, and if found, replaces that pattern
1154with the replacement text and returns the number of substitutions
1155made. Otherwise it returns false (specifically, the empty string).
1156
1157If no string is specified via the C<=~> or C<!~> operator, the C<$_>
1158variable is searched and modified. (The string specified with C<=~> must
1159be scalar variable, an array element, a hash element, or an assignment
1160to one of those, i.e., an lvalue.)
1161
1162If the delimiter chosen is a single quote, no interpolation is
1163done on either the PATTERN or the REPLACEMENT. Otherwise, if the
1164PATTERN contains a $ that looks like a variable rather than an
1165end-of-string test, the variable will be interpolated into the pattern
1166at run-time. If you want the pattern compiled only once the first time
1167the variable is interpolated, use the C</o> option. If the pattern
1168evaluates to the empty string, the last successfully executed regular
1169expression is used instead. See L<perlre> for further explanation on these.
1170See L<perllocale> for discussion of additional considerations that apply
1171when C<use locale> is in effect.
1172
1173Options are:
1174
1175 e Evaluate the right side as an expression.
1176 g Replace globally, i.e., all occurrences.
1177 i Do case-insensitive pattern matching.
1178 m Treat string as multiple lines.
1179 o Compile pattern only once.
1180 s Treat string as single line.
1181 x Use extended regular expressions.
1182
1183Any non-alphanumeric, non-whitespace delimiter may replace the
1184slashes. If single quotes are used, no interpretation is done on the
1185replacement string (the C</e> modifier overrides this, however). Unlike
1186Perl 4, Perl 5 treats backticks as normal delimiters; the replacement
1187text is not evaluated as a command. If the
1188PATTERN is delimited by bracketing quotes, the REPLACEMENT has its own
1189pair of quotes, which may or may not be bracketing quotes, e.g.,
1190C<s(foo)(bar)> or C<< s<foo>/bar/ >>. A C</e> will cause the
1191replacement portion to be treated as a full-fledged Perl expression
1192and evaluated right then and there. It is, however, syntax checked at
1193compile-time. A second C<e> modifier will cause the replacement portion
1194to be C<eval>ed before being run as a Perl expression.
1195
1196Examples:
1197
1198 s/\bgreen\b/mauve/g; # don't change wintergreen
1199
1200 $path =~ s|/usr/bin|/usr/local/bin|;
1201
1202 s/Login: $foo/Login: $bar/; # run-time pattern
1203
1204 ($foo = $bar) =~ s/this/that/; # copy first, then change
1205
1206 $count = ($paragraph =~ s/Mister\b/Mr./g); # get change-count
1207
1208 $_ = 'abc123xyz';
1209 s/\d+/$&*2/e; # yields 'abc246xyz'
1210 s/\d+/sprintf("%5d",$&)/e; # yields 'abc 246xyz'
1211 s/\w/$& x 2/eg; # yields 'aabbcc 224466xxyyzz'
1212
1213 s/%(.)/$percent{$1}/g; # change percent escapes; no /e
1214 s/%(.)/$percent{$1} || $&/ge; # expr now, so /e
1215 s/^=(\w+)/&pod($1)/ge; # use function call
1216
1217 # expand variables in $_, but dynamics only, using
1218 # symbolic dereferencing
1219 s/\$(\w+)/${$1}/g;
1220
1221 # Add one to the value of any numbers in the string
1222 s/(\d+)/1 + $1/eg;
1223
1224 # This will expand any embedded scalar variable
1225 # (including lexicals) in $_ : First $1 is interpolated
1226 # to the variable name, and then evaluated
1227 s/(\$\w+)/$1/eeg;
1228
1229 # Delete (most) C comments.
1230 $program =~ s {
1231 /\* # Match the opening delimiter.
1232 .*? # Match a minimal number of characters.
1233 \*/ # Match the closing delimiter.
1234 } []gsx;
1235
1236 s/^\s*(.*?)\s*$/$1/; # trim white space in $_, expensively
1237
1238 for ($variable) { # trim white space in $variable, cheap
1239 s/^\s+//;
1240 s/\s+$//;
1241 }
1242
1243 s/([^ ]*) *([^ ]*)/$2 $1/; # reverse 1st two fields
1244
1245Note the use of $ instead of \ in the last example. Unlike
1246B<sed>, we use the \<I<digit>> form in only the left hand side.
1247Anywhere else it's $<I<digit>>.
1248
1249Occasionally, you can't use just a C</g> to get all the changes
1250to occur that you might want. Here are two common cases:
1251
1252 # put commas in the right places in an integer
1253 1 while s/(\d)(\d\d\d)(?!\d)/$1,$2/g;
1254
1255 # expand tabs to 8-column spacing
1256 1 while s/\t+/' ' x (length($&)*8 - length($`)%8)/e;
1257
1258=item tr/SEARCHLIST/REPLACEMENTLIST/cds
1259
1260=item y/SEARCHLIST/REPLACEMENTLIST/cds
1261
1262Transliterates all occurrences of the characters found in the search list
1263with the corresponding character in the replacement list. It returns
1264the number of characters replaced or deleted. If no string is
1265specified via the =~ or !~ operator, the $_ string is transliterated. (The
1266string specified with =~ must be a scalar variable, an array element, a
1267hash element, or an assignment to one of those, i.e., an lvalue.)
1268
1269A character range may be specified with a hyphen, so C<tr/A-J/0-9/>
1270does the same replacement as C<tr/ACEGIBDFHJ/0246813579/>.
1271For B<sed> devotees, C<y> is provided as a synonym for C<tr>. If the
1272SEARCHLIST is delimited by bracketing quotes, the REPLACEMENTLIST has
1273its own pair of quotes, which may or may not be bracketing quotes,
1274e.g., C<tr[A-Z][a-z]> or C<tr(+\-*/)/ABCD/>.
1275
1276Note that C<tr> does B<not> do regular expression character classes
1277such as C<\d> or C<[:lower:]>. The <tr> operator is not equivalent to
1278the tr(1) utility. If you want to map strings between lower/upper
1279cases, see L<perlfunc/lc> and L<perlfunc/uc>, and in general consider
1280using the C<s> operator if you need regular expressions.
1281
1282Note also that the whole range idea is rather unportable between
1283character sets--and even within character sets they may cause results
1284you probably didn't expect. A sound principle is to use only ranges
1285that begin from and end at either alphabets of equal case (a-e, A-E),
1286or digits (0-4). Anything else is unsafe. If in doubt, spell out the
1287character sets in full.
1288
1289Options:
1290
1291 c Complement the SEARCHLIST.
1292 d Delete found but unreplaced characters.
1293 s Squash duplicate replaced characters.
1294
1295If the C</c> modifier is specified, the SEARCHLIST character set
1296is complemented. If the C</d> modifier is specified, any characters
1297specified by SEARCHLIST not found in REPLACEMENTLIST are deleted.
1298(Note that this is slightly more flexible than the behavior of some
1299B<tr> programs, which delete anything they find in the SEARCHLIST,
1300period.) If the C</s> modifier is specified, sequences of characters
1301that were transliterated to the same character are squashed down
1302to a single instance of the character.
1303
1304If the C</d> modifier is used, the REPLACEMENTLIST is always interpreted
1305exactly as specified. Otherwise, if the REPLACEMENTLIST is shorter
1306than the SEARCHLIST, the final character is replicated till it is long
1307enough. If the REPLACEMENTLIST is empty, the SEARCHLIST is replicated.
1308This latter is useful for counting characters in a class or for
1309squashing character sequences in a class.
1310
1311Examples:
1312
1313 $ARGV[1] =~ tr/A-Z/a-z/; # canonicalize to lower case
1314
1315 $cnt = tr/*/*/; # count the stars in $_
1316
1317 $cnt = $sky =~ tr/*/*/; # count the stars in $sky
1318
1319 $cnt = tr/0-9//; # count the digits in $_
1320
1321 tr/a-zA-Z//s; # bookkeeper -> bokeper
1322
1323 ($HOST = $host) =~ tr/a-z/A-Z/;
1324
1325 tr/a-zA-Z/ /cs; # change non-alphas to single space
1326
1327 tr [\200-\377]
1328 [\000-\177]; # delete 8th bit
1329
1330If multiple transliterations are given for a character, only the
1331first one is used:
1332
1333 tr/AAA/XYZ/
1334
1335will transliterate any A to X.
1336
1337Because the transliteration table is built at compile time, neither
1338the SEARCHLIST nor the REPLACEMENTLIST are subjected to double quote
1339interpolation. That means that if you want to use variables, you
1340must use an eval():
1341
1342 eval "tr/$oldlist/$newlist/";
1343 die $@ if $@;
1344
1345 eval "tr/$oldlist/$newlist/, 1" or die $@;
1346
1347=item <<EOF
1348
1349A line-oriented form of quoting is based on the shell "here-document"
1350syntax. Following a C<< << >> you specify a string to terminate
1351the quoted material, and all lines following the current line down to
1352the terminating string are the value of the item. The terminating
1353string may be either an identifier (a word), or some quoted text. If
1354quoted, the type of quotes you use determines the treatment of the
1355text, just as in regular quoting. An unquoted identifier works like
1356double quotes. There must be no space between the C<< << >> and
1357the identifier, unless the identifier is quoted. (If you put a space it
1358will be treated as a null identifier, which is valid, and matches the first
1359empty line.) The terminating string must appear by itself (unquoted and
1360with no surrounding whitespace) on the terminating line.
1361
1362 print <<EOF;
1363 The price is $Price.
1364 EOF
1365
1366 print << "EOF"; # same as above
1367 The price is $Price.
1368 EOF
1369
1370 print << `EOC`; # execute commands
1371 echo hi there
1372 echo lo there
1373 EOC
1374
1375 print <<"foo", <<"bar"; # you can stack them
1376 I said foo.
1377 foo
1378 I said bar.
1379 bar
1380
1381 myfunc(<< "THIS", 23, <<'THAT');
1382 Here's a line
1383 or two.
1384 THIS
1385 and here's another.
1386 THAT
1387
1388Just don't forget that you have to put a semicolon on the end
1389to finish the statement, as Perl doesn't know you're not going to
1390try to do this:
1391
1392 print <<ABC
1393 179231
1394 ABC
1395 + 20;
1396
1397If you want your here-docs to be indented with the
1398rest of the code, you'll need to remove leading whitespace
1399from each line manually:
1400
1401 ($quote = <<'FINIS') =~ s/^\s+//gm;
1402 The Road goes ever on and on,
1403 down from the door where it began.
1404 FINIS
1405
1406If you use a here-doc within a delimited construct, such as in C<s///eg>,
1407the quoted material must come on the lines following the final delimiter.
1408So instead of
1409
1410 s/this/<<E . 'that'
1411 the other
1412 E
1413 . 'more '/eg;
1414
1415you have to write
1416
1417 s/this/<<E . 'that'
1418 . 'more '/eg;
1419 the other
1420 E
1421
1422If the terminating identifier is on the last line of the program, you
1423must be sure there is a newline after it; otherwise, Perl will give the
1424warning B<Can't find string terminator "END" anywhere before EOF...>.
1425
1426Additionally, the quoting rules for the identifier are not related to
1427Perl's quoting rules -- C<q()>, C<qq()>, and the like are not supported
1428in place of C<''> and C<"">, and the only interpolation is for backslashing
1429the quoting character:
1430
1431 print << "abc\"def";
1432 testing...
1433 abc"def
1434
1435Finally, quoted strings cannot span multiple lines. The general rule is
1436that the identifier must be a string literal. Stick with that, and you
1437should be safe.
1438
1439=back
1440
1441=head2 Gory details of parsing quoted constructs
1442
1443When presented with something that might have several different
1444interpretations, Perl uses the B<DWIM> (that's "Do What I Mean")
1445principle to pick the most probable interpretation. This strategy
1446is so successful that Perl programmers often do not suspect the
1447ambivalence of what they write. But from time to time, Perl's
1448notions differ substantially from what the author honestly meant.
1449
1450This section hopes to clarify how Perl handles quoted constructs.
1451Although the most common reason to learn this is to unravel labyrinthine
1452regular expressions, because the initial steps of parsing are the
1453same for all quoting operators, they are all discussed together.
1454
1455The most important Perl parsing rule is the first one discussed
1456below: when processing a quoted construct, Perl first finds the end
1457of that construct, then interprets its contents. If you understand
1458this rule, you may skip the rest of this section on the first
1459reading. The other rules are likely to contradict the user's
1460expectations much less frequently than this first one.
1461
1462Some passes discussed below are performed concurrently, but because
1463their results are the same, we consider them individually. For different
1464quoting constructs, Perl performs different numbers of passes, from
1465one to five, but these passes are always performed in the same order.
1466
1467=over 4
1468
1469=item Finding the end
1470
1471The first pass is finding the end of the quoted construct, whether
1472it be a multicharacter delimiter C<"\nEOF\n"> in the C<<<EOF>
1473construct, a C</> that terminates a C<qq//> construct, a C<]> which
1474terminates C<qq[]> construct, or a C<< > >> which terminates a
1475fileglob started with C<< < >>.
1476
1477When searching for single-character non-pairing delimiters, such
1478as C</>, combinations of C<\\> and C<\/> are skipped. However,
1479when searching for single-character pairing delimiter like C<[>,
1480combinations of C<\\>, C<\]>, and C<\[> are all skipped, and nested
1481C<[>, C<]> are skipped as well. When searching for multicharacter
1482delimiters, nothing is skipped.
1483
1484For constructs with three-part delimiters (C<s///>, C<y///>, and
1485C<tr///>), the search is repeated once more.
1486
1487During this search no attention is paid to the semantics of the construct.
1488Thus:
1489
1490 "$hash{"$foo/$bar"}"
1491
1492or:
1493
1494 m/
1495 bar # NOT a comment, this slash / terminated m//!
1496 /x
1497
1498do not form legal quoted expressions. The quoted part ends on the
1499first C<"> and C</>, and the rest happens to be a syntax error.
1500Because the slash that terminated C<m//> was followed by a C<SPACE>,
1501the example above is not C<m//x>, but rather C<m//> with no C</x>
1502modifier. So the embedded C<#> is interpreted as a literal C<#>.
1503
1504=item Removal of backslashes before delimiters
1505
1506During the second pass, text between the starting and ending
1507delimiters is copied to a safe location, and the C<\> is removed
1508from combinations consisting of C<\> and delimiter--or delimiters,
1509meaning both starting and ending delimiters will should these differ.
1510This removal does not happen for multi-character delimiters.
1511Note that the combination C<\\> is left intact, just as it was.
1512
1513Starting from this step no information about the delimiters is
1514used in parsing.
1515
1516=item Interpolation
1517
1518The next step is interpolation in the text obtained, which is now
1519delimiter-independent. There are four different cases.
1520
1521=over 4
1522
1523=item C<<<'EOF'>, C<m''>, C<s'''>, C<tr///>, C<y///>
1524
1525No interpolation is performed.
1526
1527=item C<''>, C<q//>
1528
1529The only interpolation is removal of C<\> from pairs C<\\>.
1530
1531=item C<"">, C<``>, C<qq//>, C<qx//>, C<< <file*glob> >>
1532
1533C<\Q>, C<\U>, C<\u>, C<\L>, C<\l> (possibly paired with C<\E>) are
1534converted to corresponding Perl constructs. Thus, C<"$foo\Qbaz$bar">
1535is converted to C<$foo . (quotemeta("baz" . $bar))> internally.
1536The other combinations are replaced with appropriate expansions.
1537
1538Let it be stressed that I<whatever falls between C<\Q> and C<\E>>
1539is interpolated in the usual way. Something like C<"\Q\\E"> has
1540no C<\E> inside. instead, it has C<\Q>, C<\\>, and C<E>, so the
1541result is the same as for C<"\\\\E">. As a general rule, backslashes
1542between C<\Q> and C<\E> may lead to counterintuitive results. So,
1543C<"\Q\t\E"> is converted to C<quotemeta("\t")>, which is the same
1544as C<"\\\t"> (since TAB is not alphanumeric). Note also that:
1545
1546 $str = '\t';
1547 return "\Q$str";
1548
1549may be closer to the conjectural I<intention> of the writer of C<"\Q\t\E">.
1550
1551Interpolated scalars and arrays are converted internally to the C<join> and
1552C<.> catenation operations. Thus, C<"$foo XXX '@arr'"> becomes:
1553
1554 $foo . " XXX '" . (join $", @arr) . "'";
1555
1556All operations above are performed simultaneously, left to right.
1557
1558Because the result of C<"\Q STRING \E"> has all metacharacters
1559quoted, there is no way to insert a literal C<$> or C<@> inside a
1560C<\Q\E> pair. If protected by C<\>, C<$> will be quoted to became
1561C<"\\\$">; if not, it is interpreted as the start of an interpolated
1562scalar.
1563
1564Note also that the interpolation code needs to make a decision on
1565where the interpolated scalar ends. For instance, whether
1566C<< "a $b -> {c}" >> really means:
1567
1568 "a " . $b . " -> {c}";
1569
1570or:
1571
1572 "a " . $b -> {c};
1573
1574Most of the time, the longest possible text that does not include
1575spaces between components and which contains matching braces or
1576brackets. because the outcome may be determined by voting based
1577on heuristic estimators, the result is not strictly predictable.
1578Fortunately, it's usually correct for ambiguous cases.
1579
1580=item C<?RE?>, C</RE/>, C<m/RE/>, C<s/RE/foo/>,
1581
1582Processing of C<\Q>, C<\U>, C<\u>, C<\L>, C<\l>, and interpolation
1583happens (almost) as with C<qq//> constructs, but the substitution
1584of C<\> followed by RE-special chars (including C<\>) is not
1585performed. Moreover, inside C<(?{BLOCK})>, C<(?# comment )>, and
1586a C<#>-comment in a C<//x>-regular expression, no processing is
1587performed whatsoever. This is the first step at which the presence
1588of the C<//x> modifier is relevant.
1589
1590Interpolation has several quirks: C<$|>, C<$(>, and C<$)> are not
1591interpolated, and constructs C<$var[SOMETHING]> are voted (by several
1592different estimators) to be either an array element or C<$var>
1593followed by an RE alternative. This is where the notation
1594C<${arr[$bar]}> comes handy: C</${arr[0-9]}/> is interpreted as
1595array element C<-9>, not as a regular expression from the variable
1596C<$arr> followed by a digit, which would be the interpretation of
1597C</$arr[0-9]/>. Since voting among different estimators may occur,
1598the result is not predictable.
1599
1600It is at this step that C<\1> is begrudgingly converted to C<$1> in
1601the replacement text of C<s///> to correct the incorrigible
1602I<sed> hackers who haven't picked up the saner idiom yet. A warning
1603is emitted if the C<use warnings> pragma or the B<-w> command-line flag
1604(that is, the C<$^W> variable) was set.
1605
1606The lack of processing of C<\\> creates specific restrictions on
1607the post-processed text. If the delimiter is C</>, one cannot get
1608the combination C<\/> into the result of this step. C</> will
1609finish the regular expression, C<\/> will be stripped to C</> on
1610the previous step, and C<\\/> will be left as is. Because C</> is
1611equivalent to C<\/> inside a regular expression, this does not
1612matter unless the delimiter happens to be character special to the
1613RE engine, such as in C<s*foo*bar*>, C<m[foo]>, or C<?foo?>; or an
1614alphanumeric char, as in:
1615
1616 m m ^ a \s* b mmx;
1617
1618In the RE above, which is intentionally obfuscated for illustration, the
1619delimiter is C<m>, the modifier is C<mx>, and after backslash-removal the
1620RE is the same as for C<m/ ^ a s* b /mx>). There's more than one
1621reason you're encouraged to restrict your delimiters to non-alphanumeric,
1622non-whitespace choices.
1623
1624=back
1625
1626This step is the last one for all constructs except regular expressions,
1627which are processed further.
1628
1629=item Interpolation of regular expressions
1630
1631Previous steps were performed during the compilation of Perl code,
1632but this one happens at run time--although it may be optimized to
1633be calculated at compile time if appropriate. After preprocessing
1634described above, and possibly after evaluation if catenation,
1635joining, casing translation, or metaquoting are involved, the
1636resulting I<string> is passed to the RE engine for compilation.
1637
1638Whatever happens in the RE engine might be better discussed in L<perlre>,
1639but for the sake of continuity, we shall do so here.
1640
1641This is another step where the presence of the C<//x> modifier is
1642relevant. The RE engine scans the string from left to right and
1643converts it to a finite automaton.
1644
1645Backslashed characters are either replaced with corresponding
1646literal strings (as with C<\{>), or else they generate special nodes
1647in the finite automaton (as with C<\b>). Characters special to the
1648RE engine (such as C<|>) generate corresponding nodes or groups of
1649nodes. C<(?#...)> comments are ignored. All the rest is either
1650converted to literal strings to match, or else is ignored (as is
1651whitespace and C<#>-style comments if C<//x> is present).
1652
1653Parsing of the bracketed character class construct, C<[...]>, is
1654rather different than the rule used for the rest of the pattern.
1655The terminator of this construct is found using the same rules as
1656for finding the terminator of a C<{}>-delimited construct, the only
1657exception being that C<]> immediately following C<[> is treated as
1658though preceded by a backslash. Similarly, the terminator of
1659C<(?{...})> is found using the same rules as for finding the
1660terminator of a C<{}>-delimited construct.
1661
1662It is possible to inspect both the string given to RE engine and the
1663resulting finite automaton. See the arguments C<debug>/C<debugcolor>
1664in the C<use L<re>> pragma, as well as Perl's B<-Dr> command-line
1665switch documented in L<perlrun/"Command Switches">.
1666
1667=item Optimization of regular expressions
1668
1669This step is listed for completeness only. Since it does not change
1670semantics, details of this step are not documented and are subject
1671to change without notice. This step is performed over the finite
1672automaton that was generated during the previous pass.
1673
1674It is at this stage that C<split()> silently optimizes C</^/> to
1675mean C</^/m>.
1676
1677=back
1678
1679=head2 I/O Operators
1680
1681There are several I/O operators you should know about.
1682
1683A string enclosed by backticks (grave accents) first undergoes
1684double-quote interpolation. It is then interpreted as an external
1685command, and the output of that command is the value of the
1686backtick string, like in a shell. In scalar context, a single string
1687consisting of all output is returned. In list context, a list of
1688values is returned, one per line of output. (You can set C<$/> to use
1689a different line terminator.) The command is executed each time the
1690pseudo-literal is evaluated. The status value of the command is
1691returned in C<$?> (see L<perlvar> for the interpretation of C<$?>).
1692Unlike in B<csh>, no translation is done on the return data--newlines
1693remain newlines. Unlike in any of the shells, single quotes do not
1694hide variable names in the command from interpretation. To pass a
1695literal dollar-sign through to the shell you need to hide it with a
1696backslash. The generalized form of backticks is C<qx//>. (Because
1697backticks always undergo shell expansion as well, see L<perlsec> for
1698security concerns.)
1699
1700In scalar context, evaluating a filehandle in angle brackets yields
1701the next line from that file (the newline, if any, included), or
1702C<undef> at end-of-file or on error. When C<$/> is set to C<undef>
1703(sometimes known as file-slurp mode) and the file is empty, it
1704returns C<''> the first time, followed by C<undef> subsequently.
1705
1706Ordinarily you must assign the returned value to a variable, but
1707there is one situation where an automatic assignment happens. If
1708and only if the input symbol is the only thing inside the conditional
1709of a C<while> statement (even if disguised as a C<for(;;)> loop),
1710the value is automatically assigned to the global variable $_,
1711destroying whatever was there previously. (This may seem like an
1712odd thing to you, but you'll use the construct in almost every Perl
1713script you write.) The $_ variable is not implicitly localized.
1714You'll have to put a C<local $_;> before the loop if you want that
1715to happen.
1716
1717The following lines are equivalent:
1718
1719 while (defined($_ = <STDIN>)) { print; }
1720 while ($_ = <STDIN>) { print; }
1721 while (<STDIN>) { print; }
1722 for (;<STDIN>;) { print; }
1723 print while defined($_ = <STDIN>);
1724 print while ($_ = <STDIN>);
1725 print while <STDIN>;
1726
1727This also behaves similarly, but avoids $_ :
1728
1729 while (my $line = <STDIN>) { print $line }
1730
1731In these loop constructs, the assigned value (whether assignment
1732is automatic or explicit) is then tested to see whether it is
1733defined. The defined test avoids problems where line has a string
1734value that would be treated as false by Perl, for example a "" or
1735a "0" with no trailing newline. If you really mean for such values
1736to terminate the loop, they should be tested for explicitly:
1737
1738 while (($_ = <STDIN>) ne '0') { ... }
1739 while (<STDIN>) { last unless $_; ... }
1740
1741In other boolean contexts, C<< <I<filehandle>> >> without an
1742explicit C<defined> test or comparison elicit a warning if the
1743C<use warnings> pragma or the B<-w>
1744command-line switch (the C<$^W> variable) is in effect.
1745
1746The filehandles STDIN, STDOUT, and STDERR are predefined. (The
1747filehandles C<stdin>, C<stdout>, and C<stderr> will also work except
1748in packages, where they would be interpreted as local identifiers
1749rather than global.) Additional filehandles may be created with
1750the open() function, amongst others. See L<perlopentut> and
1751L<perlfunc/open> for details on this.
1752
1753If a <FILEHANDLE> is used in a context that is looking for
1754a list, a list comprising all input lines is returned, one line per
1755list element. It's easy to grow to a rather large data space this
1756way, so use with care.
1757
1758<FILEHANDLE> may also be spelled C<readline(*FILEHANDLE)>.
1759See L<perlfunc/readline>.
1760
1761The null filehandle <> is special: it can be used to emulate the
1762behavior of B<sed> and B<awk>. Input from <> comes either from
1763standard input, or from each file listed on the command line. Here's
1764how it works: the first time <> is evaluated, the @ARGV array is
1765checked, and if it is empty, C<$ARGV[0]> is set to "-", which when opened
1766gives you standard input. The @ARGV array is then processed as a list
1767of filenames. The loop
1768
1769 while (<>) {
1770 ... # code for each line
1771 }
1772
1773is equivalent to the following Perl-like pseudo code:
1774
1775 unshift(@ARGV, '-') unless @ARGV;
1776 while ($ARGV = shift) {
1777 open(ARGV, $ARGV);
1778 while (<ARGV>) {
1779 ... # code for each line
1780 }
1781 }
1782
1783except that it isn't so cumbersome to say, and will actually work.
1784It really does shift the @ARGV array and put the current filename
1785into the $ARGV variable. It also uses filehandle I<ARGV>
1786internally--<> is just a synonym for <ARGV>, which
1787is magical. (The pseudo code above doesn't work because it treats
1788<ARGV> as non-magical.)
1789
1790You can modify @ARGV before the first <> as long as the array ends up
1791containing the list of filenames you really want. Line numbers (C<$.>)
1792continue as though the input were one big happy file. See the example
1793in L<perlfunc/eof> for how to reset line numbers on each file.
1794
1795If you want to set @ARGV to your own list of files, go right ahead.
1796This sets @ARGV to all plain text files if no @ARGV was given:
1797
1798 @ARGV = grep { -f && -T } glob('*') unless @ARGV;
1799
1800You can even set them to pipe commands. For example, this automatically
1801filters compressed arguments through B<gzip>:
1802
1803 @ARGV = map { /\.(gz|Z)$/ ? "gzip -dc < $_ |" : $_ } @ARGV;
1804
1805If you want to pass switches into your script, you can use one of the
1806Getopts modules or put a loop on the front like this:
1807
1808 while ($_ = $ARGV[0], /^-/) {
1809 shift;
1810 last if /^--$/;
1811 if (/^-D(.*)/) { $debug = $1 }
1812 if (/^-v/) { $verbose++ }
1813 # ... # other switches
1814 }
1815
1816 while (<>) {
1817 # ... # code for each line
1818 }
1819
1820The <> symbol will return C<undef> for end-of-file only once.
1821If you call it again after this, it will assume you are processing another
1822@ARGV list, and if you haven't set @ARGV, will read input from STDIN.
1823
1824If what the angle brackets contain is a simple scalar variable (e.g.,
1825<$foo>), then that variable contains the name of the
1826filehandle to input from, or its typeglob, or a reference to the
1827same. For example:
1828
1829 $fh = \*STDIN;
1830 $line = <$fh>;
1831
1832If what's within the angle brackets is neither a filehandle nor a simple
1833scalar variable containing a filehandle name, typeglob, or typeglob
1834reference, it is interpreted as a filename pattern to be globbed, and
1835either a list of filenames or the next filename in the list is returned,
1836depending on context. This distinction is determined on syntactic
1837grounds alone. That means C<< <$x> >> is always a readline() from
1838an indirect handle, but C<< <$hash{key}> >> is always a glob().
1839That's because $x is a simple scalar variable, but C<$hash{key}> is
1840not--it's a hash element.
1841
1842One level of double-quote interpretation is done first, but you can't
1843say C<< <$foo> >> because that's an indirect filehandle as explained
1844in the previous paragraph. (In older versions of Perl, programmers
1845would insert curly brackets to force interpretation as a filename glob:
1846C<< <${foo}> >>. These days, it's considered cleaner to call the
1847internal function directly as C<glob($foo)>, which is probably the right
1848way to have done it in the first place.) For example:
1849
1850 while (<*.c>) {
1851 chmod 0644, $_;
1852 }
1853
1854is roughly equivalent to:
1855
1856 open(FOO, "echo *.c | tr -s ' \t\r\f' '\\012\\012\\012\\012'|");
1857 while (<FOO>) {
1858 chomp;
1859 chmod 0644, $_;
1860 }
1861
1862except that the globbing is actually done internally using the standard
1863C<File::Glob> extension. Of course, the shortest way to do the above is:
1864
1865 chmod 0644, <*.c>;
1866
1867A (file)glob evaluates its (embedded) argument only when it is
1868starting a new list. All values must be read before it will start
1869over. In list context, this isn't important because you automatically
1870get them all anyway. However, in scalar context the operator returns
1871the next value each time it's called, or C<undef> when the list has
1872run out. As with filehandle reads, an automatic C<defined> is
1873generated when the glob occurs in the test part of a C<while>,
1874because legal glob returns (e.g. a file called F<0>) would otherwise
1875terminate the loop. Again, C<undef> is returned only once. So if
1876you're expecting a single value from a glob, it is much better to
1877say
1878
1879 ($file) = <blurch*>;
1880
1881than
1882
1883 $file = <blurch*>;
1884
1885because the latter will alternate between returning a filename and
1886returning false.
1887
1888If you're trying to do variable interpolation, it's definitely better
1889to use the glob() function, because the older notation can cause people
1890to become confused with the indirect filehandle notation.
1891
1892 @files = glob("$dir/*.[ch]");
1893 @files = glob($files[$i]);
1894
1895=head2 Constant Folding
1896
1897Like C, Perl does a certain amount of expression evaluation at
1898compile time whenever it determines that all arguments to an
1899operator are static and have no side effects. In particular, string
1900concatenation happens at compile time between literals that don't do
1901variable substitution. Backslash interpolation also happens at
1902compile time. You can say
1903
1904 'Now is the time for all' . "\n" .
1905 'good men to come to.'
1906
1907and this all reduces to one string internally. Likewise, if
1908you say
1909
1910 foreach $file (@filenames) {
1911 if (-s $file > 5 + 100 * 2**16) { }
1912 }
1913
1914the compiler will precompute the number which that expression
1915represents so that the interpreter won't have to.
1916
1917=head2 Bitwise String Operators
1918
1919Bitstrings of any size may be manipulated by the bitwise operators
1920(C<~ | & ^>).
1921
1922If the operands to a binary bitwise op are strings of different
1923sizes, B<|> and B<^> ops act as though the shorter operand had
1924additional zero bits on the right, while the B<&> op acts as though
1925the longer operand were truncated to the length of the shorter.
1926The granularity for such extension or truncation is one or more
1927bytes.
1928
1929 # ASCII-based examples
1930 print "j p \n" ^ " a h"; # prints "JAPH\n"
1931 print "JA" | " ph\n"; # prints "japh\n"
1932 print "japh\nJunk" & '_____'; # prints "JAPH\n";
1933 print 'p N$' ^ " E<H\n"; # prints "Perl\n";
1934
1935If you are intending to manipulate bitstrings, be certain that
1936you're supplying bitstrings: If an operand is a number, that will imply
1937a B<numeric> bitwise operation. You may explicitly show which type of
1938operation you intend by using C<""> or C<0+>, as in the examples below.
1939
1940 $foo = 150 | 105 ; # yields 255 (0x96 | 0x69 is 0xFF)
1941 $foo = '150' | 105 ; # yields 255
1942 $foo = 150 | '105'; # yields 255
1943 $foo = '150' | '105'; # yields string '155' (under ASCII)
1944
1945 $baz = 0+$foo & 0+$bar; # both ops explicitly numeric
1946 $biz = "$foo" ^ "$bar"; # both ops explicitly stringy
1947
1948See L<perlfunc/vec> for information on how to manipulate individual bits
1949in a bit vector.
1950
1951=head2 Integer Arithmetic
1952
1953By default, Perl assumes that it must do most of its arithmetic in
1954floating point. But by saying
1955
1956 use integer;
1957
1958you may tell the compiler that it's okay to use integer operations
1959(if it feels like it) from here to the end of the enclosing BLOCK.
1960An inner BLOCK may countermand this by saying
1961
1962 no integer;
1963
1964which lasts until the end of that BLOCK. Note that this doesn't
1965mean everything is only an integer, merely that Perl may use integer
1966operations if it is so inclined. For example, even under C<use
1967integer>, if you take the C<sqrt(2)>, you'll still get C<1.4142135623731>
1968or so.
1969
1970Used on numbers, the bitwise operators ("&", "|", "^", "~", "<<",
1971and ">>") always produce integral results. (But see also
1972L<Bitwise String Operators>.) However, C<use integer> still has meaning for
1973them. By default, their results are interpreted as unsigned integers, but
1974if C<use integer> is in effect, their results are interpreted
1975as signed integers. For example, C<~0> usually evaluates to a large
1976integral value. However, C<use integer; ~0> is C<-1> on twos-complement
1977machines.
1978
1979=head2 Floating-point Arithmetic
1980
1981While C<use integer> provides integer-only arithmetic, there is no
1982analogous mechanism to provide automatic rounding or truncation to a
1983certain number of decimal places. For rounding to a certain number
1984of digits, sprintf() or printf() is usually the easiest route.
1985See L<perlfaq4>.
1986
1987Floating-point numbers are only approximations to what a mathematician
1988would call real numbers. There are infinitely more reals than floats,
1989so some corners must be cut. For example:
1990
1991 printf "%.20g\n", 123456789123456789;
1992 # produces 123456789123456784
1993
1994Testing for exact equality of floating-point equality or inequality is
1995not a good idea. Here's a (relatively expensive) work-around to compare
1996whether two floating-point numbers are equal to a particular number of
1997decimal places. See Knuth, volume II, for a more robust treatment of
1998this topic.
1999
2000 sub fp_equal {
2001 my ($X, $Y, $POINTS) = @_;
2002 my ($tX, $tY);
2003 $tX = sprintf("%.${POINTS}g", $X);
2004 $tY = sprintf("%.${POINTS}g", $Y);
2005 return $tX eq $tY;
2006 }
2007
2008The POSIX module (part of the standard perl distribution) implements
2009ceil(), floor(), and other mathematical and trigonometric functions.
2010The Math::Complex module (part of the standard perl distribution)
2011defines mathematical functions that work on both the reals and the
2012imaginary numbers. Math::Complex not as efficient as POSIX, but
2013POSIX can't work with complex numbers.
2014
2015Rounding in financial applications can have serious implications, and
2016the rounding method used should be specified precisely. In these
2017cases, it probably pays not to trust whichever system rounding is
2018being used by Perl, but to instead implement the rounding function you
2019need yourself.
2020
2021=head2 Bigger Numbers
2022
2023The standard Math::BigInt and Math::BigFloat modules provide
2024variable-precision arithmetic and overloaded operators, although
2025they're currently pretty slow. At the cost of some space and
2026considerable speed, they avoid the normal pitfalls associated with
2027limited-precision representations.
2028
2029 use Math::BigInt;
2030 $x = Math::BigInt->new('123456789123456789');
2031 print $x * $x;
2032
2033 # prints +15241578780673678515622620750190521
2034
2035There are several modules that let you calculate with (bound only by
2036memory and cpu-time) unlimited or fixed precision. There are also
2037some non-standard modules that provide faster implementations via
2038external C libraries.
2039
2040Here is a short, but incomplete summary:
2041
2042 Math::Fraction big, unlimited fractions like 9973 / 12967
2043 Math::String treat string sequences like numbers
2044 Math::FixedPrecision calculate with a fixed precision
2045 Math::Currency for currency calculations
2046 Bit::Vector manipulate bit vectors fast (uses C)
2047 Math::BigIntFast Bit::Vector wrapper for big numbers
2048 Math::Pari provides access to the Pari C library
2049 Math::BigInteger uses an external C library
2050 Math::Cephes uses external Cephes C library (no big numbers)
2051 Math::Cephes::Fraction fractions via the Cephes library
2052 Math::GMP another one using an external C library
2053
2054Choose wisely.
2055
2056=cut