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