size 41 data/sphere/level_set_test.cpp std::valarray<double> lsf_values (v_list.size()); size 42 data/sphere/level_set_test.cpp for(size_t it = 0; it < v_list.size(); ++it) size 50 data/sphere/level_set_test.cpp std::cout << "Mean value: " << lsf_values.sum() / v_list.size() << std::endl; size 54 data/sphere/level_set_test.cpp if(v_list.size() % 2) size 55 data/sphere/level_set_test.cpp std::cout << lsf_values[ v_list.size()/2 ]; size 57 data/sphere/level_set_test.cpp std::cout << (lsf_values[ v_list.size()/2 - 1 ] + lsf_values[ v_list.size()/2])/2; size 150 include/grid.h auto size() const { return fun.size(); } size 178 include/grid.h auto size() const { return fun.size(); } size 101 include/io_dgf.h to_vertices(It first, It last, const int dim, const std::size_t size); size 148 include/io_dgf.h const auto size = container.size(); size 149 include/io_dgf.h if(size % dim) throw std::logic_error size 151 include/io_dgf.h return to_vertices(begin(container), end(container), dim, size); size 155 include/io_dgf.h const int dim, const std::size_t size) try{ size 158 include/io_dgf.h rv.reserve(size); size 468 old_code/2015linfty/backup_dune_heat_algo.hpp (i < prev_steps_vec.size()) && (iter < itno); size 517 old_code/2015linfty/backup_dune_heat_algo.hpp for(size_t i=0; i < prev_steps_vec.size(); ++i){ size 530 old_code/2015linfty/backup_dune_heat_algo.hpp for(size_t i=0; i < prev_steps_vec.size() - 1; ++i) size 590 old_code/2015linfty/backup_dune_heat_algo.hpp for(size_t i=0; i < prev_steps_vec.size(); ++i){ size 106 old_code/2015linfty/dune_bdf.hpp if(vertex_list.size() == 0) return 0; size 112 old_code/2015linfty/dune_bdf.hpp precision_vec.push_back(s.size()); size 128 old_code/2015linfty/dune_bdf.hpp for(std::size_t s = 0; s < ad.size() -1 ; ++s) size 175 old_code/2015linfty/dune_bdf.hpp std::copy(x_0.data(), x_0.data() + x_0.size(), it_new.begin()); size 121 old_code/2015linfty/dune_heat_algorithm.hpp if(prev_steps_U_nmk.size() != prev_steps_M_U_nmk.size()) size 187 old_code/2015linfty/dune_heat_algorithm.hpp time_step_no < std::min(prev_steps_U_nmk.size(), size_t(time_step_no_max)); size 230 old_code/2015linfty/dune_heat_algorithm.hpp for(size_t i=0; i < prev_steps_U_nmk.size(); ++i){ size 251 old_code/2015linfty/dune_heat_algorithm.hpp for(size_t i=0; i < prev_steps_U_nmk.size() - 1; ++i){ size 121 old_code/tumor_growth/tumor_bdf.h if(vertex_list.size() == 0) return 0; size 149 old_code/tumor_growth/tumor_bdf.h for(std::size_t s = 0; s < ad.size() -1 ; ++s) size 211 old_code/tumor_growth/tumor_bdf.h std::copy(x_0.data(), x_0.data() + x_0.size(), it_new.begin()); size 240 old_code/tumor_growth/tumor_bdf.h const auto no_vertices = original_vertices.size(); size 241 old_code/tumor_growth/tumor_bdf.h const auto dof_times_dim = new_vertices.size(); size 120 old_code/tumor_growth/tumor_code.h if(prev_steps_U_nmk.size() != prev_steps_M_U_nmk.size()) size 186 old_code/tumor_growth/tumor_code.h time_step_no < std::min(prev_steps_U_nmk.size(), size_t(time_step_no_max)); size 229 old_code/tumor_growth/tumor_code.h for(size_t i=0; i < prev_steps_U_nmk.size(); ++i){ size 250 old_code/tumor_growth/tumor_code.h for(size_t i=0; i < prev_steps_U_nmk.size() - 1; ++i){ size 47 old_code/tumor_growth/tumor_deformation.h for(std::size_t s = 0; s < range_node.size(); ++s) size 68 src/grid_GridAndTime_impl.cpp const auto no_vertices = original_vertices.size(); size 69 src/grid_GridAndTime_impl.cpp const auto dof_times_dim = new_nodes.size(); size 120 src/grid_GridAndTime_impl.cpp rv.reserve(nodes_lines.size()); size 144 src/grid_GridAndTime_impl.cpp rv.reserve(vertex_list.size() * world_dim); size 243 src/grid_GridAndTime_impl.cpp m.reserve(str_keys.size()); size 244 src/grid_GridAndTime_impl.cpp ol.reserve(str_keys.size()); size 269 src/grid_GridAndTime_impl.cpp const auto size = init_keys.size()/dim; size 272 src/grid_GridAndTime_impl.cpp (size * dim == init_keys.size(), size 275 src/grid_GridAndTime_impl.cpp m.reserve(size); size 276 src/grid_GridAndTime_impl.cpp ol.reserve(size); size 288 src/grid_GridAndTime_impl.cpp (dim * m.size() == value_list.size(), size 91 src/io_dgf.cpp if(fef.size() != no_of_nodes()) throw logic_error size 114 src/io_dgf.cpp if(vfef.size() != d_ptr -> vec_dim_dof) throw logic_error size 140 src/io_dgf.cpp const auto dim_of_vertices = vertices.size() * vertices.front().size(); size 141 src/io_dgf.cpp const auto dim_of_fef = vfef.size(); size 160 src/io_dgf.cpp const auto dim_of_vertices = vertices.size() * vertices.front().size(); size 161 src/io_dgf.cpp const auto dim_of_fef = fef.size(); size 190 src/io_dgf.cpp rv.reserve(simplices_list.size()); size 222 src/io_dgf.cpp rv.reserve(vertices_list.size()); size 89 src/io_l2h1Calculator.cpp size_t no_nodes = v.size() / d; // assuming the post condition size 90 src/io_l2h1Calculator.cpp Assert::dynamic(v.size() == no_nodes * d, size 116 src/io_l2h1Calculator.cpp for(size_t it = 0; it < d_ptr->vec_fefun1.size(); ++it){ size 138 src/io_l2h1Calculator.cpp for(size_t it = 0; it < d_ptr->vec_fefun1.size(); ++it){ size 66 src/io_parameter_impl.cpp (vd.size() <= max_vec_size, size 71 src/io_parameter_impl.cpp for(std::size_t it = 0; it < vd.size() - 1; ++it) size 127 src/maxH_main.cpp Assert::dynamic(v.size() == 3, Assert::compose(__FILE__, __LINE__, "!= 3")); size 133 src/maxH_main.cpp Assert::dynamic(vd1.size() == 3 && vd2.size() == 3, size 142 src/maxH_main.cpp valarray<double> all_h(fm.e.size() * no_edges); size 169 src/maxH_main.cpp for(size_t i = 0; i < v.size() - 1; ++i) cout << v[i] << ", "; size 170 src/maxH_main.cpp cout << v[v.size()-1] << ")" << endl; size 273 src/secOrd_op_brusselator_impl.cpp for(std::size_t localCol = 0; localCol < base_set.size(); ++localCol){ size 306 src/secOrd_op_brusselator_impl.cpp for(std::size_t localCol = 0; localCol < base_set.size(); ++localCol){ size 189 src/secOrd_op_solutionDriven_impl.cpp (basis.size() == 2, "Dimension of basis bad.");