xref: /openbsd/gnu/usr.bin/perl/pod/perlop.pod (revision fc61954a)
1=head1 NAME
2X<operator>
3
4perlop - Perl operators and precedence
5
6=head1 DESCRIPTION
7
8In Perl, the operator determines what operation is performed,
9independent of the type of the operands.  For example C<$x + $y>
10is always a numeric addition, and if C<$x> or C<$y> do not contain
11numbers, an attempt is made to convert them to numbers first.
12
13This is in contrast to many other dynamic languages, where the
14operation is determined by the type of the first argument.  It also
15means that Perl has two versions of some operators, one for numeric
16and one for string comparison.  For example C<$x == $y> compares
17two numbers for equality, and C<$x eq $y> compares two strings.
18
19There are a few exceptions though: C<x> can be either string
20repetition or list repetition, depending on the type of the left
21operand, and C<&>, C<|> and C<^> can be either string or numeric bit
22operations.
23
24=head2 Operator Precedence and Associativity
25X<operator, precedence> X<precedence> X<associativity>
26
27Operator precedence and associativity work in Perl more or less like
28they do in mathematics.
29
30I<Operator precedence> means some operators are evaluated before
31others.  For example, in C<2 + 4 * 5>, the multiplication has higher
32precedence so C<4 * 5> is evaluated first yielding C<2 + 20 ==
3322> and not C<6 * 5 == 30>.
34
35I<Operator associativity> defines what happens if a sequence of the
36same operators is used one after another: whether the evaluator will
37evaluate the left operations first or the right.  For example, in C<8
38- 4 - 2>, subtraction is left associative so Perl evaluates the
39expression left to right.  C<8 - 4> is evaluated first making the
40expression C<4 - 2 == 2> and not C<8 - 2 == 6>.
41
42Perl operators have the following associativity and precedence,
43listed from highest precedence to lowest.  Operators borrowed from
44C keep the same precedence relationship with each other, even where
45C's precedence is slightly screwy.  (This makes learning Perl easier
46for C folks.)  With very few exceptions, these all operate on scalar
47values only, not array values.
48
49    left	terms and list operators (leftward)
50    left	->
51    nonassoc	++ --
52    right	**
53    right	! ~ \ and unary + and -
54    left	=~ !~
55    left	* / % x
56    left	+ - .
57    left	<< >>
58    nonassoc	named unary operators
59    nonassoc	< > <= >= lt gt le ge
60    nonassoc	== != <=> eq ne cmp ~~
61    left	&
62    left	| ^
63    left	&&
64    left	|| //
65    nonassoc	..  ...
66    right	?:
67    right	= += -= *= etc. goto last next redo dump
68    left	, =>
69    nonassoc	list operators (rightward)
70    right	not
71    left	and
72    left	or xor
73
74In the following sections, these operators are covered in precedence order.
75
76Many operators can be overloaded for objects.  See L<overload>.
77
78=head2 Terms and List Operators (Leftward)
79X<list operator> X<operator, list> X<term>
80
81A TERM has the highest precedence in Perl.  They include variables,
82quote and quote-like operators, any expression in parentheses,
83and any function whose arguments are parenthesized.  Actually, there
84aren't really functions in this sense, just list operators and unary
85operators behaving as functions because you put parentheses around
86the arguments.  These are all documented in L<perlfunc>.
87
88If any list operator (print(), etc.) or any unary operator (chdir(), etc.)
89is followed by a left parenthesis as the next token, the operator and
90arguments within parentheses are taken to be of highest precedence,
91just like a normal function call.
92
93In the absence of parentheses, the precedence of list operators such as
94C<print>, C<sort>, or C<chmod> is either very high or very low depending on
95whether you are looking at the left side or the right side of the operator.
96For example, in
97
98    @ary = (1, 3, sort 4, 2);
99    print @ary;		# prints 1324
100
101the commas on the right of the sort are evaluated before the sort,
102but the commas on the left are evaluated after.  In other words,
103list operators tend to gobble up all arguments that follow, and
104then act like a simple TERM with regard to the preceding expression.
105Be careful with parentheses:
106
107    # These evaluate exit before doing the print:
108    print($foo, exit);	# Obviously not what you want.
109    print $foo, exit;	# Nor is this.
110
111    # These do the print before evaluating exit:
112    (print $foo), exit;	# This is what you want.
113    print($foo), exit;	# Or this.
114    print ($foo), exit;	# Or even this.
115
116Also note that
117
118    print ($foo & 255) + 1, "\n";
119
120probably doesn't do what you expect at first glance.  The parentheses
121enclose the argument list for C<print> which is evaluated (printing
122the result of C<$foo & 255>).  Then one is added to the return value
123of C<print> (usually 1).  The result is something like this:
124
125    1 + 1, "\n";    # Obviously not what you meant.
126
127To do what you meant properly, you must write:
128
129    print(($foo & 255) + 1, "\n");
130
131See L<Named Unary Operators> for more discussion of this.
132
133Also parsed as terms are the C<do {}> and C<eval {}> constructs, as
134well as subroutine and method calls, and the anonymous
135constructors C<[]> and C<{}>.
136
137See also L<Quote and Quote-like Operators> toward the end of this section,
138as well as L</"I/O Operators">.
139
140=head2 The Arrow Operator
141X<arrow> X<dereference> X<< -> >>
142
143"C<< -> >>" is an infix dereference operator, just as it is in C
144and C++.  If the right side is either a C<[...]>, C<{...}>, or a
145C<(...)> subscript, then the left side must be either a hard or
146symbolic reference to an array, a hash, or a subroutine respectively.
147(Or technically speaking, a location capable of holding a hard
148reference, if it's an array or hash reference being used for
149assignment.)  See L<perlreftut> and L<perlref>.
150
151Otherwise, the right side is a method name or a simple scalar
152variable containing either the method name or a subroutine reference,
153and the left side must be either an object (a blessed reference)
154or a class name (that is, a package name).  See L<perlobj>.
155
156The dereferencing cases (as opposed to method-calling cases) are
157somewhat extended by the experimental C<postderef> feature.  For the
158details of that feature, consult L<perlref/Postfix Dereference Syntax>.
159
160=head2 Auto-increment and Auto-decrement
161X<increment> X<auto-increment> X<++> X<decrement> X<auto-decrement> X<-->
162
163"++" and "--" work as in C.  That is, if placed before a variable,
164they increment or decrement the variable by one before returning the
165value, and if placed after, increment or decrement after returning the
166value.
167
168    $i = 0;  $j = 0;
169    print $i++;  # prints 0
170    print ++$j;  # prints 1
171
172Note that just as in C, Perl doesn't define B<when> the variable is
173incremented or decremented.  You just know it will be done sometime
174before or after the value is returned.  This also means that modifying
175a variable twice in the same statement will lead to undefined behavior.
176Avoid statements like:
177
178    $i = $i ++;
179    print ++ $i + $i ++;
180
181Perl will not guarantee what the result of the above statements is.
182
183The auto-increment operator has a little extra builtin magic to it.  If
184you increment a variable that is numeric, or that has ever been used in
185a numeric context, you get a normal increment.  If, however, the
186variable has been used in only string contexts since it was set, and
187has a value that is not the empty string and matches the pattern
188C</^[a-zA-Z]*[0-9]*\z/>, the increment is done as a string, preserving each
189character within its range, with carry:
190
191    print ++($foo = "99");	# prints "100"
192    print ++($foo = "a0");	# prints "a1"
193    print ++($foo = "Az");	# prints "Ba"
194    print ++($foo = "zz");	# prints "aaa"
195
196C<undef> is always treated as numeric, and in particular is changed
197to C<0> before incrementing (so that a post-increment of an undef value
198will return C<0> rather than C<undef>).
199
200The auto-decrement operator is not magical.
201
202=head2 Exponentiation
203X<**> X<exponentiation> X<power>
204
205Binary "**" is the exponentiation operator.  It binds even more
206tightly than unary minus, so -2**4 is -(2**4), not (-2)**4.  (This is
207implemented using C's pow(3) function, which actually works on doubles
208internally.)
209
210=head2 Symbolic Unary Operators
211X<unary operator> X<operator, unary>
212
213Unary "!" performs logical negation, that is, "not".  See also C<not> for a lower
214precedence version of this.
215X<!>
216
217Unary "-" performs arithmetic negation if the operand is numeric,
218including any string that looks like a number.  If the operand is
219an identifier, a string consisting of a minus sign concatenated
220with the identifier is returned.  Otherwise, if the string starts
221with a plus or minus, a string starting with the opposite sign is
222returned.  One effect of these rules is that -bareword is equivalent
223to the string "-bareword".  If, however, the string begins with a
224non-alphabetic character (excluding "+" or "-"), Perl will attempt to convert
225the string to a numeric and the arithmetic negation is performed.  If the
226string cannot be cleanly converted to a numeric, Perl will give the warning
227B<Argument "the string" isn't numeric in negation (-) at ...>.
228X<-> X<negation, arithmetic>
229
230Unary "~" performs bitwise negation, that is, 1's complement.  For
231example, C<0666 & ~027> is 0640.  (See also L<Integer Arithmetic> and
232L<Bitwise String Operators>.)  Note that the width of the result is
233platform-dependent: ~0 is 32 bits wide on a 32-bit platform, but 64
234bits wide on a 64-bit platform, so if you are expecting a certain bit
235width, remember to use the "&" operator to mask off the excess bits.
236X<~> X<negation, binary>
237
238When complementing strings, if all characters have ordinal values under
239256, then their complements will, also.  But if they do not, all
240characters will be in either 32- or 64-bit complements, depending on your
241architecture.  So for example, C<~"\x{3B1}"> is C<"\x{FFFF_FC4E}"> on
24232-bit machines and C<"\x{FFFF_FFFF_FFFF_FC4E}"> on 64-bit machines.
243
244Unary "+" has no effect whatsoever, even on strings.  It is useful
245syntactically for separating a function name from a parenthesized expression
246that would otherwise be interpreted as the complete list of function
247arguments.  (See examples above under L<Terms and List Operators (Leftward)>.)
248X<+>
249
250Unary "\" creates a reference to whatever follows it.  See L<perlreftut>
251and L<perlref>.  Do not confuse this behavior with the behavior of
252backslash within a string, although both forms do convey the notion
253of protecting the next thing from interpolation.
254X<\> X<reference> X<backslash>
255
256=head2 Binding Operators
257X<binding> X<operator, binding> X<=~> X<!~>
258
259Binary "=~" binds a scalar expression to a pattern match.  Certain operations
260search or modify the string $_ by default.  This operator makes that kind
261of operation work on some other string.  The right argument is a search
262pattern, substitution, or transliteration.  The left argument is what is
263supposed to be searched, substituted, or transliterated instead of the default
264$_.  When used in scalar context, the return value generally indicates the
265success of the operation.  The exceptions are substitution (s///)
266and transliteration (y///) with the C</r> (non-destructive) option,
267which cause the B<r>eturn value to be the result of the substitution.
268Behavior in list context depends on the particular operator.
269See L</"Regexp Quote-Like Operators"> for details and L<perlretut> for
270examples using these operators.
271
272If the right argument is an expression rather than a search pattern,
273substitution, or transliteration, it is interpreted as a search pattern at run
274time.  Note that this means that its
275contents will be interpolated twice, so
276
277    '\\' =~ q'\\';
278
279is not ok, as the regex engine will end up trying to compile the
280pattern C<\>, which it will consider a syntax error.
281
282Binary "!~" is just like "=~" except the return value is negated in
283the logical sense.
284
285Binary "!~" with a non-destructive substitution (s///r) or transliteration
286(y///r) is a syntax error.
287
288=head2 Multiplicative Operators
289X<operator, multiplicative>
290
291Binary "*" multiplies two numbers.
292X<*>
293
294Binary "/" divides two numbers.
295X</> X<slash>
296
297Binary "%" is the modulo operator, which computes the division
298remainder of its first argument with respect to its second argument.
299Given integer
300operands C<$m> and C<$n>: If C<$n> is positive, then C<$m % $n> is
301C<$m> minus the largest multiple of C<$n> less than or equal to
302C<$m>.  If C<$n> is negative, then C<$m % $n> is C<$m> minus the
303smallest multiple of C<$n> that is not less than C<$m> (that is, the
304result will be less than or equal to zero).  If the operands
305C<$m> and C<$n> are floating point values and the absolute value of
306C<$n> (that is C<abs($n)>) is less than C<(UV_MAX + 1)>, only
307the integer portion of C<$m> and C<$n> will be used in the operation
308(Note: here C<UV_MAX> means the maximum of the unsigned integer type).
309If the absolute value of the right operand (C<abs($n)>) is greater than
310or equal to C<(UV_MAX + 1)>, "%" computes the floating-point remainder
311C<$r> in the equation C<($r = $m - $i*$n)> where C<$i> is a certain
312integer that makes C<$r> have the same sign as the right operand
313C<$n> (B<not> as the left operand C<$m> like C function C<fmod()>)
314and the absolute value less than that of C<$n>.
315Note that when C<use integer> is in scope, "%" gives you direct access
316to the modulo operator as implemented by your C compiler.  This
317operator is not as well defined for negative operands, but it will
318execute faster.
319X<%> X<remainder> X<modulo> X<mod>
320
321Binary "x" is the repetition operator.  In scalar context or if the left
322operand is not enclosed in parentheses, it returns a string consisting
323of the left operand repeated the number of times specified by the right
324operand.  In list context, if the left operand is enclosed in
325parentheses or is a list formed by C<qw/STRING/>, it repeats the list.
326If the right operand is zero or negative, it returns an empty string
327or an empty list, depending on the context.
328X<x>
329
330    print '-' x 80;		# print row of dashes
331
332    print "\t" x ($tab/8), ' ' x ($tab%8);	# tab over
333
334    @ones = (1) x 80;		# a list of 80 1's
335    @ones = (5) x @ones;	# set all elements to 5
336
337
338=head2 Additive Operators
339X<operator, additive>
340
341Binary C<+> returns the sum of two numbers.
342X<+>
343
344Binary C<-> returns the difference of two numbers.
345X<->
346
347Binary C<.> concatenates two strings.
348X<string, concatenation> X<concatenation>
349X<cat> X<concat> X<concatenate> X<.>
350
351=head2 Shift Operators
352X<shift operator> X<operator, shift> X<<< << >>>
353X<<< >> >>> X<right shift> X<left shift> X<bitwise shift>
354X<shl> X<shr> X<shift, right> X<shift, left>
355
356Binary C<<< << >>> returns the value of its left argument shifted left by the
357number of bits specified by the right argument.  Arguments should be
358integers.  (See also L<Integer Arithmetic>.)
359
360Binary C<<< >> >>> returns the value of its left argument shifted right by
361the number of bits specified by the right argument.  Arguments should
362be integers.  (See also L<Integer Arithmetic>.)
363
364Note that both C<<< << >>> and C<<< >> >>> in Perl are implemented directly using
365C<<< << >>> and C<<< >> >>>  in C.  If C<use integer> (see L<Integer Arithmetic>) is
366in force then signed C integers are used, else unsigned C integers are
367used.  Either way, the implementation isn't going to generate results
368larger than the size of the integer type Perl was built with (32 bits
369or 64 bits).
370
371The result of overflowing the range of the integers is undefined
372because it is undefined also in C.  In other words, using 32-bit
373integers, C<< 1 << 32 >> is undefined.  Shifting by a negative number
374of bits is also undefined.
375
376If you get tired of being subject to your platform's native integers,
377the C<use bigint> pragma neatly sidesteps the issue altogether:
378
379    print 20 << 20;  # 20971520
380    print 20 << 40;  # 5120 on 32-bit machines,
381                     # 21990232555520 on 64-bit machines
382    use bigint;
383    print 20 << 100; # 25353012004564588029934064107520
384
385=head2 Named Unary Operators
386X<operator, named unary>
387
388The various named unary operators are treated as functions with one
389argument, with optional parentheses.
390
391If any list operator (print(), etc.) or any unary operator (chdir(), etc.)
392is followed by a left parenthesis as the next token, the operator and
393arguments within parentheses are taken to be of highest precedence,
394just like a normal function call.  For example,
395because named unary operators are higher precedence than C<||>:
396
397    chdir $foo    || die;	# (chdir $foo) || die
398    chdir($foo)   || die;	# (chdir $foo) || die
399    chdir ($foo)  || die;	# (chdir $foo) || die
400    chdir +($foo) || die;	# (chdir $foo) || die
401
402but, because * is higher precedence than named operators:
403
404    chdir $foo * 20;	# chdir ($foo * 20)
405    chdir($foo) * 20;	# (chdir $foo) * 20
406    chdir ($foo) * 20;	# (chdir $foo) * 20
407    chdir +($foo) * 20;	# chdir ($foo * 20)
408
409    rand 10 * 20;	# rand (10 * 20)
410    rand(10) * 20;	# (rand 10) * 20
411    rand (10) * 20;	# (rand 10) * 20
412    rand +(10) * 20;	# rand (10 * 20)
413
414Regarding precedence, the filetest operators, like C<-f>, C<-M>, etc. are
415treated like named unary operators, but they don't follow this functional
416parenthesis rule.  That means, for example, that C<-f($file).".bak"> is
417equivalent to C<-f "$file.bak">.
418X<-X> X<filetest> X<operator, filetest>
419
420See also L<"Terms and List Operators (Leftward)">.
421
422=head2 Relational Operators
423X<relational operator> X<operator, relational>
424
425Perl operators that return true or false generally return values
426that can be safely used as numbers.  For example, the relational
427operators in this section and the equality operators in the next
428one return C<1> for true and a special version of the defined empty
429string, C<"">, which counts as a zero but is exempt from warnings
430about improper numeric conversions, just as C<"0 but true"> is.
431
432Binary "<" returns true if the left argument is numerically less than
433the right argument.
434X<< < >>
435
436Binary ">" returns true if the left argument is numerically greater
437than the right argument.
438X<< > >>
439
440Binary "<=" returns true if the left argument is numerically less than
441or equal to the right argument.
442X<< <= >>
443
444Binary ">=" returns true if the left argument is numerically greater
445than or equal to the right argument.
446X<< >= >>
447
448Binary "lt" returns true if the left argument is stringwise less than
449the right argument.
450X<< lt >>
451
452Binary "gt" returns true if the left argument is stringwise greater
453than the right argument.
454X<< gt >>
455
456Binary "le" returns true if the left argument is stringwise less than
457or equal to the right argument.
458X<< le >>
459
460Binary "ge" returns true if the left argument is stringwise greater
461than or equal to the right argument.
462X<< ge >>
463
464=head2 Equality Operators
465X<equality> X<equal> X<equals> X<operator, equality>
466
467Binary "==" returns true if the left argument is numerically equal to
468the right argument.
469X<==>
470
471Binary "!=" returns true if the left argument is numerically not equal
472to the right argument.
473X<!=>
474
475Binary "<=>" returns -1, 0, or 1 depending on whether the left
476argument is numerically less than, equal to, or greater than the right
477argument.  If your platform supports NaNs (not-a-numbers) as numeric
478values, using them with "<=>" returns undef.  NaN is not "<", "==", ">",
479"<=" or ">=" anything (even NaN), so those 5 return false.  NaN != NaN
480returns true, as does NaN != anything else.  If your platform doesn't
481support NaNs then NaN is just a string with numeric value 0.
482X<< <=> >> X<spaceship>
483
484    $ perl -le '$x = "NaN"; print "No NaN support here" if $x == $x'
485    $ perl -le '$x = "NaN"; print "NaN support here" if $x != $x'
486
487(Note that the L<bigint>, L<bigrat>, and L<bignum> pragmas all
488support "NaN".)
489
490Binary "eq" returns true if the left argument is stringwise equal to
491the right argument.
492X<eq>
493
494Binary "ne" returns true if the left argument is stringwise not equal
495to the right argument.
496X<ne>
497
498Binary "cmp" returns -1, 0, or 1 depending on whether the left
499argument is stringwise less than, equal to, or greater than the right
500argument.
501X<cmp>
502
503Binary "~~" does a smartmatch between its arguments.  Smart matching
504is described in the next section.
505X<~~>
506
507"lt", "le", "ge", "gt" and "cmp" use the collation (sort) order specified
508by the current locale if a legacy C<use locale> (but not
509C<use locale ':not_characters'>) is in effect.  See
510L<perllocale>.  Do not mix these with Unicode, only with legacy binary
511encodings.  The standard L<Unicode::Collate> and
512L<Unicode::Collate::Locale> modules offer much more powerful solutions to
513collation issues.
514
515=head2 Smartmatch Operator
516
517First available in Perl 5.10.1 (the 5.10.0 version behaved differently),
518binary C<~~> does a "smartmatch" between its arguments.  This is mostly
519used implicitly in the C<when> construct described in L<perlsyn>, although
520not all C<when> clauses call the smartmatch operator.  Unique among all of
521Perl's operators, the smartmatch operator can recurse.  The smartmatch
522operator is L<experimental|perlpolicy/experimental> and its behavior is
523subject to change.
524
525It is also unique in that all other Perl operators impose a context
526(usually string or numeric context) on their operands, autoconverting
527those operands to those imposed contexts.  In contrast, smartmatch
528I<infers> contexts from the actual types of its operands and uses that
529type information to select a suitable comparison mechanism.
530
531The C<~~> operator compares its operands "polymorphically", determining how
532to compare them according to their actual types (numeric, string, array,
533hash, etc.)  Like the equality operators with which it shares the same
534precedence, C<~~> returns 1 for true and C<""> for false.  It is often best
535read aloud as "in", "inside of", or "is contained in", because the left
536operand is often looked for I<inside> the right operand.  That makes the
537order of the operands to the smartmatch operand often opposite that of
538the regular match operator.  In other words, the "smaller" thing is usually
539placed in the left operand and the larger one in the right.
540
541The behavior of a smartmatch depends on what type of things its arguments
542are, as determined by the following table.  The first row of the table
543whose types apply determines the smartmatch behavior.  Because what
544actually happens is mostly determined by the type of the second operand,
545the table is sorted on the right operand instead of on the left.
546
547 Left      Right      Description and pseudocode
548 ===============================================================
549 Any       undef      check whether Any is undefined
550                like: !defined Any
551
552 Any       Object     invoke ~~ overloading on Object, or die
553
554 Right operand is an ARRAY:
555
556 Left      Right      Description and pseudocode
557 ===============================================================
558 ARRAY1    ARRAY2     recurse on paired elements of ARRAY1 and ARRAY2[2]
559                like: (ARRAY1[0] ~~ ARRAY2[0])
560                        && (ARRAY1[1] ~~ ARRAY2[1]) && ...
561 HASH      ARRAY      any ARRAY elements exist as HASH keys
562                like: grep { exists HASH->{$_} } ARRAY
563 Regexp    ARRAY      any ARRAY elements pattern match Regexp
564                like: grep { /Regexp/ } ARRAY
565 undef     ARRAY      undef in ARRAY
566                like: grep { !defined } ARRAY
567 Any       ARRAY      smartmatch each ARRAY element[3]
568                like: grep { Any ~~ $_ } ARRAY
569
570 Right operand is a HASH:
571
572 Left      Right      Description and pseudocode
573 ===============================================================
574 HASH1     HASH2      all same keys in both HASHes
575                like: keys HASH1 ==
576                         grep { exists HASH2->{$_} } keys HASH1
577 ARRAY     HASH       any ARRAY elements exist as HASH keys
578                like: grep { exists HASH->{$_} } ARRAY
579 Regexp    HASH       any HASH keys pattern match Regexp
580                like: grep { /Regexp/ } keys HASH
581 undef     HASH       always false (undef can't be a key)
582                like: 0 == 1
583 Any       HASH       HASH key existence
584                like: exists HASH->{Any}
585
586 Right operand is CODE:
587
588 Left      Right      Description and pseudocode
589 ===============================================================
590 ARRAY     CODE       sub returns true on all ARRAY elements[1]
591                like: !grep { !CODE->($_) } ARRAY
592 HASH      CODE       sub returns true on all HASH keys[1]
593                like: !grep { !CODE->($_) } keys HASH
594 Any       CODE       sub passed Any returns true
595                like: CODE->(Any)
596
597Right operand is a Regexp:
598
599 Left      Right      Description and pseudocode
600 ===============================================================
601 ARRAY     Regexp     any ARRAY elements match Regexp
602                like: grep { /Regexp/ } ARRAY
603 HASH      Regexp     any HASH keys match Regexp
604                like: grep { /Regexp/ } keys HASH
605 Any       Regexp     pattern match
606                like: Any =~ /Regexp/
607
608 Other:
609
610 Left      Right      Description and pseudocode
611 ===============================================================
612 Object    Any        invoke ~~ overloading on Object,
613                      or fall back to...
614
615 Any       Num        numeric equality
616                 like: Any == Num
617 Num       nummy[4]    numeric equality
618                 like: Num == nummy
619 undef     Any        check whether undefined
620                 like: !defined(Any)
621 Any       Any        string equality
622                 like: Any eq Any
623
624
625Notes:
626
627=over
628
629=item 1.
630Empty hashes or arrays match.
631
632=item 2.
633That is, each element smartmatches the element of the same index in the other array.[3]
634
635=item 3.
636If a circular reference is found, fall back to referential equality.
637
638=item 4.
639Either an actual number, or a string that looks like one.
640
641=back
642
643The smartmatch implicitly dereferences any non-blessed hash or array
644reference, so the C<I<HASH>> and C<I<ARRAY>> entries apply in those cases.
645For blessed references, the C<I<Object>> entries apply.  Smartmatches
646involving hashes only consider hash keys, never hash values.
647
648The "like" code entry is not always an exact rendition.  For example, the
649smartmatch operator short-circuits whenever possible, but C<grep> does
650not.  Also, C<grep> in scalar context returns the number of matches, but
651C<~~> returns only true or false.
652
653Unlike most operators, the smartmatch operator knows to treat C<undef>
654specially:
655
656    use v5.10.1;
657    @array = (1, 2, 3, undef, 4, 5);
658    say "some elements undefined" if undef ~~ @array;
659
660Each operand is considered in a modified scalar context, the modification
661being that array and hash variables are passed by reference to the
662operator, which implicitly dereferences them.  Both elements
663of each pair are the same:
664
665    use v5.10.1;
666
667    my %hash = (red    => 1, blue   => 2, green  => 3,
668                orange => 4, yellow => 5, purple => 6,
669                black  => 7, grey   => 8, white  => 9);
670
671    my @array = qw(red blue green);
672
673    say "some array elements in hash keys" if  @array ~~  %hash;
674    say "some array elements in hash keys" if \@array ~~ \%hash;
675
676    say "red in array" if "red" ~~  @array;
677    say "red in array" if "red" ~~ \@array;
678
679    say "some keys end in e" if /e$/ ~~  %hash;
680    say "some keys end in e" if /e$/ ~~ \%hash;
681
682Two arrays smartmatch if each element in the first array smartmatches
683(that is, is "in") the corresponding element in the second array,
684recursively.
685
686    use v5.10.1;
687    my @little = qw(red blue green);
688    my @bigger = ("red", "blue", [ "orange", "green" ] );
689    if (@little ~~ @bigger) {  # true!
690        say "little is contained in bigger";
691    }
692
693Because the smartmatch operator recurses on nested arrays, this
694will still report that "red" is in the array.
695
696    use v5.10.1;
697    my @array = qw(red blue green);
698    my $nested_array = [[[[[[[ @array ]]]]]]];
699    say "red in array" if "red" ~~ $nested_array;
700
701If two arrays smartmatch each other, then they are deep
702copies of each others' values, as this example reports:
703
704    use v5.12.0;
705    my @a = (0, 1, 2, [3, [4, 5], 6], 7);
706    my @b = (0, 1, 2, [3, [4, 5], 6], 7);
707
708    if (@a ~~ @b && @b ~~ @a) {
709        say "a and b are deep copies of each other";
710    }
711    elsif (@a ~~ @b) {
712        say "a smartmatches in b";
713    }
714    elsif (@b ~~ @a) {
715        say "b smartmatches in a";
716    }
717    else {
718        say "a and b don't smartmatch each other at all";
719    }
720
721
722If you were to set C<$b[3] = 4>, then instead of reporting that "a and b
723are deep copies of each other", it now reports that "b smartmatches in a".
724That because the corresponding position in C<@a> contains an array that
725(eventually) has a 4 in it.
726
727Smartmatching one hash against another reports whether both contain the
728same keys, no more and no less.  This could be used to see whether two
729records have the same field names, without caring what values those fields
730might have.  For example:
731
732    use v5.10.1;
733    sub make_dogtag {
734        state $REQUIRED_FIELDS = { name=>1, rank=>1, serial_num=>1 };
735
736        my ($class, $init_fields) = @_;
737
738        die "Must supply (only) name, rank, and serial number"
739            unless $init_fields ~~ $REQUIRED_FIELDS;
740
741        ...
742    }
743
744or, if other non-required fields are allowed, use ARRAY ~~ HASH:
745
746    use v5.10.1;
747    sub make_dogtag {
748        state $REQUIRED_FIELDS = { name=>1, rank=>1, serial_num=>1 };
749
750        my ($class, $init_fields) = @_;
751
752        die "Must supply (at least) name, rank, and serial number"
753            unless [keys %{$init_fields}] ~~ $REQUIRED_FIELDS;
754
755        ...
756    }
757
758The smartmatch operator is most often used as the implicit operator of a
759C<when> clause.  See the section on "Switch Statements" in L<perlsyn>.
760
761=head3 Smartmatching of Objects
762
763To avoid relying on an object's underlying representation, if the
764smartmatch's right operand is an object that doesn't overload C<~~>,
765it raises the exception "C<Smartmatching a non-overloaded object
766breaks encapsulation>".  That's because one has no business digging
767around to see whether something is "in" an object.  These are all
768illegal on objects without a C<~~> overload:
769
770    %hash ~~ $object
771       42 ~~ $object
772   "fred" ~~ $object
773
774However, you can change the way an object is smartmatched by overloading
775the C<~~> operator.  This is allowed to
776extend the usual smartmatch semantics.
777For objects that do have an C<~~> overload, see L<overload>.
778
779Using an object as the left operand is allowed, although not very useful.
780Smartmatching rules take precedence over overloading, so even if the
781object in the left operand has smartmatch overloading, this will be
782ignored.  A left operand that is a non-overloaded object falls back on a
783string or numeric comparison of whatever the C<ref> operator returns.  That
784means that
785
786    $object ~~ X
787
788does I<not> invoke the overload method with C<I<X>> as an argument.
789Instead the above table is consulted as normal, and based on the type of
790C<I<X>>, overloading may or may not be invoked.  For simple strings or
791numbers, in becomes equivalent to this:
792
793    $object ~~ $number          ref($object) == $number
794    $object ~~ $string          ref($object) eq $string
795
796For example, this reports that the handle smells IOish
797(but please don't really do this!):
798
799    use IO::Handle;
800    my $fh = IO::Handle->new();
801    if ($fh ~~ /\bIO\b/) {
802        say "handle smells IOish";
803    }
804
805That's because it treats C<$fh> as a string like
806C<"IO::Handle=GLOB(0x8039e0)">, then pattern matches against that.
807
808=head2 Bitwise And
809X<operator, bitwise, and> X<bitwise and> X<&>
810
811Binary "&" returns its operands ANDed together bit by bit.  Although no
812warning is currently raised, the result is not well defined when this operation
813is performed on operands that aren't either numbers (see
814L<Integer Arithmetic>) or bitstrings (see L<Bitwise String Operators>).
815
816Note that "&" has lower priority than relational operators, so for example
817the parentheses are essential in a test like
818
819    print "Even\n" if ($x & 1) == 0;
820
821=head2 Bitwise Or and Exclusive Or
822X<operator, bitwise, or> X<bitwise or> X<|> X<operator, bitwise, xor>
823X<bitwise xor> X<^>
824
825Binary "|" returns its operands ORed together bit by bit.
826
827Binary "^" returns its operands XORed together bit by bit.
828
829Although no warning is currently raised, the results are not well
830defined when these operations are performed on operands that aren't either
831numbers (see L<Integer Arithmetic>) or bitstrings (see L<Bitwise String
832Operators>).
833
834Note that "|" and "^" have lower priority than relational operators, so
835for example the brackets are essential in a test like
836
837    print "false\n" if (8 | 2) != 10;
838
839=head2 C-style Logical And
840X<&&> X<logical and> X<operator, logical, and>
841
842Binary "&&" performs a short-circuit logical AND operation.  That is,
843if the left operand is false, the right operand is not even evaluated.
844Scalar or list context propagates down to the right operand if it
845is evaluated.
846
847=head2 C-style Logical Or
848X<||> X<operator, logical, or>
849
850Binary "||" performs a short-circuit logical OR operation.  That is,
851if the left operand is true, the right operand is not even evaluated.
852Scalar or list context propagates down to the right operand if it
853is evaluated.
854
855=head2 Logical Defined-Or
856X<//> X<operator, logical, defined-or>
857
858Although it has no direct equivalent in C, Perl's C<//> operator is related
859to its C-style or.  In fact, it's exactly the same as C<||>, except that it
860tests the left hand side's definedness instead of its truth.  Thus,
861C<< EXPR1 // EXPR2 >> returns the value of C<< EXPR1 >> if it's defined,
862otherwise, the value of C<< EXPR2 >> is returned.
863(C<< EXPR1 >> is evaluated in scalar context, C<< EXPR2 >>
864in the context of C<< // >> itself).  Usually,
865this is the same result as C<< defined(EXPR1) ? EXPR1 : EXPR2 >> (except that
866the ternary-operator form can be used as a lvalue, while C<< EXPR1 // EXPR2 >>
867cannot).  This is very useful for
868providing default values for variables.  If you actually want to test if
869at least one of C<$x> and C<$y> is defined, use C<defined($x // $y)>.
870
871The C<||>, C<//> and C<&&> operators return the last value evaluated
872(unlike C's C<||> and C<&&>, which return 0 or 1).  Thus, a reasonably
873portable way to find out the home directory might be:
874
875    $home =  $ENV{HOME}
876	  // $ENV{LOGDIR}
877	  // (getpwuid($<))[7]
878	  // die "You're homeless!\n";
879
880In particular, this means that you shouldn't use this
881for selecting between two aggregates for assignment:
882
883    @a = @b || @c;		# this is wrong
884    @a = scalar(@b) || @c;	# really meant this
885    @a = @b ? @b : @c;		# this works fine, though
886
887As alternatives to C<&&> and C<||> when used for
888control flow, Perl provides the C<and> and C<or> operators (see below).
889The short-circuit behavior is identical.  The precedence of "and"
890and "or" is much lower, however, so that you can safely use them after a
891list operator without the need for parentheses:
892
893    unlink "alpha", "beta", "gamma"
894	    or gripe(), next LINE;
895
896With the C-style operators that would have been written like this:
897
898    unlink("alpha", "beta", "gamma")
899	    || (gripe(), next LINE);
900
901It would be even more readable to write that this way:
902
903    unless(unlink("alpha", "beta", "gamma")) {
904        gripe();
905        next LINE;
906    }
907
908Using "or" for assignment is unlikely to do what you want; see below.
909
910=head2 Range Operators
911X<operator, range> X<range> X<..> X<...>
912
913Binary ".." is the range operator, which is really two different
914operators depending on the context.  In list context, it returns a
915list of values counting (up by ones) from the left value to the right
916value.  If the left value is greater than the right value then it
917returns the empty list.  The range operator is useful for writing
918C<foreach (1..10)> loops and for doing slice operations on arrays.  In
919the current implementation, no temporary array is created when the
920range operator is used as the expression in C<foreach> loops, but older
921versions of Perl might burn a lot of memory when you write something
922like this:
923
924    for (1 .. 1_000_000) {
925	# code
926    }
927
928The range operator also works on strings, using the magical
929auto-increment, see below.
930
931In scalar context, ".." returns a boolean value.  The operator is
932bistable, like a flip-flop, and emulates the line-range (comma)
933operator of B<sed>, B<awk>, and various editors.  Each ".." operator
934maintains its own boolean state, even across calls to a subroutine
935that contains it.  It is false as long as its left operand is false.
936Once the left operand is true, the range operator stays true until the
937right operand is true, I<AFTER> which the range operator becomes false
938again.  It doesn't become false till the next time the range operator
939is evaluated.  It can test the right operand and become false on the
940same evaluation it became true (as in B<awk>), but it still returns
941true once.  If you don't want it to test the right operand until the
942next evaluation, as in B<sed>, just use three dots ("...") instead of
943two.  In all other regards, "..." behaves just like ".." does.
944
945The right operand is not evaluated while the operator is in the
946"false" state, and the left operand is not evaluated while the
947operator is in the "true" state.  The precedence is a little lower
948than || and &&.  The value returned is either the empty string for
949false, or a sequence number (beginning with 1) for true.  The sequence
950number is reset for each range encountered.  The final sequence number
951in a range has the string "E0" appended to it, which doesn't affect
952its numeric value, but gives you something to search for if you want
953to exclude the endpoint.  You can exclude the beginning point by
954waiting for the sequence number to be greater than 1.
955
956If either operand of scalar ".." is a constant expression,
957that operand is considered true if it is equal (C<==>) to the current
958input line number (the C<$.> variable).
959
960To be pedantic, the comparison is actually C<int(EXPR) == int(EXPR)>,
961but that is only an issue if you use a floating point expression; when
962implicitly using C<$.> as described in the previous paragraph, the
963comparison is C<int(EXPR) == int($.)> which is only an issue when C<$.>
964is set to a floating point value and you are not reading from a file.
965Furthermore, C<"span" .. "spat"> or C<2.18 .. 3.14> will not do what
966you want in scalar context because each of the operands are evaluated
967using their integer representation.
968
969Examples:
970
971As a scalar operator:
972
973    if (101 .. 200) { print; } # print 2nd hundred lines, short for
974                               #  if ($. == 101 .. $. == 200) { print; }
975
976    next LINE if (1 .. /^$/);  # skip header lines, short for
977                               #   next LINE if ($. == 1 .. /^$/);
978                               # (typically in a loop labeled LINE)
979
980    s/^/> / if (/^$/ .. eof());  # quote body
981
982    # parse mail messages
983    while (<>) {
984        $in_header =   1  .. /^$/;
985        $in_body   = /^$/ .. eof;
986        if ($in_header) {
987            # do something
988        } else { # in body
989            # do something else
990        }
991    } continue {
992        close ARGV if eof;             # reset $. each file
993    }
994
995Here's a simple example to illustrate the difference between
996the two range operators:
997
998    @lines = ("   - Foo",
999              "01 - Bar",
1000              "1  - Baz",
1001              "   - Quux");
1002
1003    foreach (@lines) {
1004        if (/0/ .. /1/) {
1005            print "$_\n";
1006        }
1007    }
1008
1009This program will print only the line containing "Bar".  If
1010the range operator is changed to C<...>, it will also print the
1011"Baz" line.
1012
1013And now some examples as a list operator:
1014
1015    for (101 .. 200) { print }      # print $_ 100 times
1016    @foo = @foo[0 .. $#foo];        # an expensive no-op
1017    @foo = @foo[$#foo-4 .. $#foo];  # slice last 5 items
1018
1019The range operator (in list context) makes use of the magical
1020auto-increment algorithm if the operands are strings.  You
1021can say
1022
1023    @alphabet = ("A" .. "Z");
1024
1025to get all normal letters of the English alphabet, or
1026
1027    $hexdigit = (0 .. 9, "a" .. "f")[$num & 15];
1028
1029to get a hexadecimal digit, or
1030
1031    @z2 = ("01" .. "31");
1032    print $z2[$mday];
1033
1034to get dates with leading zeros.
1035
1036If the final value specified is not in the sequence that the magical
1037increment would produce, the sequence goes until the next value would
1038be longer than the final value specified.
1039
1040If the initial value specified isn't part of a magical increment
1041sequence (that is, a non-empty string matching C</^[a-zA-Z]*[0-9]*\z/>),
1042only the initial value will be returned.  So the following will only
1043return an alpha:
1044
1045    use charnames "greek";
1046    my @greek_small =  ("\N{alpha}" .. "\N{omega}");
1047
1048To get the 25 traditional lowercase Greek letters, including both sigmas,
1049you could use this instead:
1050
1051    use charnames "greek";
1052    my @greek_small =  map { chr } ( ord("\N{alpha}")
1053                                        ..
1054                                     ord("\N{omega}")
1055                                   );
1056
1057However, because there are I<many> other lowercase Greek characters than
1058just those, to match lowercase Greek characters in a regular expression,
1059you could use the pattern C</(?:(?=\p{Greek})\p{Lower})+/> (or the
1060L<experimental feature|perlrecharclass/Extended Bracketed Character
1061Classes> C<S</(?[ \p{Greek} & \p{Lower} ])+/>>).
1062
1063Because each operand is evaluated in integer form, C<2.18 .. 3.14> will
1064return two elements in list context.
1065
1066    @list = (2.18 .. 3.14); # same as @list = (2 .. 3);
1067
1068=head2 Conditional Operator
1069X<operator, conditional> X<operator, ternary> X<ternary> X<?:>
1070
1071Ternary "?:" is the conditional operator, just as in C.  It works much
1072like an if-then-else.  If the argument before the ? is true, the
1073argument before the : is returned, otherwise the argument after the :
1074is returned.  For example:
1075
1076    printf "I have %d dog%s.\n", $n,
1077	    ($n == 1) ? "" : "s";
1078
1079Scalar or list context propagates downward into the 2nd
1080or 3rd argument, whichever is selected.
1081
1082    $x = $ok ? $y : $z;  # get a scalar
1083    @x = $ok ? @y : @z;  # get an array
1084    $x = $ok ? @y : @z;  # oops, that's just a count!
1085
1086The operator may be assigned to if both the 2nd and 3rd arguments are
1087legal lvalues (meaning that you can assign to them):
1088
1089    ($x_or_y ? $x : $y) = $z;
1090
1091Because this operator produces an assignable result, using assignments
1092without parentheses will get you in trouble.  For example, this:
1093
1094    $x % 2 ? $x += 10 : $x += 2
1095
1096Really means this:
1097
1098    (($x % 2) ? ($x += 10) : $x) += 2
1099
1100Rather than this:
1101
1102    ($x % 2) ? ($x += 10) : ($x += 2)
1103
1104That should probably be written more simply as:
1105
1106    $x += ($x % 2) ? 10 : 2;
1107
1108=head2 Assignment Operators
1109X<assignment> X<operator, assignment> X<=> X<**=> X<+=> X<*=> X<&=>
1110X<<< <<= >>> X<&&=> X<-=> X</=> X<|=> X<<< >>= >>> X<||=> X<//=> X<.=>
1111X<%=> X<^=> X<x=>
1112
1113"=" is the ordinary assignment operator.
1114
1115Assignment operators work as in C.  That is,
1116
1117    $x += 2;
1118
1119is equivalent to
1120
1121    $x = $x + 2;
1122
1123although without duplicating any side effects that dereferencing the lvalue
1124might trigger, such as from tie().  Other assignment operators work similarly.
1125The following are recognized:
1126
1127    **=    +=    *=    &=    <<=    &&=
1128           -=    /=    |=    >>=    ||=
1129           .=    %=    ^=           //=
1130                 x=
1131
1132Although these are grouped by family, they all have the precedence
1133of assignment.
1134
1135Unlike in C, the scalar assignment operator produces a valid lvalue.
1136Modifying an assignment is equivalent to doing the assignment and
1137then modifying the variable that was assigned to.  This is useful
1138for modifying a copy of something, like this:
1139
1140    ($tmp = $global) =~ tr/13579/24680/;
1141
1142Although as of 5.14, that can be also be accomplished this way:
1143
1144    use v5.14;
1145    $tmp = ($global =~  tr/13579/24680/r);
1146
1147Likewise,
1148
1149    ($x += 2) *= 3;
1150
1151is equivalent to
1152
1153    $x += 2;
1154    $x *= 3;
1155
1156Similarly, a list assignment in list context produces the list of
1157lvalues assigned to, and a list assignment in scalar context returns
1158the number of elements produced by the expression on the right hand
1159side of the assignment.
1160
1161=head2 Comma Operator
1162X<comma> X<operator, comma> X<,>
1163
1164Binary "," is the comma operator.  In scalar context it evaluates
1165its left argument, throws that value away, then evaluates its right
1166argument and returns that value.  This is just like C's comma operator.
1167
1168In list context, it's just the list argument separator, and inserts
1169both its arguments into the list.  These arguments are also evaluated
1170from left to right.
1171
1172The C<< => >> operator is a synonym for the comma except that it causes a
1173word on its left to be interpreted as a string if it begins with a letter
1174or underscore and is composed only of letters, digits and underscores.
1175This includes operands that might otherwise be interpreted as operators,
1176constants, single number v-strings or function calls.  If in doubt about
1177this behavior, the left operand can be quoted explicitly.
1178
1179Otherwise, the C<< => >> operator behaves exactly as the comma operator
1180or list argument separator, according to context.
1181
1182For example:
1183
1184    use constant FOO => "something";
1185
1186    my %h = ( FOO => 23 );
1187
1188is equivalent to:
1189
1190    my %h = ("FOO", 23);
1191
1192It is I<NOT>:
1193
1194    my %h = ("something", 23);
1195
1196The C<< => >> operator is helpful in documenting the correspondence
1197between keys and values in hashes, and other paired elements in lists.
1198
1199    %hash = ( $key => $value );
1200    login( $username => $password );
1201
1202The special quoting behavior ignores precedence, and hence may apply to
1203I<part> of the left operand:
1204
1205    print time.shift => "bbb";
1206
1207That example prints something like "1314363215shiftbbb", because the
1208C<< => >> implicitly quotes the C<shift> immediately on its left, ignoring
1209the fact that C<time.shift> is the entire left operand.
1210
1211=head2 List Operators (Rightward)
1212X<operator, list, rightward> X<list operator>
1213
1214On the right side of a list operator, the comma has very low precedence,
1215such that it controls all comma-separated expressions found there.
1216The only operators with lower precedence are the logical operators
1217"and", "or", and "not", which may be used to evaluate calls to list
1218operators without the need for parentheses:
1219
1220    open HANDLE, "< :utf8", "filename" or die "Can't open: $!\n";
1221
1222However, some people find that code harder to read than writing
1223it with parentheses:
1224
1225    open(HANDLE, "< :utf8", "filename") or die "Can't open: $!\n";
1226
1227in which case you might as well just use the more customary "||" operator:
1228
1229    open(HANDLE, "< :utf8", "filename") || die "Can't open: $!\n";
1230
1231See also discussion of list operators in L<Terms and List Operators (Leftward)>.
1232
1233=head2 Logical Not
1234X<operator, logical, not> X<not>
1235
1236Unary "not" returns the logical negation of the expression to its right.
1237It's the equivalent of "!" except for the very low precedence.
1238
1239=head2 Logical And
1240X<operator, logical, and> X<and>
1241
1242Binary "and" returns the logical conjunction of the two surrounding
1243expressions.  It's equivalent to C<&&> except for the very low
1244precedence.  This means that it short-circuits: the right
1245expression is evaluated only if the left expression is true.
1246
1247=head2 Logical or and Exclusive Or
1248X<operator, logical, or> X<operator, logical, xor>
1249X<operator, logical, exclusive or>
1250X<or> X<xor>
1251
1252Binary "or" returns the logical disjunction of the two surrounding
1253expressions.  It's equivalent to C<||> except for the very low precedence.
1254This makes it useful for control flow:
1255
1256    print FH $data		or die "Can't write to FH: $!";
1257
1258This means that it short-circuits: the right expression is evaluated
1259only if the left expression is false.  Due to its precedence, you must
1260be careful to avoid using it as replacement for the C<||> operator.
1261It usually works out better for flow control than in assignments:
1262
1263    $x = $y or $z;              # bug: this is wrong
1264    ($x = $y) or $z;            # really means this
1265    $x = $y || $z;              # better written this way
1266
1267However, when it's a list-context assignment and you're trying to use
1268C<||> for control flow, you probably need "or" so that the assignment
1269takes higher precedence.
1270
1271    @info = stat($file) || die;     # oops, scalar sense of stat!
1272    @info = stat($file) or die;     # better, now @info gets its due
1273
1274Then again, you could always use parentheses.
1275
1276Binary C<xor> returns the exclusive-OR of the two surrounding expressions.
1277It cannot short-circuit (of course).
1278
1279There is no low precedence operator for defined-OR.
1280
1281=head2 C Operators Missing From Perl
1282X<operator, missing from perl> X<&> X<*>
1283X<typecasting> X<(TYPE)>
1284
1285Here is what C has that Perl doesn't:
1286
1287=over 8
1288
1289=item unary &
1290
1291Address-of operator.  (But see the "\" operator for taking a reference.)
1292
1293=item unary *
1294
1295Dereference-address operator.  (Perl's prefix dereferencing
1296operators are typed: $, @, %, and &.)
1297
1298=item (TYPE)
1299
1300Type-casting operator.
1301
1302=back
1303
1304=head2 Quote and Quote-like Operators
1305X<operator, quote> X<operator, quote-like> X<q> X<qq> X<qx> X<qw> X<m>
1306X<qr> X<s> X<tr> X<'> X<''> X<"> X<""> X<//> X<`> X<``> X<<< << >>>
1307X<escape sequence> X<escape>
1308
1309While we usually think of quotes as literal values, in Perl they
1310function as operators, providing various kinds of interpolating and
1311pattern matching capabilities.  Perl provides customary quote characters
1312for these behaviors, but also provides a way for you to choose your
1313quote character for any of them.  In the following table, a C<{}> represents
1314any pair of delimiters you choose.
1315
1316    Customary  Generic        Meaning	     Interpolates
1317	''	 q{}	      Literal		  no
1318	""	qq{}	      Literal		  yes
1319	``	qx{}	      Command		  yes*
1320		qw{}	     Word list		  no
1321	//	 m{}	   Pattern match	  yes*
1322		qr{}	      Pattern		  yes*
1323		 s{}{}	    Substitution	  yes*
1324		tr{}{}	  Transliteration	  no (but see below)
1325		 y{}{}	  Transliteration	  no (but see below)
1326        <<EOF                 here-doc            yes*
1327
1328	* unless the delimiter is ''.
1329
1330Non-bracketing delimiters use the same character fore and aft, but the four
1331sorts of ASCII brackets (round, angle, square, curly) all nest, which means
1332that
1333
1334    q{foo{bar}baz}
1335
1336is the same as
1337
1338    'foo{bar}baz'
1339
1340Note, however, that this does not always work for quoting Perl code:
1341
1342    $s = q{ if($x eq "}") ... }; # WRONG
1343
1344is a syntax error.  The C<Text::Balanced> module (standard as of v5.8,
1345and from CPAN before then) is able to do this properly.
1346
1347There can be whitespace between the operator and the quoting
1348characters, except when C<#> is being used as the quoting character.
1349C<q#foo#> is parsed as the string C<foo>, while C<q #foo#> is the
1350operator C<q> followed by a comment.  Its argument will be taken
1351from the next line.  This allows you to write:
1352
1353    s {foo}  # Replace foo
1354      {bar}  # with bar.
1355
1356The following escape sequences are available in constructs that interpolate,
1357and in transliterations:
1358X<\t> X<\n> X<\r> X<\f> X<\b> X<\a> X<\e> X<\x> X<\0> X<\c> X<\N> X<\N{}>
1359X<\o{}>
1360
1361    Sequence     Note  Description
1362    \t                  tab               (HT, TAB)
1363    \n                  newline           (NL)
1364    \r                  return            (CR)
1365    \f                  form feed         (FF)
1366    \b                  backspace         (BS)
1367    \a                  alarm (bell)      (BEL)
1368    \e                  escape            (ESC)
1369    \x{263A}     [1,8]  hex char          (example: SMILEY)
1370    \x1b         [2,8]  restricted range hex char (example: ESC)
1371    \N{name}     [3]    named Unicode character or character sequence
1372    \N{U+263D}   [4,8]  Unicode character (example: FIRST QUARTER MOON)
1373    \c[          [5]    control char      (example: chr(27))
1374    \o{23072}    [6,8]  octal char        (example: SMILEY)
1375    \033         [7,8]  restricted range octal char  (example: ESC)
1376
1377=over 4
1378
1379=item [1]
1380
1381The result is the character specified by the hexadecimal number between
1382the braces.  See L</[8]> below for details on which character.
1383
1384Only hexadecimal digits are valid between the braces.  If an invalid
1385character is encountered, a warning will be issued and the invalid
1386character and all subsequent characters (valid or invalid) within the
1387braces will be discarded.
1388
1389If there are no valid digits between the braces, the generated character is
1390the NULL character (C<\x{00}>).  However, an explicit empty brace (C<\x{}>)
1391will not cause a warning (currently).
1392
1393=item [2]
1394
1395The result is the character specified by the hexadecimal number in the range
13960x00 to 0xFF.  See L</[8]> below for details on which character.
1397
1398Only hexadecimal digits are valid following C<\x>.  When C<\x> is followed
1399by fewer than two valid digits, any valid digits will be zero-padded.  This
1400means that C<\x7> will be interpreted as C<\x07>, and a lone <\x> will be
1401interpreted as C<\x00>.  Except at the end of a string, having fewer than
1402two valid digits will result in a warning.  Note that although the warning
1403says the illegal character is ignored, it is only ignored as part of the
1404escape and will still be used as the subsequent character in the string.
1405For example:
1406
1407  Original    Result    Warns?
1408  "\x7"       "\x07"    no
1409  "\x"        "\x00"    no
1410  "\x7q"      "\x07q"   yes
1411  "\xq"       "\x00q"   yes
1412
1413=item [3]
1414
1415The result is the Unicode character or character sequence given by I<name>.
1416See L<charnames>.
1417
1418=item [4]
1419
1420C<\N{U+I<hexadecimal number>}> means the Unicode character whose Unicode code
1421point is I<hexadecimal number>.
1422
1423=item [5]
1424
1425The character following C<\c> is mapped to some other character as shown in the
1426table:
1427
1428 Sequence   Value
1429   \c@      chr(0)
1430   \cA      chr(1)
1431   \ca      chr(1)
1432   \cB      chr(2)
1433   \cb      chr(2)
1434   ...
1435   \cZ      chr(26)
1436   \cz      chr(26)
1437   \c[      chr(27)
1438   \c]      chr(29)
1439   \c^      chr(30)
1440   \c_      chr(31)
1441   \c?      chr(127) # (on ASCII platforms)
1442
1443In other words, it's the character whose code point has had 64 xor'd with
1444its uppercase.  C<\c?> is DELETE on ASCII platforms because
1445S<C<ord("?") ^ 64>> is 127, and
1446C<\c@> is NULL because the ord of "@" is 64, so xor'ing 64 itself produces 0.
1447
1448Also, C<\c\I<X>> yields C< chr(28) . "I<X>"> for any I<X>, but cannot come at the
1449end of a string, because the backslash would be parsed as escaping the end
1450quote.
1451
1452On ASCII platforms, the resulting characters from the list above are the
1453complete set of ASCII controls.  This isn't the case on EBCDIC platforms; see
1454L<perlebcdic/OPERATOR DIFFERENCES> for a full discussion of the
1455differences between these for ASCII versus EBCDIC platforms.
1456
1457Use of any other character following the C<"c"> besides those listed above is
1458discouraged, and some are deprecated with the intention of removing
1459those in a later Perl version.  What happens for any of these
1460other characters currently though, is that the value is derived by xor'ing
1461with the seventh bit, which is 64.
1462
1463To get platform independent controls, you can use C<\N{...}>.
1464
1465=item [6]
1466
1467The result is the character specified by the octal number between the braces.
1468See L</[8]> below for details on which character.
1469
1470If a character that isn't an octal digit is encountered, a warning is raised,
1471and the value is based on the octal digits before it, discarding it and all
1472following characters up to the closing brace.  It is a fatal error if there are
1473no octal digits at all.
1474
1475=item [7]
1476
1477The result is the character specified by the three-digit octal number in the
1478range 000 to 777 (but best to not use above 077, see next paragraph).  See
1479L</[8]> below for details on which character.
1480
1481Some contexts allow 2 or even 1 digit, but any usage without exactly
1482three digits, the first being a zero, may give unintended results.  (For
1483example, in a regular expression it may be confused with a backreference;
1484see L<perlrebackslash/Octal escapes>.)  Starting in Perl 5.14, you may
1485use C<\o{}> instead, which avoids all these problems.  Otherwise, it is best to
1486use this construct only for ordinals C<\077> and below, remembering to pad to
1487the left with zeros to make three digits.  For larger ordinals, either use
1488C<\o{}>, or convert to something else, such as to hex and use C<\x{}>
1489instead.
1490
1491=item [8]
1492
1493Several constructs above specify a character by a number.  That number
1494gives the character's position in the character set encoding (indexed from 0).
1495This is called synonymously its ordinal, code position, or code point.  Perl
1496works on platforms that have a native encoding currently of either ASCII/Latin1
1497or EBCDIC, each of which allow specification of 256 characters.  In general, if
1498the number is 255 (0xFF, 0377) or below, Perl interprets this in the platform's
1499native encoding.  If the number is 256 (0x100, 0400) or above, Perl interprets
1500it as a Unicode code point and the result is the corresponding Unicode
1501character.  For example C<\x{50}> and C<\o{120}> both are the number 80 in
1502decimal, which is less than 256, so the number is interpreted in the native
1503character set encoding.  In ASCII the character in the 80th position (indexed
1504from 0) is the letter "P", and in EBCDIC it is the ampersand symbol "&".
1505C<\x{100}> and C<\o{400}> are both 256 in decimal, so the number is interpreted
1506as a Unicode code point no matter what the native encoding is.  The name of the
1507character in the 256th position (indexed by 0) in Unicode is
1508C<LATIN CAPITAL LETTER A WITH MACRON>.
1509
1510There are a couple of exceptions to the above rule.  S<C<\N{U+I<hex number>}>> is
1511always interpreted as a Unicode code point, so that C<\N{U+0050}> is "P" even
1512on EBCDIC platforms.  And if L<C<S<use encoding>>|encoding> is in effect, the
1513number is considered to be in that encoding, and is translated from that into
1514the platform's native encoding if there is a corresponding native character;
1515otherwise to Unicode.
1516
1517=back
1518
1519B<NOTE>: Unlike C and other languages, Perl has no C<\v> escape sequence for
1520the vertical tab (VT, which is 11 in both ASCII and EBCDIC), but you may
1521use C<\ck> or
1522C<\x0b>.  (C<\v>
1523does have meaning in regular expression patterns in Perl, see L<perlre>.)
1524
1525The following escape sequences are available in constructs that interpolate,
1526but not in transliterations.
1527X<\l> X<\u> X<\L> X<\U> X<\E> X<\Q> X<\F>
1528
1529    \l		lowercase next character only
1530    \u		titlecase (not uppercase!) next character only
1531    \L		lowercase all characters till \E or end of string
1532    \U		uppercase all characters till \E or end of string
1533    \F		foldcase all characters till \E or end of string
1534    \Q          quote (disable) pattern metacharacters till \E or
1535                end of string
1536    \E		end either case modification or quoted section
1537		(whichever was last seen)
1538
1539See L<perlfunc/quotemeta> for the exact definition of characters that
1540are quoted by C<\Q>.
1541
1542C<\L>, C<\U>, C<\F>, and C<\Q> can stack, in which case you need one
1543C<\E> for each.  For example:
1544
1545 say"This \Qquoting \ubusiness \Uhere isn't quite\E done yet,\E is it?";
1546 This quoting\ Business\ HERE\ ISN\'T\ QUITE\ done\ yet\, is it?
1547
1548If C<use locale> is in effect (but not C<use locale ':not_characters'>),
1549the case map used by C<\l>, C<\L>,
1550C<\u>, and C<\U> is taken from the current locale.  See L<perllocale>.
1551If Unicode (for example, C<\N{}> or code points of 0x100 or
1552beyond) is being used, the case map used by C<\l>, C<\L>, C<\u>, and
1553C<\U> is as defined by Unicode.  That means that case-mapping
1554a single character can sometimes produce several characters.
1555Under C<use locale>, C<\F> produces the same results as C<\L>
1556for all locales but a UTF-8 one, where it instead uses the Unicode
1557definition.
1558
1559All systems use the virtual C<"\n"> to represent a line terminator,
1560called a "newline".  There is no such thing as an unvarying, physical
1561newline character.  It is only an illusion that the operating system,
1562device drivers, C libraries, and Perl all conspire to preserve.  Not all
1563systems read C<"\r"> as ASCII CR and C<"\n"> as ASCII LF.  For example,
1564on the ancient Macs (pre-MacOS X) of yesteryear, these used to be reversed,
1565and on systems without line terminator,
1566printing C<"\n"> might emit no actual data.  In general, use C<"\n"> when
1567you mean a "newline" for your system, but use the literal ASCII when you
1568need an exact character.  For example, most networking protocols expect
1569and prefer a CR+LF (C<"\015\012"> or C<"\cM\cJ">) for line terminators,
1570and although they often accept just C<"\012">, they seldom tolerate just
1571C<"\015">.  If you get in the habit of using C<"\n"> for networking,
1572you may be burned some day.
1573X<newline> X<line terminator> X<eol> X<end of line>
1574X<\r>
1575
1576For constructs that do interpolate, variables beginning with "C<$>"
1577or "C<@>" are interpolated.  Subscripted variables such as C<$a[3]> or
1578C<< $href->{key}[0] >> are also interpolated, as are array and hash slices.
1579But method calls such as C<< $obj->meth >> are not.
1580
1581Interpolating an array or slice interpolates the elements in order,
1582separated by the value of C<$">, so is equivalent to interpolating
1583C<join $", @array>.  "Punctuation" arrays such as C<@*> are usually
1584interpolated only if the name is enclosed in braces C<@{*}>, but the
1585arrays C<@_>, C<@+>, and C<@-> are interpolated even without braces.
1586
1587For double-quoted strings, the quoting from C<\Q> is applied after
1588interpolation and escapes are processed.
1589
1590    "abc\Qfoo\tbar$s\Exyz"
1591
1592is equivalent to
1593
1594    "abc" . quotemeta("foo\tbar$s") . "xyz"
1595
1596For the pattern of regex operators (C<qr//>, C<m//> and C<s///>),
1597the quoting from C<\Q> is applied after interpolation is processed,
1598but before escapes are processed.  This allows the pattern to match
1599literally (except for C<$> and C<@>).  For example, the following matches:
1600
1601    '\s\t' =~ /\Q\s\t/
1602
1603Because C<$> or C<@> trigger interpolation, you'll need to use something
1604like C</\Quser\E\@\Qhost/> to match them literally.
1605
1606Patterns are subject to an additional level of interpretation as a
1607regular expression.  This is done as a second pass, after variables are
1608interpolated, so that regular expressions may be incorporated into the
1609pattern from the variables.  If this is not what you want, use C<\Q> to
1610interpolate a variable literally.
1611
1612Apart from the behavior described above, Perl does not expand
1613multiple levels of interpolation.  In particular, contrary to the
1614expectations of shell programmers, back-quotes do I<NOT> interpolate
1615within double quotes, nor do single quotes impede evaluation of
1616variables when used within double quotes.
1617
1618=head2 Regexp Quote-Like Operators
1619X<operator, regexp>
1620
1621Here are the quote-like operators that apply to pattern
1622matching and related activities.
1623
1624=over 8
1625
1626=item qr/STRING/msixpodual
1627X<qr> X</i> X</m> X</o> X</s> X</x> X</p>
1628
1629This operator quotes (and possibly compiles) its I<STRING> as a regular
1630expression.  I<STRING> is interpolated the same way as I<PATTERN>
1631in C<m/PATTERN/>.  If "'" is used as the delimiter, no interpolation
1632is done.  Returns a Perl value which may be used instead of the
1633corresponding C</STRING/msixpodual> expression.  The returned value is a
1634normalized version of the original pattern.  It magically differs from
1635a string containing the same characters: C<ref(qr/x/)> returns "Regexp";
1636however, dereferencing it is not well defined (you currently get the
1637normalized version of the original pattern, but this may change).
1638
1639
1640For example,
1641
1642    $rex = qr/my.STRING/is;
1643    print $rex;                 # prints (?si-xm:my.STRING)
1644    s/$rex/foo/;
1645
1646is equivalent to
1647
1648    s/my.STRING/foo/is;
1649
1650The result may be used as a subpattern in a match:
1651
1652    $re = qr/$pattern/;
1653    $string =~ /foo${re}bar/;	# can be interpolated in other
1654                                # patterns
1655    $string =~ $re;		# or used standalone
1656    $string =~ /$re/;		# or this way
1657
1658Since Perl may compile the pattern at the moment of execution of the qr()
1659operator, using qr() may have speed advantages in some situations,
1660notably if the result of qr() is used standalone:
1661
1662    sub match {
1663	my $patterns = shift;
1664	my @compiled = map qr/$_/i, @$patterns;
1665	grep {
1666	    my $success = 0;
1667	    foreach my $pat (@compiled) {
1668		$success = 1, last if /$pat/;
1669	    }
1670	    $success;
1671	} @_;
1672    }
1673
1674Precompilation of the pattern into an internal representation at
1675the moment of qr() avoids a need to recompile the pattern every
1676time a match C</$pat/> is attempted.  (Perl has many other internal
1677optimizations, but none would be triggered in the above example if
1678we did not use qr() operator.)
1679
1680Options (specified by the following modifiers) are:
1681
1682    m	Treat string as multiple lines.
1683    s	Treat string as single line. (Make . match a newline)
1684    i	Do case-insensitive pattern matching.
1685    x	Use extended regular expressions.
1686    p	When matching preserve a copy of the matched string so
1687        that ${^PREMATCH}, ${^MATCH}, ${^POSTMATCH} will be
1688        defined.
1689    o	Compile pattern only once.
1690    a   ASCII-restrict: Use ASCII for \d, \s, \w; specifying two
1691        a's further restricts /i matching so that no ASCII
1692        character will match a non-ASCII one.
1693    l   Use the locale.
1694    u   Use Unicode rules.
1695    d   Use Unicode or native charset, as in 5.12 and earlier.
1696
1697If a precompiled pattern is embedded in a larger pattern then the effect
1698of "msixpluad" will be propagated appropriately.  The effect the "o"
1699modifier has is not propagated, being restricted to those patterns
1700explicitly using it.
1701
1702The last four modifiers listed above, added in Perl 5.14,
1703control the character set rules, but C</a> is the only one you are likely
1704to want to specify explicitly; the other three are selected
1705automatically by various pragmas.
1706
1707See L<perlre> for additional information on valid syntax for STRING, and
1708for a detailed look at the semantics of regular expressions.  In
1709particular, all modifiers except the largely obsolete C</o> are further
1710explained in L<perlre/Modifiers>.  C</o> is described in the next section.
1711
1712=item m/PATTERN/msixpodualgc
1713X<m> X<operator, match>
1714X<regexp, options> X<regexp> X<regex, options> X<regex>
1715X</m> X</s> X</i> X</x> X</p> X</o> X</g> X</c>
1716
1717=item /PATTERN/msixpodualgc
1718
1719Searches a string for a pattern match, and in scalar context returns
1720true if it succeeds, false if it fails.  If no string is specified
1721via the C<=~> or C<!~> operator, the $_ string is searched.  (The
1722string specified with C<=~> need not be an lvalue--it may be the
1723result of an expression evaluation, but remember the C<=~> binds
1724rather tightly.)  See also L<perlre>.
1725
1726Options are as described in C<qr//> above; in addition, the following match
1727process modifiers are available:
1728
1729 g  Match globally, i.e., find all occurrences.
1730 c  Do not reset search position on a failed match when /g is
1731    in effect.
1732
1733If "/" is the delimiter then the initial C<m> is optional.  With the C<m>
1734you can use any pair of non-whitespace (ASCII) characters
1735as delimiters.  This is particularly useful for matching path names
1736that contain "/", to avoid LTS (leaning toothpick syndrome).  If "?" is
1737the delimiter, then a match-only-once rule applies,
1738described in C<m?PATTERN?> below.  If "'" (single quote) is the delimiter,
1739no interpolation is performed on the PATTERN.
1740When using a character valid in an identifier, whitespace is required
1741after the C<m>.
1742
1743PATTERN may contain variables, which will be interpolated
1744every time the pattern search is evaluated, except
1745for when the delimiter is a single quote.  (Note that C<$(>, C<$)>, and
1746C<$|> are not interpolated because they look like end-of-string tests.)
1747Perl will not recompile the pattern unless an interpolated
1748variable that it contains changes.  You can force Perl to skip the
1749test and never recompile by adding a C</o> (which stands for "once")
1750after the trailing delimiter.
1751Once upon a time, Perl would recompile regular expressions
1752unnecessarily, and this modifier was useful to tell it not to do so, in the
1753interests of speed.  But now, the only reasons to use C</o> are one of:
1754
1755=over
1756
1757=item 1
1758
1759The variables are thousands of characters long and you know that they
1760don't change, and you need to wring out the last little bit of speed by
1761having Perl skip testing for that.  (There is a maintenance penalty for
1762doing this, as mentioning C</o> constitutes a promise that you won't
1763change the variables in the pattern.  If you do change them, Perl won't
1764even notice.)
1765
1766=item 2
1767
1768you want the pattern to use the initial values of the variables
1769regardless of whether they change or not.  (But there are saner ways
1770of accomplishing this than using C</o>.)
1771
1772=item 3
1773
1774If the pattern contains embedded code, such as
1775
1776    use re 'eval';
1777    $code = 'foo(?{ $x })';
1778    /$code/
1779
1780then perl will recompile each time, even though the pattern string hasn't
1781changed, to ensure that the current value of C<$x> is seen each time.
1782Use C</o> if you want to avoid this.
1783
1784=back
1785
1786The bottom line is that using C</o> is almost never a good idea.
1787
1788=item The empty pattern //
1789
1790If the PATTERN evaluates to the empty string, the last
1791I<successfully> matched regular expression is used instead.  In this
1792case, only the C<g> and C<c> flags on the empty pattern are honored;
1793the other flags are taken from the original pattern.  If no match has
1794previously succeeded, this will (silently) act instead as a genuine
1795empty pattern (which will always match).
1796
1797Note that it's possible to confuse Perl into thinking C<//> (the empty
1798regex) is really C<//> (the defined-or operator).  Perl is usually pretty
1799good about this, but some pathological cases might trigger this, such as
1800C<$x///> (is that C<($x) / (//)> or C<$x // />?) and C<print $fh //>
1801(C<print $fh(//> or C<print($fh //>?).  In all of these examples, Perl
1802will assume you meant defined-or.  If you meant the empty regex, just
1803use parentheses or spaces to disambiguate, or even prefix the empty
1804regex with an C<m> (so C<//> becomes C<m//>).
1805
1806=item Matching in list context
1807
1808If the C</g> option is not used, C<m//> in list context returns a
1809list consisting of the subexpressions matched by the parentheses in the
1810pattern, that is, (C<$1>, C<$2>, C<$3>...)  (Note that here C<$1> etc. are
1811also set).  When there are no parentheses in the pattern, the return
1812value is the list C<(1)> for success.
1813With or without parentheses, an empty list is returned upon failure.
1814
1815Examples:
1816
1817 open(TTY, "+</dev/tty")
1818    || die "can't access /dev/tty: $!";
1819
1820 <TTY> =~ /^y/i && foo();	# do foo if desired
1821
1822 if (/Version: *([0-9.]*)/) { $version = $1; }
1823
1824 next if m#^/usr/spool/uucp#;
1825
1826 # poor man's grep
1827 $arg = shift;
1828 while (<>) {
1829    print if /$arg/o; # compile only once (no longer needed!)
1830 }
1831
1832 if (($F1, $F2, $Etc) = ($foo =~ /^(\S+)\s+(\S+)\s*(.*)/))
1833
1834This last example splits $foo into the first two words and the
1835remainder of the line, and assigns those three fields to $F1, $F2, and
1836$Etc.  The conditional is true if any variables were assigned; that is,
1837if the pattern matched.
1838
1839The C</g> modifier specifies global pattern matching--that is,
1840matching as many times as possible within the string.  How it behaves
1841depends on the context.  In list context, it returns a list of the
1842substrings matched by any capturing parentheses in the regular
1843expression.  If there are no parentheses, it returns a list of all
1844the matched strings, as if there were parentheses around the whole
1845pattern.
1846
1847In scalar context, each execution of C<m//g> finds the next match,
1848returning true if it matches, and false if there is no further match.
1849The position after the last match can be read or set using the C<pos()>
1850function; see L<perlfunc/pos>.  A failed match normally resets the
1851search position to the beginning of the string, but you can avoid that
1852by adding the C</c> modifier (for example, C<m//gc>).  Modifying the target
1853string also resets the search position.
1854
1855=item \G assertion
1856
1857You can intermix C<m//g> matches with C<m/\G.../g>, where C<\G> is a
1858zero-width assertion that matches the exact position where the
1859previous C<m//g>, if any, left off.  Without the C</g> modifier, the
1860C<\G> assertion still anchors at C<pos()> as it was at the start of
1861the operation (see L<perlfunc/pos>), but the match is of course only
1862attempted once.  Using C<\G> without C</g> on a target string that has
1863not previously had a C</g> match applied to it is the same as using
1864the C<\A> assertion to match the beginning of the string.  Note also
1865that, currently, C<\G> is only properly supported when anchored at the
1866very beginning of the pattern.
1867
1868Examples:
1869
1870    # list context
1871    ($one,$five,$fifteen) = (`uptime` =~ /(\d+\.\d+)/g);
1872
1873    # scalar context
1874    local $/ = "";
1875    while ($paragraph = <>) {
1876	while ($paragraph =~ /\p{Ll}['")]*[.!?]+['")]*\s/g) {
1877	    $sentences++;
1878	}
1879    }
1880    say $sentences;
1881
1882Here's another way to check for sentences in a paragraph:
1883
1884 my $sentence_rx = qr{
1885    (?: (?<= ^ ) | (?<= \s ) )  # after start-of-string or
1886                                # whitespace
1887    \p{Lu}                      # capital letter
1888    .*?                         # a bunch of anything
1889    (?<= \S )                   # that ends in non-
1890                                # whitespace
1891    (?<! \b [DMS]r  )           # but isn't a common abbr.
1892    (?<! \b Mrs )
1893    (?<! \b Sra )
1894    (?<! \b St  )
1895    [.?!]                       # followed by a sentence
1896                                # ender
1897    (?= $ | \s )                # in front of end-of-string
1898                                # or whitespace
1899 }sx;
1900 local $/ = "";
1901 while (my $paragraph = <>) {
1902    say "NEW PARAGRAPH";
1903    my $count = 0;
1904    while ($paragraph =~ /($sentence_rx)/g) {
1905        printf "\tgot sentence %d: <%s>\n", ++$count, $1;
1906    }
1907 }
1908
1909Here's how to use C<m//gc> with C<\G>:
1910
1911    $_ = "ppooqppqq";
1912    while ($i++ < 2) {
1913        print "1: '";
1914        print $1 while /(o)/gc; print "', pos=", pos, "\n";
1915        print "2: '";
1916        print $1 if /\G(q)/gc;  print "', pos=", pos, "\n";
1917        print "3: '";
1918        print $1 while /(p)/gc; print "', pos=", pos, "\n";
1919    }
1920    print "Final: '$1', pos=",pos,"\n" if /\G(.)/;
1921
1922The last example should print:
1923
1924    1: 'oo', pos=4
1925    2: 'q', pos=5
1926    3: 'pp', pos=7
1927    1: '', pos=7
1928    2: 'q', pos=8
1929    3: '', pos=8
1930    Final: 'q', pos=8
1931
1932Notice that the final match matched C<q> instead of C<p>, which a match
1933without the C<\G> anchor would have done.  Also note that the final match
1934did not update C<pos>.  C<pos> is only updated on a C</g> match.  If the
1935final match did indeed match C<p>, it's a good bet that you're running a
1936very old (pre-5.6.0) version of Perl.
1937
1938A useful idiom for C<lex>-like scanners is C</\G.../gc>.  You can
1939combine several regexps like this to process a string part-by-part,
1940doing different actions depending on which regexp matched.  Each
1941regexp tries to match where the previous one leaves off.
1942
1943 $_ = <<'EOL';
1944    $url = URI::URL->new( "http://example.com/" );
1945    die if $url eq "xXx";
1946 EOL
1947
1948 LOOP: {
1949     print(" digits"),       redo LOOP if /\G\d+\b[,.;]?\s*/gc;
1950     print(" lowercase"),    redo LOOP
1951                                    if /\G\p{Ll}+\b[,.;]?\s*/gc;
1952     print(" UPPERCASE"),    redo LOOP
1953                                    if /\G\p{Lu}+\b[,.;]?\s*/gc;
1954     print(" Capitalized"),  redo LOOP
1955                              if /\G\p{Lu}\p{Ll}+\b[,.;]?\s*/gc;
1956     print(" MiXeD"),        redo LOOP if /\G\pL+\b[,.;]?\s*/gc;
1957     print(" alphanumeric"), redo LOOP
1958                            if /\G[\p{Alpha}\pN]+\b[,.;]?\s*/gc;
1959     print(" line-noise"),   redo LOOP if /\G\W+/gc;
1960     print ". That's all!\n";
1961 }
1962
1963Here is the output (split into several lines):
1964
1965 line-noise lowercase line-noise UPPERCASE line-noise UPPERCASE
1966 line-noise lowercase line-noise lowercase line-noise lowercase
1967 lowercase line-noise lowercase lowercase line-noise lowercase
1968 lowercase line-noise MiXeD line-noise. That's all!
1969
1970=item m?PATTERN?msixpodualgc
1971X<?> X<operator, match-once>
1972
1973=item ?PATTERN?msixpodualgc
1974
1975This is just like the C<m/PATTERN/> search, except that it matches
1976only once between calls to the reset() operator.  This is a useful
1977optimization when you want to see only the first occurrence of
1978something in each file of a set of files, for instance.  Only C<m??>
1979patterns local to the current package are reset.
1980
1981    while (<>) {
1982	if (m?^$?) {
1983			    # blank line between header and body
1984	}
1985    } continue {
1986	reset if eof;	    # clear m?? status for next file
1987    }
1988
1989Another example switched the first "latin1" encoding it finds
1990to "utf8" in a pod file:
1991
1992    s//utf8/ if m? ^ =encoding \h+ \K latin1 ?x;
1993
1994The match-once behavior is controlled by the match delimiter being
1995C<?>; with any other delimiter this is the normal C<m//> operator.
1996
1997For historical reasons, the leading C<m> in C<m?PATTERN?> is optional,
1998but the resulting C<?PATTERN?> syntax is deprecated, will warn on
1999usage and might be removed from a future stable release of Perl (without
2000further notice!).
2001
2002=item s/PATTERN/REPLACEMENT/msixpodualgcer
2003X<substitute> X<substitution> X<replace> X<regexp, replace>
2004X<regexp, substitute> X</m> X</s> X</i> X</x> X</p> X</o> X</g> X</c> X</e> X</r>
2005
2006Searches a string for a pattern, and if found, replaces that pattern
2007with the replacement text and returns the number of substitutions
2008made.  Otherwise it returns false (specifically, the empty string).
2009
2010If the C</r> (non-destructive) option is used then it runs the
2011substitution on a copy of the string and instead of returning the
2012number of substitutions, it returns the copy whether or not a
2013substitution occurred.  The original string is never changed when
2014C</r> is used.  The copy will always be a plain string, even if the
2015input is an object or a tied variable.
2016
2017If no string is specified via the C<=~> or C<!~> operator, the C<$_>
2018variable is searched and modified.  Unless the C</r> option is used,
2019the string specified must be a scalar variable, an array element, a
2020hash element, or an assignment to one of those; that is, some sort of
2021scalar lvalue.
2022
2023If the delimiter chosen is a single quote, no interpolation is
2024done on either the PATTERN or the REPLACEMENT.  Otherwise, if the
2025PATTERN contains a $ that looks like a variable rather than an
2026end-of-string test, the variable will be interpolated into the pattern
2027at run-time.  If you want the pattern compiled only once the first time
2028the variable is interpolated, use the C</o> option.  If the pattern
2029evaluates to the empty string, the last successfully executed regular
2030expression is used instead.  See L<perlre> for further explanation on these.
2031
2032Options are as with m// with the addition of the following replacement
2033specific options:
2034
2035    e	Evaluate the right side as an expression.
2036    ee  Evaluate the right side as a string then eval the
2037        result.
2038    r   Return substitution and leave the original string
2039        untouched.
2040
2041Any non-whitespace delimiter may replace the slashes.  Add space after
2042the C<s> when using a character allowed in identifiers.  If single quotes
2043are used, no interpretation is done on the replacement string (the C</e>
2044modifier overrides this, however).  Note that Perl treats backticks
2045as normal delimiters; the replacement text is not evaluated as a command.
2046If the PATTERN is delimited by bracketing quotes, the REPLACEMENT has
2047its own pair of quotes, which may or may not be bracketing quotes, for example,
2048C<s(foo)(bar)> or C<< s<foo>/bar/ >>.  A C</e> will cause the
2049replacement portion to be treated as a full-fledged Perl expression
2050and evaluated right then and there.  It is, however, syntax checked at
2051compile-time.  A second C<e> modifier will cause the replacement portion
2052to be C<eval>ed before being run as a Perl expression.
2053
2054Examples:
2055
2056    s/\bgreen\b/mauve/g;	      # don't change wintergreen
2057
2058    $path =~ s|/usr/bin|/usr/local/bin|;
2059
2060    s/Login: $foo/Login: $bar/; # run-time pattern
2061
2062    ($foo = $bar) =~ s/this/that/;	# copy first, then
2063                                        # change
2064    ($foo = "$bar") =~ s/this/that/;	# convert to string,
2065                                        # copy, then change
2066    $foo = $bar =~ s/this/that/r;	# Same as above using /r
2067    $foo = $bar =~ s/this/that/r
2068                =~ s/that/the other/r;	# Chained substitutes
2069                                        # using /r
2070    @foo = map { s/this/that/r } @bar	# /r is very useful in
2071                                        # maps
2072
2073    $count = ($paragraph =~ s/Mister\b/Mr./g);  # get change-cnt
2074
2075    $_ = 'abc123xyz';
2076    s/\d+/$&*2/e;		# yields 'abc246xyz'
2077    s/\d+/sprintf("%5d",$&)/e;	# yields 'abc  246xyz'
2078    s/\w/$& x 2/eg;		# yields 'aabbcc  224466xxyyzz'
2079
2080    s/%(.)/$percent{$1}/g;	# change percent escapes; no /e
2081    s/%(.)/$percent{$1} || $&/ge;	# expr now, so /e
2082    s/^=(\w+)/pod($1)/ge;	# use function call
2083
2084    $_ = 'abc123xyz';
2085    $x = s/abc/def/r;           # $x is 'def123xyz' and
2086                                # $_ remains 'abc123xyz'.
2087
2088    # expand variables in $_, but dynamics only, using
2089    # symbolic dereferencing
2090    s/\$(\w+)/${$1}/g;
2091
2092    # Add one to the value of any numbers in the string
2093    s/(\d+)/1 + $1/eg;
2094
2095    # Titlecase words in the last 30 characters only
2096    substr($str, -30) =~ s/\b(\p{Alpha}+)\b/\u\L$1/g;
2097
2098    # This will expand any embedded scalar variable
2099    # (including lexicals) in $_ : First $1 is interpolated
2100    # to the variable name, and then evaluated
2101    s/(\$\w+)/$1/eeg;
2102
2103    # Delete (most) C comments.
2104    $program =~ s {
2105	/\*	# Match the opening delimiter.
2106	.*?	# Match a minimal number of characters.
2107	\*/	# Match the closing delimiter.
2108    } []gsx;
2109
2110    s/^\s*(.*?)\s*$/$1/;	# trim whitespace in $_,
2111                                # expensively
2112
2113    for ($variable) {		# trim whitespace in $variable,
2114                                # cheap
2115	s/^\s+//;
2116	s/\s+$//;
2117    }
2118
2119    s/([^ ]*) *([^ ]*)/$2 $1/;	# reverse 1st two fields
2120
2121Note the use of $ instead of \ in the last example.  Unlike
2122B<sed>, we use the \<I<digit>> form in only the left hand side.
2123Anywhere else it's $<I<digit>>.
2124
2125Occasionally, you can't use just a C</g> to get all the changes
2126to occur that you might want.  Here are two common cases:
2127
2128    # put commas in the right places in an integer
2129    1 while s/(\d)(\d\d\d)(?!\d)/$1,$2/g;
2130
2131    # expand tabs to 8-column spacing
2132    1 while s/\t+/' ' x (length($&)*8 - length($`)%8)/e;
2133
2134=back
2135
2136=head2 Quote-Like Operators
2137X<operator, quote-like>
2138
2139=over 4
2140
2141=item q/STRING/
2142X<q> X<quote, single> X<'> X<''>
2143
2144=item 'STRING'
2145
2146A single-quoted, literal string.  A backslash represents a backslash
2147unless followed by the delimiter or another backslash, in which case
2148the delimiter or backslash is interpolated.
2149
2150    $foo = q!I said, "You said, 'She said it.'"!;
2151    $bar = q('This is it.');
2152    $baz = '\n';		# a two-character string
2153
2154=item qq/STRING/
2155X<qq> X<quote, double> X<"> X<"">
2156
2157=item "STRING"
2158
2159A double-quoted, interpolated string.
2160
2161    $_ .= qq
2162     (*** The previous line contains the naughty word "$1".\n)
2163		if /\b(tcl|java|python)\b/i;      # :-)
2164    $baz = "\n";		# a one-character string
2165
2166=item qx/STRING/
2167X<qx> X<`> X<``> X<backtick>
2168
2169=item `STRING`
2170
2171A string which is (possibly) interpolated and then executed as a
2172system command with F</bin/sh> or its equivalent.  Shell wildcards,
2173pipes, and redirections will be honored.  The collected standard
2174output of the command is returned; standard error is unaffected.  In
2175scalar context, it comes back as a single (potentially multi-line)
2176string, or undef if the command failed.  In list context, returns a
2177list of lines (however you've defined lines with $/ or
2178$INPUT_RECORD_SEPARATOR), or an empty list if the command failed.
2179
2180Because backticks do not affect standard error, use shell file descriptor
2181syntax (assuming the shell supports this) if you care to address this.
2182To capture a command's STDERR and STDOUT together:
2183
2184    $output = `cmd 2>&1`;
2185
2186To capture a command's STDOUT but discard its STDERR:
2187
2188    $output = `cmd 2>/dev/null`;
2189
2190To capture a command's STDERR but discard its STDOUT (ordering is
2191important here):
2192
2193    $output = `cmd 2>&1 1>/dev/null`;
2194
2195To exchange a command's STDOUT and STDERR in order to capture the STDERR
2196but leave its STDOUT to come out the old STDERR:
2197
2198    $output = `cmd 3>&1 1>&2 2>&3 3>&-`;
2199
2200To read both a command's STDOUT and its STDERR separately, it's easiest
2201to redirect them separately to files, and then read from those files
2202when the program is done:
2203
2204    system("program args 1>program.stdout 2>program.stderr");
2205
2206The STDIN filehandle used by the command is inherited from Perl's STDIN.
2207For example:
2208
2209    open(SPLAT, "stuff")   || die "can't open stuff: $!";
2210    open(STDIN, "<&SPLAT") || die "can't dupe SPLAT: $!";
2211    print STDOUT `sort`;
2212
2213will print the sorted contents of the file named F<"stuff">.
2214
2215Using single-quote as a delimiter protects the command from Perl's
2216double-quote interpolation, passing it on to the shell instead:
2217
2218    $perl_info  = qx(ps $$);            # that's Perl's $$
2219    $shell_info = qx'ps $$';            # that's the new shell's $$
2220
2221How that string gets evaluated is entirely subject to the command
2222interpreter on your system.  On most platforms, you will have to protect
2223shell metacharacters if you want them treated literally.  This is in
2224practice difficult to do, as it's unclear how to escape which characters.
2225See L<perlsec> for a clean and safe example of a manual fork() and exec()
2226to emulate backticks safely.
2227
2228On some platforms (notably DOS-like ones), the shell may not be
2229capable of dealing with multiline commands, so putting newlines in
2230the string may not get you what you want.  You may be able to evaluate
2231multiple commands in a single line by separating them with the command
2232separator character, if your shell supports that (for example, C<;> on
2233many Unix shells and C<&> on the Windows NT C<cmd> shell).
2234
2235Perl will attempt to flush all files opened for
2236output before starting the child process, but this may not be supported
2237on some platforms (see L<perlport>).  To be safe, you may need to set
2238C<$|> ($AUTOFLUSH in English) or call the C<autoflush()> method of
2239C<IO::Handle> on any open handles.
2240
2241Beware that some command shells may place restrictions on the length
2242of the command line.  You must ensure your strings don't exceed this
2243limit after any necessary interpolations.  See the platform-specific
2244release notes for more details about your particular environment.
2245
2246Using this operator can lead to programs that are difficult to port,
2247because the shell commands called vary between systems, and may in
2248fact not be present at all.  As one example, the C<type> command under
2249the POSIX shell is very different from the C<type> command under DOS.
2250That doesn't mean you should go out of your way to avoid backticks
2251when they're the right way to get something done.  Perl was made to be
2252a glue language, and one of the things it glues together is commands.
2253Just understand what you're getting yourself into.
2254
2255See L</"I/O Operators"> for more discussion.
2256
2257=item qw/STRING/
2258X<qw> X<quote, list> X<quote, words>
2259
2260Evaluates to a list of the words extracted out of STRING, using embedded
2261whitespace as the word delimiters.  It can be understood as being roughly
2262equivalent to:
2263
2264    split(" ", q/STRING/);
2265
2266the differences being that it generates a real list at compile time, and
2267in scalar context it returns the last element in the list.  So
2268this expression:
2269
2270    qw(foo bar baz)
2271
2272is semantically equivalent to the list:
2273
2274    "foo", "bar", "baz"
2275
2276Some frequently seen examples:
2277
2278    use POSIX qw( setlocale localeconv )
2279    @EXPORT = qw( foo bar baz );
2280
2281A common mistake is to try to separate the words with comma or to
2282put comments into a multi-line C<qw>-string.  For this reason, the
2283C<use warnings> pragma and the B<-w> switch (that is, the C<$^W> variable)
2284produces warnings if the STRING contains the "," or the "#" character.
2285
2286=item tr/SEARCHLIST/REPLACEMENTLIST/cdsr
2287X<tr> X<y> X<transliterate> X</c> X</d> X</s>
2288
2289=item y/SEARCHLIST/REPLACEMENTLIST/cdsr
2290
2291Transliterates all occurrences of the characters found in the search list
2292with the corresponding character in the replacement list.  It returns
2293the number of characters replaced or deleted.  If no string is
2294specified via the C<=~> or C<!~> operator, the $_ string is transliterated.
2295
2296If the C</r> (non-destructive) option is present, a new copy of the string
2297is made and its characters transliterated, and this copy is returned no
2298matter whether it was modified or not: the original string is always
2299left unchanged.  The new copy is always a plain string, even if the input
2300string is an object or a tied variable.
2301
2302Unless the C</r> option is used, the string specified with C<=~> must be a
2303scalar variable, an array element, a hash element, or an assignment to one
2304of those; in other words, an lvalue.
2305
2306A character range may be specified with a hyphen, so C<tr/A-J/0-9/>
2307does the same replacement as C<tr/ACEGIBDFHJ/0246813579/>.
2308For B<sed> devotees, C<y> is provided as a synonym for C<tr>.  If the
2309SEARCHLIST is delimited by bracketing quotes, the REPLACEMENTLIST has
2310its own pair of quotes, which may or may not be bracketing quotes;
2311for example, C<tr[aeiouy][yuoiea]> or C<tr(+\-*/)/ABCD/>.
2312
2313Note that C<tr> does B<not> do regular expression character classes such as
2314C<\d> or C<\pL>.  The C<tr> operator is not equivalent to the tr(1)
2315utility.  If you want to map strings between lower/upper cases, see
2316L<perlfunc/lc> and L<perlfunc/uc>, and in general consider using the C<s>
2317operator if you need regular expressions.  The C<\U>, C<\u>, C<\L>, and
2318C<\l> string-interpolation escapes on the right side of a substitution
2319operator will perform correct case-mappings, but C<tr[a-z][A-Z]> will not
2320(except sometimes on legacy 7-bit data).
2321
2322Note also that the whole range idea is rather unportable between
2323character sets--and even within character sets they may cause results
2324you probably didn't expect.  A sound principle is to use only ranges
2325that begin from and end at either alphabets of equal case (a-e, A-E),
2326or digits (0-4).  Anything else is unsafe.  If in doubt, spell out the
2327character sets in full.
2328
2329Options:
2330
2331    c	Complement the SEARCHLIST.
2332    d	Delete found but unreplaced characters.
2333    s	Squash duplicate replaced characters.
2334    r	Return the modified string and leave the original string
2335	untouched.
2336
2337If the C</c> modifier is specified, the SEARCHLIST character set
2338is complemented.  If the C</d> modifier is specified, any characters
2339specified by SEARCHLIST not found in REPLACEMENTLIST are deleted.
2340(Note that this is slightly more flexible than the behavior of some
2341B<tr> programs, which delete anything they find in the SEARCHLIST,
2342period.)  If the C</s> modifier is specified, sequences of characters
2343that were transliterated to the same character are squashed down
2344to a single instance of the character.
2345
2346If the C</d> modifier is used, the REPLACEMENTLIST is always interpreted
2347exactly as specified.  Otherwise, if the REPLACEMENTLIST is shorter
2348than the SEARCHLIST, the final character is replicated till it is long
2349enough.  If the REPLACEMENTLIST is empty, the SEARCHLIST is replicated.
2350This latter is useful for counting characters in a class or for
2351squashing character sequences in a class.
2352
2353Examples:
2354
2355    $ARGV[1] =~ tr/A-Z/a-z/;	# canonicalize to lower case ASCII
2356
2357    $cnt = tr/*/*/;		# count the stars in $_
2358
2359    $cnt = $sky =~ tr/*/*/;	# count the stars in $sky
2360
2361    $cnt = tr/0-9//;		# count the digits in $_
2362
2363    tr/a-zA-Z//s;		# bookkeeper -> bokeper
2364
2365    ($HOST = $host) =~ tr/a-z/A-Z/;
2366     $HOST = $host  =~ tr/a-z/A-Z/r;   # same thing
2367
2368    $HOST = $host =~ tr/a-z/A-Z/r    # chained with s///r
2369                  =~ s/:/ -p/r;
2370
2371    tr/a-zA-Z/ /cs;		# change non-alphas to single space
2372
2373    @stripped = map tr/a-zA-Z/ /csr, @original;
2374				# /r with map
2375
2376    tr [\200-\377]
2377       [\000-\177];		# wickedly delete 8th bit
2378
2379If multiple transliterations are given for a character, only the
2380first one is used:
2381
2382    tr/AAA/XYZ/
2383
2384will transliterate any A to X.
2385
2386Because the transliteration table is built at compile time, neither
2387the SEARCHLIST nor the REPLACEMENTLIST are subjected to double quote
2388interpolation.  That means that if you want to use variables, you
2389must use an eval():
2390
2391    eval "tr/$oldlist/$newlist/";
2392    die $@ if $@;
2393
2394    eval "tr/$oldlist/$newlist/, 1" or die $@;
2395
2396=item <<EOF
2397X<here-doc> X<heredoc> X<here-document> X<<< << >>>
2398
2399A line-oriented form of quoting is based on the shell "here-document"
2400syntax.  Following a C<< << >> you specify a string to terminate
2401the quoted material, and all lines following the current line down to
2402the terminating string are the value of the item.
2403
2404The terminating string may be either an identifier (a word), or some
2405quoted text.  An unquoted identifier works like double quotes.
2406There may not be a space between the C<< << >> and the identifier,
2407unless the identifier is explicitly quoted.  (If you put a space it
2408will be treated as a null identifier, which is valid, and matches the
2409first empty line.)  The terminating string must appear by itself
2410(unquoted and with no surrounding whitespace) on the terminating line.
2411
2412If the terminating string is quoted, the type of quotes used determine
2413the treatment of the text.
2414
2415=over 4
2416
2417=item Double Quotes
2418
2419Double quotes indicate that the text will be interpolated using exactly
2420the same rules as normal double quoted strings.
2421
2422       print <<EOF;
2423    The price is $Price.
2424    EOF
2425
2426       print << "EOF"; # same as above
2427    The price is $Price.
2428    EOF
2429
2430
2431=item Single Quotes
2432
2433Single quotes indicate the text is to be treated literally with no
2434interpolation of its content.  This is similar to single quoted
2435strings except that backslashes have no special meaning, with C<\\>
2436being treated as two backslashes and not one as they would in every
2437other quoting construct.
2438
2439Just as in the shell, a backslashed bareword following the C<<< << >>>
2440means the same thing as a single-quoted string does:
2441
2442	$cost = <<'VISTA';  # hasta la ...
2443    That'll be $10 please, ma'am.
2444    VISTA
2445
2446	$cost = <<\VISTA;   # Same thing!
2447    That'll be $10 please, ma'am.
2448    VISTA
2449
2450This is the only form of quoting in perl where there is no need
2451to worry about escaping content, something that code generators
2452can and do make good use of.
2453
2454=item Backticks
2455
2456The content of the here doc is treated just as it would be if the
2457string were embedded in backticks.  Thus the content is interpolated
2458as though it were double quoted and then executed via the shell, with
2459the results of the execution returned.
2460
2461       print << `EOC`; # execute command and get results
2462    echo hi there
2463    EOC
2464
2465=back
2466
2467It is possible to stack multiple here-docs in a row:
2468
2469       print <<"foo", <<"bar"; # you can stack them
2470    I said foo.
2471    foo
2472    I said bar.
2473    bar
2474
2475       myfunc(<< "THIS", 23, <<'THAT');
2476    Here's a line
2477    or two.
2478    THIS
2479    and here's another.
2480    THAT
2481
2482Just don't forget that you have to put a semicolon on the end
2483to finish the statement, as Perl doesn't know you're not going to
2484try to do this:
2485
2486       print <<ABC
2487    179231
2488    ABC
2489       + 20;
2490
2491If you want to remove the line terminator from your here-docs,
2492use C<chomp()>.
2493
2494    chomp($string = <<'END');
2495    This is a string.
2496    END
2497
2498If you want your here-docs to be indented with the rest of the code,
2499you'll need to remove leading whitespace from each line manually:
2500
2501    ($quote = <<'FINIS') =~ s/^\s+//gm;
2502       The Road goes ever on and on,
2503       down from the door where it began.
2504    FINIS
2505
2506If you use a here-doc within a delimited construct, such as in C<s///eg>,
2507the quoted material must still come on the line following the
2508C<<< <<FOO >>> marker, which means it may be inside the delimited
2509construct:
2510
2511    s/this/<<E . 'that'
2512    the other
2513    E
2514     . 'more '/eg;
2515
2516It works this way as of Perl 5.18.  Historically, it was inconsistent, and
2517you would have to write
2518
2519    s/this/<<E . 'that'
2520     . 'more '/eg;
2521    the other
2522    E
2523
2524outside of string evals.
2525
2526Additionally, quoting rules for the end-of-string identifier are
2527unrelated to Perl's quoting rules.  C<q()>, C<qq()>, and the like are not
2528supported in place of C<''> and C<"">, and the only interpolation is for
2529backslashing the quoting character:
2530
2531    print << "abc\"def";
2532    testing...
2533    abc"def
2534
2535Finally, quoted strings cannot span multiple lines.  The general rule is
2536that the identifier must be a string literal.  Stick with that, and you
2537should be safe.
2538
2539=back
2540
2541=head2 Gory details of parsing quoted constructs
2542X<quote, gory details>
2543
2544When presented with something that might have several different
2545interpretations, Perl uses the B<DWIM> (that's "Do What I Mean")
2546principle to pick the most probable interpretation.  This strategy
2547is so successful that Perl programmers often do not suspect the
2548ambivalence of what they write.  But from time to time, Perl's
2549notions differ substantially from what the author honestly meant.
2550
2551This section hopes to clarify how Perl handles quoted constructs.
2552Although the most common reason to learn this is to unravel labyrinthine
2553regular expressions, because the initial steps of parsing are the
2554same for all quoting operators, they are all discussed together.
2555
2556The most important Perl parsing rule is the first one discussed
2557below: when processing a quoted construct, Perl first finds the end
2558of that construct, then interprets its contents.  If you understand
2559this rule, you may skip the rest of this section on the first
2560reading.  The other rules are likely to contradict the user's
2561expectations much less frequently than this first one.
2562
2563Some passes discussed below are performed concurrently, but because
2564their results are the same, we consider them individually.  For different
2565quoting constructs, Perl performs different numbers of passes, from
2566one to four, but these passes are always performed in the same order.
2567
2568=over 4
2569
2570=item Finding the end
2571
2572The first pass is finding the end of the quoted construct, where
2573the information about the delimiters is used in parsing.
2574During this search, text between the starting and ending delimiters
2575is copied to a safe location.  The text copied gets delimiter-independent.
2576
2577If the construct is a here-doc, the ending delimiter is a line
2578that has a terminating string as the content.  Therefore C<<<EOF> is
2579terminated by C<EOF> immediately followed by C<"\n"> and starting
2580from the first column of the terminating line.
2581When searching for the terminating line of a here-doc, nothing
2582is skipped.  In other words, lines after the here-doc syntax
2583are compared with the terminating string line by line.
2584
2585For the constructs except here-docs, single characters are used as starting
2586and ending delimiters.  If the starting delimiter is an opening punctuation
2587(that is C<(>, C<[>, C<{>, or C<< < >>), the ending delimiter is the
2588corresponding closing punctuation (that is C<)>, C<]>, C<}>, or C<< > >>).
2589If the starting delimiter is an unpaired character like C</> or a closing
2590punctuation, the ending delimiter is same as the starting delimiter.
2591Therefore a C</> terminates a C<qq//> construct, while a C<]> terminates
2592both C<qq[]> and C<qq]]> constructs.
2593
2594When searching for single-character delimiters, escaped delimiters
2595and C<\\> are skipped.  For example, while searching for terminating C</>,
2596combinations of C<\\> and C<\/> are skipped.  If the delimiters are
2597bracketing, nested pairs are also skipped.  For example, while searching
2598for closing C<]> paired with the opening C<[>, combinations of C<\\>, C<\]>,
2599and C<\[> are all skipped, and nested C<[> and C<]> are skipped as well.
2600However, when backslashes are used as the delimiters (like C<qq\\> and
2601C<tr\\\>), nothing is skipped.
2602During the search for the end, backslashes that escape delimiters or
2603other backslashes are removed (exactly speaking, they are not copied to the
2604safe location).
2605
2606For constructs with three-part delimiters (C<s///>, C<y///>, and
2607C<tr///>), the search is repeated once more.
2608If the first delimiter is not an opening punctuation, the three delimiters must
2609be the same, such as C<s!!!> and C<tr)))>,
2610in which case the second delimiter
2611terminates the left part and starts the right part at once.
2612If the left part is delimited by bracketing punctuation (that is C<()>,
2613C<[]>, C<{}>, or C<< <> >>), the right part needs another pair of
2614delimiters such as C<s(){}> and C<tr[]//>.  In these cases, whitespace
2615and comments are allowed between the two parts, though the comment must follow
2616at least one whitespace character; otherwise a character expected as the
2617start of the comment may be regarded as the starting delimiter of the right part.
2618
2619During this search no attention is paid to the semantics of the construct.
2620Thus:
2621
2622    "$hash{"$foo/$bar"}"
2623
2624or:
2625
2626    m/
2627      bar	# NOT a comment, this slash / terminated m//!
2628     /x
2629
2630do not form legal quoted expressions.   The quoted part ends on the
2631first C<"> and C</>, and the rest happens to be a syntax error.
2632Because the slash that terminated C<m//> was followed by a C<SPACE>,
2633the example above is not C<m//x>, but rather C<m//> with no C</x>
2634modifier.  So the embedded C<#> is interpreted as a literal C<#>.
2635
2636Also no attention is paid to C<\c\> (multichar control char syntax) during
2637this search.  Thus the second C<\> in C<qq/\c\/> is interpreted as a part
2638of C<\/>, and the following C</> is not recognized as a delimiter.
2639Instead, use C<\034> or C<\x1c> at the end of quoted constructs.
2640
2641=item Interpolation
2642X<interpolation>
2643
2644The next step is interpolation in the text obtained, which is now
2645delimiter-independent.  There are multiple cases.
2646
2647=over 4
2648
2649=item C<<<'EOF'>
2650
2651No interpolation is performed.
2652Note that the combination C<\\> is left intact, since escaped delimiters
2653are not available for here-docs.
2654
2655=item  C<m''>, the pattern of C<s'''>
2656
2657No interpolation is performed at this stage.
2658Any backslashed sequences including C<\\> are treated at the stage
2659to L</"parsing regular expressions">.
2660
2661=item C<''>, C<q//>, C<tr'''>, C<y'''>, the replacement of C<s'''>
2662
2663The only interpolation is removal of C<\> from pairs of C<\\>.
2664Therefore C<-> in C<tr'''> and C<y'''> is treated literally
2665as a hyphen and no character range is available.
2666C<\1> in the replacement of C<s'''> does not work as C<$1>.
2667
2668=item C<tr///>, C<y///>
2669
2670No variable interpolation occurs.  String modifying combinations for
2671case and quoting such as C<\Q>, C<\U>, and C<\E> are not recognized.
2672The other escape sequences such as C<\200> and C<\t> and backslashed
2673characters such as C<\\> and C<\-> are converted to appropriate literals.
2674The character C<-> is treated specially and therefore C<\-> is treated
2675as a literal C<->.
2676
2677=item C<"">, C<``>, C<qq//>, C<qx//>, C<< <file*glob> >>, C<<<"EOF">
2678
2679C<\Q>, C<\U>, C<\u>, C<\L>, C<\l>, C<\F> (possibly paired with C<\E>) are
2680converted to corresponding Perl constructs.  Thus, C<"$foo\Qbaz$bar">
2681is converted to C<$foo . (quotemeta("baz" . $bar))> internally.
2682The other escape sequences such as C<\200> and C<\t> and backslashed
2683characters such as C<\\> and C<\-> are replaced with appropriate
2684expansions.
2685
2686Let it be stressed that I<whatever falls between C<\Q> and C<\E>>
2687is interpolated in the usual way.  Something like C<"\Q\\E"> has
2688no C<\E> inside.  Instead, it has C<\Q>, C<\\>, and C<E>, so the
2689result is the same as for C<"\\\\E">.  As a general rule, backslashes
2690between C<\Q> and C<\E> may lead to counterintuitive results.  So,
2691C<"\Q\t\E"> is converted to C<quotemeta("\t")>, which is the same
2692as C<"\\\t"> (since TAB is not alphanumeric).  Note also that:
2693
2694  $str = '\t';
2695  return "\Q$str";
2696
2697may be closer to the conjectural I<intention> of the writer of C<"\Q\t\E">.
2698
2699Interpolated scalars and arrays are converted internally to the C<join> and
2700C<.> catenation operations.  Thus, C<"$foo XXX '@arr'"> becomes:
2701
2702  $foo . " XXX '" . (join $", @arr) . "'";
2703
2704All operations above are performed simultaneously, left to right.
2705
2706Because the result of C<"\Q STRING \E"> has all metacharacters
2707quoted, there is no way to insert a literal C<$> or C<@> inside a
2708C<\Q\E> pair.  If protected by C<\>, C<$> will be quoted to became
2709C<"\\\$">; if not, it is interpreted as the start of an interpolated
2710scalar.
2711
2712Note also that the interpolation code needs to make a decision on
2713where the interpolated scalar ends.  For instance, whether
2714C<< "a $x -> {c}" >> really means:
2715
2716  "a " . $x . " -> {c}";
2717
2718or:
2719
2720  "a " . $x -> {c};
2721
2722Most of the time, the longest possible text that does not include
2723spaces between components and which contains matching braces or
2724brackets.  because the outcome may be determined by voting based
2725on heuristic estimators, the result is not strictly predictable.
2726Fortunately, it's usually correct for ambiguous cases.
2727
2728=item the replacement of C<s///>
2729
2730Processing of C<\Q>, C<\U>, C<\u>, C<\L>, C<\l>, C<\F> and interpolation
2731happens as with C<qq//> constructs.
2732
2733It is at this step that C<\1> is begrudgingly converted to C<$1> in
2734the replacement text of C<s///>, in order to correct the incorrigible
2735I<sed> hackers who haven't picked up the saner idiom yet.  A warning
2736is emitted if the C<use warnings> pragma or the B<-w> command-line flag
2737(that is, the C<$^W> variable) was set.
2738
2739=item C<RE> in C<?RE?>, C</RE/>, C<m/RE/>, C<s/RE/foo/>,
2740
2741Processing of C<\Q>, C<\U>, C<\u>, C<\L>, C<\l>, C<\F>, C<\E>,
2742and interpolation happens (almost) as with C<qq//> constructs.
2743
2744Processing of C<\N{...}> is also done here, and compiled into an intermediate
2745form for the regex compiler.  (This is because, as mentioned below, the regex
2746compilation may be done at execution time, and C<\N{...}> is a compile-time
2747construct.)
2748
2749However any other combinations of C<\> followed by a character
2750are not substituted but only skipped, in order to parse them
2751as regular expressions at the following step.
2752As C<\c> is skipped at this step, C<@> of C<\c@> in RE is possibly
2753treated as an array symbol (for example C<@foo>),
2754even though the same text in C<qq//> gives interpolation of C<\c@>.
2755
2756Code blocks such as C<(?{BLOCK})> are handled by temporarily passing control
2757back to the perl parser, in a similar way that an interpolated array
2758subscript expression such as C<"foo$array[1+f("[xyz")]bar"> would be.
2759
2760Moreover, inside C<(?{BLOCK})>, C<(?# comment )>, and
2761a C<#>-comment in a C<//x>-regular expression, no processing is
2762performed whatsoever.  This is the first step at which the presence
2763of the C<//x> modifier is relevant.
2764
2765Interpolation in patterns has several quirks: C<$|>, C<$(>, C<$)>, C<@+>
2766and C<@-> are not interpolated, and constructs C<$var[SOMETHING]> are
2767voted (by several different estimators) to be either an array element
2768or C<$var> followed by an RE alternative.  This is where the notation
2769C<${arr[$bar]}> comes handy: C</${arr[0-9]}/> is interpreted as
2770array element C<-9>, not as a regular expression from the variable
2771C<$arr> followed by a digit, which would be the interpretation of
2772C</$arr[0-9]/>.  Since voting among different estimators may occur,
2773the result is not predictable.
2774
2775The lack of processing of C<\\> creates specific restrictions on
2776the post-processed text.  If the delimiter is C</>, one cannot get
2777the combination C<\/> into the result of this step.  C</> will
2778finish the regular expression, C<\/> will be stripped to C</> on
2779the previous step, and C<\\/> will be left as is.  Because C</> is
2780equivalent to C<\/> inside a regular expression, this does not
2781matter unless the delimiter happens to be character special to the
2782RE engine, such as in C<s*foo*bar*>, C<m[foo]>, or C<?foo?>; or an
2783alphanumeric char, as in:
2784
2785  m m ^ a \s* b mmx;
2786
2787In the RE above, which is intentionally obfuscated for illustration, the
2788delimiter is C<m>, the modifier is C<mx>, and after delimiter-removal the
2789RE is the same as for C<m/ ^ a \s* b /mx>.  There's more than one
2790reason you're encouraged to restrict your delimiters to non-alphanumeric,
2791non-whitespace choices.
2792
2793=back
2794
2795This step is the last one for all constructs except regular expressions,
2796which are processed further.
2797
2798=item parsing regular expressions
2799X<regexp, parse>
2800
2801Previous steps were performed during the compilation of Perl code,
2802but this one happens at run time, although it may be optimized to
2803be calculated at compile time if appropriate.  After preprocessing
2804described above, and possibly after evaluation if concatenation,
2805joining, casing translation, or metaquoting are involved, the
2806resulting I<string> is passed to the RE engine for compilation.
2807
2808Whatever happens in the RE engine might be better discussed in L<perlre>,
2809but for the sake of continuity, we shall do so here.
2810
2811This is another step where the presence of the C<//x> modifier is
2812relevant.  The RE engine scans the string from left to right and
2813converts it to a finite automaton.
2814
2815Backslashed characters are either replaced with corresponding
2816literal strings (as with C<\{>), or else they generate special nodes
2817in the finite automaton (as with C<\b>).  Characters special to the
2818RE engine (such as C<|>) generate corresponding nodes or groups of
2819nodes.  C<(?#...)> comments are ignored.  All the rest is either
2820converted to literal strings to match, or else is ignored (as is
2821whitespace and C<#>-style comments if C<//x> is present).
2822
2823Parsing of the bracketed character class construct, C<[...]>, is
2824rather different than the rule used for the rest of the pattern.
2825The terminator of this construct is found using the same rules as
2826for finding the terminator of a C<{}>-delimited construct, the only
2827exception being that C<]> immediately following C<[> is treated as
2828though preceded by a backslash.
2829
2830The terminator of runtime C<(?{...})> is found by temporarily switching
2831control to the perl parser, which should stop at the point where the
2832logically balancing terminating C<}> is found.
2833
2834It is possible to inspect both the string given to RE engine and the
2835resulting finite automaton.  See the arguments C<debug>/C<debugcolor>
2836in the C<use L<re>> pragma, as well as Perl's B<-Dr> command-line
2837switch documented in L<perlrun/"Command Switches">.
2838
2839=item Optimization of regular expressions
2840X<regexp, optimization>
2841
2842This step is listed for completeness only.  Since it does not change
2843semantics, details of this step are not documented and are subject
2844to change without notice.  This step is performed over the finite
2845automaton that was generated during the previous pass.
2846
2847It is at this stage that C<split()> silently optimizes C</^/> to
2848mean C</^/m>.
2849
2850=back
2851
2852=head2 I/O Operators
2853X<operator, i/o> X<operator, io> X<io> X<while> X<filehandle>
2854X<< <> >> X<@ARGV>
2855
2856There are several I/O operators you should know about.
2857
2858A string enclosed by backticks (grave accents) first undergoes
2859double-quote interpolation.  It is then interpreted as an external
2860command, and the output of that command is the value of the
2861backtick string, like in a shell.  In scalar context, a single string
2862consisting of all output is returned.  In list context, a list of
2863values is returned, one per line of output.  (You can set C<$/> to use
2864a different line terminator.)  The command is executed each time the
2865pseudo-literal is evaluated.  The status value of the command is
2866returned in C<$?> (see L<perlvar> for the interpretation of C<$?>).
2867Unlike in B<csh>, no translation is done on the return data--newlines
2868remain newlines.  Unlike in any of the shells, single quotes do not
2869hide variable names in the command from interpretation.  To pass a
2870literal dollar-sign through to the shell you need to hide it with a
2871backslash.  The generalized form of backticks is C<qx//>.  (Because
2872backticks always undergo shell expansion as well, see L<perlsec> for
2873security concerns.)
2874X<qx> X<`> X<``> X<backtick> X<glob>
2875
2876In scalar context, evaluating a filehandle in angle brackets yields
2877the next line from that file (the newline, if any, included), or
2878C<undef> at end-of-file or on error.  When C<$/> is set to C<undef>
2879(sometimes known as file-slurp mode) and the file is empty, it
2880returns C<''> the first time, followed by C<undef> subsequently.
2881
2882Ordinarily you must assign the returned value to a variable, but
2883there is one situation where an automatic assignment happens.  If
2884and only if the input symbol is the only thing inside the conditional
2885of a C<while> statement (even if disguised as a C<for(;;)> loop),
2886the value is automatically assigned to the global variable $_,
2887destroying whatever was there previously.  (This may seem like an
2888odd thing to you, but you'll use the construct in almost every Perl
2889script you write.)  The $_ variable is not implicitly localized.
2890You'll have to put a C<local $_;> before the loop if you want that
2891to happen.
2892
2893The following lines are equivalent:
2894
2895    while (defined($_ = <STDIN>)) { print; }
2896    while ($_ = <STDIN>) { print; }
2897    while (<STDIN>) { print; }
2898    for (;<STDIN>;) { print; }
2899    print while defined($_ = <STDIN>);
2900    print while ($_ = <STDIN>);
2901    print while <STDIN>;
2902
2903This also behaves similarly, but assigns to a lexical variable
2904instead of to C<$_>:
2905
2906    while (my $line = <STDIN>) { print $line }
2907
2908In these loop constructs, the assigned value (whether assignment
2909is automatic or explicit) is then tested to see whether it is
2910defined.  The defined test avoids problems where the line has a string
2911value that would be treated as false by Perl; for example a "" or
2912a "0" with no trailing newline.  If you really mean for such values
2913to terminate the loop, they should be tested for explicitly:
2914
2915    while (($_ = <STDIN>) ne '0') { ... }
2916    while (<STDIN>) { last unless $_; ... }
2917
2918In other boolean contexts, C<< <FILEHANDLE> >> without an
2919explicit C<defined> test or comparison elicits a warning if the
2920C<use warnings> pragma or the B<-w>
2921command-line switch (the C<$^W> variable) is in effect.
2922
2923The filehandles STDIN, STDOUT, and STDERR are predefined.  (The
2924filehandles C<stdin>, C<stdout>, and C<stderr> will also work except
2925in packages, where they would be interpreted as local identifiers
2926rather than global.)  Additional filehandles may be created with
2927the open() function, amongst others.  See L<perlopentut> and
2928L<perlfunc/open> for details on this.
2929X<stdin> X<stdout> X<sterr>
2930
2931If a <FILEHANDLE> is used in a context that is looking for
2932a list, a list comprising all input lines is returned, one line per
2933list element.  It's easy to grow to a rather large data space this
2934way, so use with care.
2935
2936<FILEHANDLE> may also be spelled C<readline(*FILEHANDLE)>.
2937See L<perlfunc/readline>.
2938
2939The null filehandle <> is special: it can be used to emulate the
2940behavior of B<sed> and B<awk>, and any other Unix filter program
2941that takes a list of filenames, doing the same to each line
2942of input from all of them.  Input from <> comes either from
2943standard input, or from each file listed on the command line.  Here's
2944how it works: the first time <> is evaluated, the @ARGV array is
2945checked, and if it is empty, C<$ARGV[0]> is set to "-", which when opened
2946gives you standard input.  The @ARGV array is then processed as a list
2947of filenames.  The loop
2948
2949    while (<>) {
2950	...			# code for each line
2951    }
2952
2953is equivalent to the following Perl-like pseudo code:
2954
2955    unshift(@ARGV, '-') unless @ARGV;
2956    while ($ARGV = shift) {
2957	open(ARGV, $ARGV);
2958	while (<ARGV>) {
2959	    ...		# code for each line
2960	}
2961    }
2962
2963except that it isn't so cumbersome to say, and will actually work.
2964It really does shift the @ARGV array and put the current filename
2965into the $ARGV variable.  It also uses filehandle I<ARGV>
2966internally.  <> is just a synonym for <ARGV>, which
2967is magical.  (The pseudo code above doesn't work because it treats
2968<ARGV> as non-magical.)
2969
2970Since the null filehandle uses the two argument form of L<perlfunc/open>
2971it interprets special characters, so if you have a script like this:
2972
2973    while (<>) {
2974        print;
2975    }
2976
2977and call it with C<perl dangerous.pl 'rm -rfv *|'>, it actually opens a
2978pipe, executes the C<rm> command and reads C<rm>'s output from that pipe.
2979If you want all items in C<@ARGV> to be interpreted as file names, you
2980can use the module C<ARGV::readonly> from CPAN.
2981
2982You can modify @ARGV before the first <> as long as the array ends up
2983containing the list of filenames you really want.  Line numbers (C<$.>)
2984continue as though the input were one big happy file.  See the example
2985in L<perlfunc/eof> for how to reset line numbers on each file.
2986
2987If you want to set @ARGV to your own list of files, go right ahead.
2988This sets @ARGV to all plain text files if no @ARGV was given:
2989
2990    @ARGV = grep { -f && -T } glob('*') unless @ARGV;
2991
2992You can even set them to pipe commands.  For example, this automatically
2993filters compressed arguments through B<gzip>:
2994
2995    @ARGV = map { /\.(gz|Z)$/ ? "gzip -dc < $_ |" : $_ } @ARGV;
2996
2997If you want to pass switches into your script, you can use one of the
2998Getopts modules or put a loop on the front like this:
2999
3000    while ($_ = $ARGV[0], /^-/) {
3001	shift;
3002        last if /^--$/;
3003	if (/^-D(.*)/) { $debug = $1 }
3004	if (/^-v/)     { $verbose++  }
3005	# ...		# other switches
3006    }
3007
3008    while (<>) {
3009	# ...		# code for each line
3010    }
3011
3012The <> symbol will return C<undef> for end-of-file only once.
3013If you call it again after this, it will assume you are processing another
3014@ARGV list, and if you haven't set @ARGV, will read input from STDIN.
3015
3016If what the angle brackets contain is a simple scalar variable (for example,
3017<$foo>), then that variable contains the name of the
3018filehandle to input from, or its typeglob, or a reference to the
3019same.  For example:
3020
3021    $fh = \*STDIN;
3022    $line = <$fh>;
3023
3024If what's within the angle brackets is neither a filehandle nor a simple
3025scalar variable containing a filehandle name, typeglob, or typeglob
3026reference, it is interpreted as a filename pattern to be globbed, and
3027either a list of filenames or the next filename in the list is returned,
3028depending on context.  This distinction is determined on syntactic
3029grounds alone.  That means C<< <$x> >> is always a readline() from
3030an indirect handle, but C<< <$hash{key}> >> is always a glob().
3031That's because $x is a simple scalar variable, but C<$hash{key}> is
3032not--it's a hash element.  Even C<< <$x > >> (note the extra space)
3033is treated as C<glob("$x ")>, not C<readline($x)>.
3034
3035One level of double-quote interpretation is done first, but you can't
3036say C<< <$foo> >> because that's an indirect filehandle as explained
3037in the previous paragraph.  (In older versions of Perl, programmers
3038would insert curly brackets to force interpretation as a filename glob:
3039C<< <${foo}> >>.  These days, it's considered cleaner to call the
3040internal function directly as C<glob($foo)>, which is probably the right
3041way to have done it in the first place.)  For example:
3042
3043    while (<*.c>) {
3044	chmod 0644, $_;
3045    }
3046
3047is roughly equivalent to:
3048
3049    open(FOO, "echo *.c | tr -s ' \t\r\f' '\\012\\012\\012\\012'|");
3050    while (<FOO>) {
3051	chomp;
3052	chmod 0644, $_;
3053    }
3054
3055except that the globbing is actually done internally using the standard
3056C<File::Glob> extension.  Of course, the shortest way to do the above is:
3057
3058    chmod 0644, <*.c>;
3059
3060A (file)glob evaluates its (embedded) argument only when it is
3061starting a new list.  All values must be read before it will start
3062over.  In list context, this isn't important because you automatically
3063get them all anyway.  However, in scalar context the operator returns
3064the next value each time it's called, or C<undef> when the list has
3065run out.  As with filehandle reads, an automatic C<defined> is
3066generated when the glob occurs in the test part of a C<while>,
3067because legal glob returns (for example,
3068a file called F<0>) would otherwise
3069terminate the loop.  Again, C<undef> is returned only once.  So if
3070you're expecting a single value from a glob, it is much better to
3071say
3072
3073    ($file) = <blurch*>;
3074
3075than
3076
3077    $file = <blurch*>;
3078
3079because the latter will alternate between returning a filename and
3080returning false.
3081
3082If you're trying to do variable interpolation, it's definitely better
3083to use the glob() function, because the older notation can cause people
3084to become confused with the indirect filehandle notation.
3085
3086    @files = glob("$dir/*.[ch]");
3087    @files = glob($files[$i]);
3088
3089=head2 Constant Folding
3090X<constant folding> X<folding>
3091
3092Like C, Perl does a certain amount of expression evaluation at
3093compile time whenever it determines that all arguments to an
3094operator are static and have no side effects.  In particular, string
3095concatenation happens at compile time between literals that don't do
3096variable substitution.  Backslash interpolation also happens at
3097compile time.  You can say
3098
3099      'Now is the time for all'
3100    . "\n"
3101    .  'good men to come to.'
3102
3103and this all reduces to one string internally.  Likewise, if
3104you say
3105
3106    foreach $file (@filenames) {
3107	if (-s $file > 5 + 100 * 2**16) {  }
3108    }
3109
3110the compiler precomputes the number which that expression
3111represents so that the interpreter won't have to.
3112
3113=head2 No-ops
3114X<no-op> X<nop>
3115
3116Perl doesn't officially have a no-op operator, but the bare constants
3117C<0> and C<1> are special-cased not to produce a warning in void
3118context, so you can for example safely do
3119
3120    1 while foo();
3121
3122=head2 Bitwise String Operators
3123X<operator, bitwise, string>
3124
3125Bitstrings of any size may be manipulated by the bitwise operators
3126(C<~ | & ^>).
3127
3128If the operands to a binary bitwise op are strings of different
3129sizes, B<|> and B<^> ops act as though the shorter operand had
3130additional zero bits on the right, while the B<&> op acts as though
3131the longer operand were truncated to the length of the shorter.
3132The granularity for such extension or truncation is one or more
3133bytes.
3134
3135    # ASCII-based examples
3136    print "j p \n" ^ " a h";        	# prints "JAPH\n"
3137    print "JA" | "  ph\n";          	# prints "japh\n"
3138    print "japh\nJunk" & '_____';   	# prints "JAPH\n";
3139    print 'p N$' ^ " E<H\n";		# prints "Perl\n";
3140
3141If you are intending to manipulate bitstrings, be certain that
3142you're supplying bitstrings: If an operand is a number, that will imply
3143a B<numeric> bitwise operation.  You may explicitly show which type of
3144operation you intend by using C<""> or C<0+>, as in the examples below.
3145
3146    $foo =  150  |  105;	# yields 255  (0x96 | 0x69 is 0xFF)
3147    $foo = '150' |  105;	# yields 255
3148    $foo =  150  | '105';	# yields 255
3149    $foo = '150' | '105';	# yields string '155' (under ASCII)
3150
3151    $baz = 0+$foo & 0+$bar;	# both ops explicitly numeric
3152    $biz = "$foo" ^ "$bar";	# both ops explicitly stringy
3153
3154See L<perlfunc/vec> for information on how to manipulate individual bits
3155in a bit vector.
3156
3157=head2 Integer Arithmetic
3158X<integer>
3159
3160By default, Perl assumes that it must do most of its arithmetic in
3161floating point.  But by saying
3162
3163    use integer;
3164
3165you may tell the compiler to use integer operations
3166(see L<integer> for a detailed explanation) from here to the end of
3167the enclosing BLOCK.  An inner BLOCK may countermand this by saying
3168
3169    no integer;
3170
3171which lasts until the end of that BLOCK.  Note that this doesn't
3172mean everything is an integer, merely that Perl will use integer
3173operations for arithmetic, comparison, and bitwise operators.  For
3174example, even under C<use integer>, if you take the C<sqrt(2)>, you'll
3175still get C<1.4142135623731> or so.
3176
3177Used on numbers, the bitwise operators ("&", "|", "^", "~", "<<",
3178and ">>") always produce integral results.  (But see also
3179L<Bitwise String Operators>.)  However, C<use integer> still has meaning for
3180them.  By default, their results are interpreted as unsigned integers, but
3181if C<use integer> is in effect, their results are interpreted
3182as signed integers.  For example, C<~0> usually evaluates to a large
3183integral value.  However, C<use integer; ~0> is C<-1> on two's-complement
3184machines.
3185
3186=head2 Floating-point Arithmetic
3187
3188X<floating-point> X<floating point> X<float> X<real>
3189
3190While C<use integer> provides integer-only arithmetic, there is no
3191analogous mechanism to provide automatic rounding or truncation to a
3192certain number of decimal places.  For rounding to a certain number
3193of digits, sprintf() or printf() is usually the easiest route.
3194See L<perlfaq4>.
3195
3196Floating-point numbers are only approximations to what a mathematician
3197would call real numbers.  There are infinitely more reals than floats,
3198so some corners must be cut.  For example:
3199
3200    printf "%.20g\n", 123456789123456789;
3201    #        produces 123456789123456784
3202
3203Testing for exact floating-point equality or inequality is not a
3204good idea.  Here's a (relatively expensive) work-around to compare
3205whether two floating-point numbers are equal to a particular number of
3206decimal places.  See Knuth, volume II, for a more robust treatment of
3207this topic.
3208
3209    sub fp_equal {
3210	my ($X, $Y, $POINTS) = @_;
3211	my ($tX, $tY);
3212	$tX = sprintf("%.${POINTS}g", $X);
3213	$tY = sprintf("%.${POINTS}g", $Y);
3214	return $tX eq $tY;
3215    }
3216
3217The POSIX module (part of the standard perl distribution) implements
3218ceil(), floor(), and other mathematical and trigonometric functions.
3219The Math::Complex module (part of the standard perl distribution)
3220defines mathematical functions that work on both the reals and the
3221imaginary numbers.  Math::Complex not as efficient as POSIX, but
3222POSIX can't work with complex numbers.
3223
3224Rounding in financial applications can have serious implications, and
3225the rounding method used should be specified precisely.  In these
3226cases, it probably pays not to trust whichever system rounding is
3227being used by Perl, but to instead implement the rounding function you
3228need yourself.
3229
3230=head2 Bigger Numbers
3231X<number, arbitrary precision>
3232
3233The standard C<Math::BigInt>, C<Math::BigRat>, and C<Math::BigFloat> modules,
3234along with the C<bignum>, C<bigint>, and C<bigrat> pragmas, provide
3235variable-precision arithmetic and overloaded operators, although
3236they're currently pretty slow.  At the cost of some space and
3237considerable speed, they avoid the normal pitfalls associated with
3238limited-precision representations.
3239
3240	use 5.010;
3241	use bigint;  # easy interface to Math::BigInt
3242	$x = 123456789123456789;
3243	say $x * $x;
3244    +15241578780673678515622620750190521
3245
3246Or with rationals:
3247
3248        use 5.010;
3249        use bigrat;
3250        $x = 3/22;
3251        $y = 4/6;
3252        say "x/y is ", $x/$y;
3253        say "x*y is ", $x*$y;
3254        x/y is 9/44
3255        x*y is 1/11
3256
3257Several modules let you calculate with (bound only by memory and CPU time)
3258unlimited or fixed precision.  There
3259are also some non-standard modules that
3260provide faster implementations via external C libraries.
3261
3262Here is a short, but incomplete summary:
3263
3264  Math::String           treat string sequences like numbers
3265  Math::FixedPrecision   calculate with a fixed precision
3266  Math::Currency         for currency calculations
3267  Bit::Vector            manipulate bit vectors fast (uses C)
3268  Math::BigIntFast       Bit::Vector wrapper for big numbers
3269  Math::Pari             provides access to the Pari C library
3270  Math::Cephes           uses the external Cephes C library (no
3271                         big numbers)
3272  Math::Cephes::Fraction fractions via the Cephes library
3273  Math::GMP              another one using an external C library
3274  Math::GMPz             an alternative interface to libgmp's big ints
3275  Math::GMPq             an interface to libgmp's fraction numbers
3276  Math::GMPf             an interface to libgmp's floating point numbers
3277
3278Choose wisely.
3279
3280=cut
3281