How do I iterate over the words of a string

Question

I m trying to iterate over the words of a string   The string can be assumed to be composed of words separated by whitespace   Note that I m not interested in C string functions or that kind of character manipulation access  Also  please give precedence to elegance over efficiency in your answer   The best solution I have right now is    include  lt iostream gt   include  lt sstream gt   include  lt string gt   using namespace std   int main         string s    Somewhere down the road       istringstream iss s        do               string subs          iss  gt  gt  subs          cout  lt  lt   Substring     lt  lt  subs  lt  lt  endl        while  iss       Is there a more elegant way to do this

User · Answer

The stringstream can be convenient if you need to parse the string by non-space symbols   string s    Name JAck  Spouse Susan        string dummy  name  spouse   istringstream iss s   getline iss  dummy        getline iss  name        getline iss  dummy        getline iss  spouse

User · Answer

As a hobbyist  this is the first solution that came to my mind  I m kind of curious why I haven t seen a similar solution here yet  is there something fundamentally wrong with how I did it    include  lt iostream gt   include  lt string gt   include  lt vector gt   std  vector lt std  string gt  split const std  string  amp s  const std  string  amp delims        std  vector lt std  string gt  result      std  string  size type pos   0      while  std  string  npos     pos   s find first not of delims  pos              auto pos2   s find first of delims  pos           result emplace back s substr pos  std  string  npos    pos2   pos2   pos2 - pos            pos   pos2            return result     int main         std  string text  And then I said    I don t get it  why would you even do that            std  string delims                   auto words   split text  delims       std  cout  lt  lt    nSentence  n     lt  lt  text  lt  lt    n nWords        for  const auto  amp w   words            std  cout  lt  lt    n     lt  lt  w            return 0      http   cpp sh 7wmzy

User · Answer

I use this to split string by a delimiter  The first puts the results in a pre-constructed vector  the second returns a new vector      include  lt string gt   include  lt sstream gt   include  lt vector gt   include  lt iterator gt   template  lt typename Out gt  void split const std  string  amp s  char delim  Out result        std  istringstream iss s       std  string item      while  std  getline iss  item  delim              result     item           std  vector lt std  string gt  split const std  string  amp s  char delim        std  vector lt std  string gt  elems      split s  delim  std  back inserter elems        return elems        Note that this solution does not skip empty tokens  so the following will find 4 items  one of which is empty   std  vector lt std  string gt  x   split  one two  three

User · Answer

include  lt iostream gt   include  lt vector gt  using namespace std   int main       string str    ABC AABCD CDDD RABC GHTTYU FR     str           dirty hack  adding extra space to the end   vector lt string gt  v     for  int i 0  i lt  int str size    i          int a  b      a   i       for  int j i  j lt  int str size    j            if  str j                    b   j          i   j          break                    v push back str substr a  b-a           for  int i 0  i lt v size    i          cout lt  lt v i  size   lt  lt     lt  lt v i  lt  lt endl        return 0

User · Answer

This is an extension of one of the top answers  It now supports setting a max number of returned elements  N  The last bit of the string will end up in the Nth element  The MAXELEMENTS parameter is optional  if set at default 0 it will return an unlimited amount of elements   -    h   class Myneatclass   public      static std  vector lt std  string gt  amp  split const std  string  amp s  char delim  std  vector lt std  string gt   amp elems  const size t MAXELEMENTS   0       static std  vector lt std  string gt  split const std  string  amp s  char delim  const size t MAXELEMENTS   0         cpp   std  vector lt std  string gt  amp  Myneatclass  split const std  string  amp s  char delim  std  vector lt std  string gt   amp elems  const size t MAXELEMENTS        std  stringstream ss s       std  string item      while  std  getline ss  item  delim             elems push back item           if  MAXELEMENTS  gt  0  amp  amp   ss eof    amp  amp  elems size     1  gt   MAXELEMENTS                std  getline ss  item               elems push back item               break                      return elems    std  vector lt std  string gt  Myneatclass  split const std  string  amp s  char delim  const size t MAXELEMENTS        std  vector lt std  string gt  elems      split s  delim  elems  MAXELEMENTS       return elems

User · Answer

Using std  stringstream as you have works perfectly fine  and do exactly what you wanted  If you re just looking for different way of doing things though  you can use std  find   std  find first of   and std  string  substr     Here s an example    include  lt iostream gt   include  lt string gt   int main         std  string s  Somewhere down the road        std  string  size type prev pos   0  pos   0       while   pos   s find      pos      std  string  npos                 std  string substring  s substr prev pos  pos-prev pos              std  cout  lt  lt  substring  lt  lt    n            prev pos     pos             std  string substring  s substr prev pos  pos-prev pos        Last word     std  cout  lt  lt  substring  lt  lt    n        return 0

User · Answer

include  lt iostream gt   include  lt string gt   include  lt deque gt   std  deque lt std  string gt  split      const std  string amp  line       std  string  value type delimiter      bool skipEmpty   false         std  deque lt std  string gt  parts         if   skipEmpty  amp  amp   line empty    amp  amp  delimiter    line at 0             parts push back                 for  const std  string  value type amp  c   line            if                                 c    delimiter                   amp  amp                   skipEmpty     parts empty    amp  amp   parts back   empty      true                                            c    delimiter  amp  amp  parts empty                            parts push back                         if  c    delimiter                parts back   push back c                        if  skipEmpty  amp  amp   parts empty    amp  amp  parts back   empty              parts pop back               return parts     void test const std  string amp  line        std  cout  lt  lt  line  lt  lt  std  endl       std  cout  lt  lt   skipEmpty 0         for  const std  string amp  part   split line                  std  cout  lt  lt  part  lt  lt                 std  cout  lt  lt  std  endl       std  cout  lt  lt   skipEmpty 1         for  const std  string amp  part   split line       true             std  cout  lt  lt  part  lt  lt                 std  cout  lt  lt  std  endl       std  cout  lt  lt  std  endl     int main         test  foo bar   baz        test          test  foo        test           test            test   foo        test    foo        test   foo         test   foo           return 0      Output   foo bar   baz skipEmpty 0  foo bar   baz  skipEmpty 1  foo bar baz    skipEmpty 0   skipEmpty 1    foo skipEmpty 0  foo  skipEmpty 1  foo     skipEmpty 0     skipEmpty 1       skipEmpty 0      skipEmpty 1     foo skipEmpty 0   foo  skipEmpty 1  foo     foo skipEmpty 0    foo  skipEmpty 1  foo    foo  skipEmpty 0   foo   skipEmpty 1  foo    foo   skipEmpty 0   foo    skipEmpty 1  foo

User · Answer

Heres a regex solution that only uses the standard regex library    I m a little rusty  so there may be a few syntax errors  but this is at least the general idea    include  lt regex h gt   include  lt string h gt   include  lt vector h gt   using namespace std   vector lt string gt  split string s       regex r     w       regex matches whole words   greedy  so no fragment words      regex iterator lt string  iterator gt  rit   s begin    s end    r        regex iterator lt string  iterator gt  rend    iterators to iterate thru words     vector lt string gt  result lt regex iterator gt  rit  rend       return result     iterates through the matches to fill the vector

User · Answer

This answer takes the string and puts it into a vector of strings  It uses the boost library    include  lt boost algorithm string hpp gt  std  vector lt std  string gt  strs  boost  split strs   string to split   boost  is any of   t

User · Answer

Here s my entry   template  lt typename Container  typename InputIter  typename ForwardIter gt  Container split InputIter first  InputIter last        ForwardIter s first  ForwardIter s last        Container output       while  true            auto pos   std  find first of first  last  s first  s last           output emplace back first  pos           if  pos    last                break                     first     pos             return output     template  lt typename Output   std  vector lt std  string gt             typename Input   std  string            typename Delims   std  string gt  Output split const Input amp  input  const Delims amp  delims              using std  cbegin      using std  cend      return split lt Output gt  cbegin input   cend input                            cbegin delims   cend delims       auto vec   split  Mary had a little lamb      The first definition is an STL-style generic function taking two pair of iterators  The second is a convenience function to save you having to do all the begin  s and end  s yourself  You can also specify the output container type as a template parameter if you wanted to use a list  for example   What makes it elegant  IMO  is that unlike most of the other answers  it s not restricted to strings but will work with any STL-compatible container  Without any change to the code above  you can say   using vec of vecs t   std  vector lt std  vector lt int gt  gt    std  vector lt int gt  v 1  2  0  3  4  5  0  7  8  0  9   auto r   split lt vec of vecs t gt  v  std  initializer list lt int gt  0  2      which will split the vector v into separate vectors every time a 0 or a 2 is encountered    There s also the added bonus that with strings  this implementation is faster than both strtok  - and getline  -based versions  at least on my system

User · Answer

This is my favorite way to iterate through a string  You can do whatever you want per word   string line    a line of text to iterate through   string word   istringstream iss line  istringstream  in    while  iss  gt  gt  word                 Do something on  word  here

User · Answer

This is an extension of one of the top answers  It now supports setting a max number of returned elements  N  The last bit of the string will end up in the Nth element  The MAXELEMENTS parameter is optional  if set at default 0 it will return an unlimited amount of elements   -    h   class Myneatclass   public      static std  vector lt std  string gt  amp  split const std  string  amp s  char delim  std  vector lt std  string gt   amp elems  const size t MAXELEMENTS   0       static std  vector lt std  string gt  split const std  string  amp s  char delim  const size t MAXELEMENTS   0         cpp   std  vector lt std  string gt  amp  Myneatclass  split const std  string  amp s  char delim  std  vector lt std  string gt   amp elems  const size t MAXELEMENTS        std  stringstream ss s       std  string item      while  std  getline ss  item  delim             elems push back item           if  MAXELEMENTS  gt  0  amp  amp   ss eof    amp  amp  elems size     1  gt   MAXELEMENTS                std  getline ss  item               elems push back item               break                      return elems    std  vector lt std  string gt  Myneatclass  split const std  string  amp s  char delim  const size t MAXELEMENTS        std  vector lt std  string gt  elems      split s  delim  elems  MAXELEMENTS       return elems

User · Answer

include  lt iostream gt   include  lt vector gt  using namespace std   int main       string str    ABC AABCD CDDD RABC GHTTYU FR     str           dirty hack  adding extra space to the end   vector lt string gt  v     for  int i 0  i lt  int str size    i          int a  b      a   i       for  int j i  j lt  int str size    j            if  str j                    b   j          i   j          break                    v push back str substr a  b-a           for  int i 0  i lt v size    i          cout lt  lt v i  size   lt  lt     lt  lt v i  lt  lt endl        return 0

User · Answer

I use this to split string by a delimiter  The first puts the results in a pre-constructed vector  the second returns a new vector      include  lt string gt   include  lt sstream gt   include  lt vector gt   include  lt iterator gt   template  lt typename Out gt  void split const std  string  amp s  char delim  Out result        std  istringstream iss s       std  string item      while  std  getline iss  item  delim              result     item           std  vector lt std  string gt  split const std  string  amp s  char delim        std  vector lt std  string gt  elems      split s  delim  std  back inserter elems        return elems        Note that this solution does not skip empty tokens  so the following will find 4 items  one of which is empty   std  vector lt std  string gt  x   split  one two  three

User · Answer

This is similar to Stack nbsp Overflow question How do I tokenize a string in C       include  lt iostream gt   include  lt string gt   include  lt boost tokenizer hpp gt   using namespace std  using namespace boost   int main int argc  char   argv        string text    token  test tstring        char separator lt char gt  sep    t        tokenizer lt char separator lt char gt  gt  tokens text  sep       for  const string amp  t   tokens                cout  lt  lt  t  lt  lt       lt  lt  endl

User · Answer

When dealing with whitespace as separator  the obvious answer of using std  istream iterator lt T gt  is already given and voted up a lot  Of course  elements may not be separated by whitespace but by some separator instead  I didn t spot any answer which just redefines the meaning of whitespace to be said separator and then uses the conventional approach   The way to change what streams consider whitespace  you d simply change the stream s std  locale using  std  istream  imbue    with a std  ctype lt char gt  facet with its own definition of what whitespace means  it can be done for std  ctype lt wchar t gt   too  but its is actually slightly different because std  ctype lt char gt  is table-driven while std  ctype lt wchar t gt  is driven by virtual functions     include  lt iostream gt   include  lt algorithm gt   include  lt iterator gt   include  lt sstream gt   include  lt locale gt   struct whitespace mask       std  ctype base  mask mask table std  ctype lt char gt   table size       whitespace mask std  string const amp  spaces            std  ctype base  mask  table   this- gt mask table          std  ctype base  mask const  tab               std  use facet lt std  ctype lt char gt  gt  std  locale    table            for  std  size t i 0   i    std  ctype lt char gt   table size    i                table i    tab i   amp   std  ctype base  space                    std  for each spaces begin    spaces end        unsigned char c                table c     std  ctype base  space                       class whitespace facet       private whitespace mask       public std  ctype lt char gt    public      whitespace facet std  string const amp  spaces            whitespace mask spaces            std  ctype lt char gt  this- gt mask table              struct whitespace       std  string spaces      whitespace std  string const amp  spaces   spaces spaces        std  istream amp  operator gt  gt  std  istream amp  in  whitespace const amp  ws        std  locale loc in getloc    new whitespace facet ws spaces        in imbue loc       return in       everything above would probably go into a utility library     int main         std  istringstream in  a  b  c  d  e        std  copy std  istream iterator lt std  string gt  in  gt  gt  whitespace                       std  istream iterator lt std  string gt                   std  ostream iterator lt std  string gt  std  cout    n          std  istringstream pipes  a b c   d  e     e        std  copy std  istream iterator lt std  string gt  pipes  gt  gt  whitespace                      std  istream iterator lt std  string gt                   std  ostream iterator lt std  string gt  std  cout    n            Most of the code is for packaging up a general purpose tool providing soft delimiters   multiple delimiters in a row are merged  There is no way to produce an empty sequence  When different delimiters are needed within a stream  you d probably use differently set up streams using a shared stream buffer   void f std  istream amp  in        std  istream pipes in rdbuf         pipes  gt  gt  whitespace           std  istream comma in rdbuf         comma  gt  gt  whitespace            std  string s0  s1      if  pipes  gt  gt  s0  gt  gt  std  ws      read up to first pipe and ignore sequence of pipes          amp  amp  comma  gt  gt  s1  gt  gt  std  ws       read up to first comma and ignore commas

User · Answer

I believe no one has posted this solution yet  Instead of using delimiters directly  it basically does the same as boost  split    i e   it allows you to pass a predicate that returns true if a char is a delimiter  and false otherwise  I think this gives the programmer a lot more control  and the great thing is you don t need boost   template  lt class Container  class String  class Predicate gt  void split Container amp  output  const String amp  input             const Predicate amp  pred  bool trimEmpty   false        auto it   begin input       auto itLast   it      while  it   find if it  end input   pred   it    end input             if  not  trimEmpty and it    itLast                 output emplace back itLast  it                       it          itLast   it            Then you can use it like this   struct Delim       bool operator   char c            return not isalpha c                 int main         string s   include lt iostream gt  n                int main     std  cout  lt  lt    Hello world     lt  lt  std  endl            vector lt string gt  v       split v  s  Delim    true          Which is also the same as        split v  s     char c    return not isalpha c      true        for  const auto amp  i   v            cout  lt  lt  i  lt  lt  endl

User · Answer

For those who need alternative in splitting string with a string delimiter  perhaps you can try my following solution   std  vector lt size t gt  str pos const std  string  amp search  const std  string  amp target        std  vector lt size t gt  founds       if  search empty                  size t start pos   0           while  true                        size t found pos   target find search  start pos                if found pos    std  string  npos                                size t found   found pos                   founds push back found                    start pos    found pos   1                             else                               break                                     return founds     std  string str sub index size t begin index  size t end index  const std  string  amp target        std  string sub       size t size   target length         const char  copy   target c str         for size t i   begin index  i  lt   end index  i                  if i  gt   size                        break                    else                       char c   copy i                sub    c                       return sub     std  vector lt std  string gt  str split const std  string  amp delimiter  const std  string  amp target        std  vector lt std  string gt  splits       if  delimiter empty                  std  vector lt size t gt  founds   str pos delimiter  target            size t founds size   founds size             if founds size  gt  0                        size t search len   delimiter length                 size t begin index   0               for int i   0  i  lt   founds size  i                                  std  string sub                   if i    founds size                                        size t pos    founds at i                        sub   str sub index begin index  pos - 1  target                        begin index    pos   search len                                     else                                       sub   str sub index begin index   target length   - 1   target                                      splits push back sub                                      return splits      Those snippets consist of 3 function  The bad news is to use the str split function you will need the other two functions  Yes it is a huge chunk of code  But the good news is that those additional two functions are able to work independently and sometimes can be useful too       Tested the function in main   block like this   int main         std  string s    Hello  world  We need to make the world a better place  Because your world is also my world  and our children s world         std  vector lt std  string gt  split   str split  world   s        for int i   0  i  lt  split size    i                  std  cout  lt  lt  split i   lt  lt  std  endl            And it would produce   Hello     We need to make the   a better place  Because your   is also my    and our children s      I believe that s not the most efficient code  but at least it works  Hope it helps

User · Answer

I wrote the following piece of code  You can specify delimiter  which can be a string  The result is similar to Java s String split  with empty string in the result   For example  if we call split  ABCPICKABCANYABCTWO ABC    ABC    the result is as follows   0   lt len 0 gt  1 PICK  lt len 4 gt  2 ANY  lt len 3 gt  3 TWO   lt len 4 gt  4   lt len 0 gt    Code   vector  lt string gt  split const string amp  str  const string amp  delimiter              vector  lt string gt  tokens       string  size type lastPos   0      string  size type pos   str find delimiter  lastPos        while  string  npos    pos               Found a token  add it to the vector          cout  lt  lt  str substr lastPos  pos - lastPos   lt  lt  endl          tokens push back str substr lastPos  pos - lastPos            lastPos   pos   delimiter size            pos   str find delimiter  lastPos              tokens push back str substr lastPos  str size   - lastPos        return tokens

User · Answer

Here s a simple solution that uses only the standard regex library   include  lt regex gt   include  lt string gt   include  lt vector gt   std  vector lt string gt  Tokenize  const string str  const std  regex regex         using namespace std       std  vector lt string gt  result       sregex token iterator it  str begin    str end    regex  -1        sregex token iterator reg end       for     it    reg end    it             if    it- gt str   empty       token could be empty check             result emplace back  it- gt str                 return result      The regex argument allows checking for multiple arguments  spaces  commas  etc    I usually only check to split on spaces and commas  so I also have this default function   std  vector lt string gt  TokenizeDefault  const string str         using namespace std       regex re      s             return Tokenize  str  re        The     s     checks for spaces    s  and commas       Note  if you want to split wstring instead of string    change all std  regex to std  wregex change all sregex token iterator to wsregex token iterator   Note  you might also want to take the string argument by reference  depending on your compiler

User · Answer

