Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: Regex match for Any number of words?

by sbrothy (Acolyte)
on Jan 20, 2022 at 11:55 UTC ( #11140638=note: print w/replies, xml ) Need Help??


in reply to Re^2: Regex match for Any number of words?
in thread Regex match for Any number of words?

This is ofcourse C++ and not perl. Still, for completeness sake:

I ended up using boost::regex_token_iterator.

So in all it's glorious simplicity it ended up being just:

boost::regex re("\\s+");

Regards.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (3)
As of 2022-08-14 01:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?