Hi, You might be able to do it using the string_algo find_iterator. #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; ... typedef find_iterator<string::iterator> string_find_iterator; string_find_iterator It=make_find_iterator(str1, token_finder(is_space())); for(int i=0; i<maxi; i++) for(int j=0; j<maxj; j++) { if(It!=string_find_iterator()) { v[i][j]=*It; } else { break; } } Regards, Pavol On Fri, Dec 23, 2005 at 07:30:48PM +0200, Alex Vinokur wrote:
Can the boost Tokenizer package split a string into into a series of serieses of tokens (a vector of vectors of tokens)?
==================== For instance, string s = "ab cd \nxy z\n123";
vector<vector<string> > v;
Output should be as follows: v[0][0] = "ab"; v[0][1] = "cd";
v[1][0] = "xy"; v[1][1] = "z";
v[2][0] = "123"; ====================
http://boost.org/libs/tokenizer/introduc.htm doesn't contain such a sample.
Alex Vinokur email: alex DOT vinokur AT gmail DOT com http://mathforum.org/library/view/10978.html http://sourceforge.net/users/alexvn
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users