Yes  I looked through all 30 examples   I couldn t find a version of split that works for multi-char delimiters  so here s mine     include  lt string gt   include  lt vector gt   using namespace std   vector lt string gt  split const string  amp str  const string  amp delim           const auto delim pos   str find delim        if  delim pos    string  npos          return  str        vector lt string gt  ret str substr 0  delim pos        auto tail   split str substr delim pos   delim size    string  npos   delim        ret insert ret end    tail begin    tail end          return ret      Probably not the most efficient of implementations  but it s a very straightforward recursive solution  using only  lt string gt  and  lt vector gt    Ah  it s written in C  11  but there s nothing special about this code  so you could easily adapt it to C  98

User · Answer

Here s my approach  cut and split   string cut  string amp  str  const string amp  del        string f   str       if  in find first of del     string  npos                f   str substr 0 str find first of del            str   str substr str find first of del  del length                return f     vector lt string gt  split  const string amp  in  const string amp  del            vector lt string gt  out        string t   in       while  t length    gt  del length            out push back cut t del         return out      BTW  if there s something I can do to optimize this

User · Answer

I use the following code   namespace Core       typedef std  wstring String       void SplitString const Core  String amp  input  const Core  String amp  splitter  std  list lt Core  String gt  amp  output                if  splitter empty                          throw std  invalid argument       for example                    std  list lt Core  String gt  lines           Core  String  size type offset   0           for                            Core  String  size type splitterPos   input find splitter  offset                if  splitterPos    Core  String  npos                                lines push back input substr offset  splitterPos - offset                    offset   splitterPos   splitter size                              else                               lines push back input substr offset                    break                                   lines swap output               gtest   class SplitStringTest  public testing  Test       TEST F SplitStringTest  EmptyStringAndSplitter        std  list lt Core  String gt  result      ASSERT ANY THROW Core  SplitString Core  String    Core  String    result       TEST F SplitStringTest  NonEmptyStringAndEmptySplitter        std  list lt Core  String gt  result      ASSERT ANY THROW Core  SplitString L xy   Core  String    result       TEST F SplitStringTest  EmptyStringAndNonEmptySplitter        std  list lt Core  String gt  result      Core  SplitString Core  String    Core  String L      result       ASSERT EQ 1  result size         ASSERT EQ Core  String     result begin        TEST F SplitStringTest  OneCharSplitter        std  list lt Core  String gt  result       Core  SplitString L x y   L     result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y    result rbegin          Core  SplitString L  xy   L     result       ASSERT EQ 2  result size         ASSERT EQ Core  String     result begin         ASSERT EQ L xy    result rbegin          Core  SplitString L xy    L     result       ASSERT EQ 2  result size         ASSERT EQ L xy    result begin         ASSERT EQ Core  String     result rbegin        TEST F SplitStringTest  TwoCharsSplitter        std  list lt Core  String gt  result       Core  SplitString L x  y z   L      result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y z    result rbegin          Core  SplitString L x  y z   L      result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y z    result rbegin        TEST F SplitStringTest  RecursiveSplitter        std  list lt Core  String gt  result       Core  SplitString L       L      result       ASSERT EQ 2  result size         ASSERT EQ Core  String     result begin         ASSERT EQ L      result rbegin          Core  SplitString L         L       result       ASSERT EQ 2  result size         ASSERT EQ Core  String     result begin         ASSERT EQ L       result rbegin          Core  SplitString L x     y   L       result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L   y    result rbegin          Core  SplitString L          L       result       ASSERT EQ 3  result size         ASSERT EQ Core  String     result begin         ASSERT EQ Core  String        result begin          ASSERT EQ Core  String     result rbegin        TEST F SplitStringTest  NullTerminators        std  list lt Core  String gt  result       Core  SplitString L xy   Core  String L  0   1   result       ASSERT EQ 1  result size         ASSERT EQ L xy    result begin          Core  SplitString Core  String L x 0y   3   Core  String L  0   1   result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y    result rbegin

User · Answer

Here is a split function that    is generic uses standard C    no boost  accepts multiple delimiters ignores empty tokens  can easily be changed   template lt typename T gt  vector lt T gt   split const T  amp  str  const T  amp  delimiters        vector lt T gt  v      typename T  size type start   0      auto pos   str find first of delimiters  start       while pos    T  npos            if pos    start     ignore empty tokens             v emplace back str  start  pos - start           start   pos   1          pos   str find first of delimiters  start             if start  lt  str length       ignore trailing delimiter         v emplace back str  start  str length   - start      add what s left of the string     return v       Example usage       vector lt string gt  v   split lt string gt   Hello  there  World              vector lt wstring gt  v   split lt wstring gt  L Hello  there  World   L

User · Answer

include  lt iostream gt   include  lt string gt   include  lt sstream gt   include  lt algorithm gt   include  lt iterator gt   include  lt vector gt   int main         using namespace std     int n 8      string sentence    10 20 30 40 5 6 7 8       istringstream iss sentence      vector lt string gt  tokens  copy istream iterator lt string gt  iss        istream iterator lt string gt          back inserter tokens          for int i 0 i lt n i             cout lt  lt tokens at i

User · Answer

The STL does not have such a method available already   However  you can either use C s strtok   function by using the std  string  c str   member  or you can write your own  Here is a code sample I found after a quick Google search   STL string split     void Tokenize const string amp  str                vector lt string gt  amp  tokens                const string amp  delimiters                 Skip delimiters at beginning      string  size type lastPos   str find first not of delimiters  0          Find first  non-delimiter       string  size type pos       str find first of delimiters  lastPos        while  string  npos    pos    string  npos    lastPos                   Found a token  add it to the vector          tokens push back str substr lastPos  pos - lastPos               Skip delimiters   Note the  not of          lastPos   str find first not of delimiters  pos              Find next  non-delimiter          pos   str find first of delimiters  lastPos             Taken from  http   oopweb com CPP Documents CPPHOWTO Volume C  Programming-HOWTO-7 html  If you have questions about the code sample  leave a comment and I will explain   And just because it does not implement a typedef called iterator or overload the  lt  lt  operator does not mean it is bad code  I use C functions quite frequently  For example  printf and scanf both are faster than std  cin and std  cout  significantly   the fopen syntax is a lot more friendly for binary types  and they also tend to produce smaller EXEs   Don t get sold on this  Elegance over performance  deal

User · Answer

Recently I had to split a camel-cased word into subwords   There are no delimiters  just upper characters     include  lt string gt   include  lt list gt   include  lt locale gt     std  isupper  template lt class String gt  const std  list lt String gt  split camel case string const String  amp s        std  list lt String gt  R      String w       for  String  const iterator i   s begin    i  lt  s end      i               if  std  isupper  i                 if  w length                      R push back w                   w clear                                    w     i             if  w length            R push back w       return R      For example  this splits  AQueryTrades  into  A    Query  and  Trades    The function works with narrow and wide strings  Because it respects the current locale it splits  Raumfahrt  berwachungsVerordnung  into  Raumfahrt      berwachungs  and  Verordnung    Note std  upper should be really passed as function template argument  Then the more generalized from of this function can split at delimiters like          or     too

User · Answer

For what it s worth  here s another way to extract tokens from an input string  relying only on standard library facilities  It s an example of the power and elegance behind the design of the STL    include  lt iostream gt   include  lt string gt   include  lt sstream gt   include  lt algorithm gt   include  lt iterator gt   int main         using namespace std      string sentence    And I feel fine          istringstream iss sentence       copy istream iterator lt string gt  iss            istream iterator lt string gt              ostream iterator lt string gt  cout    n         Instead of copying the extracted tokens to an output stream  one could insert them into a container  using the same generic copy algorithm   vector lt string gt  tokens  copy istream iterator lt string gt  iss        istream iterator lt string gt          back inserter tokens          or create the vector directly   vector lt string gt  tokens istream iterator lt string gt  iss                         istream iterator lt string gt

User · Answer

Here s my approach  cut and split   string cut  string amp  str  const string amp  del        string f   str       if  in find first of del     string  npos                f   str substr 0 str find first of del            str   str substr str find first of del  del length                return f     vector lt string gt  split  const string amp  in  const string amp  del            vector lt string gt  out        string t   in       while  t length    gt  del length            out push back cut t del         return out      BTW  if there s something I can do to optimize this

User · Answer

This is my versi  n taken the source of Kev    include  lt string gt   include  lt vector gt  void split vector lt string gt   amp result  string str  char delim       string tmp    string  iterator i    result clear       for i   str begin    i  lt   str end      i        if  const char  i    delim   amp  amp  i    str end            tmp     i        else         result push back tmp         tmp                     After  call the function and do something with it   vector lt string gt  hosts  split hosts   192 168 1 2 192 168 1 3         for  size t i   0  i  lt  hosts size    i       cout  lt  lt    Connecting host      lt  lt  hosts at i   lt  lt         lt  lt  endl

User · Answer

Here s a simple solution that uses only the standard regex library   include  lt regex gt   include  lt string gt   include  lt vector gt   std  vector lt string gt  Tokenize  const string str  const std  regex regex         using namespace std       std  vector lt string gt  result       sregex token iterator it  str begin    str end    regex  -1        sregex token iterator reg end       for     it    reg end    it             if    it- gt str   empty       token could be empty check             result emplace back  it- gt str                 return result      The regex argument allows checking for multiple arguments  spaces  commas  etc    I usually only check to split on spaces and commas  so I also have this default function   std  vector lt string gt  TokenizeDefault  const string str         using namespace std       regex re      s             return Tokenize  str  re        The     s     checks for spaces    s  and commas       Note  if you want to split wstring instead of string    change all std  regex to std  wregex change all sregex token iterator to wsregex token iterator   Note  you might also want to take the string argument by reference  depending on your compiler

User · Answer

I like the following because it puts the results into a vector  supports a string as a delim and gives control over keeping empty values  But  it doesn t look as good then    include  lt ostream gt   include  lt string gt   include  lt vector gt   include  lt algorithm gt   include  lt iterator gt  using namespace std   vector lt string gt  split const string amp  s  const string amp  delim  const bool keep empty   true        vector lt string gt  result      if  delim empty              result push back s           return result            string  const iterator substart   s begin    subend      while  true            subend   search substart  s end    delim begin    delim end             string temp substart  subend           if  keep empty     temp empty                  result push back temp                     if  subend    s end                  break                    substart   subend   delim size              return result     int main         const vector lt string gt  words   split  So close no matter how far             copy words begin    words end    ostream iterator lt string gt  cout    n         Of course  Boost has a split   that works partially like that  And  if by  white-space   you really do mean any type of white-space  using Boost s split with is any of   works great

User · Answer

Heres a regex solution that only uses the standard regex library    I m a little rusty  so there may be a few syntax errors  but this is at least the general idea    include  lt regex h gt   include  lt string h gt   include  lt vector h gt   using namespace std   vector lt string gt  split string s       regex r     w       regex matches whole words   greedy  so no fragment words      regex iterator lt string  iterator gt  rit   s begin    s end    r        regex iterator lt string  iterator gt  rend    iterators to iterate thru words     vector lt string gt  result lt regex iterator gt  rit  rend       return result     iterates through the matches to fill the vector

User · Answer

I ve rolled my own using strtok and used boost to split a string   The best method I have found is the C   String Toolkit Library   It is incredibly flexible and fast    include  lt iostream gt   include  lt vector gt   include  lt string gt   include  lt strtk hpp gt   const char  whitespace       t r n f   const char  whitespace and punctuation       t r n f       int main                normal parsing of a string into a vector of strings         std  string s  Somewhere down the road            std  vector lt std  string gt  result          if  strtk  parse  s  whitespace  result                           for size t i   0  i  lt  result size      i                   std  cout  lt  lt  result i   lt  lt  std  endl                             parsing a string into a vector of floats with other separators            besides spaces          std  string s  3 0  3 14  4 0            std  vector lt float gt  values          if  strtk  parse  s  whitespace and punctuation  values                           for size t i   0  i  lt  values size      i                   std  cout  lt  lt  values i   lt  lt  std  endl                             parsing a string into specific variables          std  string s  angle   45  radius   9 9            std  string w1  w2          float v1  v2          if  strtk  parse  s  whitespace and punctuation  w1  v1  w2  v2                          std  cout  lt  lt   word    lt  lt  w1  lt  lt     value    lt  lt  v1  lt  lt  std  endl              std  cout  lt  lt   word    lt  lt  w2  lt  lt     value    lt  lt  v2  lt  lt  std  endl                       return 0      The toolkit has much more flexibility than this simple example shows but its utility in parsing a string into useful elements is incredible

User · Answer

This is similar to Stack nbsp Overflow question How do I tokenize a string in C       include  lt iostream gt   include  lt string gt   include  lt boost tokenizer hpp gt   using namespace std  using namespace boost   int main int argc  char   argv        string text    token  test tstring        char separator lt char gt  sep    t        tokenizer lt char separator lt char gt  gt  tokens text  sep       for  const string amp  t   tokens                cout  lt  lt  t  lt  lt       lt  lt  endl

User · Answer

We can use strtok in c       include  lt iostream gt   include  lt cstring gt  using namespace std   int main         char str    Mickey M 12034 911416313 M 01a 9001 NULL 0 13 12 0 CPP C MSC 3D FEND BEND SEC        char  pch   strtok  str            while  pch    NULL                cout lt  lt pch lt  lt   n           pch   strtok  NULL                   return 0

User · Answer

if you want split string by some chars you can use   include lt iostream gt   include lt string gt   include lt vector gt   include lt iterator gt   include lt sstream gt   include lt string gt   using namespace std  void replaceOtherChars string  amp input  vector lt char gt   amp dividers        const char divider   dividers at 0       int replaceIndex   0      vector lt char gt   iterator it begin   dividers begin   1          it end  dividers end        for  it begin  it end   it begin                replaceIndex   0          while true                        replaceIndex input find first of  it begin replaceIndex               if replaceIndex  -1                  break              input at replaceIndex  divider                    vector lt string gt  split string str  vector lt char gt  chars  bool missEmptySpace  true         vector lt string gt  result      const char divider   chars at 0       replaceOtherChars str chars       stringstream stream      stream lt  lt str          string temp      while getline stream temp divider                 if missEmptySpace  amp  amp  temp empty                continue          result push back temp             return result    int main         string str   milk  pigs     hot-dogs        vector lt char gt  arr      arr push back       arr push back       arr push back           vector lt string gt  result   split str arr       vector lt string gt   iterator it begin  result begin            it end  result end        for  it begin  it end   it begin                cout lt  lt  it begin lt  lt endl        return 0

User · Answer

Quick version which uses vector as the base class  giving full access to all of its operators          Split string into parts      class Split   public std  vector lt std  string gt                public              Split const std  string amp  str  char  delimList                               size t lastPos   0                 size t pos   str find first of delimList                   while  pos    std  string  npos                                       if  pos    lastPos                          push back str substr lastPos  pos-lastPos                        lastPos   pos   1                      pos   str find first of delimList  lastPos                                   if  lastPos  lt  str length                       push back str substr lastPos  pos-lastPos                           Example used to populate an STL set   std  set lt std  string gt  words  Split split  Hello World         words insert split begin    split end

User · Answer

Using std  stringstream as you have works perfectly fine  and do exactly what you wanted  If you re just looking for different way of doing things though  you can use std  find   std  find first of   and std  string  substr     Here s an example    include  lt iostream gt   include  lt string gt   int main         std  string s  Somewhere down the road        std  string  size type prev pos   0  pos   0       while   pos   s find      pos      std  string  npos                 std  string substring  s substr prev pos  pos-prev pos              std  cout  lt  lt  substring  lt  lt    n            prev pos     pos             std  string substring  s substr prev pos  pos-prev pos        Last word     std  cout  lt  lt  substring  lt  lt    n        return 0

User · Answer

Using std  stringstream as you have works perfectly fine  and do exactly what you wanted  If you re just looking for different way of doing things though  you can use std  find   std  find first of   and std  string  substr     Here s an example    include  lt iostream gt   include  lt string gt   int main         std  string s  Somewhere down the road        std  string  size type prev pos   0  pos   0       while   pos   s find      pos      std  string  npos                 std  string substring  s substr prev pos  pos-prev pos              std  cout  lt  lt  substring  lt  lt    n            prev pos     pos             std  string substring  s substr prev pos  pos-prev pos        Last word     std  cout  lt  lt  substring  lt  lt    n        return 0

User · Answer

include  lt vector gt   include  lt string gt   include  lt sstream gt   int main         std  string str  Split me by whitespaces        std  string buf                     Have a buffer string     std  stringstream ss str            Insert the string into a stream      std  vector lt std  string gt  tokens     Create vector to hold our words      while  ss  gt  gt  buf          tokens push back buf        return 0

User · Answer

The STL does not have such a method available already   However  you can either use C s strtok   function by using the std  string  c str   member  or you can write your own  Here is a code sample I found after a quick Google search   STL string split     void Tokenize const string amp  str                vector lt string gt  amp  tokens                const string amp  delimiters                 Skip delimiters at beginning      string  size type lastPos   str find first not of delimiters  0          Find first  non-delimiter       string  size type pos       str find first of delimiters  lastPos        while  string  npos    pos    string  npos    lastPos                   Found a token  add it to the vector          tokens push back str substr lastPos  pos - lastPos               Skip delimiters   Note the  not of          lastPos   str find first not of delimiters  pos              Find next  non-delimiter          pos   str find first of delimiters  lastPos             Taken from  http   oopweb com CPP Documents CPPHOWTO Volume C  Programming-HOWTO-7 html  If you have questions about the code sample  leave a comment and I will explain   And just because it does not implement a typedef called iterator or overload the  lt  lt  operator does not mean it is bad code  I use C functions quite frequently  For example  printf and scanf both are faster than std  cin and std  cout  significantly   the fopen syntax is a lot more friendly for binary types  and they also tend to produce smaller EXEs   Don t get sold on this  Elegance over performance  deal

User · Answer

