iss               121 data/sphere/level_set_test.cpp   std::istringstream iss {str_vertex};
iss               123 data/sphere/level_set_test.cpp   if(!(iss >> d1 >> d2 >> d3) || !(iss >> std::ws).eof() )
iss               130 include/io_dgf.h 	std::istringstream iss {s};
iss               132 include/io_dgf.h 	for(Number n {0}; iss >> n; ) rv.push_back(n);
iss                74 old_code/2015linfty/dune_bdf.hpp 				std::istringstream iss {line};
iss                75 old_code/2015linfty/dune_bdf.hpp 				for(std::string s; iss >> s; )
iss                80 old_code/tumor_growth/tumor_bdf.h 	std::istringstream iss {line};
iss                81 old_code/tumor_growth/tumor_bdf.h 	for(std::string s; iss >> s; )
iss               211 src/grid_GridAndTime_impl.cpp   std::istringstream iss {line};
iss               212 src/grid_GridAndTime_impl.cpp   for(std::string s; iss >> s; )
iss               245 src/grid_GridAndTime_impl.cpp   istringstream iss;
iss               246 src/grid_GridAndTime_impl.cpp   iss.exceptions(ios_base::badbit);
iss               251 src/grid_GridAndTime_impl.cpp       iss.str(line);
iss               252 src/grid_GridAndTime_impl.cpp       for(int i = 0; i < dim; ++i) if(!(iss >> k[i])) throw bad {"Non-number"}; 
iss               253 src/grid_GridAndTime_impl.cpp       if(!(iss >> ws).eof()) throw bad {"Too many entries."};
iss               257 src/grid_GridAndTime_impl.cpp       iss.clear();
iss                57 src/maxH_main.cpp     istringstream iss;
iss                58 src/maxH_main.cpp     iss.exceptions(ios_base::badbit | ios_base::failbit);
iss                62 src/maxH_main.cpp 	iss.str(line);
iss                64 src/maxH_main.cpp 	iss >> d1 >> d2 >> d3;
iss                67 src/maxH_main.cpp 	iss.clear();