Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re: Regex match for Any number of words?

by Anonymous Monk
on Jan 16, 2022 at 12:38 UTC ( #11140504=note: print w/replies, xml ) Need Help??

in reply to Regex match for Any number of words?

Replies are listed 'Best First'.
Re^2: Regex match for Any number of words?
by sbrothy (Acolyte) on Jan 17, 2022 at 11:13 UTC
    Wow, thank you all. I'd expected you'd wait and see if I did any work of my own before answering but I completely forgot about this until now. These answers were all very helpful. Again, thank you! :)

      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+");


Log In?

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (8)
As of 2022-10-04 12:46 GMT
Find Nodes?
    Voting Booth?
    My preferred way to holiday/vacation is:

    Results (17 votes). Check out past polls.