I made this because I needed an easy way to split strings and c-based strings    Hopefully someone else can find it useful as well  Also it doesn t rely on tokens and you can use fields as delimiters  which is another key I needed   I m sure there s improvements that can be made to even further improve its elegance and please do by all means  StringSplitter hpp    include  lt vector gt   include  lt iostream gt   include  lt string h gt   using namespace std   class StringSplit   private      void copy fragment char   char   char        void copy fragment char   char   char       bool match fragment char   char   int       int untilnextdelim char   char       int untilnextdelim char   char        void assimilate char   char       void assimilate char   char        bool string contains char   char        long calc string size char        void copy string char   char     public      vector lt char  gt  split cstr char       vector lt char  gt  split cstr char        vector lt string gt  split string char       vector lt string gt  split string char        char  String      bool do string      bool keep empty      vector lt char  gt  Container      vector lt string gt  ContainerS       StringSplit char   in                String   in             StringSplit string in                size t len   calc string size  char  in c str             String   new char len   1           memset String  0  len   1           copy string String   char  in c str             do string   true              StringSplit                 for  int i   0  i  lt  Container size    i                          if  Container i     NULL                                delete   Container i                                   if  do string                        delete   String                       StringSplitter cpp    include  lt string h gt   include  lt iostream gt   include  lt vector gt   include  StringSplit hpp   using namespace std   void StringSplit  assimilate char src  char delim        int until   untilnextdelim src  delim       if  until  gt  0                char   temp   new char until   1           memset temp  0  until   1           copy fragment temp  src  delim           if  keep empty     temp    0                        if   do string                                Container push back temp                             else                               string x   temp                  ContainerS push back x                                    else                       delete   temp                     void StringSplit  assimilate char src  char  delim        int until   untilnextdelim src  delim       if  until  gt  0                char   temp   new char until   1           memset temp  0  until   1           copy fragment temp  src  delim           if  keep empty     temp    0                        if   do string                                Container push back temp                             else                               string x   temp                  ContainerS push back x                                   else                       delete   temp                     long StringSplit  calc string size char   in        long i   0      while    in                  i              return i     bool StringSplit  string contains char  haystack  char  needle        size t len   calc string size needle       size t lenh   calc string size haystack       while  lenh--                if  match fragment haystack   lenh  needle  len                         return true                      return false     bool StringSplit  match fragment char   src  char  cmp  int len        while  len--                if     src   len       cmp   len                         return false                      return true     int StringSplit  untilnextdelim char   in  char delim        size t len   calc string size  in       if    in    delim                 in    1          return len - 1             int c   0      while     in   c     delim  amp  amp  c  lt  len                c               return c     int StringSplit  untilnextdelim char   in  char  delim        int s   calc string size delim       int c   1   s       if   string contains  in  delim                 return calc string size  in             else if  match fragment  in  delim  s                  in    s          return calc string size  in              while   match fragment  in   c  delim  s                 c               return c     void StringSplit  copy fragment char  dest  char  src  char delim        if   src    delim                src               int c   0      while    src   c     delim  amp  amp    src   c                   dest   c      src   c           c                dest   c    0     void StringSplit  copy string char  dest  char  src        int i   0      while    src   i                   dest   i      src   i           i             void StringSplit  copy fragment char  dest  char  src  char  delim        size t len   calc string size delim       size t lens   calc string size src        if  match fragment src  delim  len                 src    len          lens -  len             int c   0      while   match fragment src   c  delim  len   amp  amp   c  lt  lens                   dest   c      src   c           c                dest   c    0     vector lt char  gt  StringSplit  split cstr char Delimiter        int i   0      while   String                if   String    Delimiter  amp  amp  i    0                        assimilate String  Delimiter                     if   String    Delimiter                        assimilate String  Delimiter                     i            String               String -  i      delete   String       return Container     vector lt string gt  StringSplit  split string char Delimiter        do string   true       int i   0      while   String                if   String    Delimiter  amp  amp  i    0                        assimilate String  Delimiter                     if   String    Delimiter                        assimilate String  Delimiter                     i            String               String -  i      delete   String       return ContainerS     vector lt char  gt  StringSplit  split cstr char  Delimiter        int i   0      size t LenDelim   calc string size Delimiter        while  String                if   match fragment String  Delimiter  LenDelim   amp  amp  i    0                        assimilate String  Delimiter                     if  match fragment String  Delimiter  LenDelim                         assimilate String Delimiter                     i            String               String -  i      delete   String       return Container     vector lt string gt  StringSplit  split string char  Delimiter        do string   true      int i   0      size t LenDelim   calc string size Delimiter        while   String                if   match fragment String  Delimiter  LenDelim   amp  amp  i    0                        assimilate String  Delimiter                     if  match fragment String  Delimiter  LenDelim                         assimilate String  Delimiter                     i            String               String -  i      delete   String       return ContainerS      Examples   int main int argc  char argv          StringSplit ss    This CUT is CUT an CUT example CUT cstring       vector lt char  gt  Split   ss split cstr   CUT          for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0      Will output   This is an example cstring  int main int argc  char argv          StringSplit ss    This is an example cstring       vector lt char  gt  Split   ss split cstr            for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0     int main int argc  char argv          string mystring    This SPLIT is SPLIT an SPLIT example SPLIT string       StringSplit ss   mystring      vector lt string gt  Split   ss split string   SPLIT          for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0     int main int argc  char argv          string mystring    This is an example string       StringSplit ss   mystring      vector lt string gt  Split   ss split string            for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0      To keep empty entries  by default empties will be excluded    StringSplit ss   mystring  ss keep empty   true  vector lt string gt  Split   ss split string   DELIM       The goal was to make it similar to C  s Split   method where splitting a string is as easy as   String   Split         Hey cut what s cut your cut name   Split new     cut     StringSplitOptions None    foreach String X in Split        Console Write X       I hope someone else can find this as useful as I do

User · Answer

Not that we need more answers  but this is what I came up with after being inspired by Evan Teran    std  vector  lt std  string gt  split const string  amp input  auto delimiter  bool skipEmpty true           Splits a string at each delimiter and returns these strings as a string vector    If the delimiter is not found then nothing is returned    If skipEmpty is true then strings between delimiters that are 0 in length will be skipped         bool delimiterFound   false    int pos 0  pPos 0    std  vector  lt std  string gt  result    while  true        pos   input find delimiter pPos       if  pos    std  string  npos          if  skipEmpty  false or pos-pPos  gt  0     if empty values are to be kept or not         result push back input substr pPos pos-pPos          delimiterFound   true        else         if  pPos  lt  input length   and delimiterFound            if  skipEmpty  false or input length  -pPos  gt  0     if empty values are to be kept or not           result push back input substr pPos input length  -pPos                  break            pPos   pos 1        return result

User · Answer

I believe no one has posted this solution yet  Instead of using delimiters directly  it basically does the same as boost  split    i e   it allows you to pass a predicate that returns true if a char is a delimiter  and false otherwise  I think this gives the programmer a lot more control  and the great thing is you don t need boost   template  lt class Container  class String  class Predicate gt  void split Container amp  output  const String amp  input             const Predicate amp  pred  bool trimEmpty   false        auto it   begin input       auto itLast   it      while  it   find if it  end input   pred   it    end input             if  not  trimEmpty and it    itLast                 output emplace back itLast  it                       it          itLast   it            Then you can use it like this   struct Delim       bool operator   char c            return not isalpha c                 int main         string s   include lt iostream gt  n                int main     std  cout  lt  lt    Hello world     lt  lt  std  endl            vector lt string gt  v       split v  s  Delim    true          Which is also the same as        split v  s     char c    return not isalpha c      true        for  const auto amp  i   v            cout  lt  lt  i  lt  lt  endl

User · Answer

Using std  string view and Eric Niebler s range-v3 library   https   wandbox org permlink kW5lwRCL1pxjp2pW   include  lt iostream gt   include  lt string gt   include  lt string view gt   include  range v3 view hpp   include  range v3 algorithm hpp   int main         std  string s    Somewhere down the range v3 library       ranges  for each s               ranges  view  split                  ranges  view  transform    auto  amp  amp sub                    return std  string view  amp  sub begin    ranges  distance sub                               auto s   std  cout  lt  lt   Substring     lt  lt  s  lt  lt    n               By using a range for loop instead of ranges  for each algorithm    include  lt iostream gt   include  lt string gt   include  lt string view gt   include  range v3 view hpp   int main         std  string str    Somewhere down the range v3 library       for  auto s   str   ranges  view  split                              ranges  view  transform    auto amp  amp  sub    return std  string view  amp  sub begin    ranges  distance sub                                             std  cout  lt  lt   Substring     lt  lt  s  lt  lt    n

User · Answer

So far I used the one in Boost  but I needed something that doesn t depends on it  so I came to this   static void Split std  vector lt std  string gt  amp  lst  const std  string amp  input  const std  string amp  separators  bool remove empty   true        std  ostringstream word      for  size t n   0  n  lt  input size      n                if  std  string  npos    separators find input n                word  lt  lt  input n           else                       if   word str   empty       remove empty                  lst push back word str                 word str                          if   word str   empty       remove empty          lst push back word str         A good point is that in separators you can pass more than one character

User · Answer

For a ridiculously large and probably redundant version  try a lot of for loops   string stringlist 10   int count   0   for  int i   0  i  lt  sequence length    i          if  sequence i                        stringlist count    sequence substr 0  i           sequence erase 0  i 1           i   0          count              else if  i    sequence length  -1      Last word               stringlist count    sequence substr 0  i 1             It isn t pretty  but by and large  Barring punctuation and a slew of other bugs  it works

User · Answer

I use this to split string by a delimiter  The first puts the results in a pre-constructed vector  the second returns a new vector      include  lt string gt   include  lt sstream gt   include  lt vector gt   include  lt iterator gt   template  lt typename Out gt  void split const std  string  amp s  char delim  Out result        std  istringstream iss s       std  string item      while  std  getline iss  item  delim              result     item           std  vector lt std  string gt  split const std  string  amp s  char delim        std  vector lt std  string gt  elems      split s  delim  std  back inserter elems        return elems        Note that this solution does not skip empty tokens  so the following will find 4 items  one of which is empty   std  vector lt std  string gt  x   split  one two  three

User · Answer

For a ridiculously large and probably redundant version  try a lot of for loops   string stringlist 10   int count   0   for  int i   0  i  lt  sequence length    i          if  sequence i                        stringlist count    sequence substr 0  i           sequence erase 0  i 1           i   0          count              else if  i    sequence length  -1      Last word               stringlist count    sequence substr 0  i 1             It isn t pretty  but by and large  Barring punctuation and a slew of other bugs  it works

User · Answer

LazyStringSplitter    include  lt string gt   include  lt algorithm gt   include  lt unordered set gt   using namespace std   class LazyStringSplitter       string  const iterator start  finish      unordered set lt char gt  chop   public          Empty Constructor     explicit LazyStringSplitter               explicit LazyStringSplitter  const string cstr  const string delims            start cstr begin              finish cstr end              chop delims begin    delims end                void operator     const string cstr  const string delims                chop insert delims begin    delims end             start   cstr begin            finish   cstr end               bool empty   const   return  start  gt   finish          string next                    return empty string            if ran out of characters         if  empty                return string               auto runner   find if start  finish    amp   char c                return chop count c     1                          construct next string         string ret start  runner           start   runner   1              Never return empty string              tail recursion makes this method efficient         return  ret empty     ret   next                I call this method the LazyStringSplitter because of one reason - It does not split the string in one go  In essence it behaves like a python generator It exposes a method called next which returns the next string that is split from the original I made use of the unordered set from c  11 STL  so that look up of delimiters is that much faster And here is how it works   TEST PROGRAM   include  lt iostream gt  using namespace std   int main         LazyStringSplitter splitter          split at the characters                        splitter  This  is a string  And here is another string  Let s test and see how well this does                  while   splitter empty            cout  lt  lt  splitter next    lt  lt  endl      return 0      OUTPUT  This is a string And here is another string Let s test and see how well this does   Next plan to improve this is to implement begin and end methods so that one can do something like   vector lt string gt  split string splitter begin    splitter end

User · Answer

The stringstream can be convenient if you need to parse the string by non-space symbols   string s    Name JAck  Spouse Susan        string dummy  name  spouse   istringstream iss s   getline iss  dummy        getline iss  name        getline iss  dummy        getline iss  spouse

User · Answer

Just for convenience   template lt class V  typename T gt  bool in const V  amp v  const T  amp el        return std  find v begin    v end    el     v end        The actual splitting based on multiple delimiters   std  vector lt std  string gt  split const std  string  amp s                                 const std  vector lt char gt   amp delims        std  vector lt std  string gt  res      auto stuff     amp delims  char c    return  in delims  c          auto space     amp delims  char c    return in delims  c          auto first   std  find if s begin    s end    stuff       while  first    s end              auto last   std  find if first  s end    space           res push back std  string first  last            first   std  find if last   1  s end    stuff             return res      The usage   int main         std  string s       aaa   bb  cc        for  auto el  split s                       std  cout  lt  lt  el  lt  lt  std  endl      return 0

User · Answer

I like to use the boost regex methods for this task since they provide maximum flexibility for specifying the splitting criteria    include  lt iostream gt   include  lt string gt   include  lt boost regex hpp gt   int main         std  string line  A   line  to split        const boost  regex re           one or more colons         -1 means find inverse matches aka split     boost  sregex token iterator tokens line begin   line end   re -1       boost  sregex token iterator end       for    tokens    end    tokens          std  cout  lt  lt   tokens  lt  lt  std  endl

User · Answer

Here is my solution using C  11 and the STL  It should be reasonably efficient    include  lt vector gt   include  lt string gt   include  lt cstring gt   include  lt iostream gt   include  lt algorithm gt   include  lt functional gt   std  vector lt std  string gt  split const std  string amp  s        std  vector lt std  string gt  v       const auto end   s end        auto to   s begin        decltype to  from       while  from   std  find if to  end             char c   return  std  isspace c          end                to   std  find if from  end     char c   return std  isspace c               v emplace back from  to              return v     int main         std  string s    this is the string  to  split        auto v   split s        for auto amp  amp  s  v          std  cout  lt  lt  s  lt  lt    n       Output   this is the string to split

User · Answer

If you like to use boost  but want to use a whole string as delimiter  instead of single characters as in most of the previously proposed solutions   you can use the boost split iterator   Example code including convenient template    include  lt iostream gt   include  lt vector gt   include  lt boost algorithm string hpp gt   template lt typename  OutputIterator gt  inline void split      const std  string amp  str       const std  string amp  delim        OutputIterator result        using namespace boost  algorithm      typedef split iterator lt std  string  const iterator gt  It       for It iter make split iterator str  first finder delim  is equal                  iter  It                  iter                  result      boost  copy range lt std  string gt   iter            int main int argc  char  argv          using namespace std       vector lt string gt  splitted      split  HelloFOOworldFOO     FOO   back inserter splitted            or directly to console  for example     split  HelloFOOworldFOO     FOO   ostream iterator lt string gt  cout    n         return 0

User · Answer

I use the following  void split string in  vector lt string gt  amp  parts  char separator        string  iterator  ts  curr      ts   curr   in begin        for   curr  lt   in end    curr               if   curr    in end       curr    separator   amp  amp  curr  gt  ts                  parts push back  string  ts  curr             if  curr    in end                    break          if   curr    separator   ts   curr   1             PlasmaHH  I forgot to include the extra check  curr   ts  for removing tokens with whitespace

User · Answer

I ve been searching for a way to split a string by a separator of any length  so I started writing it from scratch  as existing solutions didn t suit me   Here is my little algorithm  using only STL     use like this   std  vector lt std  wstring gt  vec   Split lt std  wstring gt   L Hello  world      L        template  lt typename valueType gt  static std  vector  lt valueType gt  Split  valueType text  const valueType amp  delimiter        std  vector  lt valueType gt  tokens      size t pos   0      valueType token       while   pos   text find delimiter      valueType  npos                 token   text substr 0  pos           tokens push back  token           text erase 0  pos   delimiter length               tokens push back  text        return tokens      It can be used with separator of any length and form  as far as I ve tested  Instantiate with either string or wstring type   All the algorithm does is it searches for the delimiter  gets the part of the string that is up to the delimiter  deletes the delimiter and searches again until it finds it no more   Of course  you can use any number of whitespaces for the delimiter   I hope it helps

User · Answer

For a ridiculously large and probably redundant version  try a lot of for loops   string stringlist 10   int count   0   for  int i   0  i  lt  sequence length    i          if  sequence i                        stringlist count    sequence substr 0  i           sequence erase 0  i 1           i   0          count              else if  i    sequence length  -1      Last word               stringlist count    sequence substr 0  i 1             It isn t pretty  but by and large  Barring punctuation and a slew of other bugs  it works

User · Answer

Short and elegant   include  lt vector gt   include  lt string gt  using namespace std   vector lt string gt  split string data  string token        vector lt string gt  output      size t pos   string  npos     size t to avoid improbable overflow     do               pos   data find token           output push back data substr 0  pos            if  string  npos    pos              data   data substr pos   token size           while  string  npos    pos       return output      can use any string as delimiter  also can be used with binary data  std  string supports binary data  including nulls   using   auto a   split  this  is   example string            output   this is  example string

User · Answer

A possible solution using Boost might be    include  lt boost algorithm string hpp gt  std  vector lt std  string gt  strs  boost  split strs   string to split   boost  is any of   t        This approach might be even faster than the stringstream approach  And since this is a generic template function it can be used to split other types of strings  wchar  etc  or UTF-8  using all kinds of delimiters   See the documentation for details

User · Answer

I made this because I needed an easy way to split strings and c-based strings    Hopefully someone else can find it useful as well  Also it doesn t rely on tokens and you can use fields as delimiters  which is another key I needed   I m sure there s improvements that can be made to even further improve its elegance and please do by all means  StringSplitter hpp    include  lt vector gt   include  lt iostream gt   include  lt string h gt   using namespace std   class StringSplit   private      void copy fragment char   char   char        void copy fragment char   char   char       bool match fragment char   char   int       int untilnextdelim char   char       int untilnextdelim char   char        void assimilate char   char       void assimilate char   char        bool string contains char   char        long calc string size char        void copy string char   char     public      vector lt char  gt  split cstr char       vector lt char  gt  split cstr char        vector lt string gt  split string char       vector lt string gt  split string char        char  String      bool do string      bool keep empty      vector lt char  gt  Container      vector lt string gt  ContainerS       StringSplit char   in                String   in             StringSplit string in                size t len   calc string size  char  in c str             String   new char len   1           memset String  0  len   1           copy string String   char  in c str             do string   true              StringSplit                 for  int i   0  i  lt  Container size    i                          if  Container i     NULL                                delete   Container i                                   if  do string                        delete   String                       StringSplitter cpp    include  lt string h gt   include  lt iostream gt   include  lt vector gt   include  StringSplit hpp   using namespace std   void StringSplit  assimilate char src  char delim        int until   untilnextdelim src  delim       if  until  gt  0                char   temp   new char until   1           memset temp  0  until   1           copy fragment temp  src  delim           if  keep empty     temp    0                        if   do string                                Container push back temp                             else                               string x   temp                  ContainerS push back x                                    else                       delete   temp                     void StringSplit  assimilate char src  char  delim        int until   untilnextdelim src  delim       if  until  gt  0                char   temp   new char until   1           memset temp  0  until   1           copy fragment temp  src  delim           if  keep empty     temp    0                        if   do string                                Container push back temp                             else                               string x   temp                  ContainerS push back x                                   else                       delete   temp                     long StringSplit  calc string size char   in        long i   0      while    in                  i              return i     bool StringSplit  string contains char  haystack  char  needle        size t len   calc string size needle       size t lenh   calc string size haystack       while  lenh--                if  match fragment haystack   lenh  needle  len                         return true                      return false     bool StringSplit  match fragment char   src  char  cmp  int len        while  len--                if     src   len       cmp   len                         return false                      return true     int StringSplit  untilnextdelim char   in  char delim        size t len   calc string size  in       if    in    delim                 in    1          return len - 1             int c   0      while     in   c     delim  amp  amp  c  lt  len                c               return c     int StringSplit  untilnextdelim char   in  char  delim        int s   calc string size delim       int c   1   s       if   string contains  in  delim                 return calc string size  in             else if  match fragment  in  delim  s                  in    s          return calc string size  in              while   match fragment  in   c  delim  s                 c               return c     void StringSplit  copy fragment char  dest  char  src  char delim        if   src    delim                src               int c   0      while    src   c     delim  amp  amp    src   c                   dest   c      src   c           c                dest   c    0     void StringSplit  copy string char  dest  char  src        int i   0      while    src   i                   dest   i      src   i           i             void StringSplit  copy fragment char  dest  char  src  char  delim        size t len   calc string size delim       size t lens   calc string size src        if  match fragment src  delim  len                 src    len          lens -  len             int c   0      while   match fragment src   c  delim  len   amp  amp   c  lt  lens                   dest   c      src   c           c                dest   c    0     vector lt char  gt  StringSplit  split cstr char Delimiter        int i   0      while   String                if   String    Delimiter  amp  amp  i    0                        assimilate String  Delimiter                     if   String    Delimiter                        assimilate String  Delimiter                     i            String               String -  i      delete   String       return Container     vector lt string gt  StringSplit  split string char Delimiter        do string   true       int i   0      while   String                if   String    Delimiter  amp  amp  i    0                        assimilate String  Delimiter                     if   String    Delimiter                        assimilate String  Delimiter                     i            String               String -  i      delete   String       return ContainerS     vector lt char  gt  StringSplit  split cstr char  Delimiter        int i   0      size t LenDelim   calc string size Delimiter        while  String                if   match fragment String  Delimiter  LenDelim   amp  amp  i    0                        assimilate String  Delimiter                     if  match fragment String  Delimiter  LenDelim                         assimilate String Delimiter                     i            String               String -  i      delete   String       return Container     vector lt string gt  StringSplit  split string char  Delimiter        do string   true      int i   0      size t LenDelim   calc string size Delimiter        while   String                if   match fragment String  Delimiter  LenDelim   amp  amp  i    0                        assimilate String  Delimiter                     if  match fragment String  Delimiter  LenDelim                         assimilate String  Delimiter                     i            String               String -  i      delete   String       return ContainerS      Examples   int main int argc  char argv          StringSplit ss    This CUT is CUT an CUT example CUT cstring       vector lt char  gt  Split   ss split cstr   CUT          for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0      Will output   This is an example cstring  int main int argc  char argv          StringSplit ss    This is an example cstring       vector lt char  gt  Split   ss split cstr            for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0     int main int argc  char argv          string mystring    This SPLIT is SPLIT an SPLIT example SPLIT string       StringSplit ss   mystring      vector lt string gt  Split   ss split string   SPLIT          for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0     int main int argc  char argv          string mystring    This is an example string       StringSplit ss   mystring      vector lt string gt  Split   ss split string            for  int i   0  i  lt  Split size    i                  cout  lt  lt  Split i   lt  lt  endl             return 0      To keep empty entries  by default empties will be excluded    StringSplit ss   mystring  ss keep empty   true  vector lt string gt  Split   ss split string   DELIM       The goal was to make it similar to C  s Split   method where splitting a string is as easy as   String   Split         Hey cut what s cut your cut name   Split new     cut     StringSplitOptions None    foreach String X in Split        Console Write X       I hope someone else can find this as useful as I do

