Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Benchmarking "Are all these characters in this sentence?"

by martin (Friar)
on Sep 05, 2008 at 14:33 UTC ( [id://709290]=note: print w/replies, xml ) Need Help??


in reply to Benchmarking "Are all these characters in this sentence?"

Just for completeness, try this one, too:
martin => sub { # args: sentence, wantedchars '' eq $_[1] || '' ne $_[0] && $_[1] =~ /^[\Q$_[0]\E]*\z/; },
Putting the whole sentence into a character class will kind of suck with veeery long sentences but medium-sized cases should benefit from the one-pass approach.

Update: fixed the order of subroutine parameters

Replies are listed 'Best First'.
Re^2: Benchmarking "Are all these characters in this sentence?"
by RMGir (Prior) on Sep 05, 2008 at 17:22 UTC
    You're checking whether only the wantedchars are used.

    That wouldn't work. The question isn't whether the sentence consists ONLY of characters in the wantedchars, just whether or not ALL the wantedchars are present.


    Mike
      You're checking whether only the wantedchars are used.

      Not quite. It's supposed to be the other way round. The idea is to check whether $wantedchars only contains characters from $sentence.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://709290]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others surveying the Monastery: (2)
As of 2024-04-19 19:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found