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