User · Answer

A possible solution using Boost might be    include  lt boost algorithm string hpp gt  std  vector lt std  string gt  strs  boost  split strs   string to split   boost  is any of   t        This approach might be even faster than the stringstream approach  And since this is a generic template function it can be used to split other types of strings  wchar  etc  or UTF-8  using all kinds of delimiters   See the documentation for details

User · Answer

I like the following because it puts the results into a vector  supports a string as a delim and gives control over keeping empty values  But  it doesn t look as good then    include  lt ostream gt   include  lt string gt   include  lt vector gt   include  lt algorithm gt   include  lt iterator gt  using namespace std   vector lt string gt  split const string amp  s  const string amp  delim  const bool keep empty   true        vector lt string gt  result      if  delim empty              result push back s           return result            string  const iterator substart   s begin    subend      while  true            subend   search substart  s end    delim begin    delim end             string temp substart  subend           if  keep empty     temp empty                  result push back temp                     if  subend    s end                  break                    substart   subend   delim size              return result     int main         const vector lt string gt  words   split  So close no matter how far             copy words begin    words end    ostream iterator lt string gt  cout    n         Of course  Boost has a split   that works partially like that  And  if by  white-space   you really do mean any type of white-space  using Boost s split with is any of   works great

User · Answer

Just for convenience   template lt class V  typename T gt  bool in const V  amp v  const T  amp el        return std  find v begin    v end    el     v end        The actual splitting based on multiple delimiters   std  vector lt std  string gt  split const std  string  amp s                                 const std  vector lt char gt   amp delims        std  vector lt std  string gt  res      auto stuff     amp delims  char c    return  in delims  c          auto space     amp delims  char c    return in delims  c          auto first   std  find if s begin    s end    stuff       while  first    s end              auto last   std  find if first  s end    space           res push back std  string first  last            first   std  find if last   1  s end    stuff             return res      The usage   int main         std  string s       aaa   bb  cc        for  auto el  split s                       std  cout  lt  lt  el  lt  lt  std  endl      return 0

User · Answer

Everyone answered for predefined string input  I think this answer will help someone for scanned input   I used tokens vector for holding string tokens  It s optional    include  lt bits stdc   h gt   using namespace std   int main         string str  token       getline cin  str       get the string as input     istringstream ss str      insert the string into tokenizer      vector lt string gt  tokens     vector tokens holds the tokens      while  ss  gt  gt  token  tokens push back token      splits the tokens     for auto x   tokens  cout  lt  lt  x  lt  lt  endl      prints the tokens      return 0        sample input   port city international university   sample output   port city international university   Note that by default this will work for only space as the delimiter   you can use custom delimiter  For that  you have customized the code  let the delimiter be      so use   char delimiter         while getline ss  token  delimiter   tokens push back token      instead of   while  ss  gt  gt  token  tokens push back token

User · Answer

Quick version which uses vector as the base class  giving full access to all of its operators          Split string into parts      class Split   public std  vector lt std  string gt                public              Split const std  string amp  str  char  delimList                               size t lastPos   0                 size t pos   str find first of delimList                   while  pos    std  string  npos                                       if  pos    lastPos                          push back str substr lastPos  pos-lastPos                        lastPos   pos   1                      pos   str find first of delimList  lastPos                                   if  lastPos  lt  str length                       push back str substr lastPos  pos-lastPos                           Example used to populate an STL set   std  set lt std  string gt  words  Split split  Hello World         words insert split begin    split end

User · Answer

I have just written a fine example of how to split a char by symbol  which then places each array of chars  words seperated by your symbol  into a vector  For simplicity i made the vector type of std string   I hope this helps and is readable to you    include  lt vector gt   include  lt string gt   include  lt iostream gt   void push std  vector lt std  string gt   amp WORDS  std  string  amp TMP       WORDS push back TMP       TMP         std  vector lt std  string gt  mySplit char STRING             std  vector lt std  string gt  words          std  string s          for unsigned short i   0  i  lt  strlen STRING   i                 if STRING i                           s    STRING i                else                  push words  s                                   push words  s    Used to get last split         return words     int main        char string      My awesome string        std  cout  lt  lt  mySplit string  2       std  cin get        return 0

User · Answer

No Boost  no string streams  just the standard C library cooperating together with std  string and std  list  C library functions for easy analysis  C   data types for easy memory management   Whitespace is considered to be any combination of newlines  tabs and spaces  The set of whitespace characters is established by the wschars variable    include  lt string gt   include  lt list gt   include  lt iostream gt   include  lt cstring gt   using namespace std   const char  wschars     t n     list lt string gt  split const string  amp str      const char  cstr   str c str      list lt string gt  out     while   cstr                           while remaining string not empty     size t toklen      cstr    strspn cstr  wschars         skip leading whitespace     toklen   strcspn cstr  wschars       figure out token length     if  toklen                           if we have a token  add to list       out push back string cstr  toklen        cstr    toklen                       skip over token           ran out of string  return list    return out     int main int argc  char   argv      list lt string gt  li   split argv 1      for  list lt string gt   iterator i   li begin    i    li end    i        cout  lt  lt       lt  lt   i  lt  lt       lt  lt  endl    return 0      Run       split        split  a   a      split   a    a      split   a b   a   b      split   a b c   a   b   c      split   a b c d     a   b   c   d    Tail-recursive version of split  itself split into two functions   All destructive manipulation of variables is gone  except for the pushing of strings into the list   void split rec const char  cstr  list lt string gt   amp li      if   cstr        const size t leadsp   strspn cstr  wschars       const size t toklen   strcspn cstr   leadsp  wschars        if  toklen        li push back string cstr   leadsp  toklen         split rec cstr   leadsp   toklen  li          list lt string gt  split const string  amp str      list lt string gt  out    split rec str c str    out     return out

User · Answer

So far I used the one in Boost  but I needed something that doesn t depends on it  so I came to this   static void Split std  vector lt std  string gt  amp  lst  const std  string amp  input  const std  string amp  separators  bool remove empty   true        std  ostringstream word      for  size t n   0  n  lt  input size      n                if  std  string  npos    separators find input n                word  lt  lt  input n           else                       if   word str   empty       remove empty                  lst push back word str                 word str                          if   word str   empty       remove empty          lst push back word str         A good point is that in separators you can pass more than one character

User · Answer

Here is my version   include  lt vector gt   inline std  vector lt std  string gt  Split const std  string  amp str  const std  string  amp delim              std  vector lt std  string gt  tokens      if  str size    gt  0                if  delim size    gt  0                        std  string  size type currPos   0  prevPos   0              while   currPos   str find delim  prevPos      std  string  npos                                std  string item   str substr prevPos  currPos - prevPos                   if  item size    gt  0                                        tokens push back item                                     prevPos   currPos   1                            tokens push back str substr prevPos                      else                       tokens push back str                       return tokens      It works with multi-character delimiters  It prevents empty tokens to get in your results  It uses a single header  It returns the string as one single token when you provide no delimiter  It also returns an empty result if the string is empty  It is unfortunately inefficient because of the huge std  vector copy UNLESS you are compiling using C  11  which should be using the move schematic  In C  11  this code should be fast

User · Answer

The STL does not have such a method available already   However  you can either use C s strtok   function by using the std  string  c str   member  or you can write your own  Here is a code sample I found after a quick Google search   STL string split     void Tokenize const string amp  str                vector lt string gt  amp  tokens                const string amp  delimiters                 Skip delimiters at beginning      string  size type lastPos   str find first not of delimiters  0          Find first  non-delimiter       string  size type pos       str find first of delimiters  lastPos        while  string  npos    pos    string  npos    lastPos                   Found a token  add it to the vector          tokens push back str substr lastPos  pos - lastPos               Skip delimiters   Note the  not of          lastPos   str find first not of delimiters  pos              Find next  non-delimiter          pos   str find first of delimiters  lastPos             Taken from  http   oopweb com CPP Documents CPPHOWTO Volume C  Programming-HOWTO-7 html  If you have questions about the code sample  leave a comment and I will explain   And just because it does not implement a typedef called iterator or overload the  lt  lt  operator does not mean it is bad code  I use C functions quite frequently  For example  printf and scanf both are faster than std  cin and std  cout  significantly   the fopen syntax is a lot more friendly for binary types  and they also tend to produce smaller EXEs   Don t get sold on this  Elegance over performance  deal

User · Answer

Here is a split function that    is generic uses standard C    no boost  accepts multiple delimiters ignores empty tokens  can easily be changed   template lt typename T gt  vector lt T gt   split const T  amp  str  const T  amp  delimiters        vector lt T gt  v      typename T  size type start   0      auto pos   str find first of delimiters  start       while pos    T  npos            if pos    start     ignore empty tokens             v emplace back str  start  pos - start           start   pos   1          pos   str find first of delimiters  start             if start  lt  str length       ignore trailing delimiter         v emplace back str  start  str length   - start      add what s left of the string     return v       Example usage       vector lt string gt  v   split lt string gt   Hello  there  World              vector lt wstring gt  v   split lt wstring gt  L Hello  there  World   L

User · Answer

Here s another solution  It s compact and reasonably efficient   std  vector lt std  string gt  split const std  string  amp text  char sep      std  vector lt std  string gt  tokens    std  size t start   0  end   0    while   end   text find sep  start      std  string  npos        tokens push back text substr start  end - start        start   end   1        tokens push back text substr start      return tokens      It can easily be templatised to handle string separators  wide strings  etc   Note that splitting    results in a single empty string and splitting      ie  sep  results in two empty strings   It can also be easily expanded to skip empty tokens   std  vector lt std  string gt  split const std  string  amp text  char sep        std  vector lt std  string gt  tokens      std  size t start   0  end   0      while   end   text find sep  start      std  string  npos            if  end    start              tokens push back text substr start  end - start                      start   end   1            if  end    start           tokens push back text substr start              return tokens        If splitting a string at multiple delimiters while skipping empty tokens is desired  this version may be used   std  vector lt std  string gt  split const std  string amp  text  const std  string amp  delims        std  vector lt std  string gt  tokens      std  size t start   text find first not of delims   end   0       while  end   text find first of delims  start      std  string  npos                tokens push back text substr start  end - start            start   text find first not of delims  end             if start    std  string  npos          tokens push back text substr start         return tokens

User · Answer

LazyStringSplitter    include  lt string gt   include  lt algorithm gt   include  lt unordered set gt   using namespace std   class LazyStringSplitter       string  const iterator start  finish      unordered set lt char gt  chop   public          Empty Constructor     explicit LazyStringSplitter               explicit LazyStringSplitter  const string cstr  const string delims            start cstr begin              finish cstr end              chop delims begin    delims end                void operator     const string cstr  const string delims                chop insert delims begin    delims end             start   cstr begin            finish   cstr end               bool empty   const   return  start  gt   finish          string next                    return empty string            if ran out of characters         if  empty                return string               auto runner   find if start  finish    amp   char c                return chop count c     1                          construct next string         string ret start  runner           start   runner   1              Never return empty string              tail recursion makes this method efficient         return  ret empty     ret   next                I call this method the LazyStringSplitter because of one reason - It does not split the string in one go  In essence it behaves like a python generator It exposes a method called next which returns the next string that is split from the original I made use of the unordered set from c  11 STL  so that look up of delimiters is that much faster And here is how it works   TEST PROGRAM   include  lt iostream gt  using namespace std   int main         LazyStringSplitter splitter          split at the characters                        splitter  This  is a string  And here is another string  Let s test and see how well this does                  while   splitter empty            cout  lt  lt  splitter next    lt  lt  endl      return 0      OUTPUT  This is a string And here is another string Let s test and see how well this does   Next plan to improve this is to implement begin and end methods so that one can do something like   vector lt string gt  split string splitter begin    splitter end

User · Answer

include  lt iostream gt   include  lt string gt   include  lt deque gt   std  deque lt std  string gt  split      const std  string amp  line       std  string  value type delimiter      bool skipEmpty   false         std  deque lt std  string gt  parts         if   skipEmpty  amp  amp   line empty    amp  amp  delimiter    line at 0             parts push back                 for  const std  string  value type amp  c   line            if                                 c    delimiter                   amp  amp                   skipEmpty     parts empty    amp  amp   parts back   empty      true                                            c    delimiter  amp  amp  parts empty                            parts push back                         if  c    delimiter                parts back   push back c                        if  skipEmpty  amp  amp   parts empty    amp  amp  parts back   empty              parts pop back               return parts     void test const std  string amp  line        std  cout  lt  lt  line  lt  lt  std  endl       std  cout  lt  lt   skipEmpty 0         for  const std  string amp  part   split line                  std  cout  lt  lt  part  lt  lt                 std  cout  lt  lt  std  endl       std  cout  lt  lt   skipEmpty 1         for  const std  string amp  part   split line       true             std  cout  lt  lt  part  lt  lt                 std  cout  lt  lt  std  endl       std  cout  lt  lt  std  endl     int main         test  foo bar   baz        test          test  foo        test           test            test   foo        test    foo        test   foo         test   foo           return 0      Output   foo bar   baz skipEmpty 0  foo bar   baz  skipEmpty 1  foo bar baz    skipEmpty 0   skipEmpty 1    foo skipEmpty 0  foo  skipEmpty 1  foo     skipEmpty 0     skipEmpty 1       skipEmpty 0      skipEmpty 1     foo skipEmpty 0   foo  skipEmpty 1  foo     foo skipEmpty 0    foo  skipEmpty 1  foo    foo  skipEmpty 0   foo   skipEmpty 1  foo    foo   skipEmpty 0   foo    skipEmpty 1  foo

User · Answer

Get Boost     -    include  lt boost algorithm string split hpp gt   include  lt boost algorithm string hpp gt   include  lt iostream gt   include  lt vector gt   using namespace std  using namespace boost   int main int argc  char  argv        typedef vector  lt  string  gt  list type       list type list      string line       line    Somewhere down the road       split list  line  is any of             for int i   0  i  lt  list size    i                  cout  lt  lt  list i   lt  lt  endl             return 0      This example gives the output -   Somewhere down the road

User · Answer

What about this    include  lt string gt   include  lt vector gt   using namespace std   vector lt string gt  split string str  const char delim        vector lt string gt  v      string tmp       for string  const iterator i  i   str begin    i  lt   str end      i            if  i    delim  amp  amp  i    str end                  tmp     i             else               v push back tmp               tmp                                   return v

User · Answer

my general implementation for string and u32string    using the boost  algorithm  split signature   template lt typename CharT  typename UnaryPredicate gt  void split std  vector lt std  basic string lt CharT gt  gt  amp  split result             const std  basic string lt CharT gt  amp  s             UnaryPredicate predicate        using ST   std  basic string lt CharT gt       using std  swap      std  vector lt ST gt  tmp result      auto iter   s cbegin             end iter   s cend        while  true                               edge case  empty str - gt  push an empty str and exit                      auto find iter   find if iter  end iter  predicate           tmp result emplace back iter  find iter           if  find iter    end iter    break            iter     find iter             swap tmp result  split result       template lt typename CharT gt  void split std  vector lt std  basic string lt CharT gt  gt  amp  split result             const std  basic string lt CharT gt  amp  s             const std  basic string lt CharT gt  amp  char candidate        std  unordered set lt CharT gt  candidate set char candidate cbegin                                                char candidate cend         auto predicate     amp candidate set  const CharT amp  c            return candidate set count c   gt  0U             return split split result  s  predicate      template lt typename CharT gt  void split std  vector lt std  basic string lt CharT gt  gt  amp  split result             const std  basic string lt CharT gt  amp  s             const CharT  literals        return split split result  s  std  basic string lt CharT gt  literals

User · Answer

Yet another flexible and fast way  template lt typename Operator gt  void tokenize Operator amp  op  const char  input  const char  delimiters      const char  s   input    const char  e   s    while   e    0        e   s      while   e    0  amp  amp  strchr delimiters   e     0    e      if  e - s  gt  0          op s  e - s             s   e   1          To use it with a vector of strings  Edit  Since someone pointed out not to inherit STL classes    hrmf         template lt class ContainerType gt  class Appender   public    Appender ContainerType amp  container    container  container        void operator    const char  s  unsigned length         container  push back std  string s length        private    ContainerType amp  container       std  vector lt std  string gt  strVector  Appender v strVector   tokenize v   A number of words to be tokenized      t      That s it  And that s just one way to use the tokenizer  like how to just  count words   class WordCounter   public    WordCounter     noOfWords 0       void operator    const char   unsigned          noOfWords        unsigned noOfWords      WordCounter wc  tokenize wc   A number of words to be counted      t     ASSERT  wc noOfWords    7      Limited by imagination

User · Answer

include  lt iostream gt   include  lt regex gt   using namespace std   int main        string s    foo bar  baz      regex e    s        regex token iterator lt string  iterator gt  i s begin    s end    e  -1      regex token iterator lt string  iterator gt  end     while  i    end        cout  lt  lt        lt  lt   i    lt  lt           IMO  this is the closest thing to python s re split    See cplusplus com for more information about regex token iterator  The -1  4th argument in regex token iterator ctor  is the section of the sequence that is not matched  using the match as separator

