.\" Automatically generated by Pod::Man v1.34, Pod::Parser v1.13 .\" .\" Standard preamble: .\" ======================================================================== .de Sh \" Subsection heading .br .if t .Sp .ne 5 .PP \fB\\$1\fR .PP .. .de Sp \" Vertical space (when we can't use .PP) .if t .sp .5v .if n .sp .. .de Vb \" Begin verbatim text .ft CW .nf .ne \\$1 .. .de Ve \" End verbatim text .ft R .fi .. .\" Set up some character translations and predefined strings. \*(-- will .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left .\" double quote, and \*(R" will give a right double quote. | will give a .\" real vertical bar. \*(C+ will give a nicer C++. Capital omega is used to .\" do unbreakable dashes and therefore won't be available. \*(C` and \*(C' .\" expand to `' in nroff, nothing in troff, for use with C<>. .tr \(*W-|\(bv\*(Tr .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' .ie n \{\ . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} .el\{\ . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' 'br\} .\" .\" If the F register is turned on, we'll generate index entries on stderr for .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index .\" entries marked with X<> in POD. Of course, you'll have to process the .\" output yourself in some meaningful fashion. .if \nF \{\ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . nr % 0 . rr F .\} .\" .\" For nroff, turn off justification. Always turn off hyphenation; it makes .\" way too many mistakes in technical documents. .hy 0 .if n .na .\" .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2). .\" Fear. Run. Save yourself. No user-serviceable parts. . \" fudge factors for nroff and troff .if n \{\ . ds #H 0 . ds #V .8m . ds #F .3m . ds #[ \f1 . ds #] \fP .\} .if t \{\ . ds #H ((1u-(\\\\n(.fu%2u))*.13m) . ds #V .6m . ds #F 0 . ds #[ \& . ds #] \& .\} . \" simple accents for nroff and troff .if n \{\ . ds ' \& . ds ` \& . ds ^ \& . ds , \& . ds ~ ~ . ds / .\} .if t \{\ . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u" . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u' . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u' . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u' . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u' . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u' .\} . \" troff and (daisy-wheel) nroff accents .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V' .ds 8 \h'\*(#H'\(*b\h'-\*(#H' .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#] .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H' .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u' .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#] .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#] .ds ae a\h'-(\w'a'u*4/10)'e .ds Ae A\h'-(\w'A'u*4/10)'E . \" corrections for vroff .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u' .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u' . \" for low resolution devices (crt and lpr) .if \n(.H>23 .if \n(.V>19 \ \{\ . ds : e . ds 8 ss . ds o a . ds d- d\h'-1'\(ga . ds D- D\h'-1'\(hy . ds th \o'bp' . ds Th \o'LP' . ds ae ae . ds Ae AE .\} .rm #[ #] #H #V #F C .\" ======================================================================== .\" .IX Title "PERLOP 1" .TH PERLOP 1 "2002-11-24" "perl v5.8.0" "Perl Programmers Reference Guide" .SH "NAME" perlop \- Perl operators and precedence .SH "SYNOPSIS" .IX Header "SYNOPSIS" Perl operators have the following associativity and precedence, listed from highest precedence to lowest. Operators borrowed from C keep the same precedence relationship with each other, even where C's precedence is slightly screwy. (This makes learning Perl easier for C folks.) With very few exceptions, these all operate on scalar values only, not array values. .PP .Vb 24 \& left terms and list operators (leftward) \& left -> \& nonassoc ++ -- \& right ** \& right ! ~ \e and unary + and - \& left =~ !~ \& left * / % x \& left + - . \& left << >> \& nonassoc named unary operators \& nonassoc < > <= >= lt gt le ge \& nonassoc == != <=> eq ne cmp \& left & \& left | ^ \& left && \& left || \& nonassoc .. ... \& right ?: \& right = += -= *= etc. \& left , => \& nonassoc list operators (rightward) \& right not \& left and \& left or xor .Ve .PP In the following sections, these operators are covered in precedence order. .PP Many operators can be overloaded for objects. See overload. .SH "DESCRIPTION" .IX Header "DESCRIPTION" .Sh "Terms and List Operators (Leftward)" .IX Subsection "Terms and List Operators (Leftward)" A \s-1TERM\s0 has the highest precedence in Perl. They include variables, quote and quote-like operators, any expression in parentheses, and any function whose arguments are parenthesized. Actually, there aren't really functions in this sense, just list operators and unary operators behaving as functions because you put parentheses around the arguments. These are all documented in perlfunc. .PP If any list operator (\fIprint()\fR, etc.) or any unary operator (\fIchdir()\fR, etc.) is followed by a left parenthesis as the next token, the operator and arguments within parentheses are taken to be of highest precedence, just like a normal function call. .PP In the absence of parentheses, the precedence of list operators such as \&\f(CW\*(C`print\*(C'\fR, \f(CW\*(C`sort\*(C'\fR, or \f(CW\*(C`chmod\*(C'\fR is either very high or very low depending on whether you are looking at the left side or the right side of the operator. For example, in .PP .Vb 2 \& @ary = (1, 3, sort 4, 2); \& print @ary; # prints 1324 .Ve .PP the commas on the right of the sort are evaluated before the sort, but the commas on the left are evaluated after. In other words, list operators tend to gobble up all arguments that follow, and then act like a simple \s-1TERM\s0 with regard to the preceding expression. Be careful with parentheses: .PP .Vb 3 \& # These evaluate exit before doing the print: \& print($foo, exit); # Obviously not what you want. \& print $foo, exit; # Nor is this. .Ve .PP .Vb 4 \& # These do the print before evaluating exit: \& (print $foo), exit; # This is what you want. \& print($foo), exit; # Or this. \& print ($foo), exit; # Or even this. .Ve .PP Also note that .PP .Vb 1 \& print ($foo & 255) + 1, "\en"; .Ve .PP probably doesn't do what you expect at first glance. See \&\*(L"Named Unary Operators\*(R" for more discussion of this. .PP Also parsed as terms are the \f(CW\*(C`do {}\*(C'\fR and \f(CW\*(C`eval {}\*(C'\fR constructs, as well as subroutine and method calls, and the anonymous constructors \f(CW\*(C`[]\*(C'\fR and \f(CW\*(C`{}\*(C'\fR. .PP See also \*(L"Quote and Quote-like Operators\*(R" toward the end of this section, as well as \*(L"I/O Operators\*(R". .Sh "The Arrow Operator" .IX Subsection "The Arrow Operator" "\f(CW\*(C`\->\*(C'\fR" is an infix dereference operator, just as it is in C and \*(C+. If the right side is either a \f(CW\*(C`[...]\*(C'\fR, \f(CW\*(C`{...}\*(C'\fR, or a \&\f(CW\*(C`(...)\*(C'\fR subscript, then the left side must be either a hard or symbolic reference to an array, a hash, or a subroutine respectively. (Or technically speaking, a location capable of holding a hard reference, if it's an array or hash reference being used for assignment.) See perlreftut and perlref. .PP Otherwise, the right side is a method name or a simple scalar variable containing either the method name or a subroutine reference, and the left side must be either an object (a blessed reference) or a class name (that is, a package name). See perlobj. .Sh "Auto-increment and Auto-decrement" .IX Subsection "Auto-increment and Auto-decrement" \&\*(L"++\*(R" and \*(L"\-\-\*(R" work as in C. That is, if placed before a variable, they increment or decrement the variable before returning the value, and if placed after, increment or decrement the variable after returning the value. .PP The auto-increment operator has a little extra builtin magic to it. If you increment a variable that is numeric, or that has ever been used in a numeric context, you get a normal increment. If, however, the variable has been used in only string contexts since it was set, and has a value that is not the empty string and matches the pattern \&\f(CW\*(C`/^[a\-zA\-Z]*[0\-9]*\ez/\*(C'\fR, the increment is done as a string, preserving each character within its range, with carry: .PP .Vb 4 \& print ++($foo = '99'); # prints '100' \& print ++($foo = 'a0'); # prints 'a1' \& print ++($foo = 'Az'); # prints 'Ba' \& print ++($foo = 'zz'); # prints 'aaa' .Ve .PP The auto-decrement operator is not magical. .Sh "Exponentiation" .IX Subsection "Exponentiation" Binary \*(L"**\*(R" is the exponentiation operator. It binds even more tightly than unary minus, so \-2**4 is \-(2**4), not (\-2)**4. (This is implemented using C's \fIpow\fR\|(3) function, which actually works on doubles internally.) .Sh "Symbolic Unary Operators" .IX Subsection "Symbolic Unary Operators" Unary \*(L"!\*(R" performs logical negation, i.e., \*(L"not\*(R". See also \f(CW\*(C`not\*(C'\fR for a lower precedence version of this. .PP Unary \*(L"\-\*(R" performs arithmetic negation if the operand is numeric. If the operand is an identifier, a string consisting of a minus sign concatenated with the identifier is returned. Otherwise, if the string starts with a plus or minus, a string starting with the opposite sign is returned. One effect of these rules is that \f(CW\*(C`\-bareword\*(C'\fR is equivalent to \f(CW"\-bareword"\fR. .PP Unary \*(L"~\*(R" performs bitwise negation, i.e., 1's complement. For example, \f(CW\*(C`0666 & ~027\*(C'\fR is 0640. (See also \*(L"Integer Arithmetic\*(R" and \&\*(L"Bitwise String Operators\*(R".) Note that the width of the result is platform\-dependent: ~0 is 32 bits wide on a 32\-bit platform, but 64 bits wide on a 64\-bit platform, so if you are expecting a certain bit width, remember use the & operator to mask off the excess bits. .PP Unary \*(L"+\*(R" has no effect whatsoever, even on strings. It is useful syntactically for separating a function name from a parenthesized expression that would otherwise be interpreted as the complete list of function arguments. (See examples above under \*(L"Terms and List Operators (Leftward)\*(R".) .PP Unary \*(L"\e\*(R" creates a reference to whatever follows it. See perlreftut and perlref. Do not confuse this behavior with the behavior of backslash within a string, although both forms do convey the notion of protecting the next thing from interpolation. .Sh "Binding Operators" .IX Subsection "Binding Operators" Binary \*(L"=~\*(R" binds a scalar expression to a pattern match. Certain operations search or modify the string \f(CW$_\fR by default. This operator makes that kind of operation work on some other string. The right argument is a search pattern, substitution, or transliteration. The left argument is what is supposed to be searched, substituted, or transliterated instead of the default \&\f(CW$_\fR. When used in scalar context, the return value generally indicates the success of the operation. Behavior in list context depends on the particular operator. See \*(L"Regexp Quote-Like Operators\*(R" for details. .PP If the right argument is an expression rather than a search pattern, substitution, or transliteration, it is interpreted as a search pattern at run time. This can be less efficient than an explicit search, because the pattern must be compiled every time the expression is evaluated. .PP Binary \*(L"!~\*(R" is just like \*(L"=~\*(R" except the return value is negated in the logical sense. .Sh "Multiplicative Operators" .IX Subsection "Multiplicative Operators" Binary \*(L"*\*(R" multiplies two numbers. .PP Binary \*(L"/\*(R" divides two numbers. .PP Binary \*(L"%\*(R" computes the modulus of two numbers. Given integer operands \f(CW$a\fR and \f(CW$b\fR: If \f(CW$b\fR is positive, then \f(CW\*(C`$a % $b\*(C'\fR is \&\f(CW$a\fR minus the largest multiple of \f(CW$b\fR that is not greater than \&\f(CW$a\fR. If \f(CW$b\fR is negative, then \f(CW\*(C`$a % $b\*(C'\fR is \f(CW$a\fR minus the smallest multiple of \f(CW$b\fR that is not less than \f(CW$a\fR (i.e. the result will be less than or equal to zero). Note than when \f(CW\*(C`use integer\*(C'\fR is in scope, \*(L"%\*(R" gives you direct access to the modulus operator as implemented by your C compiler. This operator is not as well defined for negative operands, but it will execute faster. .PP Binary \*(L"x\*(R" is the repetition operator. In scalar context or if the left operand is not enclosed in parentheses, it returns a string consisting of the left operand repeated the number of times specified by the right operand. In list context, if the left operand is enclosed in parentheses, it repeats the list. .PP .Vb 1 \& print '-' x 80; # print row of dashes .Ve .PP .Vb 1 \& print "\et" x ($tab/8), ' ' x ($tab%8); # tab over .Ve .PP .Vb 2 \& @ones = (1) x 80; # a list of 80 1's \& @ones = (5) x @ones; # set all elements to 5 .Ve .Sh "Additive Operators" .IX Subsection "Additive Operators" Binary \*(L"+\*(R" returns the sum of two numbers. .PP Binary \*(L"\-\*(R" returns the difference of two numbers. .PP Binary \*(L".\*(R" concatenates two strings. .Sh "Shift Operators" .IX Subsection "Shift Operators" Binary \*(L"<<\*(R" returns the value of its left argument shifted left by the number of bits specified by the right argument. Arguments should be integers. (See also \*(L"Integer Arithmetic\*(R".) .PP Binary \*(L">>\*(R" returns the value of its left argument shifted right by the number of bits specified by the right argument. Arguments should be integers. (See also \*(L"Integer Arithmetic\*(R".) .PP Note that both \*(L"<<\*(R" and \*(L">>\*(R" in Perl are implemented directly using \&\*(L"<<\*(R" and \*(L">>\*(R" in C. If \f(CW\*(C`use integer\*(C'\fR (see \*(L"Integer Arithmetic\*(R") is in force then signed C integers are used, else unsigned C integers are used. Either way, the implementation isn't going to generate results larger than the size of the integer type Perl was built with (32 bits or 64 bits). .PP The result of overflowing the range of the integers is undefined because it is undefined also in C. In other words, using 32\-bit integers, \f(CW\*(C`1 << 32\*(C'\fR is undefined. Shifting by a negative number of bits is also undefined. .Sh "Named Unary Operators" .IX Subsection "Named Unary Operators" The various named unary operators are treated as functions with one argument, with optional parentheses. These include the filetest operators, like \f(CW\*(C`\-f\*(C'\fR, \f(CW\*(C`\-M\*(C'\fR, etc. See perlfunc. .PP If any list operator (\fIprint()\fR, etc.) or any unary operator (\fIchdir()\fR, etc.) is followed by a left parenthesis as the next token, the operator and arguments within parentheses are taken to be of highest precedence, just like a normal function call. For example, because named unary operators are higher precedence than ||: .PP .Vb 4 \& chdir $foo || die; # (chdir $foo) || die \& chdir($foo) || die; # (chdir $foo) || die \& chdir ($foo) || die; # (chdir $foo) || die \& chdir +($foo) || die; # (chdir $foo) || die .Ve .PP but, because * is higher precedence than named operators: .PP .Vb 4 \& chdir $foo * 20; # chdir ($foo * 20) \& chdir($foo) * 20; # (chdir $foo) * 20 \& chdir ($foo) * 20; # (chdir $foo) * 20 \& chdir +($foo) * 20; # chdir ($foo * 20) .Ve .PP .Vb 4 \& rand 10 * 20; # rand (10 * 20) \& rand(10) * 20; # (rand 10) * 20 \& rand (10) * 20; # (rand 10) * 20 \& rand +(10) * 20; # rand (10 * 20) .Ve .PP See also \*(L"Terms and List Operators (Leftward)\*(R". .Sh "Relational Operators" .IX Subsection "Relational Operators" Binary \*(L"<\*(R" returns true if the left argument is numerically less than the right argument. .PP Binary \*(L">\*(R" returns true if the left argument is numerically greater than the right argument. .PP Binary \*(L"<=\*(R" returns true if the left argument is numerically less than or equal to the right argument. .PP Binary \*(L">=\*(R" returns true if the left argument is numerically greater than or equal to the right argument. .PP Binary \*(L"lt\*(R" returns true if the left argument is stringwise less than the right argument. .PP Binary \*(L"gt\*(R" returns true if the left argument is stringwise greater than the right argument. .PP Binary \*(L"le\*(R" returns true if the left argument is stringwise less than or equal to the right argument. .PP Binary \*(L"ge\*(R" returns true if the left argument is stringwise greater than or equal to the right argument. .Sh "Equality Operators" .IX Subsection "Equality Operators" Binary \*(L"==\*(R" returns true if the left argument is numerically equal to the right argument. .PP Binary \*(L"!=\*(R" returns true if the left argument is numerically not equal to the right argument. .PP Binary \*(L"<=>\*(R" returns \-1, 0, or 1 depending on whether the left argument is numerically less than, equal to, or greater than the right argument. If your platform supports NaNs (not\-a\-numbers) as numeric values, using them with \*(L"<=>\*(R" returns undef. NaN is not \*(L"<\*(R", \*(L"==\*(R", \*(L">\*(R", \&\*(L"<=\*(R" or \*(L">=\*(R" anything (even NaN), so those 5 return false. NaN != NaN returns true, as does NaN != anything else. If your platform doesn't support NaNs then NaN is just a string with numeric value 0. .PP .Vb 2 \& perl -le '$a = NaN; print "No NaN support here" if $a == $a' \& perl -le '$a = NaN; print "NaN support here" if $a != $a' .Ve .PP Binary \*(L"eq\*(R" returns true if the left argument is stringwise equal to the right argument. .PP Binary \*(L"ne\*(R" returns true if the left argument is stringwise not equal to the right argument. .PP Binary \*(L"cmp\*(R" returns \-1, 0, or 1 depending on whether the left argument is stringwise less than, equal to, or greater than the right argument. .PP \&\*(L"lt\*(R", \*(L"le\*(R", \*(L"ge\*(R", \*(L"gt\*(R" and \*(L"cmp\*(R" use the collation (sort) order specified by the current locale if \f(CW\*(C`use locale\*(C'\fR is in effect. See perllocale. .Sh "Bitwise And" .IX Subsection "Bitwise And" Binary \*(L"&\*(R" returns its operators ANDed together bit by bit. (See also \*(L"Integer Arithmetic\*(R" and \*(L"Bitwise String Operators\*(R".) .Sh "Bitwise Or and Exclusive Or" .IX Subsection "Bitwise Or and Exclusive Or" Binary \*(L"|\*(R" returns its operators ORed together bit by bit. (See also \*(L"Integer Arithmetic\*(R" and \*(L"Bitwise String Operators\*(R".) .PP Binary \*(L"^\*(R" returns its operators XORed together bit by bit. (See also \*(L"Integer Arithmetic\*(R" and \*(L"Bitwise String Operators\*(R".) .Sh "C\-style Logical And" .IX Subsection "C-style Logical And" Binary \*(L"&&\*(R" performs a short-circuit logical \s-1AND\s0 operation. That is, if the left operand is false, the right operand is not even evaluated. Scalar or list context propagates down to the right operand if it is evaluated. .Sh "C\-style Logical Or" .IX Subsection "C-style Logical Or" Binary \*(L"||\*(R" performs a short-circuit logical \s-1OR\s0 operation. That is, if the left operand is true, the right operand is not even evaluated. Scalar or list context propagates down to the right operand if it is evaluated. .PP The \f(CW\*(C`||\*(C'\fR and \f(CW\*(C`&&\*(C'\fR operators differ from C's in that, rather than returning 0 or 1, they return the last value evaluated. Thus, a reasonably portable way to find out the home directory (assuming it's not \*(L"0\*(R") might be: .PP .Vb 2 \& $home = $ENV{'HOME'} || $ENV{'LOGDIR'} || \& (getpwuid($<))[7] || die "You're homeless!\en"; .Ve .PP In particular, this means that you shouldn't use this for selecting between two aggregates for assignment: .PP .Vb 3 \& @a = @b || @c; # this is wrong \& @a = scalar(@b) || @c; # really meant this \& @a = @b ? @b : @c; # this works fine, though .Ve .PP As more readable alternatives to \f(CW\*(C`&&\*(C'\fR and \f(CW\*(C`||\*(C'\fR when used for control flow, Perl provides \f(CW\*(C`and\*(C'\fR and \f(CW\*(C`or\*(C'\fR operators (see below). The short-circuit behavior is identical. The precedence of \*(L"and\*(R" and \&\*(L"or\*(R" is much lower, however, so that you can safely use them after a list operator without the need for parentheses: .PP .Vb 2 \& unlink "alpha", "beta", "gamma" \& or gripe(), next LINE; .Ve .PP With the C\-style operators that would have been written like this: .PP .Vb 2 \& unlink("alpha", "beta", "gamma") \& || (gripe(), next LINE); .Ve .PP Using \*(L"or\*(R" for assignment is unlikely to do what you want; see below. .Sh "Range Operators" .IX Subsection "Range Operators" Binary \*(L"..\*(R" is the range operator, which is really two different operators depending on the context. In list context, it returns an list of values counting (up by ones) from the left value to the right value. If the left value is greater than the right value then it returns the empty array. The range operator is useful for writing \&\f(CW\*(C`foreach (1..10)\*(C'\fR loops and for doing slice operations on arrays. In the current implementation, no temporary array is created when the range operator is used as the expression in \f(CW\*(C`foreach\*(C'\fR loops, but older versions of Perl might burn a lot of memory when you write something like this: .PP .Vb 3 \& for (1 .. 1_000_000) { \& # code \& } .Ve .PP The range operator also works on strings, using the magical auto\-increment, see below. .PP In scalar context, \*(L"..\*(R" returns a boolean value. The operator is bistable, like a flip\-flop, and emulates the line-range (comma) operator of \fBsed\fR, \fBawk\fR, and various editors. Each \*(L"..\*(R" operator maintains its own boolean state. It is false as long as its left operand is false. Once the left operand is true, the range operator stays true until the right operand is true, \fI\s-1AFTER\s0\fR which the range operator becomes false again. It doesn't become false till the next time the range operator is evaluated. It can test the right operand and become false on the same evaluation it became true (as in \fBawk\fR), but it still returns true once. If you don't want it to test the right operand till the next evaluation, as in \fBsed\fR, just use three dots (\*(L"...\*(R") instead of two. In all other regards, \*(L"...\*(R" behaves just like \*(L"..\*(R" does. .PP The right operand is not evaluated while the operator is in the \&\*(L"false\*(R" state, and the left operand is not evaluated while the operator is in the \*(L"true\*(R" state. The precedence is a little lower than || and &&. The value returned is either the empty string for false, or a sequence number (beginning with 1) for true. The sequence number is reset for each range encountered. The final sequence number in a range has the string \*(L"E0\*(R" appended to it, which doesn't affect its numeric value, but gives you something to search for if you want to exclude the endpoint. You can exclude the beginning point by waiting for the sequence number to be greater than 1. If either operand of scalar \*(L"..\*(R" is a constant expression, that operand is implicitly compared to the \f(CW$.\fR variable, the current line number. Examples: .PP As a scalar operator: .PP .Vb 3 \& if (101 .. 200) { print; } # print 2nd hundred lines \& next line if (1 .. /^$/); # skip header lines \& s/^/> / if (/^$/ .. eof()); # quote body .Ve .PP .Vb 8 \& # parse mail messages \& while (<>) { \& $in_header = 1 .. /^$/; \& $in_body = /^$/ .. eof(); \& # do something based on those \& } continue { \& close ARGV if eof; # reset $. each file \& } .Ve .PP As a list operator: .PP .Vb 3 \& for (101 .. 200) { print; } # print $_ 100 times \& @foo = @foo[0 .. $#foo]; # an expensive no-op \& @foo = @foo[$#foo-4 .. $#foo]; # slice last 5 items .Ve .PP The range operator (in list context) makes use of the magical auto-increment algorithm if the operands are strings. You can say .PP .Vb 1 \& @alphabet = ('A' .. 'Z'); .Ve .PP to get all normal letters of the English alphabet, or .PP .Vb 1 \& $hexdigit = (0 .. 9, 'a' .. 'f')[$num & 15]; .Ve .PP to get a hexadecimal digit, or .PP .Vb 1 \& @z2 = ('01' .. '31'); print $z2[$mday]; .Ve .PP to get dates with leading zeros. If the final value specified is not in the sequence that the magical increment would produce, the sequence goes until the next value would be longer than the final value specified. .Sh "Conditional Operator" .IX Subsection "Conditional Operator" Ternary \*(L"?:\*(R" is the conditional operator, just as in C. It works much like an if\-then\-else. If the argument before the ? is true, the argument before the : is returned, otherwise the argument after the : is returned. For example: .PP .Vb 2 \& printf "I have %d dog%s.\en", $n, \& ($n == 1) ? '' : "s"; .Ve .PP Scalar or list context propagates downward into the 2nd or 3rd argument, whichever is selected. .PP .Vb 3 \& $a = $ok ? $b : $c; # get a scalar \& @a = $ok ? @b : @c; # get an array \& $a = $ok ? @b : @c; # oops, that's just a count! .Ve .PP The operator may be assigned to if both the 2nd and 3rd arguments are legal lvalues (meaning that you can assign to them): .PP .Vb 1 \& ($a_or_b ? $a : $b) = $c; .Ve .PP Because this operator produces an assignable result, using assignments without parentheses will get you in trouble. For example, this: .PP .Vb 1 \& $a % 2 ? $a += 10 : $a += 2 .Ve .PP Really means this: .PP .Vb 1 \& (($a % 2) ? ($a += 10) : $a) += 2 .Ve .PP Rather than this: .PP .Vb 1 \& ($a % 2) ? ($a += 10) : ($a += 2) .Ve .PP That should probably be written more simply as: .PP .Vb 1 \& $a += ($a % 2) ? 10 : 2; .Ve .Sh "Assignment Operators" .IX Subsection "Assignment Operators" \&\*(L"=\*(R" is the ordinary assignment operator. .PP Assignment operators work as in C. That is, .PP .Vb 1 \& $a += 2; .Ve .PP is equivalent to .PP .Vb 1 \& $a = $a + 2; .Ve .PP although without duplicating any side effects that dereferencing the lvalue might trigger, such as from \fItie()\fR. Other assignment operators work similarly. The following are recognized: .PP .Vb 4 \& **= += *= &= <<= &&= \& -= /= |= >>= ||= \& .= %= ^= \& x= .Ve .PP Although these are grouped by family, they all have the precedence of assignment. .PP Unlike in C, the scalar assignment operator produces a valid lvalue. Modifying an assignment is equivalent to doing the assignment and then modifying the variable that was assigned to. This is useful for modifying a copy of something, like this: .PP .Vb 1 \& ($tmp = $global) =~ tr [A-Z] [a-z]; .Ve .PP Likewise, .PP .Vb 1 \& ($a += 2) *= 3; .Ve .PP is equivalent to .PP .Vb 2 \& $a += 2; \& $a *= 3; .Ve .PP Similarly, a list assignment in list context produces the list of lvalues assigned to, and a list assignment in scalar context returns the number of elements produced by the expression on the right hand side of the assignment. .Sh "Comma Operator" .IX Subsection "Comma Operator" Binary \*(L",\*(R" is the comma operator. In scalar context it evaluates its left argument, throws that value away, then evaluates its right argument and returns that value. This is just like C's comma operator. .PP In list context, it's just the list argument separator, and inserts both its arguments into the list. .PP The => digraph is mostly just a synonym for the comma operator. It's useful for documenting arguments that come in pairs. As of release 5.001, it also forces any word to the left of it to be interpreted as a string. .Sh "List Operators (Rightward)" .IX Subsection "List Operators (Rightward)" On the right side of a list operator, it has very low precedence, such that it controls all comma-separated expressions found there. The only operators with lower precedence are the logical operators \&\*(L"and\*(R", \*(L"or\*(R", and \*(L"not\*(R", which may be used to evaluate calls to list operators without the need for extra parentheses: .PP .Vb 2 \& open HANDLE, "filename" \& or die "Can't open: $!\en"; .Ve .PP See also discussion of list operators in \*(L"Terms and List Operators (Leftward)\*(R". .Sh "Logical Not" .IX Subsection "Logical Not" Unary \*(L"not\*(R" returns the logical negation of the expression to its right. It's the equivalent of \*(L"!\*(R" except for the very low precedence. .Sh "Logical And" .IX Subsection "Logical And" Binary \*(L"and\*(R" returns the logical conjunction of the two surrounding expressions. It's equivalent to && except for the very low precedence. This means that it short\-circuits: i.e., the right expression is evaluated only if the left expression is true. .Sh "Logical or and Exclusive Or" .IX Subsection "Logical or and Exclusive Or" Binary \*(L"or\*(R" returns the logical disjunction of the two surrounding expressions. It's equivalent to || except for the very low precedence. This makes it useful for control flow .PP .Vb 1 \& print FH $data or die "Can't write to FH: $!"; .Ve .PP This means that it short\-circuits: i.e., the right expression is evaluated only if the left expression is false. Due to its precedence, you should probably avoid using this for assignment, only for control flow. .PP .Vb 3 \& $a = $b or $c; # bug: this is wrong \& ($a = $b) or $c; # really means this \& $a = $b || $c; # better written this way .Ve .PP However, when it's a list-context assignment and you're trying to use \&\*(L"||\*(R" for control flow, you probably need \*(L"or\*(R" so that the assignment takes higher precedence. .PP .Vb 2 \& @info = stat($file) || die; # oops, scalar sense of stat! \& @info = stat($file) or die; # better, now @info gets its due .Ve .PP Then again, you could always use parentheses. .PP Binary \*(L"xor\*(R" returns the exclusive-OR of the two surrounding expressions. It cannot short circuit, of course. .Sh "C Operators Missing From Perl" .IX Subsection "C Operators Missing From Perl" Here is what C has that Perl doesn't: .IP "unary &" 8 .IX Item "unary &" Address-of operator. (But see the \*(L"\e\*(R" operator for taking a reference.) .IP "unary *" 8 .IX Item "unary *" Dereference-address operator. (Perl's prefix dereferencing operators are typed: $, @, %, and &.) .IP "(\s-1TYPE\s0)" 8 .IX Item "(TYPE)" Type-casting operator. .Sh "Quote and Quote-like Operators" .IX Subsection "Quote and Quote-like Operators" While we usually think of quotes as literal values, in Perl they function as operators, providing various kinds of interpolating and pattern matching capabilities. Perl provides customary quote characters for these behaviors, but also provides a way for you to choose your quote character for any of them. In the following table, a \f(CW\*(C`{}\*(C'\fR represents any pair of delimiters you choose. .PP .Vb 10 \& Customary Generic Meaning Interpolates \& '' q{} Literal no \& "" qq{} Literal yes \& `` qx{} Command yes* \& qw{} Word list no \& // m{} Pattern match yes* \& qr{} Pattern yes* \& s{}{} Substitution yes* \& tr{}{} Transliteration no (but see below) \& < are also interpolated, as are array and hash slices. But method calls such as \f(CW\*(C`$obj\-\*(C'\fRmeth> are not. .PP Interpolating an array or slice interpolates the elements in order, separated by the value of \f(CW$"\fR, so is equivalent to interpolating \&\f(CW\*(C`join $", @array\*(C'\fR. \*(L"Punctuation\*(R" arrays such as \f(CW\*(C`@+\*(C'\fR are only interpolated if the name is enclosed in braces \f(CW\*(C`@{+}\*(C'\fR. .PP You cannot include a literal \f(CW\*(C`$\*(C'\fR or \f(CW\*(C`@\*(C'\fR within a \f(CW\*(C`\eQ\*(C'\fR sequence. An unescaped \f(CW\*(C`$\*(C'\fR or \f(CW\*(C`@\*(C'\fR interpolates the corresponding variable, while escaping will cause the literal string \f(CW\*(C`\e$\*(C'\fR to be inserted. You'll need to write something like \f(CW\*(C`m/\eQuser\eE\e@\eQhost/\*(C'\fR. .PP Patterns are subject to an additional level of interpretation as a regular expression. This is done as a second pass, after variables are interpolated, so that regular expressions may be incorporated into the pattern from the variables. If this is not what you want, use \f(CW\*(C`\eQ\*(C'\fR to interpolate a variable literally. .PP Apart from the behavior described above, Perl does not expand multiple levels of interpolation. In particular, contrary to the expectations of shell programmers, back-quotes do \fI\s-1NOT\s0\fR interpolate within double quotes, nor do single quotes impede evaluation of variables when used within double quotes. .Sh "Regexp Quote-Like Operators" .IX Subsection "Regexp Quote-Like Operators" Here are the quote-like operators that apply to pattern matching and related activities. .IP "?PATTERN?" 8 .IX Item "?PATTERN?" This is just like the \f(CW\*(C`/pattern/\*(C'\fR search, except that it matches only once between calls to the \fIreset()\fR operator. This is a useful optimization when you want to see only the first occurrence of something in each file of a set of files, for instance. Only \f(CW\*(C`??\*(C'\fR patterns local to the current package are reset. .Sp .Vb 7 \& while (<>) { \& if (?^$?) { \& # blank line between header and body \& } \& } continue { \& reset if eof; # clear ?? status for next file \& } .Ve .Sp This usage is vaguely deprecated, which means it just might possibly be removed in some distant future version of Perl, perhaps somewhere around the year 2168. .IP "m/PATTERN/cgimosx" 8 .IX Item "m/PATTERN/cgimosx" .PD 0 .IP "/PATTERN/cgimosx" 8 .IX Item "/PATTERN/cgimosx" .PD Searches a string for a pattern match, and in scalar context returns true if it succeeds, false if it fails. If no string is specified via the \f(CW\*(C`=~\*(C'\fR or \f(CW\*(C`!~\*(C'\fR operator, the \f(CW$_\fR string is searched. (The string specified with \f(CW\*(C`=~\*(C'\fR need not be an lvalue\*(--it may be the result of an expression evaluation, but remember the \f(CW\*(C`=~\*(C'\fR binds rather tightly.) See also perlre. See perllocale for discussion of additional considerations that apply when \f(CW\*(C`use locale\*(C'\fR is in effect. .Sp Options are: .Sp .Vb 7 \& c Do not reset search position on a failed match when /g is in effect. \& g Match globally, i.e., find all occurrences. \& i Do case-insensitive pattern matching. \& m Treat string as multiple lines. \& o Compile pattern only once. \& s Treat string as single line. \& x Use extended regular expressions. .Ve .Sp If \*(L"/\*(R" is the delimiter then the initial \f(CW\*(C`m\*(C'\fR is optional. With the \f(CW\*(C`m\*(C'\fR you can use any pair of non\-alphanumeric, non-whitespace characters as delimiters. This is particularly useful for matching path names that contain \*(L"/\*(R", to avoid \s-1LTS\s0 (leaning toothpick syndrome). If \*(L"?\*(R" is the delimiter, then the match-only-once rule of \f(CW\*(C`?PATTERN?\*(C'\fR applies. If \*(L"'\*(R" is the delimiter, no interpolation is performed on the \s-1PATTERN\s0. .Sp \&\s-1PATTERN\s0 may contain variables, which will be interpolated (and the pattern recompiled) every time the pattern search is evaluated, except for when the delimiter is a single quote. (Note that \f(CW$(\fR, \f(CW$)\fR, and \&\f(CW$|\fR are not interpolated because they look like end-of-string tests.) If you want such a pattern to be compiled only once, add a \f(CW\*(C`/o\*(C'\fR after the trailing delimiter. This avoids expensive run-time recompilations, and is useful when the value you are interpolating won't change over the life of the script. However, mentioning \f(CW\*(C`/o\*(C'\fR constitutes a promise that you won't change the variables in the pattern. If you change them, Perl won't even notice. See also \*(L"qr/STRING/imosx\*(R". .Sp If the \s-1PATTERN\s0 evaluates to the empty string, the last \&\fIsuccessfully\fR matched regular expression is used instead. In this case, only the \f(CW\*(C`g\*(C'\fR and \f(CW\*(C`c\*(C'\fR flags on the empty pattern is honoured \- the other flags are taken from the original pattern. If no match has previously succeeded, this will (silently) act instead as a genuine empty pattern (which will always match). .Sp If the \f(CW\*(C`/g\*(C'\fR option is not used, \f(CW\*(C`m//\*(C'\fR in list context returns a list consisting of the subexpressions matched by the parentheses in the pattern, i.e., (\f(CW$1\fR, \f(CW$2\fR, \f(CW$3\fR...). (Note that here \f(CW$1\fR etc. are also set, and that this differs from Perl 4's behavior.) When there are no parentheses in the pattern, the return value is the list \f(CW\*(C`(1)\*(C'\fR for success. With or without parentheses, an empty list is returned upon failure. .Sp Examples: .Sp .Vb 2 \& open(TTY, '/dev/tty'); \& =~ /^y/i && foo(); # do foo if desired .Ve .Sp .Vb 1 \& if (/Version: *([0-9.]*)/) { $version = $1; } .Ve .Sp .Vb 1 \& next if m#^/usr/spool/uucp#; .Ve .Sp .Vb 5 \& # poor man's grep \& $arg = shift; \& while (<>) { \& print if /$arg/o; # compile only once \& } .Ve .Sp .Vb 1 \& if (($F1, $F2, $Etc) = ($foo =~ /^(\eS+)\es+(\eS+)\es*(.*)/)) .Ve .Sp This last example splits \f(CW$foo\fR into the first two words and the remainder of the line, and assigns those three fields to \f(CW$F1\fR, \f(CW$F2\fR, and \&\f(CW$Etc\fR. The conditional is true if any variables were assigned, i.e., if the pattern matched. .Sp The \f(CW\*(C`/g\*(C'\fR modifier specifies global pattern matching\*(--that is, matching as many times as possible within the string. How it behaves depends on the context. In list context, it returns a list of the substrings matched by any capturing parentheses in the regular expression. If there are no parentheses, it returns a list of all the matched strings, as if there were parentheses around the whole pattern. .Sp In scalar context, each execution of \f(CW\*(C`m//g\*(C'\fR finds the next match, returning true if it matches, and false if there is no further match. The position after the last match can be read or set using the \fIpos()\fR function; see \*(L"pos\*(R" in perlfunc. A failed match normally resets the search position to the beginning of the string, but you can avoid that by adding the \f(CW\*(C`/c\*(C'\fR modifier (e.g. \f(CW\*(C`m//gc\*(C'\fR). Modifying the target string also resets the search position. .Sp You can intermix \f(CW\*(C`m//g\*(C'\fR matches with \f(CW\*(C`m/\eG.../g\*(C'\fR, where \f(CW\*(C`\eG\*(C'\fR is a zero-width assertion that matches the exact position where the previous \&\f(CW\*(C`m//g\*(C'\fR, if any, left off. Without the \f(CW\*(C`/g\*(C'\fR modifier, the \f(CW\*(C`\eG\*(C'\fR assertion still anchors at \fIpos()\fR, but the match is of course only attempted once. Using \f(CW\*(C`\eG\*(C'\fR without \f(CW\*(C`/g\*(C'\fR on a target string that has not previously had a \&\f(CW\*(C`/g\*(C'\fR match applied to it is the same as using the \f(CW\*(C`\eA\*(C'\fR assertion to match the beginning of the string. Note also that, currently, \f(CW\*(C`\eG\*(C'\fR is only properly supported when anchored at the very beginning of the pattern. .Sp Examples: .Sp .Vb 2 \& # list context \& ($one,$five,$fifteen) = (`uptime` =~ /(\ed+\e.\ed+)/g); .Ve .Sp .Vb 8 \& # scalar context \& $/ = ""; \& while (defined($paragraph = <>)) { \& while ($paragraph =~ /[a-z]['")]*[.!?]+['")]*\es/g) { \& $sentences++; \& } \& } \& print "$sentences\en"; .Ve .Sp .Vb 11 \& # using m//gc with \eG \& $_ = "ppooqppqq"; \& while ($i++ < 2) { \& print "1: '"; \& print $1 while /(o)/gc; print "', pos=", pos, "\en"; \& print "2: '"; \& print $1 if /\eG(q)/gc; print "', pos=", pos, "\en"; \& print "3: '"; \& print $1 while /(p)/gc; print "', pos=", pos, "\en"; \& } \& print "Final: '$1', pos=",pos,"\en" if /\eG(.)/; .Ve .Sp The last example should print: .Sp .Vb 7 \& 1: 'oo', pos=4 \& 2: 'q', pos=5 \& 3: 'pp', pos=7 \& 1: '', pos=7 \& 2: 'q', pos=8 \& 3: '', pos=8 \& Final: 'q', pos=8 .Ve .Sp Notice that the final match matched \f(CW\*(C`q\*(C'\fR instead of \f(CW\*(C`p\*(C'\fR, which a match without the \f(CW\*(C`\eG\*(C'\fR anchor would have done. Also note that the final match did not update \f(CW\*(C`pos\*(C'\fR \*(-- \f(CW\*(C`pos\*(C'\fR is only updated on a \f(CW\*(C`/g\*(C'\fR match. If the final match did indeed match \f(CW\*(C`p\*(C'\fR, it's a good bet that you're running an older (pre\-5.6.0) Perl. .Sp A useful idiom for \f(CW\*(C`lex\*(C'\fR\-like scanners is \f(CW\*(C`/\eG.../gc\*(C'\fR. You can combine several regexps like this to process a string part\-by\-part, doing different actions depending on which regexp matched. Each regexp tries to match where the previous one leaves off. .Sp .Vb 14 \& $_ = <<'EOL'; \& $url = new URI::URL "http://www/"; die if $url eq "xXx"; \& EOL \& LOOP: \& { \& print(" digits"), redo LOOP if /\eG\ed+\eb[,.;]?\es*/gc; \& print(" lowercase"), redo LOOP if /\eG[a-z]+\eb[,.;]?\es*/gc; \& print(" UPPERCASE"), redo LOOP if /\eG[A-Z]+\eb[,.;]?\es*/gc; \& print(" Capitalized"), redo LOOP if /\eG[A-Z][a-z]+\eb[,.;]?\es*/gc; \& print(" MiXeD"), redo LOOP if /\eG[A-Za-z]+\eb[,.;]?\es*/gc; \& print(" alphanumeric"), redo LOOP if /\eG[A-Za-z0-9]+\eb[,.;]?\es*/gc; \& print(" line-noise"), redo LOOP if /\eG[^A-Za-z0-9]+/gc; \& print ". That's all!\en"; \& } .Ve .Sp Here is the output (split into several lines): .Sp .Vb 4 \& line-noise lowercase line-noise lowercase UPPERCASE line-noise \& UPPERCASE line-noise lowercase line-noise lowercase line-noise \& lowercase lowercase line-noise lowercase lowercase line-noise \& MiXeD line-noise. That's all! .Ve .IP "q/STRING/" 8 .IX Item "q/STRING/" .PD 0 .ie n .IP "'STRING'" 8 .el .IP "\f(CW'STRING'\fR" 8 .IX Item "'STRING'" .PD A single\-quoted, literal string. A backslash represents a backslash unless followed by the delimiter or another backslash, in which case the delimiter or backslash is interpolated. .Sp .Vb 3 \& $foo = q!I said, "You said, 'She said it.'"!; \& $bar = q('This is it.'); \& $baz = '\en'; # a two-character string .Ve .IP "qq/STRING/" 8 .IX Item "qq/STRING/" .PD 0 .ie n .IP """\s-1STRING\s0""" 8 .el .IP "``\s-1STRING\s0''" 8 .IX Item "STRING" .PD A double\-quoted, interpolated string. .Sp .Vb 4 \& $_ .= qq \& (*** The previous line contains the naughty word "$1".\en) \& if /\eb(tcl|java|python)\eb/i; # :-) \& $baz = "\en"; # a one-character string .Ve .IP "qr/STRING/imosx" 8 .IX Item "qr/STRING/imosx" This operator quotes (and possibly compiles) its \fI\s-1STRING\s0\fR as a regular expression. \fI\s-1STRING\s0\fR is interpolated the same way as \fI\s-1PATTERN\s0\fR in \f(CW\*(C`m/PATTERN/\*(C'\fR. If \*(L"'\*(R" is used as the delimiter, no interpolation is done. Returns a Perl value which may be used instead of the corresponding \f(CW\*(C`/STRING/imosx\*(C'\fR expression. .Sp For example, .Sp .Vb 2 \& $rex = qr/my.STRING/is; \& s/$rex/foo/; .Ve .Sp is equivalent to .Sp .Vb 1 \& s/my.STRING/foo/is; .Ve .Sp The result may be used as a subpattern in a match: .Sp .Vb 4 \& $re = qr/$pattern/; \& $string =~ /foo${re}bar/; # can be interpolated in other patterns \& $string =~ $re; # or used standalone \& $string =~ /$re/; # or this way .Ve .Sp Since Perl may compile the pattern at the moment of execution of \fIqr()\fR operator, using \fIqr()\fR may have speed advantages in some situations, notably if the result of \fIqr()\fR is used standalone: .Sp .Vb 11 \& sub match { \& my $patterns = shift; \& my @compiled = map qr/$_/i, @$patterns; \& grep { \& my $success = 0; \& foreach my $pat (@compiled) { \& $success = 1, last if /$pat/; \& } \& $success; \& } @_; \& } .Ve .Sp Precompilation of the pattern into an internal representation at the moment of \fIqr()\fR avoids a need to recompile the pattern every time a match \f(CW\*(C`/$pat/\*(C'\fR is attempted. (Perl has many other internal optimizations, but none would be triggered in the above example if we did not use \fIqr()\fR operator.) .Sp Options are: .Sp .Vb 5 \& i Do case-insensitive pattern matching. \& m Treat string as multiple lines. \& o Compile pattern only once. \& s Treat string as single line. \& x Use extended regular expressions. .Ve .Sp See perlre for additional information on valid syntax for \s-1STRING\s0, and for a detailed look at the semantics of regular expressions. .IP "qx/STRING/" 8 .IX Item "qx/STRING/" .PD 0 .IP "`STRING`" 8 .IX Item "`STRING`" .PD A string which is (possibly) interpolated and then executed as a system command with \f(CW\*(C`/bin/sh\*(C'\fR or its equivalent. Shell wildcards, pipes, and redirections will be honored. The collected standard output of the command is returned; standard error is unaffected. In scalar context, it comes back as a single (potentially multi\-line) string, or undef if the command failed. In list context, returns a list of lines (however you've defined lines with $/ or \&\f(CW$INPUT_RECORD_SEPARATOR\fR), or an empty list if the command failed. .Sp Because backticks do not affect standard error, use shell file descriptor syntax (assuming the shell supports this) if you care to address this. To capture a command's \s-1STDERR\s0 and \s-1STDOUT\s0 together: .Sp .Vb 1 \& $output = `cmd 2>&1`; .Ve .Sp To capture a command's \s-1STDOUT\s0 but discard its \s-1STDERR:\s0 .Sp .Vb 1 \& $output = `cmd 2>/dev/null`; .Ve .Sp To capture a command's \s-1STDERR\s0 but discard its \s-1STDOUT\s0 (ordering is important here): .Sp .Vb 1 \& $output = `cmd 2>&1 1>/dev/null`; .Ve .Sp To exchange a command's \s-1STDOUT\s0 and \s-1STDERR\s0 in order to capture the \s-1STDERR\s0 but leave its \s-1STDOUT\s0 to come out the old \s-1STDERR:\s0 .Sp .Vb 1 \& $output = `cmd 3>&1 1>&2 2>&3 3>&-`; .Ve .Sp To read both a command's \s-1STDOUT\s0 and its \s-1STDERR\s0 separately, it's easiest and safest to redirect them separately to files, and then read from those files when the program is done: .Sp .Vb 1 \& system("program args 1>/tmp/program.stdout 2>/tmp/program.stderr"); .Ve .Sp Using single-quote as a delimiter protects the command from Perl's double-quote interpolation, passing it on to the shell instead: .Sp .Vb 2 \& $perl_info = qx(ps $$); # that's Perl's $$ \& $shell_info = qx'ps $$'; # that's the new shell's $$ .Ve .Sp How that string gets evaluated is entirely subject to the command interpreter on your system. On most platforms, you will have to protect shell metacharacters if you want them treated literally. This is in practice difficult to do, as it's unclear how to escape which characters. See perlsec for a clean and safe example of a manual \fIfork()\fR and \fIexec()\fR to emulate backticks safely. .Sp On some platforms (notably DOS-like ones), the shell may not be capable of dealing with multiline commands, so putting newlines in the string may not get you what you want. You may be able to evaluate multiple commands in a single line by separating them with the command separator character, if your shell supports that (e.g. \f(CW\*(C`;\*(C'\fR on many Unix shells; \f(CW\*(C`&\*(C'\fR on the Windows \s-1NT\s0 \f(CW\*(C`cmd\*(C'\fR shell). .Sp Beginning with v5.6.0, Perl will attempt to flush all files opened for output before starting the child process, but this may not be supported on some platforms (see perlport). To be safe, you may need to set \&\f(CW$|\fR ($AUTOFLUSH in English) or call the \f(CW\*(C`autoflush()\*(C'\fR method of \&\f(CW\*(C`IO::Handle\*(C'\fR on any open handles. .Sp Beware that some command shells may place restrictions on the length of the command line. You must ensure your strings don't exceed this limit after any necessary interpolations. See the platform-specific release notes for more details about your particular environment. .Sp Using this operator can lead to programs that are difficult to port, because the shell commands called vary between systems, and may in fact not be present at all. As one example, the \f(CW\*(C`type\*(C'\fR command under the \s-1POSIX\s0 shell is very different from the \f(CW\*(C`type\*(C'\fR command under \s-1DOS\s0. That doesn't mean you should go out of your way to avoid backticks when they're the right way to get something done. Perl was made to be a glue language, and one of the things it glues together is commands. Just understand what you're getting yourself into. .Sp See \*(L"I/O Operators\*(R" for more discussion. .IP "qw/STRING/" 8 .IX Item "qw/STRING/" Evaluates to a list of the words extracted out of \s-1STRING\s0, using embedded whitespace as the word delimiters. It can be understood as being roughly equivalent to: .Sp .Vb 1 \& split(' ', q/STRING/); .Ve .Sp the difference being that it generates a real list at compile time. So this expression: .Sp .Vb 1 \& qw(foo bar baz) .Ve .Sp is semantically equivalent to the list: .Sp .Vb 1 \& 'foo', 'bar', 'baz' .Ve .Sp Some frequently seen examples: .Sp .Vb 2 \& use POSIX qw( setlocale localeconv ) \& @EXPORT = qw( foo bar baz ); .Ve .Sp A common mistake is to try to separate the words with comma or to put comments into a multi-line \f(CW\*(C`qw\*(C'\fR\-string. For this reason, the \&\f(CW\*(C`use warnings\*(C'\fR pragma and the \fB\-w\fR switch (that is, the \f(CW$^W\fR variable) produces warnings if the \s-1STRING\s0 contains the \*(L",\*(R" or the \*(L"#\*(R" character. .IP "s/PATTERN/REPLACEMENT/egimosx" 8 .IX Item "s/PATTERN/REPLACEMENT/egimosx" Searches a string for a pattern, and if found, replaces that pattern with the replacement text and returns the number of substitutions made. Otherwise it returns false (specifically, the empty string). .Sp If no string is specified via the \f(CW\*(C`=~\*(C'\fR or \f(CW\*(C`!~\*(C'\fR operator, the \f(CW$_\fR variable is searched and modified. (The string specified with \f(CW\*(C`=~\*(C'\fR must be scalar variable, an array element, a hash element, or an assignment to one of those, i.e., an lvalue.) .Sp If the delimiter chosen is a single quote, no interpolation is done on either the \s-1PATTERN\s0 or the \s-1REPLACEMENT\s0. Otherwise, if the \&\s-1PATTERN\s0 contains a $ that looks like a variable rather than an end-of-string test, the variable will be interpolated into the pattern at run\-time. If you want the pattern compiled only once the first time the variable is interpolated, use the \f(CW\*(C`/o\*(C'\fR option. If the pattern evaluates to the empty string, the last successfully executed regular expression is used instead. See perlre for further explanation on these. See perllocale for discussion of additional considerations that apply when \f(CW\*(C`use locale\*(C'\fR is in effect. .Sp Options are: .Sp .Vb 7 \& e Evaluate the right side as an expression. \& g Replace globally, i.e., all occurrences. \& i Do case-insensitive pattern matching. \& m Treat string as multiple lines. \& o Compile pattern only once. \& s Treat string as single line. \& x Use extended regular expressions. .Ve .Sp Any non\-alphanumeric, non-whitespace delimiter may replace the slashes. If single quotes are used, no interpretation is done on the replacement string (the \f(CW\*(C`/e\*(C'\fR modifier overrides this, however). Unlike Perl 4, Perl 5 treats backticks as normal delimiters; the replacement text is not evaluated as a command. If the \&\s-1PATTERN\s0 is delimited by bracketing quotes, the \s-1REPLACEMENT\s0 has its own pair of quotes, which may or may not be bracketing quotes, e.g., \&\f(CW\*(C`s(foo)(bar)\*(C'\fR or \f(CW\*(C`s/bar/\*(C'\fR. A \f(CW\*(C`/e\*(C'\fR will cause the replacement portion to be treated as a full-fledged Perl expression and evaluated right then and there. It is, however, syntax checked at compile\-time. A second \f(CW\*(C`e\*(C'\fR modifier will cause the replacement portion to be \f(CW\*(C`eval\*(C'\fRed before being run as a Perl expression. .Sp Examples: .Sp .Vb 1 \& s/\ebgreen\eb/mauve/g; # don't change wintergreen .Ve .Sp .Vb 1 \& $path =~ s|/usr/bin|/usr/local/bin|; .Ve .Sp .Vb 1 \& s/Login: $foo/Login: $bar/; # run-time pattern .Ve .Sp .Vb 1 \& ($foo = $bar) =~ s/this/that/; # copy first, then change .Ve .Sp .Vb 1 \& $count = ($paragraph =~ s/Mister\eb/Mr./g); # get change-count .Ve .Sp .Vb 4 \& $_ = 'abc123xyz'; \& s/\ed+/$&*2/e; # yields 'abc246xyz' \& s/\ed+/sprintf("%5d",$&)/e; # yields 'abc 246xyz' \& s/\ew/$& x 2/eg; # yields 'aabbcc 224466xxyyzz' .Ve .Sp .Vb 3 \& s/%(.)/$percent{$1}/g; # change percent escapes; no /e \& s/%(.)/$percent{$1} || $&/ge; # expr now, so /e \& s/^=(\ew+)/&pod($1)/ge; # use function call .Ve .Sp .Vb 3 \& # expand variables in $_, but dynamics only, using \& # symbolic dereferencing \& s/\e$(\ew+)/${$1}/g; .Ve .Sp .Vb 2 \& # Add one to the value of any numbers in the string \& s/(\ed+)/1 + $1/eg; .Ve .Sp .Vb 4 \& # This will expand any embedded scalar variable \& # (including lexicals) in $_ : First $1 is interpolated \& # to the variable name, and then evaluated \& s/(\e$\ew+)/$1/eeg; .Ve .Sp .Vb 6 \& # Delete (most) C comments. \& $program =~ s { \& /\e* # Match the opening delimiter. \& .*? # Match a minimal number of characters. \& \e*/ # Match the closing delimiter. \& } []gsx; .Ve .Sp .Vb 1 \& s/^\es*(.*?)\es*$/$1/; # trim white space in $_, expensively .Ve .Sp .Vb 4 \& for ($variable) { # trim white space in $variable, cheap \& s/^\es+//; \& s/\es+$//; \& } .Ve .Sp .Vb 1 \& s/([^ ]*) *([^ ]*)/$2 $1/; # reverse 1st two fields .Ve .Sp Note the use of $ instead of \e in the last example. Unlike \&\fBsed\fR, we use the \e<\fIdigit\fR> form in only the left hand side. Anywhere else it's $<\fIdigit\fR>. .Sp Occasionally, you can't use just a \f(CW\*(C`/g\*(C'\fR to get all the changes to occur that you might want. Here are two common cases: .Sp .Vb 2 \& # put commas in the right places in an integer \& 1 while s/(\ed)(\ed\ed\ed)(?!\ed)/$1,$2/g; .Ve .Sp .Vb 2 \& # expand tabs to 8-column spacing \& 1 while s/\et+/' ' x (length($&)*8 - length($`)%8)/e; .Ve .IP "tr/SEARCHLIST/REPLACEMENTLIST/cds" 8 .IX Item "tr/SEARCHLIST/REPLACEMENTLIST/cds" .PD 0 .IP "y/SEARCHLIST/REPLACEMENTLIST/cds" 8 .IX Item "y/SEARCHLIST/REPLACEMENTLIST/cds" .PD Transliterates all occurrences of the characters found in the search list with the corresponding character in the replacement list. It returns the number of characters replaced or deleted. If no string is specified via the =~ or !~ operator, the \f(CW$_\fR string is transliterated. (The string specified with =~ must be a scalar variable, an array element, a hash element, or an assignment to one of those, i.e., an lvalue.) .Sp A character range may be specified with a hyphen, so \f(CW\*(C`tr/A\-J/0\-9/\*(C'\fR does the same replacement as \f(CW\*(C`tr/ACEGIBDFHJ/0246813579/\*(C'\fR. For \fBsed\fR devotees, \f(CW\*(C`y\*(C'\fR is provided as a synonym for \f(CW\*(C`tr\*(C'\fR. If the \&\s-1SEARCHLIST\s0 is delimited by bracketing quotes, the \s-1REPLACEMENTLIST\s0 has its own pair of quotes, which may or may not be bracketing quotes, e.g., \f(CW\*(C`tr[A\-Z][a\-z]\*(C'\fR or \f(CW\*(C`tr(+\e\-*/)/ABCD/\*(C'\fR. .Sp Note that \f(CW\*(C`tr\*(C'\fR does \fBnot\fR do regular expression character classes such as \f(CW\*(C`\ed\*(C'\fR or \f(CW\*(C`[:lower:]\*(C'\fR. The operator is not equivalent to the \fItr\fR\|(1) utility. If you want to map strings between lower/upper cases, see \*(L"lc\*(R" in perlfunc and \*(L"uc\*(R" in perlfunc, and in general consider using the \f(CW\*(C`s\*(C'\fR operator if you need regular expressions. .Sp Note also that the whole range idea is rather unportable between character sets\*(--and even within character sets they may cause results you probably didn't expect. A sound principle is to use only ranges that begin from and end at either alphabets of equal case (a\-e, A\-E), or digits (0\-4). Anything else is unsafe. If in doubt, spell out the character sets in full. .Sp Options: .Sp .Vb 3 \& c Complement the SEARCHLIST. \& d Delete found but unreplaced characters. \& s Squash duplicate replaced characters. .Ve .Sp If the \f(CW\*(C`/c\*(C'\fR modifier is specified, the \s-1SEARCHLIST\s0 character set is complemented. If the \f(CW\*(C`/d\*(C'\fR modifier is specified, any characters specified by \s-1SEARCHLIST\s0 not found in \s-1REPLACEMENTLIST\s0 are deleted. (Note that this is slightly more flexible than the behavior of some \&\fBtr\fR programs, which delete anything they find in the \s-1SEARCHLIST\s0, period.) If the \f(CW\*(C`/s\*(C'\fR modifier is specified, sequences of characters that were transliterated to the same character are squashed down to a single instance of the character. .Sp If the \f(CW\*(C`/d\*(C'\fR modifier is used, the \s-1REPLACEMENTLIST\s0 is always interpreted exactly as specified. Otherwise, if the \s-1REPLACEMENTLIST\s0 is shorter than the \s-1SEARCHLIST\s0, the final character is replicated till it is long enough. If the \s-1REPLACEMENTLIST\s0 is empty, the \s-1SEARCHLIST\s0 is replicated. This latter is useful for counting characters in a class or for squashing character sequences in a class. .Sp Examples: .Sp .Vb 1 \& $ARGV[1] =~ tr/A-Z/a-z/; # canonicalize to lower case .Ve .Sp .Vb 1 \& $cnt = tr/*/*/; # count the stars in $_ .Ve .Sp .Vb 1 \& $cnt = $sky =~ tr/*/*/; # count the stars in $sky .Ve .Sp .Vb 1 \& $cnt = tr/0-9//; # count the digits in $_ .Ve .Sp .Vb 1 \& tr/a-zA-Z//s; # bookkeeper -> bokeper .Ve .Sp .Vb 1 \& ($HOST = $host) =~ tr/a-z/A-Z/; .Ve .Sp .Vb 1 \& tr/a-zA-Z/ /cs; # change non-alphas to single space .Ve .Sp .Vb 2 \& tr [\e200-\e377] \& [\e000-\e177]; # delete 8th bit .Ve .Sp If multiple transliterations are given for a character, only the first one is used: .Sp .Vb 1 \& tr/AAA/XYZ/ .Ve .Sp will transliterate any A to X. .Sp Because the transliteration table is built at compile time, neither the \s-1SEARCHLIST\s0 nor the \s-1REPLACEMENTLIST\s0 are subjected to double quote interpolation. That means that if you want to use variables, you must use an \fIeval()\fR: .Sp .Vb 2 \& eval "tr/$oldlist/$newlist/"; \& die $@ if $@; .Ve .Sp .Vb 1 \& eval "tr/$oldlist/$newlist/, 1" or die $@; .Ve .IP "<<\s-1EOF\s0" 8 .IX Item "<\*(C'\fR which terminates a fileglob started with \f(CW\*(C`<\*(C'\fR. .Sp When searching for single-character non-pairing delimiters, such as \f(CW\*(C`/\*(C'\fR, combinations of \f(CW\*(C`\e\e\*(C'\fR and \f(CW\*(C`\e/\*(C'\fR are skipped. However, when searching for single-character pairing delimiter like \f(CW\*(C`[\*(C'\fR, combinations of \f(CW\*(C`\e\e\*(C'\fR, \f(CW\*(C`\e]\*(C'\fR, and \f(CW\*(C`\e[\*(C'\fR are all skipped, and nested \&\f(CW\*(C`[\*(C'\fR, \f(CW\*(C`]\*(C'\fR are skipped as well. When searching for multicharacter delimiters, nothing is skipped. .Sp For constructs with three-part delimiters (\f(CW\*(C`s///\*(C'\fR, \f(CW\*(C`y///\*(C'\fR, and \&\f(CW\*(C`tr///\*(C'\fR), the search is repeated once more. .Sp During this search no attention is paid to the semantics of the construct. Thus: .Sp .Vb 1 \& "$hash{"$foo/$bar"}" .Ve .Sp or: .Sp .Vb 3 \& m/ \& bar # NOT a comment, this slash / terminated m//! \& /x .Ve .Sp do not form legal quoted expressions. The quoted part ends on the first \f(CW\*(C`"\*(C'\fR and \f(CW\*(C`/\*(C'\fR, and the rest happens to be a syntax error. Because the slash that terminated \f(CW\*(C`m//\*(C'\fR was followed by a \f(CW\*(C`SPACE\*(C'\fR, the example above is not \f(CW\*(C`m//x\*(C'\fR, but rather \f(CW\*(C`m//\*(C'\fR with no \f(CW\*(C`/x\*(C'\fR modifier. So the embedded \f(CW\*(C`#\*(C'\fR is interpreted as a literal \f(CW\*(C`#\*(C'\fR. .IP "Removal of backslashes before delimiters" 4 .IX Item "Removal of backslashes before delimiters" During the second pass, text between the starting and ending delimiters is copied to a safe location, and the \f(CW\*(C`\e\*(C'\fR is removed from combinations consisting of \f(CW\*(C`\e\*(C'\fR and delimiter\*(--or delimiters, meaning both starting and ending delimiters will should these differ. This removal does not happen for multi-character delimiters. Note that the combination \f(CW\*(C`\e\e\*(C'\fR is left intact, just as it was. .Sp Starting from this step no information about the delimiters is used in parsing. .IP "Interpolation" 4 .IX Item "Interpolation" The next step is interpolation in the text obtained, which is now delimiter\-independent. There are four different cases. .RS 4 .ie n .IP """<<'EOF'""\fR, \f(CW""m''""\fR, \f(CW""s'''""\fR, \f(CW""tr///""\fR, \f(CW""y///""" 4 .el .IP "\f(CW<<'EOF'\fR, \f(CWm''\fR, \f(CWs'''\fR, \f(CWtr///\fR, \f(CWy///\fR" 4 .IX Item "<<'EOF', m'', s''', tr///, y///" No interpolation is performed. .ie n .IP "''\fR, \f(CW""q//""" 4 .el .IP "\f(CW''\fR, \f(CWq//\fR" 4 .IX Item "'', q//" The only interpolation is removal of \f(CW\*(C`\e\*(C'\fR from pairs \f(CW\*(C`\e\e\*(C'\fR. .ie n .IP """""\fR, \f(CW``\fR, \f(CW""qq//""\fR, \f(CW""qx//""\fR, \f(CW""""" 4 .el .IP "\f(CW``''\fR, \f(CW``\fR, \f(CWqq//\fR, \f(CWqx//\fR, \f(CW\fR" 4 .IX Item """"", ``, qq//, qx//, " \&\f(CW\*(C`\eQ\*(C'\fR, \f(CW\*(C`\eU\*(C'\fR, \f(CW\*(C`\eu\*(C'\fR, \f(CW\*(C`\eL\*(C'\fR, \f(CW\*(C`\el\*(C'\fR (possibly paired with \f(CW\*(C`\eE\*(C'\fR) are converted to corresponding Perl constructs. Thus, \f(CW"$foo\eQbaz$bar"\fR is converted to \f(CW\*(C`$foo . (quotemeta("baz" . $bar))\*(C'\fR internally. The other combinations are replaced with appropriate expansions. .Sp Let it be stressed that \fIwhatever falls between \f(CI\*(C`\eQ\*(C'\fI and \f(CI\*(C`\eE\*(C'\fI\fR is interpolated in the usual way. Something like \f(CW"\eQ\e\eE"\fR has no \f(CW\*(C`\eE\*(C'\fR inside. instead, it has \f(CW\*(C`\eQ\*(C'\fR, \f(CW\*(C`\e\e\*(C'\fR, and \f(CW\*(C`E\*(C'\fR, so the result is the same as for \f(CW"\e\e\e\eE"\fR. As a general rule, backslashes between \f(CW\*(C`\eQ\*(C'\fR and \f(CW\*(C`\eE\*(C'\fR may lead to counterintuitive results. So, \&\f(CW"\eQ\et\eE"\fR is converted to \f(CW\*(C`quotemeta("\et")\*(C'\fR, which is the same as \f(CW"\e\e\et"\fR (since \s-1TAB\s0 is not alphanumeric). Note also that: .Sp .Vb 2 \& $str = '\et'; \& return "\eQ$str"; .Ve .Sp may be closer to the conjectural \fIintention\fR of the writer of \f(CW"\eQ\et\eE"\fR. .Sp Interpolated scalars and arrays are converted internally to the \f(CW\*(C`join\*(C'\fR and \&\f(CW\*(C`.\*(C'\fR catenation operations. Thus, \f(CW"$foo XXX '@arr'"\fR becomes: .Sp .Vb 1 \& $foo . " XXX '" . (join $", @arr) . "'"; .Ve .Sp All operations above are performed simultaneously, left to right. .Sp Because the result of \f(CW"\eQ STRING \eE"\fR has all metacharacters quoted, there is no way to insert a literal \f(CW\*(C`$\*(C'\fR or \f(CW\*(C`@\*(C'\fR inside a \&\f(CW\*(C`\eQ\eE\*(C'\fR pair. If protected by \f(CW\*(C`\e\*(C'\fR, \f(CW\*(C`$\*(C'\fR will be quoted to became \&\f(CW"\e\e\e$"\fR; if not, it is interpreted as the start of an interpolated scalar. .Sp Note also that the interpolation code needs to make a decision on where the interpolated scalar ends. For instance, whether \&\f(CW"a $b \-> {c}"\fR really means: .Sp .Vb 1 \& "a " . $b . " -> {c}"; .Ve .Sp or: .Sp .Vb 1 \& "a " . $b -> {c}; .Ve .Sp Most of the time, the longest possible text that does not include spaces between components and which contains matching braces or brackets. because the outcome may be determined by voting based on heuristic estimators, the result is not strictly predictable. Fortunately, it's usually correct for ambiguous cases. .ie n .IP """?RE?""\fR, \f(CW""/RE/""\fR, \f(CW""m/RE/""\fR, \f(CW""s/RE/foo/""," 4 .el .IP "\f(CW?RE?\fR, \f(CW/RE/\fR, \f(CWm/RE/\fR, \f(CWs/RE/foo/\fR," 4 .IX Item "?RE?, /RE/, m/RE/, s/RE/foo/," Processing of \f(CW\*(C`\eQ\*(C'\fR, \f(CW\*(C`\eU\*(C'\fR, \f(CW\*(C`\eu\*(C'\fR, \f(CW\*(C`\eL\*(C'\fR, \f(CW\*(C`\el\*(C'\fR, and interpolation happens (almost) as with \f(CW\*(C`qq//\*(C'\fR constructs, but the substitution of \f(CW\*(C`\e\*(C'\fR followed by RE-special chars (including \f(CW\*(C`\e\*(C'\fR) is not performed. Moreover, inside \f(CW\*(C`(?{BLOCK})\*(C'\fR, \f(CW\*(C`(?# comment )\*(C'\fR, and a \f(CW\*(C`#\*(C'\fR\-comment in a \f(CW\*(C`//x\*(C'\fR\-regular expression, no processing is performed whatsoever. This is the first step at which the presence of the \f(CW\*(C`//x\*(C'\fR modifier is relevant. .Sp Interpolation has several quirks: \f(CW$|\fR, \f(CW$(\fR, and \f(CW$)\fR are not interpolated, and constructs \f(CW$var[SOMETHING]\fR are voted (by several different estimators) to be either an array element or \f(CW$var\fR followed by an \s-1RE\s0 alternative. This is where the notation \&\f(CW\*(C`${arr[$bar]}\*(C'\fR comes handy: \f(CW\*(C`/${arr[0\-9]}/\*(C'\fR is interpreted as array element \f(CW\*(C`\-9\*(C'\fR, not as a regular expression from the variable \&\f(CW$arr\fR followed by a digit, which would be the interpretation of \&\f(CW\*(C`/$arr[0\-9]/\*(C'\fR. Since voting among different estimators may occur, the result is not predictable. .Sp It is at this step that \f(CW\*(C`\e1\*(C'\fR is begrudgingly converted to \f(CW$1\fR in the replacement text of \f(CW\*(C`s///\*(C'\fR to correct the incorrigible \&\fIsed\fR hackers who haven't picked up the saner idiom yet. A warning is emitted if the \f(CW\*(C`use warnings\*(C'\fR pragma or the \fB\-w\fR command-line flag (that is, the \f(CW$^W\fR variable) was set. .Sp The lack of processing of \f(CW\*(C`\e\e\*(C'\fR creates specific restrictions on the post-processed text. If the delimiter is \f(CW\*(C`/\*(C'\fR, one cannot get the combination \f(CW\*(C`\e/\*(C'\fR into the result of this step. \f(CW\*(C`/\*(C'\fR will finish the regular expression, \f(CW\*(C`\e/\*(C'\fR will be stripped to \f(CW\*(C`/\*(C'\fR on the previous step, and \f(CW\*(C`\e\e/\*(C'\fR will be left as is. Because \f(CW\*(C`/\*(C'\fR is equivalent to \f(CW\*(C`\e/\*(C'\fR inside a regular expression, this does not matter unless the delimiter happens to be character special to the \&\s-1RE\s0 engine, such as in \f(CW\*(C`s*foo*bar*\*(C'\fR, \f(CW\*(C`m[foo]\*(C'\fR, or \f(CW\*(C`?foo?\*(C'\fR; or an alphanumeric char, as in: .Sp .Vb 1 \& m m ^ a \es* b mmx; .Ve .Sp In the \s-1RE\s0 above, which is intentionally obfuscated for illustration, the delimiter is \f(CW\*(C`m\*(C'\fR, the modifier is \f(CW\*(C`mx\*(C'\fR, and after backslash-removal the \&\s-1RE\s0 is the same as for \f(CW\*(C`m/ ^ a s* b /mx\*(C'\fR). There's more than one reason you're encouraged to restrict your delimiters to non\-alphanumeric, non-whitespace choices. .RE .RS 4 .Sp This step is the last one for all constructs except regular expressions, which are processed further. .RE .IP "Interpolation of regular expressions" 4 .IX Item "Interpolation of regular expressions" Previous steps were performed during the compilation of Perl code, but this one happens at run time\*(--although it may be optimized to be calculated at compile time if appropriate. After preprocessing described above, and possibly after evaluation if catenation, joining, casing translation, or metaquoting are involved, the resulting \fIstring\fR is passed to the \s-1RE\s0 engine for compilation. .Sp Whatever happens in the \s-1RE\s0 engine might be better discussed in perlre, but for the sake of continuity, we shall do so here. .Sp This is another step where the presence of the \f(CW\*(C`//x\*(C'\fR modifier is relevant. The \s-1RE\s0 engine scans the string from left to right and converts it to a finite automaton. .Sp Backslashed characters are either replaced with corresponding literal strings (as with \f(CW\*(C`\e{\*(C'\fR), or else they generate special nodes in the finite automaton (as with \f(CW\*(C`\eb\*(C'\fR). Characters special to the \&\s-1RE\s0 engine (such as \f(CW\*(C`|\*(C'\fR) generate corresponding nodes or groups of nodes. \f(CW\*(C`(?#...)\*(C'\fR comments are ignored. All the rest is either converted to literal strings to match, or else is ignored (as is whitespace and \f(CW\*(C`#\*(C'\fR\-style comments if \f(CW\*(C`//x\*(C'\fR is present). .Sp Parsing of the bracketed character class construct, \f(CW\*(C`[...]\*(C'\fR, is rather different than the rule used for the rest of the pattern. The terminator of this construct is found using the same rules as for finding the terminator of a \f(CW\*(C`{}\*(C'\fR\-delimited construct, the only exception being that \f(CW\*(C`]\*(C'\fR immediately following \f(CW\*(C`[\*(C'\fR is treated as though preceded by a backslash. Similarly, the terminator of \&\f(CW\*(C`(?{...})\*(C'\fR is found using the same rules as for finding the terminator of a \f(CW\*(C`{}\*(C'\fR\-delimited construct. .Sp It is possible to inspect both the string given to \s-1RE\s0 engine and the resulting finite automaton. See the arguments \f(CW\*(C`debug\*(C'\fR/\f(CW\*(C`debugcolor\*(C'\fR in the \f(CW\*(C`use re\*(C'\fR pragma, as well as Perl's \fB\-Dr\fR command-line switch documented in \*(L"Command Switches\*(R" in perlrun. .IP "Optimization of regular expressions" 4 .IX Item "Optimization of regular expressions" This step is listed for completeness only. Since it does not change semantics, details of this step are not documented and are subject to change without notice. This step is performed over the finite automaton that was generated during the previous pass. .Sp It is at this stage that \f(CW\*(C`split()\*(C'\fR silently optimizes \f(CW\*(C`/^/\*(C'\fR to mean \f(CW\*(C`/^/m\*(C'\fR. .Sh "I/O Operators" .IX Subsection "I/O Operators" There are several I/O operators you should know about. .PP A string enclosed by backticks (grave accents) first undergoes double-quote interpolation. It is then interpreted as an external command, and the output of that command is the value of the backtick string, like in a shell. In scalar context, a single string consisting of all output is returned. In list context, a list of values is returned, one per line of output. (You can set \f(CW$/\fR to use a different line terminator.) The command is executed each time the pseudo-literal is evaluated. The status value of the command is returned in \f(CW$?\fR (see perlvar for the interpretation of \f(CW$?\fR). Unlike in \fBcsh\fR, no translation is done on the return data\*(--newlines remain newlines. Unlike in any of the shells, single quotes do not hide variable names in the command from interpretation. To pass a literal dollar-sign through to the shell you need to hide it with a backslash. The generalized form of backticks is \f(CW\*(C`qx//\*(C'\fR. (Because backticks always undergo shell expansion as well, see perlsec for security concerns.) .PP In scalar context, evaluating a filehandle in angle brackets yields the next line from that file (the newline, if any, included), or \&\f(CW\*(C`undef\*(C'\fR at end-of-file or on error. When \f(CW$/\fR is set to \f(CW\*(C`undef\*(C'\fR (sometimes known as file-slurp mode) and the file is empty, it returns \f(CW''\fR the first time, followed by \f(CW\*(C`undef\*(C'\fR subsequently. .PP Ordinarily you must assign the returned value to a variable, but there is one situation where an automatic assignment happens. If and only if the input symbol is the only thing inside the conditional of a \f(CW\*(C`while\*(C'\fR statement (even if disguised as a \f(CW\*(C`for(;;)\*(C'\fR loop), the value is automatically assigned to the global variable \f(CW$_\fR, destroying whatever was there previously. (This may seem like an odd thing to you, but you'll use the construct in almost every Perl script you write.) The \f(CW$_\fR variable is not implicitly localized. You'll have to put a \f(CW\*(C`local $_;\*(C'\fR before the loop if you want that to happen. .PP The following lines are equivalent: .PP .Vb 7 \& while (defined($_ = )) { print; } \& while ($_ = ) { print; } \& while () { print; } \& for (;;) { print; } \& print while defined($_ = ); \& print while ($_ = ); \& print while ; .Ve .PP This also behaves similarly, but avoids \f(CW$_\fR : .PP .Vb 1 \& while (my $line = ) { print $line } .Ve .PP In these loop constructs, the assigned value (whether assignment is automatic or explicit) is then tested to see whether it is defined. The defined test avoids problems where line has a string value that would be treated as false by Perl, for example a "\*(L" or a \*(R"0" with no trailing newline. If you really mean for such values to terminate the loop, they should be tested for explicitly: .PP .Vb 2 \& while (($_ = ) ne '0') { ... } \& while () { last unless $_; ... } .Ve .PP In other boolean contexts, \f(CW\*(C`<\f(CIfilehandle\f(CW>\*(C'\fR without an explicit \f(CW\*(C`defined\*(C'\fR test or comparison elicit a warning if the \&\f(CW\*(C`use warnings\*(C'\fR pragma or the \fB\-w\fR command-line switch (the \f(CW$^W\fR variable) is in effect. .PP The filehandles \s-1STDIN\s0, \s-1STDOUT\s0, and \s-1STDERR\s0 are predefined. (The filehandles \f(CW\*(C`stdin\*(C'\fR, \f(CW\*(C`stdout\*(C'\fR, and \f(CW\*(C`stderr\*(C'\fR will also work except in packages, where they would be interpreted as local identifiers rather than global.) Additional filehandles may be created with the \fIopen()\fR function, amongst others. See perlopentut and \&\*(L"open\*(R" in perlfunc for details on this. .PP If a <\s-1FILEHANDLE\s0> is used in a context that is looking for a list, a list comprising all input lines is returned, one line per list element. It's easy to grow to a rather large data space this way, so use with care. .PP <\s-1FILEHANDLE\s0> may also be spelled \f(CW\*(C`readline(*FILEHANDLE)\*(C'\fR. See \*(L"readline\*(R" in perlfunc. .PP The null filehandle <> is special: it can be used to emulate the behavior of \fBsed\fR and \fBawk\fR. Input from <> comes either from standard input, or from each file listed on the command line. Here's how it works: the first time <> is evaluated, the \f(CW@ARGV\fR array is checked, and if it is empty, \f(CW$ARGV[0]\fR is set to \*(L"\-\*(R", which when opened gives you standard input. The \f(CW@ARGV\fR array is then processed as a list of filenames. The loop .PP .Vb 3 \& while (<>) { \& ... # code for each line \& } .Ve .PP is equivalent to the following Perl-like pseudo code: .PP .Vb 7 \& unshift(@ARGV, '-') unless @ARGV; \& while ($ARGV = shift) { \& open(ARGV, $ARGV); \& while () { \& ... # code for each line \& } \& } .Ve .PP except that it isn't so cumbersome to say, and will actually work. It really does shift the \f(CW@ARGV\fR array and put the current filename into the \f(CW$ARGV\fR variable. It also uses filehandle \fI\s-1ARGV\s0\fR internally\-\-<> is just a synonym for <\s-1ARGV\s0>, which is magical. (The pseudo code above doesn't work because it treats <\s-1ARGV\s0> as non\-magical.) .PP You can modify \f(CW@ARGV\fR before the first <> as long as the array ends up containing the list of filenames you really want. Line numbers (\f(CW$.\fR) continue as though the input were one big happy file. See the example in \*(L"eof\*(R" in perlfunc for how to reset line numbers on each file. .PP If you want to set \f(CW@ARGV\fR to your own list of files, go right ahead. This sets \f(CW@ARGV\fR to all plain text files if no \f(CW@ARGV\fR was given: .PP .Vb 1 \& @ARGV = grep { -f && -T } glob('*') unless @ARGV; .Ve .PP You can even set them to pipe commands. For example, this automatically filters compressed arguments through \fBgzip\fR: .PP .Vb 1 \& @ARGV = map { /\e.(gz|Z)$/ ? "gzip -dc < $_ |" : $_ } @ARGV; .Ve .PP If you want to pass switches into your script, you can use one of the Getopts modules or put a loop on the front like this: .PP .Vb 7 \& while ($_ = $ARGV[0], /^-/) { \& shift; \& last if /^--$/; \& if (/^-D(.*)/) { $debug = $1 } \& if (/^-v/) { $verbose++ } \& # ... # other switches \& } .Ve .PP .Vb 3 \& while (<>) { \& # ... # code for each line \& } .Ve .PP The <> symbol will return \f(CW\*(C`undef\*(C'\fR for end-of-file only once. If you call it again after this, it will assume you are processing another \&\f(CW@ARGV\fR list, and if you haven't set \f(CW@ARGV\fR, will read input from \s-1STDIN\s0. .PP If what the angle brackets contain is a simple scalar variable (e.g., <$foo>), then that variable contains the name of the filehandle to input from, or its typeglob, or a reference to the same. For example: .PP .Vb 2 \& $fh = \e*STDIN; \& $line = <$fh>; .Ve .PP If what's within the angle brackets is neither a filehandle nor a simple scalar variable containing a filehandle name, typeglob, or typeglob reference, it is interpreted as a filename pattern to be globbed, and either a list of filenames or the next filename in the list is returned, depending on context. This distinction is determined on syntactic grounds alone. That means \f(CW\*(C`<$x>\*(C'\fR is always a \fIreadline()\fR from an indirect handle, but \f(CW\*(C`<$hash{key}>\*(C'\fR is always a \fIglob()\fR. That's because \f(CW$x\fR is a simple scalar variable, but \f(CW$hash{key}\fR is not\*(--it's a hash element. .PP One level of double-quote interpretation is done first, but you can't say \f(CW\*(C`<$foo>\*(C'\fR because that's an indirect filehandle as explained in the previous paragraph. (In older versions of Perl, programmers would insert curly brackets to force interpretation as a filename glob: \&\f(CW\*(C`<${foo}>\*(C'\fR. These days, it's considered cleaner to call the internal function directly as \f(CW\*(C`glob($foo)\*(C'\fR, which is probably the right way to have done it in the first place.) For example: .PP .Vb 3 \& while (<*.c>) { \& chmod 0644, $_; \& } .Ve .PP is roughly equivalent to: .PP .Vb 5 \& open(FOO, "echo *.c | tr -s ' \et\er\ef' '\e\e012\e\e012\e\e012\e\e012'|"); \& while () { \& chomp; \& chmod 0644, $_; \& } .Ve .PP except that the globbing is actually done internally using the standard \&\f(CW\*(C`File::Glob\*(C'\fR extension. Of course, the shortest way to do the above is: .PP .Vb 1 \& chmod 0644, <*.c>; .Ve .PP A (file)glob evaluates its (embedded) argument only when it is starting a new list. All values must be read before it will start over. In list context, this isn't important because you automatically get them all anyway. However, in scalar context the operator returns the next value each time it's called, or \f(CW\*(C`undef\*(C'\fR when the list has run out. As with filehandle reads, an automatic \f(CW\*(C`defined\*(C'\fR is generated when the glob occurs in the test part of a \f(CW\*(C`while\*(C'\fR, because legal glob returns (e.g. a file called \fI0\fR) would otherwise terminate the loop. Again, \f(CW\*(C`undef\*(C'\fR is returned only once. So if you're expecting a single value from a glob, it is much better to say .PP .Vb 1 \& ($file) = ; .Ve .PP than .PP .Vb 1 \& $file = ; .Ve .PP because the latter will alternate between returning a filename and returning false. .PP If you're trying to do variable interpolation, it's definitely better to use the \fIglob()\fR function, because the older notation can cause people to become confused with the indirect filehandle notation. .PP .Vb 2 \& @files = glob("$dir/*.[ch]"); \& @files = glob($files[$i]); .Ve .Sh "Constant Folding" .IX Subsection "Constant Folding" Like C, Perl does a certain amount of expression evaluation at compile time whenever it determines that all arguments to an operator are static and have no side effects. In particular, string concatenation happens at compile time between literals that don't do variable substitution. Backslash interpolation also happens at compile time. You can say .PP .Vb 2 \& 'Now is the time for all' . "\en" . \& 'good men to come to.' .Ve .PP and this all reduces to one string internally. Likewise, if you say .PP .Vb 3 \& foreach $file (@filenames) { \& if (-s $file > 5 + 100 * 2**16) { } \& } .Ve .PP the compiler will precompute the number which that expression represents so that the interpreter won't have to. .Sh "Bitwise String Operators" .IX Subsection "Bitwise String Operators" Bitstrings of any size may be manipulated by the bitwise operators (\f(CW\*(C`~ | & ^\*(C'\fR). .PP If the operands to a binary bitwise op are strings of different sizes, \fB|\fR and \fB^\fR ops act as though the shorter operand had additional zero bits on the right, while the \fB&\fR op acts as though the longer operand were truncated to the length of the shorter. The granularity for such extension or truncation is one or more bytes. .PP .Vb 5 \& # ASCII-based examples \& print "j p \en" ^ " a h"; # prints "JAPH\en" \& print "JA" | " ph\en"; # prints "japh\en" \& print "japh\enJunk" & '_____'; # prints "JAPH\en"; \& print 'p N$' ^ " E>\*(R") always produce integral results. (But see also \&\*(L"Bitwise String Operators\*(R".) However, \f(CW\*(C`use integer\*(C'\fR still has meaning for them. By default, their results are interpreted as unsigned integers, but if \f(CW\*(C`use integer\*(C'\fR is in effect, their results are interpreted as signed integers. For example, \f(CW\*(C`~0\*(C'\fR usually evaluates to a large integral value. However, \f(CW\*(C`use integer; ~0\*(C'\fR is \f(CW\*(C`\-1\*(C'\fR on twos-complement machines. .Sh "Floating-point Arithmetic" .IX Subsection "Floating-point Arithmetic" While \f(CW\*(C`use integer\*(C'\fR provides integer-only arithmetic, there is no analogous mechanism to provide automatic rounding or truncation to a certain number of decimal places. For rounding to a certain number of digits, \fIsprintf()\fR or \fIprintf()\fR is usually the easiest route. See perlfaq4. .PP Floating-point numbers are only approximations to what a mathematician would call real numbers. There are infinitely more reals than floats, so some corners must be cut. For example: .PP .Vb 2 \& printf "%.20g\en", 123456789123456789; \& # produces 123456789123456784 .Ve .PP Testing for exact equality of floating-point equality or inequality is not a good idea. Here's a (relatively expensive) work-around to compare whether two floating-point numbers are equal to a particular number of decimal places. See Knuth, volume \s-1II\s0, for a more robust treatment of this topic. .PP .Vb 7 \& sub fp_equal { \& my ($X, $Y, $POINTS) = @_; \& my ($tX, $tY); \& $tX = sprintf("%.${POINTS}g", $X); \& $tY = sprintf("%.${POINTS}g", $Y); \& return $tX eq $tY; \& } .Ve .PP The \s-1POSIX\s0 module (part of the standard perl distribution) implements \&\fIceil()\fR, \fIfloor()\fR, and other mathematical and trigonometric functions. The Math::Complex module (part of the standard perl distribution) defines mathematical functions that work on both the reals and the imaginary numbers. Math::Complex not as efficient as \s-1POSIX\s0, but \&\s-1POSIX\s0 can't work with complex numbers. .PP Rounding in financial applications can have serious implications, and the rounding method used should be specified precisely. In these cases, it probably pays not to trust whichever system rounding is being used by Perl, but to instead implement the rounding function you need yourself. .Sh "Bigger Numbers" .IX Subsection "Bigger Numbers" The standard Math::BigInt and Math::BigFloat modules provide variable-precision arithmetic and overloaded operators, although they're currently pretty slow. At the cost of some space and considerable speed, they avoid the normal pitfalls associated with limited-precision representations. .PP .Vb 3 \& use Math::BigInt; \& $x = Math::BigInt->new('123456789123456789'); \& print $x * $x; .Ve .PP .Vb 1 \& # prints +15241578780673678515622620750190521 .Ve .PP There are several modules that let you calculate with (bound only by memory and cpu\-time) unlimited or fixed precision. There are also some non-standard modules that provide faster implementations via external C libraries. .PP Here is a short, but incomplete summary: .PP .Vb 11 \& Math::Fraction big, unlimited fractions like 9973 / 12967 \& Math::String treat string sequences like numbers \& Math::FixedPrecision calculate with a fixed precision \& Math::Currency for currency calculations \& Bit::Vector manipulate bit vectors fast (uses C) \& Math::BigIntFast Bit::Vector wrapper for big numbers \& Math::Pari provides access to the Pari C library \& Math::BigInteger uses an external C library \& Math::Cephes uses external Cephes C library (no big numbers) \& Math::Cephes::Fraction fractions via the Cephes library \& Math::GMP another one using an external C library .Ve .PP Choose wisely.