Re^3: Golf for unique digits (17)

tye++ ... but I'm stuck to understand how it works?

According to perlop:

Searches a string for a pattern, and if found, replaces that pattern with the replacement text and returns the number of substitutions made.

How does the number of substitutions made equate to the number of characters left after the substitutions?

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^3: Golf for unique digits (17)

Replies are listed 'Best First'.
Re^4: Golf for unique digits (17) by LanX (Saint) on Jan 09, 2013 at 19:05 UTC
>How does the number of substitutions made equate to the number of characters left after the substitutions? `(?!..)` = not followed by! every cipher is exactly once the last of it's kind! =) Cheers Rolf	[reply] [d/l]
Re^5: Golf for unique digits (17) by BrowserUk (Patriarch) on Jan 09, 2013 at 19:10 UTC
Of course! Thanks. With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday' Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. "Science is about questioning the status quo. Questioning authority". In the absence of evidence, opinion is indistinguishable from prejudice.	[reply]