User · Answer

Yet another flexible and fast way  template lt typename Operator gt  void tokenize Operator amp  op  const char  input  const char  delimiters      const char  s   input    const char  e   s    while   e    0        e   s      while   e    0  amp  amp  strchr delimiters   e     0    e      if  e - s  gt  0          op s  e - s             s   e   1          To use it with a vector of strings  Edit  Since someone pointed out not to inherit STL classes    hrmf         template lt class ContainerType gt  class Appender   public    Appender ContainerType amp  container    container  container        void operator    const char  s  unsigned length         container  push back std  string s length        private    ContainerType amp  container       std  vector lt std  string gt  strVector  Appender v strVector   tokenize v   A number of words to be tokenized      t      That s it  And that s just one way to use the tokenizer  like how to just  count words   class WordCounter   public    WordCounter     noOfWords 0       void operator    const char   unsigned          noOfWords        unsigned noOfWords      WordCounter wc  tokenize wc   A number of words to be counted      t     ASSERT  wc noOfWords    7      Limited by imagination

User · Answer

Based on Galik s answer I made this  This is mostly here so I don t have to keep writing it again and again  It s crazy that C   still doesn t have a native split function  Features    Should be very fast  Easy to understand  I think   Merges empty sections  Trivial to use several delimiters  e g    r n        include  lt string gt   include  lt vector gt   include  lt algorithm gt   std  vector lt std  string gt  split const std  string amp  s  const std  string amp  delims        using namespace std       vector lt string gt  v          Start of an element      size t elemStart   0          We start searching from the end of the previous element  which        initially is the start of the string      size t elemEnd   0          Find the first non-delim  i e  the start of an element  after the end of the previous element      while  elemStart   s find first not of delims  elemEnd      string  npos                   Find the first delem  i e  the end of the element  or if this fails it is the end of the string           elemEnd   s find first of delims  elemStart              Add it          v emplace back s  elemStart  elemEnd    string  npos   string  npos   elemEnd - elemStart                When there are no more non-spaces  we are done       return v

User · Answer

My implementation can be an alternative solution   std  vector lt std  wstring gt  SplitString const std  wstring  amp  String  const std  wstring  amp  Seperator        std  vector lt std  wstring gt  Lines      size t stSearchPos   0      size t stFoundPos      while  stSearchPos  lt  String size   - 1                stFoundPos   String find Seperator  stSearchPos           stFoundPos    stFoundPos    std  string  npos    String size     stFoundPos          Lines push back String substr stSearchPos  stFoundPos - stSearchPos            stSearchPos   stFoundPos   Seperator size              return Lines      Test code   std  wstring MyString L Part 1SEPsecond partSEPlast partSEPend    std  vector lt std  wstring gt  Parts   IniFile  SplitString MyString  L SEP    std  wcout  lt  lt  L The string     lt  lt  MyString  lt  lt  std  endl  for  std  vector lt std  wstring gt   const iterator it Parts begin    it lt Parts end      it        std  wcout  lt  lt   it  lt  lt  L  lt ---   lt  lt  std  endl    std  wcout  lt  lt  std  endl  MyString   L this time a comma separated string   std  wcout  lt  lt  L The string     lt  lt  MyString  lt  lt  std  endl  Parts   IniFile  SplitString MyString  L      for  std  vector lt std  wstring gt   const iterator it Parts begin    it lt Parts end      it        std  wcout  lt  lt   it  lt  lt  L  lt ---   lt  lt  std  endl      Output of the test code   The string  Part 1SEPsecond partSEPlast partSEPend Part 1 lt --- second part lt --- last part lt --- end lt ---  The string  this time a comma separated string this lt --- time lt --- a lt --- comma separated lt --- string lt ---

User · Answer

This answer takes the string and puts it into a vector of strings  It uses the boost library    include  lt boost algorithm string hpp gt  std  vector lt std  string gt  strs  boost  split strs   string to split   boost  is any of   t

User · Answer

Yes  I looked through all 30 examples   I couldn t find a version of split that works for multi-char delimiters  so here s mine     include  lt string gt   include  lt vector gt   using namespace std   vector lt string gt  split const string  amp str  const string  amp delim           const auto delim pos   str find delim        if  delim pos    string  npos          return  str        vector lt string gt  ret str substr 0  delim pos        auto tail   split str substr delim pos   delim size    string  npos   delim        ret insert ret end    tail begin    tail end          return ret      Probably not the most efficient of implementations  but it s a very straightforward recursive solution  using only  lt string gt  and  lt vector gt    Ah  it s written in C  11  but there s nothing special about this code  so you could easily adapt it to C  98

User · Answer

Thank you  Jairo Abdiel Toribio Cisneros  It works for me but your function return some empty element  So for return without empty I have edited with the following   std  vector lt std  string gt  split std  string str  const char  delim        std  vector lt std  string gt  v      std  string tmp       for std  string  const iterator i   str begin    i  lt   str end      i            if  i     delim  amp  amp  i    str end                  tmp     i            else               if  tmp length    gt  0                    v push back tmp                             tmp                            return v      Using   std  string s    one two  three   std  string delim        std  vector lt std  string gt  vv   split s  delim c str

User · Answer

This is similar to Stack nbsp Overflow question How do I tokenize a string in C       include  lt iostream gt   include  lt string gt   include  lt boost tokenizer hpp gt   using namespace std  using namespace boost   int main int argc  char   argv        string text    token  test tstring        char separator lt char gt  sep    t        tokenizer lt char separator lt char gt  gt  tokens text  sep       for  const string amp  t   tokens                cout  lt  lt  t  lt  lt       lt  lt  endl

User · Answer

For a ridiculously large and probably redundant version  try a lot of for loops   string stringlist 10   int count   0   for  int i   0  i  lt  sequence length    i          if  sequence i                        stringlist count    sequence substr 0  i           sequence erase 0  i 1           i   0          count              else if  i    sequence length  -1      Last word               stringlist count    sequence substr 0  i 1             It isn t pretty  but by and large  Barring punctuation and a slew of other bugs  it works

User · Answer

I have a 2 lines solution to this problem   char sep        std  string s  1 This is an example    for size t p 0  q 0  p  s npos  p q    std  cout  lt  lt  s substr p  p  0    q s find sep  p 1  -p- p  0    lt  lt  std  endl    Then instead of printing you can put it in a vector

User · Answer

I have just written a fine example of how to split a char by symbol  which then places each array of chars  words seperated by your symbol  into a vector  For simplicity i made the vector type of std string   I hope this helps and is readable to you    include  lt vector gt   include  lt string gt   include  lt iostream gt   void push std  vector lt std  string gt   amp WORDS  std  string  amp TMP       WORDS push back TMP       TMP         std  vector lt std  string gt  mySplit char STRING             std  vector lt std  string gt  words          std  string s          for unsigned short i   0  i  lt  strlen STRING   i                 if STRING i                           s    STRING i                else                  push words  s                                   push words  s    Used to get last split         return words     int main        char string      My awesome string        std  cout  lt  lt  mySplit string  2       std  cin get        return 0

User · Answer

Here is my version   include  lt vector gt   inline std  vector lt std  string gt  Split const std  string  amp str  const std  string  amp delim              std  vector lt std  string gt  tokens      if  str size    gt  0                if  delim size    gt  0                        std  string  size type currPos   0  prevPos   0              while   currPos   str find delim  prevPos      std  string  npos                                std  string item   str substr prevPos  currPos - prevPos                   if  item size    gt  0                                        tokens push back item                                     prevPos   currPos   1                            tokens push back str substr prevPos                      else                       tokens push back str                       return tokens      It works with multi-character delimiters  It prevents empty tokens to get in your results  It uses a single header  It returns the string as one single token when you provide no delimiter  It also returns an empty result if the string is empty  It is unfortunately inefficient because of the huge std  vector copy UNLESS you are compiling using C  11  which should be using the move schematic  In C  11  this code should be fast

User · Answer

This is similar to Stack nbsp Overflow question How do I tokenize a string in C       include  lt iostream gt   include  lt string gt   include  lt boost tokenizer hpp gt   using namespace std  using namespace boost   int main int argc  char   argv        string text    token  test tstring        char separator lt char gt  sep    t        tokenizer lt char separator lt char gt  gt  tokens text  sep       for  const string amp  t   tokens                cout  lt  lt  t  lt  lt       lt  lt  endl

User · Answer

very late to the party here I know but I was thinking about the most elegant way of doing this if you were given a range of delimiters rather than whitespace  and using nothing more than the standard library   Here are my thoughts   To split words into a string vector by a sequence of delimiters   template lt class Container gt  std  vector lt std  string gt  split by delimiters const std  string amp  input  const Container amp  delimiters        std  vector lt std  string gt  result       for  auto current   begin input    current    end input                    auto first   find if current  end input   not in delimiters            if  first    end input   break          auto last   find if first  end input   is in delimiters            result emplace back first  last           current   last            return result      to split the other way  by providing a sequence of valid characters   template lt class Container gt  std  vector lt std  string gt  split by valid chars const std  string amp  input  const Container amp  valid chars        std  vector lt std  string gt  result       for  auto current   begin input    current    end input                    auto first   find if current  end input   is in valid chars            if  first    end input   break          auto last   find if first  end input   not in valid chars            result emplace back first  last           current   last            return result      is in and not in are defined thus   namespace detail       template lt class Container gt      struct is in           is in const Container amp  charset             charset charset                      bool operator   char c  const                       return find begin  charset   end  charset   c     end  charset                      const Container amp   charset              template lt class Container gt      struct not in           not in const Container amp  charset             charset charset                      bool operator   char c  const                       return find begin  charset   end  charset   c     end  charset                      const Container amp   charset             template lt class Container gt  detail  not in lt Container gt  not in const Container amp  c        return detail  not in lt Container gt  c      template lt class Container gt  detail  is in lt Container gt  is in const Container amp  c        return detail  is in lt Container gt  c

User · Answer

I use this simpleton because we got our String class  special   i e  not standard    void splitString const String  amp s  const String  amp delim  std  vector lt String gt   amp result        const int l   delim length        int f   0      int i   s indexOf delim f       while  i gt  0            String token  i-f  gt  0   s substring f i-f                 result push back token           f i l          i   s indexOf delim f             String token   s substring f       result push back token

User · Answer

C  17 version without any memory allocation  except may be for std  function   void iter words const std  string view amp  input  const std  function lt void std  string view  gt  amp  process word         auto itr   input begin         auto consume whitespace     amp               for   itr    input end      itr                if  isspace  itr                   return                        auto consume letters     amp               for   itr    input end      itr                if isspace  itr                   return                        while true            consume whitespace            if itr    input end                return          auto word start   itr - input begin            consume letters            auto word end   itr - input begin            process word input substr word start  word end - word start             int main         iter words  foo bar      std  string view sv            std  cout  lt  lt   Got word     lt  lt   sv  lt  lt    n               return 0

User · Answer

include lt iostream gt   include lt string gt   include lt sstream gt   include lt vector gt  using namespace std       vector lt string gt  split const string  amp s  char delim            vector lt string gt  elems          stringstream ss s           string item          while  getline ss  item  delim                 elems push back item                     return elems         int main              vector lt string gt  x   split  thi is an sample test                unsigned int i          for i 0 i lt x size   i                cout lt  lt i lt  lt     lt  lt x i  lt  lt endl          return 0

User · Answer

include lt iostream gt   include lt string gt   include lt sstream gt   include lt vector gt  using namespace std       vector lt string gt  split const string  amp s  char delim            vector lt string gt  elems          stringstream ss s           string item          while  getline ss  item  delim                 elems push back item                     return elems         int main              vector lt string gt  x   split  thi is an sample test                unsigned int i          for i 0 i lt x size   i                cout lt  lt i lt  lt     lt  lt x i  lt  lt endl          return 0

User · Answer

Here s another solution  It s compact and reasonably efficient   std  vector lt std  string gt  split const std  string  amp text  char sep      std  vector lt std  string gt  tokens    std  size t start   0  end   0    while   end   text find sep  start      std  string  npos        tokens push back text substr start  end - start        start   end   1        tokens push back text substr start      return tokens      It can easily be templatised to handle string separators  wide strings  etc   Note that splitting    results in a single empty string and splitting      ie  sep  results in two empty strings   It can also be easily expanded to skip empty tokens   std  vector lt std  string gt  split const std  string  amp text  char sep        std  vector lt std  string gt  tokens      std  size t start   0  end   0      while   end   text find sep  start      std  string  npos            if  end    start              tokens push back text substr start  end - start                      start   end   1            if  end    start           tokens push back text substr start              return tokens        If splitting a string at multiple delimiters while skipping empty tokens is desired  this version may be used   std  vector lt std  string gt  split const std  string amp  text  const std  string amp  delims        std  vector lt std  string gt  tokens      std  size t start   text find first not of delims   end   0       while  end   text find first of delims  start      std  string  npos                tokens push back text substr start  end - start            start   text find first not of delims  end             if start    std  string  npos          tokens push back text substr start         return tokens

User · Answer

I have a very different approach from the other solutions that offers a lot of value in ways that the other solutions are variously lacking  but of course also has its own down sides  Here is the working implementation  with the example of putting  lt tag gt  lt  tag gt  around words   For a start  this problem can be solved with one loop  no additional memory  and by considering merely four logical cases  Conceptually  we re interested in boundaries  Our code should reflect that  let s iterate through the string and look at two characters at a time  bearing in mind that we have special cases at the start and end of the string   The downside is that we have to write the implementation  which is somewhat verbose  but mostly convenient boilerplate   The upside is that we wrote the implementation  so it is very easy to customize it to specific needs  such as distinguishing left and write word boundaries  using any set of delimiters  or handling other cases such as non-boundary or erroneous positions   using namespace std    include  lt iostream gt   include  lt string gt    include  lt cctype gt   typedef enum boundary type e       E BOUNDARY TYPE ERROR   -1      E BOUNDARY TYPE NONE      E BOUNDARY TYPE LEFT      E BOUNDARY TYPE RIGHT    boundary type t   typedef struct boundary s       boundary type t type      int pos    boundary t   bool is delim char int c        return isspace c      also compare against any other chars you want to use as delimiters    bool is word char int c        return      lt   c  amp  amp  c  lt        amp  amp   is delim char c      boundary t maybe word boundary string str  int pos        int len   str length        if  pos  lt  0    pos  gt   len            return  boundary t   type   E BOUNDARY TYPE ERROR         else           if  pos    0  amp  amp  is word char str pos                     if the first character is word-y  we have a left boundary at the beginning             return  boundary t   type   E BOUNDARY TYPE LEFT   pos   pos             else if  pos    len - 1  amp  amp  is word char str pos                     if the last character is word-y  we have a right boundary left of the null terminator             return  boundary t   type   E BOUNDARY TYPE RIGHT   pos   pos   1             else if   is word char str pos    amp  amp  is word char str pos   1                     if we have a delimiter followed by a word char  we have a left boundary left of the word char             return  boundary t   type   E BOUNDARY TYPE LEFT   pos   pos   1             else if  is word char str pos    amp  amp   is word char str pos   1                     if we have a word char followed by a delimiter  we have a right boundary right of the word char             return  boundary t   type   E BOUNDARY TYPE RIGHT   pos   pos   1                     return  boundary t   type   E BOUNDARY TYPE NONE            int main         string str      getline cin  str        int len   str length        for  int i   0  i  lt  len  i              boundary t boundary   maybe word boundary str  i           if  boundary type    E BOUNDARY TYPE LEFT                   whatever           else if  boundary type    E BOUNDARY TYPE RIGHT                   whatever                     As you can see  the code is very simple to understand and fine tune  and the actual usage of the code is very short and simple  Using C   should not stop us from writing the simplest and most readily customized code possible  even if that means not using the STL  I would think this is an instance of what Linus Torvalds might call  taste   since we have eliminated all the logic we don t need while writing in a style that naturally allows more cases to be handled when and if the need to handle them arises   What could improve this code might be the use of enum class  accepting a function pointer to is word char in maybe word boundary instead of invoking is word char directly  and passing a lambda

User · Answer

I use this simpleton because we got our String class  special   i e  not standard    void splitString const String  amp s  const String  amp delim  std  vector lt String gt   amp result        const int l   delim length        int f   0      int i   s indexOf delim f       while  i gt  0            String token  i-f  gt  0   s substring f i-f                 result push back token           f i l          i   s indexOf delim f             String token   s substring f       result push back token

User · Answer

For those with whom it does not sit well to sacrifice all efficiency for code size and see  efficient  as a type of elegance  the following should hit a sweet spot  and I think the template container class is an awesomely elegant addition     template  lt  class ContainerT  gt  void tokenize const std  string amp  str  ContainerT amp  tokens                const std  string amp  delimiters        bool trimEmpty   false       std  string  size type pos  lastPos   0  length   str length        using value type   typename ContainerT  value type     using size type    typename ContainerT  size type      while lastPos  lt  length   1             pos   str find first of delimiters  lastPos         if pos    std  string  npos                   pos   length                 if pos    lastPos     trimEmpty           tokens push back value type str data   lastPos                  size type pos-lastPos            lastPos   pos   1           I usually choose to use std  vector lt std  string gt  types as my second parameter  ContainerT     but list lt  gt  is way faster than vector lt  gt  for when direct access is not needed  and you can even create your own string class and use something like std  list lt subString gt  where subString does not do any copies for incredible speed increases   It s more than double as fast as the fastest tokenize on this page and almost 5 times faster than some others  Also with the perfect parameter types you can eliminate all string and list copies for additional speed increases   Additionally it does not do the  extremely inefficient  return of result  but rather it passes the tokens as a reference  thus also allowing you to build up tokens using multiple calls if you so wished   Lastly it allows you to specify whether to trim empty tokens from the results via a last optional parameter   All it needs is std  string    the rest are optional  It does not use streams or the boost library  but is flexible enough to be able to accept some of these foreign types naturally

User · Answer

I like the following because it puts the results into a vector  supports a string as a delim and gives control over keeping empty values  But  it doesn t look as good then    include  lt ostream gt   include  lt string gt   include  lt vector gt   include  lt algorithm gt   include  lt iterator gt  using namespace std   vector lt string gt  split const string amp  s  const string amp  delim  const bool keep empty   true        vector lt string gt  result      if  delim empty              result push back s           return result            string  const iterator substart   s begin    subend      while  true            subend   search substart  s end    delim begin    delim end             string temp substart  subend           if  keep empty     temp empty                  result push back temp                     if  subend    s end                  break                    substart   subend   delim size              return result     int main         const vector lt string gt  words   split  So close no matter how far             copy words begin    words end    ostream iterator lt string gt  cout    n         Of course  Boost has a split   that works partially like that  And  if by  white-space   you really do mean any type of white-space  using Boost s split with is any of   works great

User · Answer

