it                 42 data/sphere/level_set_test.cpp   for(size_t it = 0; it < v_list.size(); ++it)
it                 43 data/sphere/level_set_test.cpp     lsf_values[it] = level_set_function(v_list[it]);
it                139 include/io_dgf.h 	for(const auto it : container)
it                140 include/io_dgf.h 	  if( !(oss << std::setprecision(precision) << it << ' ') )
it                161 include/io_dgf.h 	  for(auto& it : v){
it                162 include/io_dgf.h 	    it = *first;
it                141 old_code/2015linfty/dune_bdf.hpp 		for(auto& it : return_array)
it                142 old_code/2015linfty/dune_bdf.hpp 			if(!(interpreter >> it)) error("operator>>() failed!");
it                171 old_code/2015linfty/dune_bdf.hpp 		for(auto& it : evoMap){
it                172 old_code/2015linfty/dune_bdf.hpp 			Eigen::Map<Eigen::Vector3d> x_0 {it.second.data()};	// get vector
it                176 old_code/2015linfty/dune_bdf.hpp 			it.second = it_new;
it                 74 old_code/2015linfty/iodof.h     for(auto it = fe.dbegin(); it != fe.dend(); ++it)
it                 75 old_code/2015linfty/iodof.h       ofs << *it << std::endl;
it                 80 old_code/2015linfty/iodof.h     for(auto it = fe.dbegein(); it != fe.dend(); ++it)
it                 81 old_code/2015linfty/iodof.h       ifs >> *it;
it                162 old_code/tumor_growth/tumor_bdf.h     for(auto& it : return_array)
it                163 old_code/tumor_growth/tumor_bdf.h       if(!(interpreter >> it)) error("operator>>() failed!");
it                195 old_code/tumor_growth/tumor_bdf.h       for(const auto& it : evoMap)
it                196 old_code/tumor_growth/tumor_bdf.h 	std::cout << it.first << std::endl;
it                207 old_code/tumor_growth/tumor_bdf.h     for(auto& it : evoMap){
it                208 old_code/tumor_growth/tumor_bdf.h       Eigen::Map<Eigen::Vector3d> x_0 {it.second.data()};	// get vector
it                212 old_code/tumor_growth/tumor_bdf.h       it.second = it_new;
it                 92 src/brusselator_algo.cpp   for(long it = 0; it < time_steps(); ++it){
it                119 src/brusselator_algo.cpp   for(long it = 0; it < pattern_timeSteps(); ++it){
it                175 src/brusselator_algo.cpp   for(long it = 0; it < pattern_timeSteps(); ++it){
it                201 src/brusselator_algo.cpp   for(long it = 0; it < pattern_timeSteps(); ++it){
it                227 src/brusselator_algo.cpp   for(long it = 0; it < pattern_timeSteps(); ++it){
it                257 src/brusselator_algo.cpp   for(long it = 0; it < end_steps; ++it){
it                295 src/brusselator_algo.cpp   for(long it = 0; it < prePattern_timeSteps(); ++it, next_timeStep()){
it                319 src/brusselator_algo.cpp   for(long it = 0; it < pattern_timeSteps(); ++it){
it                421 src/brusselator_algo.cpp   for(long it = 0; it < it_end; ++it){
it                422 src/brusselator_algo.cpp     if(it < it_end-2){
it                188 src/grid_GridAndTime_impl.cpp   for(std::size_t it = 0; it < Node::dimension; ++it){
it                189 src/grid_GridAndTime_impl.cpp     if(interpreter >> value) rv[it] = value;
it                277 src/grid_GridAndTime_impl.cpp   for(auto it = init_keys.begin(); it != init_keys.end(); ++it){
it                279 src/grid_GridAndTime_impl.cpp     for(int i = 0; i < dim; ++i, ++it) k[i] = *it;
it                 36 src/grid_fef.cpp   for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it += d;
it                 40 src/grid_fef.cpp   for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it *= d;
it                 68 src/grid_fef.cpp   for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it += d;
it                 72 src/grid_fef.cpp   for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it *= d;
it                 81 src/io_l2h1Calculator.cpp   for(int it = 0; it < d; ++it){
it                 96 src/io_l2h1Calculator.cpp     for(size_t it = 0; it < no_nodes; ++it, vfef_ptr += d, ++fef_ptr)
it                116 src/io_l2h1Calculator.cpp   for(size_t it = 0; it < d_ptr->vec_fefun1.size(); ++it){
it                118 src/io_l2h1Calculator.cpp       l2.distance(d_ptr->vec_fefun1[it], d_ptr->vec_fefun2[it]);
it                138 src/io_l2h1Calculator.cpp   for(size_t it = 0; it < d_ptr->vec_fefun1.size(); ++it){
it                140 src/io_l2h1Calculator.cpp       h1.distance(d_ptr->vec_fefun1[it], d_ptr->vec_fefun2[it]);
it                 71 src/io_parameter_impl.cpp   for(std::size_t it = 0; it < vd.size() - 1; ++it)
it                 72 src/io_parameter_impl.cpp     oss << vd[it] << ", ";
it                 68 src/linHeat_algo.h   for(long it =0; it < data.max_timeSteps(); ++it){