Re^2: number of numbers in a string

Replies are listed 'Best First'.
Re^3: number of numbers in a string by japhy (Canon) on Aug 12, 2004 at 18:14 UTC
Accounting only for integers, we have: `my $n = 0; $n += map .5(1+length)length, $s =~ /\d+/g;` [download] This makes use of the triangular pattern that the number "1234" has 10 "embedded numbers" (1234, 123, 12, 1, 234, 23, 2, 34, 3, 4). No need to put all that hard work in the regex itself. Although, if you wanted to, it'd be: `our $n; $s =~ /\d+(??{ ++$n })(?!)/;` [download] _____________________________________________________ Jeff `japhy` Pinyan, P.L., P.M., P.O.D, X.S.: Perl, regex, and `perl` hacker How can we ever be the sold short or the cheated, we who for every service have long ago been overpaid? ~~ Meister Eckhart	[reply] [d/l] [select]
Re^3: number of numbers in a string by Joost (Canon) on Aug 12, 2004 at 18:24 UTC
how about this (works on STDIN): `#!/usr/bin/perl -ln $n+=(1<<length)-1for/(\d+)/g; END{print $n}` [download] ignore that, I'm off to think. "What should it profit a man, if he should win a flame war, yet lose his cool?"	[reply] [d/l]