Using std  string view and Eric Niebler s range-v3 library   https   wandbox org permlink kW5lwRCL1pxjp2pW   include  lt iostream gt   include  lt string gt   include  lt string view gt   include  range v3 view hpp   include  range v3 algorithm hpp   int main         std  string s    Somewhere down the range v3 library       ranges  for each s               ranges  view  split                  ranges  view  transform    auto  amp  amp sub                    return std  string view  amp  sub begin    ranges  distance sub                               auto s   std  cout  lt  lt   Substring     lt  lt  s  lt  lt    n               By using a range for loop instead of ranges  for each algorithm    include  lt iostream gt   include  lt string gt   include  lt string view gt   include  range v3 view hpp   int main         std  string str    Somewhere down the range v3 library       for  auto s   str   ranges  view  split                              ranges  view  transform    auto amp  amp  sub    return std  string view  amp  sub begin    ranges  distance sub                                             std  cout  lt  lt   Substring     lt  lt  s  lt  lt    n

User · Answer

I have a 2 lines solution to this problem   char sep        std  string s  1 This is an example    for size t p 0  q 0  p  s npos  p q    std  cout  lt  lt  s substr p  p  0    q s find sep  p 1  -p- p  0    lt  lt  std  endl    Then instead of printing you can put it in a vector

User · Answer

For what it s worth  here s another way to extract tokens from an input string  relying only on standard library facilities  It s an example of the power and elegance behind the design of the STL    include  lt iostream gt   include  lt string gt   include  lt sstream gt   include  lt algorithm gt   include  lt iterator gt   int main         using namespace std      string sentence    And I feel fine          istringstream iss sentence       copy istream iterator lt string gt  iss            istream iterator lt string gt              ostream iterator lt string gt  cout    n         Instead of copying the extracted tokens to an output stream  one could insert them into a container  using the same generic copy algorithm   vector lt string gt  tokens  copy istream iterator lt string gt  iss        istream iterator lt string gt          back inserter tokens          or create the vector directly   vector lt string gt  tokens istream iterator lt string gt  iss                         istream iterator lt string gt

User · Answer

The code below uses strtok   to split a  string into tokens and stores the tokens in a vector    include  lt iostream gt   include  lt algorithm gt   include  lt vector gt   include  lt string gt   using namespace std    char one line string      hello hi how are you nice weather we are having ok then bye   char seps           t n   char  token     int main        vector lt string gt  vec String Lines     token   strtok  one line string  seps        cout  lt  lt   Extracting and storing data in a vector   n n n       while  token    NULL              vec String Lines push back token         token   strtok  NULL  seps              cout  lt  lt   Displaying end result in vector line storage   n n        for   int i   0  i  lt  vec String Lines size      i      cout  lt  lt  vec String Lines i   lt  lt    n       cout  lt  lt    n n n     return 0

User · Answer

I wrote the following piece of code  You can specify delimiter  which can be a string  The result is similar to Java s String split  with empty string in the result   For example  if we call split  ABCPICKABCANYABCTWO ABC    ABC    the result is as follows   0   lt len 0 gt  1 PICK  lt len 4 gt  2 ANY  lt len 3 gt  3 TWO   lt len 4 gt  4   lt len 0 gt    Code   vector  lt string gt  split const string amp  str  const string amp  delimiter              vector  lt string gt  tokens       string  size type lastPos   0      string  size type pos   str find delimiter  lastPos        while  string  npos    pos               Found a token  add it to the vector          cout  lt  lt  str substr lastPos  pos - lastPos   lt  lt  endl          tokens push back str substr lastPos  pos - lastPos            lastPos   pos   delimiter size            pos   str find delimiter  lastPos              tokens push back str substr lastPos  str size   - lastPos        return tokens

User · Answer

This is my favorite way to iterate through a string  You can do whatever you want per word   string line    a line of text to iterate through   string word   istringstream iss line  istringstream  in    while  iss  gt  gt  word                 Do something on  word  here

User · Answer

This is a function I wrote that helps me do a lot  It helped me when doing protocol for WebSockets    using namespace std   include  lt iostream gt   include  lt vector gt   include  lt sstream gt   include  lt string gt   vector lt string gt  split   string input   string split id       vector lt string gt  result    int i   0    bool add    string temp    stringstream ss    size t found    string real    int r   0      while   i    input length               add   false          ss  lt  lt  input at i           temp   ss str            found   temp find split id           if   found    string  npos                 add   true              real append   temp   0   found              else if   r  gt  0  amp  amp     i 1      input length                   add   true              real append   temp   0   found                      if   add                 result push back real               ss str string                 ss clear                temp clear                real clear                r   0                    i            r            return result     int main         string s    S o m e w h e r e  down the road  n In a really big C   house    n  Lives a little old lady     n   That no one ever knew      n    She comes outside       n     In the very hot sun        n n n n n n n n   And throws C   at us      n    The End   FIN        vector  lt  string  gt  Token      Token   split   s              for   int i   0   i  lt  Token size    i       cout  lt  lt  Token at i   lt  lt  endl      cout  lt  lt  endl  lt  lt  Token size        int a      cin  gt  gt  a      return a

User · Answer

C  20 finally blesses us with a split function  Or rather  a range adapter  Godbolt link    include  lt iostream gt   include  lt ranges gt   include  lt string view gt   namespace ranges   std  ranges  namespace views   std  views   using str   std  string view   constexpr auto view        Multiple words        views  split            views  transform    auto  amp  amp r  - gt  str           return                amp  r begin                static cast lt str  size type gt  ranges  distance r                       auto main   - gt  int       for  str  amp  amp sv   view            std  cout  lt  lt  sv  lt  lt    n

User · Answer

I like the following because it puts the results into a vector  supports a string as a delim and gives control over keeping empty values  But  it doesn t look as good then    include  lt ostream gt   include  lt string gt   include  lt vector gt   include  lt algorithm gt   include  lt iterator gt  using namespace std   vector lt string gt  split const string amp  s  const string amp  delim  const bool keep empty   true        vector lt string gt  result      if  delim empty              result push back s           return result            string  const iterator substart   s begin    subend      while  true            subend   search substart  s end    delim begin    delim end             string temp substart  subend           if  keep empty     temp empty                  result push back temp                     if  subend    s end                  break                    substart   subend   delim size              return result     int main         const vector lt string gt  words   split  So close no matter how far             copy words begin    words end    ostream iterator lt string gt  cout    n         Of course  Boost has a split   that works partially like that  And  if by  white-space   you really do mean any type of white-space  using Boost s split with is any of   works great

User · Answer

Short and elegant   include  lt vector gt   include  lt string gt  using namespace std   vector lt string gt  split string data  string token        vector lt string gt  output      size t pos   string  npos     size t to avoid improbable overflow     do               pos   data find token           output push back data substr 0  pos            if  string  npos    pos              data   data substr pos   token size           while  string  npos    pos       return output      can use any string as delimiter  also can be used with binary data  std  string supports binary data  including nulls   using   auto a   split  this  is   example string            output   this is  example string

User · Answer

I use the following code   namespace Core       typedef std  wstring String       void SplitString const Core  String amp  input  const Core  String amp  splitter  std  list lt Core  String gt  amp  output                if  splitter empty                          throw std  invalid argument       for example                    std  list lt Core  String gt  lines           Core  String  size type offset   0           for                            Core  String  size type splitterPos   input find splitter  offset                if  splitterPos    Core  String  npos                                lines push back input substr offset  splitterPos - offset                    offset   splitterPos   splitter size                              else                               lines push back input substr offset                    break                                   lines swap output               gtest   class SplitStringTest  public testing  Test       TEST F SplitStringTest  EmptyStringAndSplitter        std  list lt Core  String gt  result      ASSERT ANY THROW Core  SplitString Core  String    Core  String    result       TEST F SplitStringTest  NonEmptyStringAndEmptySplitter        std  list lt Core  String gt  result      ASSERT ANY THROW Core  SplitString L xy   Core  String    result       TEST F SplitStringTest  EmptyStringAndNonEmptySplitter        std  list lt Core  String gt  result      Core  SplitString Core  String    Core  String L      result       ASSERT EQ 1  result size         ASSERT EQ Core  String     result begin        TEST F SplitStringTest  OneCharSplitter        std  list lt Core  String gt  result       Core  SplitString L x y   L     result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y    result rbegin          Core  SplitString L  xy   L     result       ASSERT EQ 2  result size         ASSERT EQ Core  String     result begin         ASSERT EQ L xy    result rbegin          Core  SplitString L xy    L     result       ASSERT EQ 2  result size         ASSERT EQ L xy    result begin         ASSERT EQ Core  String     result rbegin        TEST F SplitStringTest  TwoCharsSplitter        std  list lt Core  String gt  result       Core  SplitString L x  y z   L      result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y z    result rbegin          Core  SplitString L x  y z   L      result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y z    result rbegin        TEST F SplitStringTest  RecursiveSplitter        std  list lt Core  String gt  result       Core  SplitString L       L      result       ASSERT EQ 2  result size         ASSERT EQ Core  String     result begin         ASSERT EQ L      result rbegin          Core  SplitString L         L       result       ASSERT EQ 2  result size         ASSERT EQ Core  String     result begin         ASSERT EQ L       result rbegin          Core  SplitString L x     y   L       result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L   y    result rbegin          Core  SplitString L          L       result       ASSERT EQ 3  result size         ASSERT EQ Core  String     result begin         ASSERT EQ Core  String        result begin          ASSERT EQ Core  String     result rbegin        TEST F SplitStringTest  NullTerminators        std  list lt Core  String gt  result       Core  SplitString L xy   Core  String L  0   1   result       ASSERT EQ 1  result size         ASSERT EQ L xy    result begin          Core  SplitString Core  String L x 0y   3   Core  String L  0   1   result       ASSERT EQ 2  result size         ASSERT EQ L x    result begin         ASSERT EQ L y    result rbegin

User · Answer

Using std  stringstream as you have works perfectly fine  and do exactly what you wanted  If you re just looking for different way of doing things though  you can use std  find   std  find first of   and std  string  substr     Here s an example    include  lt iostream gt   include  lt string gt   int main         std  string s  Somewhere down the road        std  string  size type prev pos   0  pos   0       while   pos   s find      pos      std  string  npos                 std  string substring  s substr prev pos  pos-prev pos              std  cout  lt  lt  substring  lt  lt    n            prev pos     pos             std  string substring  s substr prev pos  pos-prev pos        Last word     std  cout  lt  lt  substring  lt  lt    n        return 0

User · Answer

This is my solution to this problem   vector lt string gt  get tokens string str        vector lt string gt  dt      stringstream ss      string tmp       ss  lt  lt  str      for  size t i   ss eof      i            ss  gt  gt  tmp          dt push back tmp             return dt      This function returns a vector of strings

User · Answer

my general implementation for string and u32string    using the boost  algorithm  split signature   template lt typename CharT  typename UnaryPredicate gt  void split std  vector lt std  basic string lt CharT gt  gt  amp  split result             const std  basic string lt CharT gt  amp  s             UnaryPredicate predicate        using ST   std  basic string lt CharT gt       using std  swap      std  vector lt ST gt  tmp result      auto iter   s cbegin             end iter   s cend        while  true                               edge case  empty str - gt  push an empty str and exit                      auto find iter   find if iter  end iter  predicate           tmp result emplace back iter  find iter           if  find iter    end iter    break            iter     find iter             swap tmp result  split result       template lt typename CharT gt  void split std  vector lt std  basic string lt CharT gt  gt  amp  split result             const std  basic string lt CharT gt  amp  s             const std  basic string lt CharT gt  amp  char candidate        std  unordered set lt CharT gt  candidate set char candidate cbegin                                                char candidate cend         auto predicate     amp candidate set  const CharT amp  c            return candidate set count c   gt  0U             return split split result  s  predicate      template lt typename CharT gt  void split std  vector lt std  basic string lt CharT gt  gt  amp  split result             const std  basic string lt CharT gt  amp  s             const CharT  literals        return split split result  s  std  basic string lt CharT gt  literals

User · Answer

The following is a much better way to do this  It can take any character  and doesn t split lines unless you want  No special libraries needed  well  besides std  but who really considers that an extra library   no pointers  no references  and it s static  Just simple plain C      pragma once  include  lt vector gt   include  lt sstream gt  using namespace std  class Helpers       public          static vector lt string gt  split string s  char delim                        stringstream temp  stringstream  in   stringstream  out               vector lt string gt  elems 0               if  s size      0    delim    0                  return elems              for char c   s                                if c    delim                                        elems push back temp str                         temp   stringstream stringstream  in   stringstream  out                                     else                     temp  lt  lt  c                            if  temp str   size    gt  0                  elems push back temp str                     return elems                           Splits string s with a list of delimiters in delims  it s just a list  like if we wanted to           split at the following letters  a  b  c we would make delims  abc           static vector lt string gt  split string s  string delims                        stringstream temp  stringstream  in   stringstream  out               vector lt string gt  elems 0               bool found              if s size      0    delims size      0                  return elems              for char c   s                                found   false                  for char d   delims                                        if  c    d                                                elems push back temp str                             temp   stringstream stringstream  in   stringstream  out                           found   true                          break                                                          if  found                      temp  lt  lt  c                            if temp str   size    gt  0                  elems push back temp str                 return elems

User · Answer

adapted from a  regular  csv parse std  string stringIn    my csv  is 10233478 NOTseparated by commas   std  vector lt std  string gt  commaSeparated 1   int commaCounter   0  for  int i 0  i lt stringIn size    i          if  stringIn i                    commaSeparated push back              commaCounter          else           commaSeparated at commaCounter     stringIn i             in the end you will have a vector of strings with every element in the sentence separated by spaces   only non-standard resource is std  vector  but since an std  string is involved  i figured it would be acceptable    empty strings are saved as a separate items

User · Answer

For those with whom it does not sit well to sacrifice all efficiency for code size and see  efficient  as a type of elegance  the following should hit a sweet spot  and I think the template container class is an awesomely elegant addition     template  lt  class ContainerT  gt  void tokenize const std  string amp  str  ContainerT amp  tokens                const std  string amp  delimiters        bool trimEmpty   false       std  string  size type pos  lastPos   0  length   str length        using value type   typename ContainerT  value type     using size type    typename ContainerT  size type      while lastPos  lt  length   1             pos   str find first of delimiters  lastPos         if pos    std  string  npos                   pos   length                 if pos    lastPos     trimEmpty           tokens push back value type str data   lastPos                  size type pos-lastPos            lastPos   pos   1           I usually choose to use std  vector lt std  string gt  types as my second parameter  ContainerT     but list lt  gt  is way faster than vector lt  gt  for when direct access is not needed  and you can even create your own string class and use something like std  list lt subString gt  where subString does not do any copies for incredible speed increases   It s more than double as fast as the fastest tokenize on this page and almost 5 times faster than some others  Also with the perfect parameter types you can eliminate all string and list copies for additional speed increases   Additionally it does not do the  extremely inefficient  return of result  but rather it passes the tokens as a reference  thus also allowing you to build up tokens using multiple calls if you so wished   Lastly it allows you to specify whether to trim empty tokens from the results via a last optional parameter   All it needs is std  string    the rest are optional  It does not use streams or the boost library  but is flexible enough to be able to accept some of these foreign types naturally

User · Answer

void splitString string str  char delim  string array    const int arraySize        int delimPosition  subStrSize  subStrStart   0       for  int index   0  delimPosition    -1  index                  delimPosition   str find delim  subStrStart           subStrSize   delimPosition - subStrStart          array index    str substr subStrStart  subStrSize           subStrStart     delimPosition   1

User · Answer

We can use strtok in c       include  lt iostream gt   include  lt cstring gt  using namespace std   int main         char str    Mickey M 12034 911416313 M 01a 9001 NULL 0 13 12 0 CPP C MSC 3D FEND BEND SEC        char  pch   strtok  str            while  pch    NULL                cout lt  lt pch lt  lt   n           pch   strtok  NULL                   return 0

User · Answer

Based on Galik s answer I made this  This is mostly here so I don t have to keep writing it again and again  It s crazy that C   still doesn t have a native split function  Features    Should be very fast  Easy to understand  I think   Merges empty sections  Trivial to use several delimiters  e g    r n        include  lt string gt   include  lt vector gt   include  lt algorithm gt   std  vector lt std  string gt  split const std  string amp  s  const std  string amp  delims        using namespace std       vector lt string gt  v          Start of an element      size t elemStart   0          We start searching from the end of the previous element  which        initially is the start of the string      size t elemEnd   0          Find the first non-delim  i e  the start of an element  after the end of the previous element      while  elemStart   s find first not of delims  elemEnd      string  npos                   Find the first delem  i e  the end of the element  or if this fails it is the end of the string           elemEnd   s find first of delims  elemStart              Add it          v emplace back s  elemStart  elemEnd    string  npos   string  npos   elemEnd - elemStart                When there are no more non-spaces  we are done       return v

User · Answer

Here s another way of doing it    void split string string text vector lt string gt  amp  words      int i 0    char ch    string word     while ch text i             if  isspace ch               if   word empty                    words push back word                 word                 else             word    ch              if   word empty            words push back word

User · Answer

There is a function named strtok    include lt string gt  using namespace std   vector lt string gt  split char  str const char  delim        char  saveptr      char  token   strtok r str delim  amp saveptr        vector lt string gt  result       while token    NULL                result push back token           token   strtok r NULL delim  amp saveptr             return result

User · Answer

This is a function I wrote that helps me do a lot  It helped me when doing protocol for WebSockets    using namespace std   include  lt iostream gt   include  lt vector gt   include  lt sstream gt   include  lt string gt   vector lt string gt  split   string input   string split id       vector lt string gt  result    int i   0    bool add    string temp    stringstream ss    size t found    string real    int r   0      while   i    input length               add   false          ss  lt  lt  input at i           temp   ss str            found   temp find split id           if   found    string  npos                 add   true              real append   temp   0   found              else if   r  gt  0  amp  amp     i 1      input length                   add   true              real append   temp   0   found                      if   add                 result push back real               ss str string                 ss clear                temp clear                real clear                r   0                    i            r            return result     int main         string s    S o m e w h e r e  down the road  n In a really big C   house    n  Lives a little old lady     n   That no one ever knew      n    She comes outside       n     In the very hot sun        n n n n n n n n   And throws C   at us      n    The End   FIN        vector  lt  string  gt  Token      Token   split   s              for   int i   0   i  lt  Token size    i       cout  lt  lt  Token at i   lt  lt  endl      cout  lt  lt  endl  lt  lt  Token size        int a      cin  gt  gt  a      return a

User · Answer

