Leaked source code of windows server 2003
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

1936 lines
74 KiB

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