Can anyone figure this out?

Here's a subroutine I made to find the total number of digits in a string(sounds simple, but very obsfucated, to say the least). Can anyone figure out how/why it works? Here it is:

sub findAllDigits { 
$_=pop;s;\d;($&&~433)x$&>4?2:$&;geese};
}
[download]

Comment on Can anyone figure this out? Download Code

Replies are listed 'Best First'.
Re: Can anyone figure this out? by chipmunk (Parson) on Jun 04, 2001 at 06:35 UTC
It turns out that this is as simple as it sounds. s///g returns the number of matches found. The replacement in the substitution here is entirely irrelevant, as are the three /e modifiers. The subroutine could be rewritten as: `sub { $_ = pop; s/\d//g; }` [download] It took me a little while to figure it out, though. :)	[reply] [d/l]
Re: Can anyone figure this out? by srawls (Friar) on Jun 04, 2001 at 01:12 UTC
Note: you had a type, take off the { and ; and it will work. Well, I'll leave it to someone else to explain it, but I'll give you some tips to improve your obfu. 1. Use as few parentheses as possible: when you write `($&&~433)x ...` you don't need those parentheses. It makes it harder to understand if you use as few parentheses as possible, I suggest you scan the precedence table while you are writing your obfu. 2. your $test:$one?$two is a little easy to understand. I would change your: `($&&~433)x$&>4?2:$&` [download] to this: `$&&~433x$&>4$^F+(!$&>4$&)` [download] Note I also used one of perl's special variables ($^F) instead of the number 2. The 15 year old, freshman programmer, Stephen Rawls	[reply] [d/l] [select]
A reply falls below the community's threshold of quality. You may see it by logging in.


Perl Monk, Perl Meditation
	PerlMonks