I have a very different approach from the other solutions that offers a lot of value in ways that the other solutions are variously lacking  but of course also has its own down sides  Here is the working implementation  with the example of putting  lt tag gt  lt  tag gt  around words   For a start  this problem can be solved with one loop  no additional memory  and by considering merely four logical cases  Conceptually  we re interested in boundaries  Our code should reflect that  let s iterate through the string and look at two characters at a time  bearing in mind that we have special cases at the start and end of the string   The downside is that we have to write the implementation  which is somewhat verbose  but mostly convenient boilerplate   The upside is that we wrote the implementation  so it is very easy to customize it to specific needs  such as distinguishing left and write word boundaries  using any set of delimiters  or handling other cases such as non-boundary or erroneous positions   using namespace std    include  lt iostream gt   include  lt string gt    include  lt cctype gt   typedef enum boundary type e       E BOUNDARY TYPE ERROR   -1      E BOUNDARY TYPE NONE      E BOUNDARY TYPE LEFT      E BOUNDARY TYPE RIGHT    boundary type t   typedef struct boundary s       boundary type t type      int pos    boundary t   bool is delim char int c        return isspace c      also compare against any other chars you want to use as delimiters    bool is word char int c        return      lt   c  amp  amp  c  lt        amp  amp   is delim char c      boundary t maybe word boundary string str  int pos        int len   str length        if  pos  lt  0    pos  gt   len            return  boundary t   type   E BOUNDARY TYPE ERROR         else           if  pos    0  amp  amp  is word char str pos                     if the first character is word-y  we have a left boundary at the beginning             return  boundary t   type   E BOUNDARY TYPE LEFT   pos   pos             else if  pos    len - 1  amp  amp  is word char str pos                     if the last character is word-y  we have a right boundary left of the null terminator             return  boundary t   type   E BOUNDARY TYPE RIGHT   pos   pos   1             else if   is word char str pos    amp  amp  is word char str pos   1                     if we have a delimiter followed by a word char  we have a left boundary left of the word char             return  boundary t   type   E BOUNDARY TYPE LEFT   pos   pos   1             else if  is word char str pos    amp  amp   is word char str pos   1                     if we have a word char followed by a delimiter  we have a right boundary right of the word char             return  boundary t   type   E BOUNDARY TYPE RIGHT   pos   pos   1                     return  boundary t   type   E BOUNDARY TYPE NONE            int main         string str      getline cin  str        int len   str length        for  int i   0  i  lt  len  i              boundary t boundary   maybe word boundary str  i           if  boundary type    E BOUNDARY TYPE LEFT                   whatever           else if  boundary type    E BOUNDARY TYPE RIGHT                   whatever                     As you can see  the code is very simple to understand and fine tune  and the actual usage of the code is very short and simple  Using C   should not stop us from writing the simplest and most readily customized code possible  even if that means not using the STL  I would think this is an instance of what Linus Torvalds might call  taste   since we have eliminated all the logic we don t need while writing in a style that naturally allows more cases to be handled when and if the need to handle them arises   What could improve this code might be the use of enum class  accepting a function pointer to is word char in maybe word boundary instead of invoking is word char directly  and passing a lambda

User · Answer

Here s my entry   template  lt typename Container  typename InputIter  typename ForwardIter gt  Container split InputIter first  InputIter last        ForwardIter s first  ForwardIter s last        Container output       while  true            auto pos   std  find first of first  last  s first  s last           output emplace back first  pos           if  pos    last                break                     first     pos             return output     template  lt typename Output   std  vector lt std  string gt             typename Input   std  string            typename Delims   std  string gt  Output split const Input amp  input  const Delims amp  delims              using std  cbegin      using std  cend      return split lt Output gt  cbegin input   cend input                            cbegin delims   cend delims       auto vec   split  Mary had a little lamb      The first definition is an STL-style generic function taking two pair of iterators  The second is a convenience function to save you having to do all the begin  s and end  s yourself  You can also specify the output container type as a template parameter if you wanted to use a list  for example   What makes it elegant  IMO  is that unlike most of the other answers  it s not restricted to strings but will work with any STL-compatible container  Without any change to the code above  you can say   using vec of vecs t   std  vector lt std  vector lt int gt  gt    std  vector lt int gt  v 1  2  0  3  4  5  0  7  8  0  9   auto r   split lt vec of vecs t gt  v  std  initializer list lt int gt  0  2      which will split the vector v into separate vectors every time a 0 or a 2 is encountered    There s also the added bonus that with strings  this implementation is faster than both strtok  - and getline  -based versions  at least on my system

User · Answer

My code is    include  lt list gt   include  lt string gt  template lt class StringType   std  string  class ContainerType   std  list lt StringType gt   gt  class DSplitString public ContainerType   public      explicit DSplitString const StringType amp  strString  char cChar  bool bSkipEmptyParts   true                size t iPos   0          size t iPos char   0          while StringType  npos     iPos char   strString find cChar  iPos                          StringType strTemp   strString substr iPos  iPos char - iPos               if  bSkipEmptyParts  amp  amp   strTemp empty         bSkipEmptyParts                   push back strTemp               iPos   iPos char   1                      explicit DSplitString const StringType amp  strString  const StringType amp  strSub  bool bSkipEmptyParts   true                size t iPos   0          size t iPos char   0          while StringType  npos     iPos char   strString find strSub  iPos                          StringType strTemp   strString substr iPos  iPos char - iPos               if  bSkipEmptyParts  amp  amp   strTemp empty         bSkipEmptyParts                   push back strTemp               iPos   iPos char   strSub length                         Example    include  lt iostream gt   include  lt string gt  int  tmain int argc   TCHAR  argv          DSplitString lt  gt  aa  doicanhden1 doicanhden2 doicanhden3              for each  std  string var in aa                std  cout  lt  lt  var  lt  lt  std  endl            std  cin get        return 0

User · Answer

This is my versi  n taken the source of Kev    include  lt string gt   include  lt vector gt  void split vector lt string gt   amp result  string str  char delim       string tmp    string  iterator i    result clear       for i   str begin    i  lt   str end      i        if  const char  i    delim   amp  amp  i    str end            tmp     i        else         result push back tmp         tmp                     After  call the function and do something with it   vector lt string gt  hosts  split hosts   192 168 1 2 192 168 1 3         for  size t i   0  i  lt  hosts size    i       cout  lt  lt    Connecting host      lt  lt  hosts at i   lt  lt         lt  lt  endl

User · Answer

What about this    include  lt string gt   include  lt vector gt   using namespace std   vector lt string gt  split string str  const char delim        vector lt string gt  v      string tmp       for string  const iterator i  i   str begin    i  lt   str end      i            if  i    delim  amp  amp  i    str end                  tmp     i             else               v push back tmp               tmp                                   return v

User · Answer

For what it s worth  here s another way to extract tokens from an input string  relying only on standard library facilities  It s an example of the power and elegance behind the design of the STL    include  lt iostream gt   include  lt string gt   include  lt sstream gt   include  lt algorithm gt   include  lt iterator gt   int main         using namespace std      string sentence    And I feel fine          istringstream iss sentence       copy istream iterator lt string gt  iss            istream iterator lt string gt              ostream iterator lt string gt  cout    n         Instead of copying the extracted tokens to an output stream  one could insert them into a container  using the same generic copy algorithm   vector lt string gt  tokens  copy istream iterator lt string gt  iss        istream iterator lt string gt          back inserter tokens          or create the vector directly   vector lt string gt  tokens istream iterator lt string gt  iss                         istream iterator lt string gt

User · Answer

A possible solution using Boost might be    include  lt boost algorithm string hpp gt  std  vector lt std  string gt  strs  boost  split strs   string to split   boost  is any of   t        This approach might be even faster than the stringstream approach  And since this is a generic template function it can be used to split other types of strings  wchar  etc  or UTF-8  using all kinds of delimiters   See the documentation for details

User · Answer

C  17 version without any memory allocation  except may be for std  function   void iter words const std  string view amp  input  const std  function lt void std  string view  gt  amp  process word         auto itr   input begin         auto consume whitespace     amp               for   itr    input end      itr                if  isspace  itr                   return                        auto consume letters     amp               for   itr    input end      itr                if isspace  itr                   return                        while true            consume whitespace            if itr    input end                return          auto word start   itr - input begin            consume letters            auto word end   itr - input begin            process word input substr word start  word end - word start             int main         iter words  foo bar      std  string view sv            std  cout  lt  lt   Got word     lt  lt   sv  lt  lt    n               return 0

User · Answer

This is my solution to this problem   vector lt string gt  get tokens string str        vector lt string gt  dt      stringstream ss      string tmp       ss  lt  lt  str      for  size t i   ss eof      i            ss  gt  gt  tmp          dt push back tmp             return dt      This function returns a vector of strings

User · Answer

The code below uses strtok   to split a  string into tokens and stores the tokens in a vector    include  lt iostream gt   include  lt algorithm gt   include  lt vector gt   include  lt string gt   using namespace std    char one line string      hello hi how are you nice weather we are having ok then bye   char seps           t n   char  token     int main        vector lt string gt  vec String Lines     token   strtok  one line string  seps        cout  lt  lt   Extracting and storing data in a vector   n n n       while  token    NULL              vec String Lines push back token         token   strtok  NULL  seps              cout  lt  lt   Displaying end result in vector line storage   n n        for   int i   0  i  lt  vec String Lines size      i      cout  lt  lt  vec String Lines i   lt  lt    n       cout  lt  lt    n n n     return 0

User · Answer

The STL does not have such a method available already   However  you can either use C s strtok   function by using the std  string  c str   member  or you can write your own  Here is a code sample I found after a quick Google search   STL string split     void Tokenize const string amp  str                vector lt string gt  amp  tokens                const string amp  delimiters                 Skip delimiters at beginning      string  size type lastPos   str find first not of delimiters  0          Find first  non-delimiter       string  size type pos       str find first of delimiters  lastPos        while  string  npos    pos    string  npos    lastPos                   Found a token  add it to the vector          tokens push back str substr lastPos  pos - lastPos               Skip delimiters   Note the  not of          lastPos   str find first not of delimiters  pos              Find next  non-delimiter          pos   str find first of delimiters  lastPos             Taken from  http   oopweb com CPP Documents CPPHOWTO Volume C  Programming-HOWTO-7 html  If you have questions about the code sample  leave a comment and I will explain   And just because it does not implement a typedef called iterator or overload the  lt  lt  operator does not mean it is bad code  I use C functions quite frequently  For example  printf and scanf both are faster than std  cin and std  cout  significantly   the fopen syntax is a lot more friendly for binary types  and they also tend to produce smaller EXEs   Don t get sold on this  Elegance over performance  deal

User · Answer

Loop on getline with     as the token

User · Answer

Here s my take on this  I had to process the input string word by word  which could have been done by using space to count words but I felt it would be tedious and I should split the words into vectors     include lt iostream gt   include lt vector gt   include lt string gt   include lt stdio h gt  using namespace std  int main         char x     0       string s           vector lt string gt  q      x   getchar        while x      n                 if x                               q push back s               s                   x   getchar                continue                    s   s   x          x   getchar              q push back s       for int i   0  i lt q size    i            cout lt  lt q i  lt  lt          return 0       Doesn t take care of multiple spaces  If the last word is not immediately followed by newline character  it includes the whitespace between the last word s last character and newline character

User · Answer

I use this to split string by a delimiter  The first puts the results in a pre-constructed vector  the second returns a new vector      include  lt string gt   include  lt sstream gt   include  lt vector gt   include  lt iterator gt   template  lt typename Out gt  void split const std  string  amp s  char delim  Out result        std  istringstream iss s       std  string item      while  std  getline iss  item  delim              result     item           std  vector lt std  string gt  split const std  string  amp s  char delim        std  vector lt std  string gt  elems      split s  delim  std  back inserter elems        return elems        Note that this solution does not skip empty tokens  so the following will find 4 items  one of which is empty   std  vector lt std  string gt  x   split  one two  three

User · Answer

if you want split string by some chars you can use   include lt iostream gt   include lt string gt   include lt vector gt   include lt iterator gt   include lt sstream gt   include lt string gt   using namespace std  void replaceOtherChars string  amp input  vector lt char gt   amp dividers        const char divider   dividers at 0       int replaceIndex   0      vector lt char gt   iterator it begin   dividers begin   1          it end  dividers end        for  it begin  it end   it begin                replaceIndex   0          while true                        replaceIndex input find first of  it begin replaceIndex               if replaceIndex  -1                  break              input at replaceIndex  divider                    vector lt string gt  split string str  vector lt char gt  chars  bool missEmptySpace  true         vector lt string gt  result      const char divider   chars at 0       replaceOtherChars str chars       stringstream stream      stream lt  lt str          string temp      while getline stream temp divider                 if missEmptySpace  amp  amp  temp empty                continue          result push back temp             return result    int main         string str   milk  pigs     hot-dogs        vector lt char gt  arr      arr push back       arr push back       arr push back           vector lt string gt  result   split str arr       vector lt string gt   iterator it begin  result begin            it end  result end        for  it begin  it end   it begin                cout lt  lt  it begin lt  lt endl        return 0

User · Answer

No Boost  no string streams  just the standard C library cooperating together with std  string and std  list  C library functions for easy analysis  C   data types for easy memory management   Whitespace is considered to be any combination of newlines  tabs and spaces  The set of whitespace characters is established by the wschars variable    include  lt string gt   include  lt list gt   include  lt iostream gt   include  lt cstring gt   using namespace std   const char  wschars     t n     list lt string gt  split const string  amp str      const char  cstr   str c str      list lt string gt  out     while   cstr                           while remaining string not empty     size t toklen      cstr    strspn cstr  wschars         skip leading whitespace     toklen   strcspn cstr  wschars       figure out token length     if  toklen                           if we have a token  add to list       out push back string cstr  toklen        cstr    toklen                       skip over token           ran out of string  return list    return out     int main int argc  char   argv      list lt string gt  li   split argv 1      for  list lt string gt   iterator i   li begin    i    li end    i        cout  lt  lt       lt  lt   i  lt  lt       lt  lt  endl    return 0      Run       split        split  a   a      split   a    a      split   a b   a   b      split   a b c   a   b   c      split   a b c d     a   b   c   d    Tail-recursive version of split  itself split into two functions   All destructive manipulation of variables is gone  except for the pushing of strings into the list   void split rec const char  cstr  list lt string gt   amp li      if   cstr        const size t leadsp   strspn cstr  wschars       const size t toklen   strcspn cstr   leadsp  wschars        if  toklen        li push back string cstr   leadsp  toklen         split rec cstr   leadsp   toklen  li          list lt string gt  split const string  amp str      list lt string gt  out    split rec str c str    out     return out

User · Answer

Loop on getline with     as the token

User · Answer

Here s my take on this  I had to process the input string word by word  which could have been done by using space to count words but I felt it would be tedious and I should split the words into vectors     include lt iostream gt   include lt vector gt   include lt string gt   include lt stdio h gt  using namespace std  int main         char x     0       string s           vector lt string gt  q      x   getchar        while x      n                 if x                               q push back s               s                   x   getchar                continue                    s   s   x          x   getchar              q push back s       for int i   0  i lt q size    i            cout lt  lt q i  lt  lt          return 0       Doesn t take care of multiple spaces  If the last word is not immediately followed by newline character  it includes the whitespace between the last word s last character and newline character

User · Answer

include  lt iostream gt   include  lt string gt   include  lt sstream gt   include  lt algorithm gt   include  lt iterator gt   include  lt vector gt   int main         using namespace std     int n 8      string sentence    10 20 30 40 5 6 7 8       istringstream iss sentence      vector lt string gt  tokens  copy istream iterator lt string gt  iss        istream iterator lt string gt          back inserter tokens          for int i 0 i lt n i             cout lt  lt tokens at i

User · Answer

For those who need alternative in splitting string with a string delimiter  perhaps you can try my following solution   std  vector lt size t gt  str pos const std  string  amp search  const std  string  amp target        std  vector lt size t gt  founds       if  search empty                  size t start pos   0           while  true                        size t found pos   target find search  start pos                if found pos    std  string  npos                                size t found   found pos                   founds push back found                    start pos    found pos   1                             else                               break                                     return founds     std  string str sub index size t begin index  size t end index  const std  string  amp target        std  string sub       size t size   target length         const char  copy   target c str         for size t i   begin index  i  lt   end index  i                  if i  gt   size                        break                    else                       char c   copy i                sub    c                       return sub     std  vector lt std  string gt  str split const std  string  amp delimiter  const std  string  amp target        std  vector lt std  string gt  splits       if  delimiter empty                  std  vector lt size t gt  founds   str pos delimiter  target            size t founds size   founds size             if founds size  gt  0                        size t search len   delimiter length                 size t begin index   0               for int i   0  i  lt   founds size  i                                  std  string sub                   if i    founds size                                        size t pos    founds at i                        sub   str sub index begin index  pos - 1  target                        begin index    pos   search len                                     else                                       sub   str sub index begin index   target length   - 1   target                                      splits push back sub                                      return splits      Those snippets consist of 3 function  The bad news is to use the str split function you will need the other two functions  Yes it is a huge chunk of code  But the good news is that those additional two functions are able to work independently and sometimes can be useful too       Tested the function in main   block like this   int main         std  string s    Hello  world  We need to make the world a better place  Because your world is also my world  and our children s world         std  vector lt std  string gt  split   str split  world   s        for int i   0  i  lt  split size    i                  std  cout  lt  lt  split i   lt  lt  std  endl            And it would produce   Hello     We need to make the   a better place  Because your   is also my    and our children s      I believe that s not the most efficient code  but at least it works  Hope it helps

User · Answer

void splitString string str  char delim  string array    const int arraySize        int delimPosition  subStrSize  subStrStart   0       for  int index   0  delimPosition    -1  index                  delimPosition   str find delim  subStrStart           subStrSize   delimPosition - subStrStart          array index    str substr subStrStart  subStrSize           subStrStart     delimPosition   1

User · Answer

Everyone answered for predefined string input  I think this answer will help someone for scanned input   I used tokens vector for holding string tokens  It s optional    include  lt bits stdc   h gt   using namespace std   int main         string str  token       getline cin  str       get the string as input     istringstream ss str      insert the string into tokenizer      vector lt string gt  tokens     vector tokens holds the tokens      while  ss  gt  gt  token  tokens push back token      splits the tokens     for auto x   tokens  cout  lt  lt  x  lt  lt  endl      prints the tokens      return 0        sample input   port city international university   sample output   port city international university   Note that by default this will work for only space as the delimiter   you can use custom delimiter  For that  you have customized the code  let the delimiter be      so use   char delimiter         while getline ss  token  delimiter   tokens push back token      instead of   while  ss  gt  gt  token  tokens push back token

User · Answer

include  lt vector gt   include  lt string gt   include  lt sstream gt   int main         std  string str  Split me by whitespaces        std  string buf                     Have a buffer string     std  stringstream ss str            Insert the string into a stream      std  vector lt std  string gt  tokens     Create vector to hold our words      while  ss  gt  gt  buf          tokens push back buf        return 0

User · Answer

I ve been searching for a way to split a string by a separator of any length  so I started writing it from scratch  as existing solutions didn t suit me   Here is my little algorithm  using only STL     use like this   std  vector lt std  wstring gt  vec   Split lt std  wstring gt   L Hello  world      L        template  lt typename valueType gt  static std  vector  lt valueType gt  Split  valueType text  const valueType amp  delimiter        std  vector  lt valueType gt  tokens      size t pos   0      valueType token       while   pos   text find delimiter      valueType  npos                 token   text substr 0  pos           tokens push back  token           text erase 0  pos   delimiter length               tokens push back  text        return tokens      It can be used with separator of any length and form  as far as I ve tested  Instantiate with either string or wstring type   All the algorithm does is it searches for the delimiter  gets the part of the string that is up to the delimiter  deletes the delimiter and searches again until it finds it no more   Of course  you can use any number of whitespaces for the delimiter   I hope it helps

User · Answer

If you like to use boost  but want to use a whole string as delimiter  instead of single characters as in most of the previously proposed solutions   you can use the boost split iterator   Example code including convenient template    include  lt iostream gt   include  lt vector gt   include  lt boost algorithm string hpp gt   template lt typename  OutputIterator gt  inline void split      const std  string amp  str       const std  string amp  delim        OutputIterator result        using namespace boost  algorithm      typedef split iterator lt std  string  const iterator gt  It       for It iter make split iterator str  first finder delim  is equal                  iter  It                  iter                  result      boost  copy range lt std  string gt   iter            int main int argc  char  argv          using namespace std       vector lt string gt  splitted      split  HelloFOOworldFOO     FOO   back inserter splitted            or directly to console  for example     split  HelloFOOworldFOO     FOO   ostream iterator lt string gt  cout    n         return 0

User · Answer

Get Boost     -    include  lt boost algorithm string split hpp gt   include  lt boost algorithm string hpp gt   include  lt iostream gt   include  lt vector gt   using namespace std  using namespace boost   int main int argc  char  argv        typedef vector  lt  string  gt  list type       list type list      string line       line    Somewhere down the road       split list  line  is any of             for int i   0  i  lt  list size    i                  cout  lt  lt  list i   lt  lt  endl             return 0      This example gives the output -   Somewhere down the road

User · Answer

This is my favorite way to iterate through a string  You can do whatever you want per word   string line    a line of text to iterate through   string word   istringstream iss line  istringstream  in    while  iss  gt  gt  word                 Do something on  word  here

User · Answer

C  20 finally blesses us with a split function  Or rather  a range adapter  Godbolt link    include  lt iostream gt   include  lt ranges gt   include  lt string view gt   namespace ranges   std  ranges  namespace views   std  views   using str   std  string view   constexpr auto view        Multiple words        views  split            views  transform    auto  amp  amp r  - gt  str           return                amp  r begin                static cast lt str  size type gt  ranges  distance r                       auto main   - gt  int       for  str  amp  amp sv   view            std  cout  lt  lt  sv  lt  lt    n

User · Answer

Not that we need more answers  but this is what I came up with after being inspired by Evan Teran    std  vector  lt std  string gt  split const string  amp input  auto delimiter  bool skipEmpty true           Splits a string at each delimiter and returns these strings as a string vector    If the delimiter is not found then nothing is returned    If skipEmpty is true then strings between delimiters that are 0 in length will be skipped         bool delimiterFound   false    int pos 0  pPos 0    std  vector  lt std  string gt  result    while  true        pos   input find delimiter pPos       if  pos    std  string  npos          if  skipEmpty  false or pos-pPos  gt  0     if empty values are to be kept or not         result push back input substr pPos pos-pPos          delimiterFound   true        else         if  pPos  lt  input length   and delimiterFound            if  skipEmpty  false or input length  -pPos  gt  0     if empty values are to be kept or not           result push back input substr pPos input length  -pPos                  break            pPos   pos 1        return result

User · Answer

My code is    include  lt list gt   include  lt string gt  template lt class StringType   std  string  class ContainerType   std  list lt StringType gt   gt  class DSplitString public ContainerType   public      explicit DSplitString const StringType amp  strString  char cChar  bool bSkipEmptyParts   true                size t iPos   0          size t iPos char   0          while StringType  npos     iPos char   strString find cChar  iPos                          StringType strTemp   strString substr iPos  iPos char - iPos               if  bSkipEmptyParts  amp  amp   strTemp empty         bSkipEmptyParts                   push back strTemp               iPos   iPos char   1                      explicit DSplitString const StringType amp  strString  const StringType amp  strSub  bool bSkipEmptyParts   true                size t iPos   0          size t iPos char   0          while StringType  npos     iPos char   strString find strSub  iPos                          StringType strTemp   strString substr iPos  iPos char - iPos               if  bSkipEmptyParts  amp  amp   strTemp empty         bSkipEmptyParts                   push back strTemp               iPos   iPos char   strSub length                         Example    include  lt iostream gt   include  lt string gt  int  tmain int argc   TCHAR  argv          DSplitString lt  gt  aa  doicanhden1 doicanhden2 doicanhden3              for each  std  string var in aa                std  cout  lt  lt  var  lt  lt  std  endl            std  cin get        return 0

User · Answer

adapted from a  regular  csv parse std  string stringIn    my csv  is 10233478 NOTseparated by commas   std  vector lt std  string gt  commaSeparated 1   int commaCounter   0  for  int i 0  i lt stringIn size    i          if  stringIn i                    commaSeparated push back              commaCounter          else           commaSeparated at commaCounter     stringIn i             in the end you will have a vector of strings with every element in the sentence separated by spaces   only non-standard resource is std  vector  but since an std  string is involved  i figured it would be acceptable    empty strings are saved as a separate items

User · Answer

I use the following  void split string in  vector lt string gt  amp  parts  char separator        string  iterator  ts  curr      ts   curr   in begin        for   curr  lt   in end    curr               if   curr    in end       curr    separator   amp  amp  curr  gt  ts                  parts push back  string  ts  curr             if  curr    in end                    break          if   curr    separator   ts   curr   1             PlasmaHH  I forgot to include the extra check  curr   ts  for removing tokens with whitespace

User · Answer

very late to the party here I know but I was thinking about the most elegant way of doing this if you were given a range of delimiters rather than whitespace  and using nothing more than the standard library   Here are my thoughts   To split words into a string vector by a sequence of delimiters   template lt class Container gt  std  vector lt std  string gt  split by delimiters const std  string amp  input  const Container amp  delimiters        std  vector lt std  string gt  result       for  auto current   begin input    current    end input                    auto first   find if current  end input   not in delimiters            if  first    end input   break          auto last   find if first  end input   is in delimiters            result emplace back first  last           current   last            return result      to split the other way  by providing a sequence of valid characters   template lt class Container gt  std  vector lt std  string gt  split by valid chars const std  string amp  input  const Container amp  valid chars        std  vector lt std  string gt  result       for  auto current   begin input    current    end input                    auto first   find if current  end input   is in valid chars            if  first    end input   break          auto last   find if first  end input   not in valid chars            result emplace back first  last           current   last            return result      is in and not in are defined thus   namespace detail       template lt class Container gt      struct is in           is in const Container amp  charset             charset charset                      bool operator   char c  const                       return find begin  charset   end  charset   c     end  charset                      const Container amp   charset              template lt class Container gt      struct not in           not in const Container amp  charset             charset charset                      bool operator   char c  const                       return find begin  charset   end  charset   c     end  charset                      const Container amp   charset             template lt class Container gt  detail  not in lt Container gt  not in const Container amp  c        return detail  not in lt Container gt  c      template lt class Container gt  detail  is in lt Container gt  is in const Container amp  c        return detail  is in lt Container gt  c

User · Answer

As a hobbyist  this is the first solution that came to my mind  I m kind of curious why I haven t seen a similar solution here yet  is there something fundamentally wrong with how I did it    include  lt iostream gt   include  lt string gt   include  lt vector gt   std  vector lt std  string gt  split const std  string  amp s  const std  string  amp delims        std  vector lt std  string gt  result      std  string  size type pos   0      while  std  string  npos     pos   s find first not of delims  pos              auto pos2   s find first of delims  pos           result emplace back s substr pos  std  string  npos    pos2   pos2   pos2 - pos            pos   pos2            return result     int main         std  string text  And then I said    I don t get it  why would you even do that            std  string delims                   auto words   split text  delims       std  cout  lt  lt    nSentence  n     lt  lt  text  lt  lt    n nWords        for  const auto  amp w   words            std  cout  lt  lt    n     lt  lt  w            return 0      http   cpp sh 7wmzy

User · Answer

Thank you  Jairo Abdiel Toribio Cisneros  It works for me but your function return some empty element  So for return without empty I have edited with the following   std  vector lt std  string gt  split std  string str  const char  delim        std  vector lt std  string gt  v      std  string tmp       for std  string  const iterator i   str begin    i  lt   str end      i            if  i     delim  amp  amp  i    str end                  tmp     i            else               if  tmp length    gt  0                    v push back tmp                             tmp                            return v      Using   std  string s    one two  three   std  string delim        std  vector lt std  string gt  vv   split s  delim c str

User · Answer

My implementation can be an alternative solution   std  vector lt std  wstring gt  SplitString const std  wstring  amp  String  const std  wstring  amp  Seperator        std  vector lt std  wstring gt  Lines      size t stSearchPos   0      size t stFoundPos      while  stSearchPos  lt  String size   - 1                stFoundPos   String find Seperator  stSearchPos           stFoundPos    stFoundPos    std  string  npos    String size     stFoundPos          Lines push back String substr stSearchPos  stFoundPos - stSearchPos            stSearchPos   stFoundPos   Seperator size              return Lines      Test code   std  wstring MyString L Part 1SEPsecond partSEPlast partSEPend    std  vector lt std  wstring gt  Parts   IniFile  SplitString MyString  L SEP    std  wcout  lt  lt  L The string     lt  lt  MyString  lt  lt  std  endl  for  std  vector lt std  wstring gt   const iterator it Parts begin    it lt Parts end      it        std  wcout  lt  lt   it  lt  lt  L  lt ---   lt  lt  std  endl    std  wcout  lt  lt  std  endl  MyString   L this time a comma separated string   std  wcout  lt  lt  L The string     lt  lt  MyString  lt  lt  std  endl  Parts   IniFile  SplitString MyString  L      for  std  vector lt std  wstring gt   const iterator it Parts begin    it lt Parts end      it        std  wcout  lt  lt   it  lt  lt  L  lt ---   lt  lt  std  endl      Output of the test code   The string  Part 1SEPsecond partSEPlast partSEPend Part 1 lt --- second part lt --- last part lt --- end lt ---  The string  this time a comma separated string this lt --- time lt --- a lt --- comma separated lt --- string lt ---

User · Answer

When dealing with whitespace as separator  the obvious answer of using std  istream iterator lt T gt  is already given and voted up a lot  Of course  elements may not be separated by whitespace but by some separator instead  I didn t spot any answer which just redefines the meaning of whitespace to be said separator and then uses the conventional approach   The way to change what streams consider whitespace  you d simply change the stream s std  locale using  std  istream  imbue    with a std  ctype lt char gt  facet with its own definition of what whitespace means  it can be done for std  ctype lt wchar t gt   too  but its is actually slightly different because std  ctype lt char gt  is table-driven while std  ctype lt wchar t gt  is driven by virtual functions     include  lt iostream gt   include  lt algorithm gt   include  lt iterator gt   include  lt sstream gt   include  lt locale gt   struct whitespace mask       std  ctype base  mask mask table std  ctype lt char gt   table size       whitespace mask std  string const amp  spaces            std  ctype base  mask  table   this- gt mask table          std  ctype base  mask const  tab               std  use facet lt std  ctype lt char gt  gt  std  locale    table            for  std  size t i 0   i    std  ctype lt char gt   table size    i                table i    tab i   amp   std  ctype base  space                    std  for each spaces begin    spaces end        unsigned char c                table c     std  ctype base  space                       class whitespace facet       private whitespace mask       public std  ctype lt char gt    public      whitespace facet std  string const amp  spaces            whitespace mask spaces            std  ctype lt char gt  this- gt mask table              struct whitespace       std  string spaces      whitespace std  string const amp  spaces   spaces spaces        std  istream amp  operator gt  gt  std  istream amp  in  whitespace const amp  ws        std  locale loc in getloc    new whitespace facet ws spaces        in imbue loc       return in       everything above would probably go into a utility library     int main         std  istringstream in  a  b  c  d  e        std  copy std  istream iterator lt std  string gt  in  gt  gt  whitespace                       std  istream iterator lt std  string gt                   std  ostream iterator lt std  string gt  std  cout    n          std  istringstream pipes  a b c   d  e     e        std  copy std  istream iterator lt std  string gt  pipes  gt  gt  whitespace                      std  istream iterator lt std  string gt                   std  ostream iterator lt std  string gt  std  cout    n            Most of the code is for packaging up a general purpose tool providing soft delimiters   multiple delimiters in a row are merged  There is no way to produce an empty sequence  When different delimiters are needed within a stream  you d probably use differently set up streams using a shared stream buffer   void f std  istream amp  in        std  istream pipes in rdbuf         pipes  gt  gt  whitespace           std  istream comma in rdbuf         comma  gt  gt  whitespace            std  string s0  s1      if  pipes  gt  gt  s0  gt  gt  std  ws      read up to first pipe and ignore sequence of pipes          amp  amp  comma  gt  gt  s1  gt  gt  std  ws       read up to first comma and ignore commas

User · Answer

For what it s worth  here s another way to extract tokens from an input string  relying only on standard library facilities  It s an example of the power and elegance behind the design of the STL    include  lt iostream gt   include  lt string gt   include  lt sstream gt   include  lt algorithm gt   include  lt iterator gt   int main         using namespace std      string sentence    And I feel fine          istringstream iss sentence       copy istream iterator lt string gt  iss            istream iterator lt string gt              ostream iterator lt string gt  cout    n         Instead of copying the extracted tokens to an output stream  one could insert them into a container  using the same generic copy algorithm   vector lt string gt  tokens  copy istream iterator lt string gt  iss        istream iterator lt string gt          back inserter tokens          or create the vector directly   vector lt string gt  tokens istream iterator lt string gt  iss                         istream iterator lt string gt

User · Answer

The following is a much better way to do this  It can take any character  and doesn t split lines unless you want  No special libraries needed  well  besides std  but who really considers that an extra library   no pointers  no references  and it s static  Just simple plain C      pragma once  include  lt vector gt   include  lt sstream gt  using namespace std  class Helpers       public          static vector lt string gt  split string s  char delim                        stringstream temp  stringstream  in   stringstream  out               vector lt string gt  elems 0               if  s size      0    delim    0                  return elems              for char c   s                                if c    delim                                        elems push back temp str                         temp   stringstream stringstream  in   stringstream  out                                     else                     temp  lt  lt  c                            if  temp str   size    gt  0                  elems push back temp str                     return elems                           Splits string s with a list of delimiters in delims  it s just a list  like if we wanted to           split at the following letters  a  b  c we would make delims  abc           static vector lt string gt  split string s  string delims                        stringstream temp  stringstream  in   stringstream  out               vector lt string gt  elems 0               bool found              if s size      0    delims size      0                  return elems              for char c   s                                found   false                  for char d   delims                                        if  c    d                                                elems push back temp str                             temp   stringstream stringstream  in   stringstream  out                           found   true                          break                                                          if  found                      temp  lt  lt  c                            if temp str   size    gt  0                  elems push back temp str                 return elems

User · Answer

include  lt iostream gt   include  lt regex gt   using namespace std   int main        string s    foo bar  baz      regex e    s        regex token iterator lt string  iterator gt  i s begin    s end    e  -1      regex token iterator lt string  iterator gt  end     while  i    end        cout  lt  lt        lt  lt   i    lt  lt           IMO  this is the closest thing to python s re split    See cplusplus com for more information about regex token iterator  The -1  4th argument in regex token iterator ctor  is the section of the sequence that is not matched  using the match as separator

User · Answer

A possible solution using Boost might be    include  lt boost algorithm string hpp gt  std  vector lt std  string gt  strs  boost  split strs   string to split   boost  is any of   t        This approach might be even faster than the stringstream approach  And since this is a generic template function it can be used to split other types of strings  wchar  etc  or UTF-8  using all kinds of delimiters   See the documentation for details

User · Answer

I like to use the boost regex methods for this task since they provide maximum flexibility for specifying the splitting criteria    include  lt iostream gt   include  lt string gt   include  lt boost regex hpp gt   int main         std  string line  A   line  to split        const boost  regex re           one or more colons         -1 means find inverse matches aka split     boost  sregex token iterator tokens line begin   line end   re -1       boost  sregex token iterator end       for    tokens    end    tokens          std  cout  lt  lt   tokens  lt  lt  std  endl

User · Answer

Here s another way of doing it    void split string string text vector lt string gt  amp  words      int i 0    char ch    string word     while ch text i             if  isspace ch               if   word empty                    words push back word                 word                 else             word    ch              if   word empty            words push back word

User · Answer

Here is my solution using C  11 and the STL  It should be reasonably efficient    include  lt vector gt   include  lt string gt   include  lt cstring gt   include  lt iostream gt   include  lt algorithm gt   include  lt functional gt   std  vector lt std  string gt  split const std  string amp  s        std  vector lt std  string gt  v       const auto end   s end        auto to   s begin        decltype to  from       while  from   std  find if to  end             char c   return  std  isspace c          end                to   std  find if from  end     char c   return std  isspace c               v emplace back from  to              return v     int main         std  string s    this is the string  to  split        auto v   split s        for auto amp  amp  s  v          std  cout  lt  lt  s  lt  lt    n       Output   this is the string to split

User · Answer

There is a function named strtok    include lt string gt  using namespace std   vector lt string gt  split char  str const char  delim        char  saveptr      char  token   strtok r str delim  amp saveptr        vector lt string gt  result       while token    NULL                result push back token           token   strtok r NULL delim  amp saveptr             return result

User · Answer

This is my favorite way to iterate through a string  You can do whatever you want per word   string line    a line of text to iterate through   string word   istringstream iss line  istringstream  in    while  iss  gt  gt  word                 Do something on  word  here

User · Answer

Recently I had to split a camel-cased word into subwords   There are no delimiters  just upper characters     include  lt string gt   include  lt list gt   include  lt locale gt     std  isupper  template lt class String gt  const std  list lt String gt  split camel case string const String  amp s        std  list lt String gt  R      String w       for  String  const iterator i   s begin    i  lt  s end      i               if  std  isupper  i                 if  w length                      R push back w                   w clear                                    w     i             if  w length            R push back w       return R      For example  this splits  AQueryTrades  into  A    Query  and  Trades    The function works with narrow and wide strings  Because it respects the current locale it splits  Raumfahrt  berwachungsVerordnung  into  Raumfahrt      berwachungs  and  Verordnung    Note std  upper should be really passed as function template argument  Then the more generalized from of this function can split at delimiters like          or     too

User · Answer

I ve rolled my own using strtok and used boost to split a string   The best method I have found is the C   String Toolkit Library   It is incredibly flexible and fast    include  lt iostream gt   include  lt vector gt   include  lt string gt   include  lt strtk hpp gt   const char  whitespace       t r n f   const char  whitespace and punctuation       t r n f       int main                normal parsing of a string into a vector of strings         std  string s  Somewhere down the road            std  vector lt std  string gt  result          if  strtk  parse  s  whitespace  result                           for size t i   0  i  lt  result size      i                   std  cout  lt  lt  result i   lt  lt  std  endl                             parsing a string into a vector of floats with other separators            besides spaces          std  string s  3 0  3 14  4 0            std  vector lt float gt  values          if  strtk  parse  s  whitespace and punctuation  values                           for size t i   0  i  lt  values size      i                   std  cout  lt  lt  values i   lt  lt  std  endl                             parsing a string into specific variables          std  string s  angle   45  radius   9 9            std  string w1  w2          float v1  v2          if  strtk  parse  s  whitespace and punctuation  w1  v1  w2  v2                          std  cout  lt  lt   word    lt  lt  w1  lt  lt     value    lt  lt  v1  lt  lt  std  endl              std  cout  lt  lt   word    lt  lt  w2  lt  lt     value    lt  lt  v2  lt  lt  std  endl                       return 0      The toolkit has much more flexibility than this simple example shows but its utility in parsing a string into useful elements is incredible

[c++] How do I iterate over the words of a string?

Examples related to c++

Examples related to string

Examples related to split