size_t             42 data/sphere/level_set_test.cpp   for(size_t it = 0; it < v_list.size(); ++it)
size_t             48 include/io_dgf.h 	std::size_t no_of_nodes() const noexcept;
size_t             66 include/io_dgf.h       std::size_t get_precision(const std::string& filename);
size_t             67 include/io_dgf.h       std::size_t calculate_dof(const std::string& dgf_file);
size_t             90 include/io_dgf.h       void to_dgfFile(const CC&, std::ostream&, const std::size_t precision);
size_t             95 include/io_dgf.h       std::string from(const C&, const std::size_t precision);
size_t            101 include/io_dgf.h       to_vertices(It first, It last, const int dim, const std::size_t size);
size_t            123 include/io_dgf.h 		      const std::size_t precision){
size_t            136 include/io_dgf.h       std::string from(const C& container, const std::size_t precision){
size_t            155 include/io_dgf.h 				    const int dim, const std::size_t size) try{
size_t             30 include/io_dof.h     void file_to_dof(It first, const std::string& filename, std::size_t dof_no);
size_t             66 include/io_dof.h 		     std::size_t dof_no) try{      
size_t            253 old_code/2015linfty/backup_dune_heat_algo.hpp 	for(size_t i = 0; i < bdf_no; ++i)
size_t            517 old_code/2015linfty/backup_dune_heat_algo.hpp 			for(size_t i=0; i < prev_steps_vec.size(); ++i){
size_t            530 old_code/2015linfty/backup_dune_heat_algo.hpp 			for(size_t i=0; i < prev_steps_vec.size() - 1; ++i)
size_t            590 old_code/2015linfty/backup_dune_heat_algo.hpp 		for(size_t i=0; i < prev_steps_vec.size(); ++i){
size_t             47 old_code/2015linfty/dune_bdf.hpp 	  size_t precision;
size_t            105 old_code/2015linfty/dune_bdf.hpp 	size_t get_precision(const std::vector<std::string>& vertex_list){
size_t            108 old_code/2015linfty/dune_bdf.hpp 		std::vector<size_t> precision_vec;
size_t            116 old_code/2015linfty/dune_bdf.hpp 		std::vector<size_t>::iterator  p_precision = 
size_t            121 old_code/2015linfty/dune_bdf.hpp 	template<typename T, size_t N >
size_t            128 old_code/2015linfty/dune_bdf.hpp 		for(std::size_t s = 0; s < ad.size() -1 ; ++s)
size_t            134 old_code/2015linfty/dune_bdf.hpp 	template<typename T, size_t N >
size_t            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_t            230 old_code/2015linfty/dune_heat_algorithm.hpp     for(size_t i=0; i < prev_steps_U_nmk.size(); ++i){
size_t            251 old_code/2015linfty/dune_heat_algorithm.hpp     for(size_t i=0; i < prev_steps_U_nmk.size() - 1; ++i){
size_t             30 old_code/2015linfty/iodof.h 	      const size_t starting_no = 0);
size_t             36 old_code/2015linfty/iodof.h   size_t f_no;
size_t             47 old_code/2015linfty/iodof.h 			 const size_t starting_no)
size_t             53 old_code/tumor_growth/tumor_bdf.h     size_t precision;
size_t            111 old_code/tumor_growth/tumor_bdf.h   size_t get_relevant_digits(const std::string& number){
size_t            120 old_code/tumor_growth/tumor_bdf.h   size_t get_precision(const std::vector<std::string>& vertex_list){
size_t            123 old_code/tumor_growth/tumor_bdf.h     std::vector<size_t> precision_vec;
size_t            137 old_code/tumor_growth/tumor_bdf.h     std::vector<size_t>::iterator  p_precision = 
size_t            142 old_code/tumor_growth/tumor_bdf.h   template<typename T, size_t N >
size_t            149 old_code/tumor_growth/tumor_bdf.h     for(std::size_t s = 0; s < ad.size() -1 ; ++s)
size_t            155 old_code/tumor_growth/tumor_bdf.h   template<typename T, size_t N >
size_t            248 old_code/tumor_growth/tumor_bdf.h     for(size_t it_vertex = 0; it_vertex < no_vertices; ++it_vertex){
size_t            251 old_code/tumor_growth/tumor_bdf.h       for(size_t  it_component = 0; it_component < dim; ++it_component){
size_t            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_t            229 old_code/tumor_growth/tumor_code.h     for(size_t i=0; i < prev_steps_U_nmk.size(); ++i){
size_t            250 old_code/tumor_growth/tumor_code.h     for(size_t i=0; i < prev_steps_U_nmk.size() - 1; ++i){
size_t             47 old_code/tumor_growth/tumor_deformation.h     for(std::size_t s = 0; s < range_node.size(); ++s)
size_t            551 old_code/tumor_growth/tumor_growth.h       for(size_t pt = 0; pt < quadrature.nop(); ++pt){
size_t            603 old_code/tumor_growth/tumor_growth.h       for(size_t pt = 0; pt < quadrature.nop(); ++pt){
size_t            661 old_code/tumor_growth/tumor_growth.h       for(size_t pt = 0; pt < quadrature.nop(); ++pt){
size_t            693 old_code/tumor_growth/tumor_growth.h       for(size_t pt = 0; pt < bigger_quadrature.nop(); ++pt){
size_t            732 old_code/tumor_growth/tumor_growth.h       for(size_t pt = 0; pt < quadrature.nop(); ++pt){
size_t            766 old_code/tumor_growth/tumor_growth.h       for(size_t pt = 0; pt < quadrature.nop(); ++pt){
size_t             66 src/grid_GridAndTime_impl.cpp   constexpr std::size_t dim = 3;
size_t            102 src/grid_GridAndTime_impl.cpp size_t Esfem::Impl::
size_t            118 src/grid_GridAndTime_impl.cpp identity_map(const Nodes_key& nodes_lines, const std::size_t precision){
size_t            126 src/grid_GridAndTime_impl.cpp std::size_t Esfem::Impl::get_relevant_precision(const std::string& number) try{
size_t            140 src/grid_GridAndTime_impl.cpp vector<size_t> Esfem::Impl::create_precision_vec(const vector<string>& vertex_list){
size_t            141 src/grid_GridAndTime_impl.cpp   vector<size_t> rv {};
size_t            155 src/grid_GridAndTime_impl.cpp std::size_t Esfem::Impl::max(const std::vector<std::size_t>& v){
size_t            165 src/grid_GridAndTime_impl.cpp   for(std::size_t i = 0; i < Node::dimension - 1; ++i)
size_t            188 src/grid_GridAndTime_impl.cpp   for(std::size_t it = 0; it < Node::dimension; ++it){
size_t            247 src/grid_GridAndTime_impl.cpp   size_t line_no {1};
size_t             34 src/grid_GridAndTime_impl.h     std::size_t operator()(const Esfem::Grid::Deformation::Domain& n) const{
size_t             41 src/grid_GridAndTime_impl.h       size_t seed {0};
size_t             54 src/grid_GridAndTime_impl.h     std::size_t operator()(const Base& ai) const{
size_t             61 src/grid_GridAndTime_impl.h       size_t seed {0};
size_t            120 src/grid_GridAndTime_impl.h       std::size_t digit_precision {8};
size_t            181 src/grid_GridAndTime_impl.h     std::size_t get_relevant_precision(const Evolving_grid::Nodes_key& vertex_list);
size_t            184 src/grid_GridAndTime_impl.h     identity_map(const Evolving_grid::Nodes_key&, const std::size_t precision);
size_t            186 src/grid_GridAndTime_impl.h     std::size_t get_relevant_precision(const std::string& number);
size_t            189 src/grid_GridAndTime_impl.h     std::vector<std::size_t>
size_t            194 src/grid_GridAndTime_impl.h     std::size_t max(const std::vector<std::size_t>&);
size_t             41 src/io_dgf.cpp   const size_t scal_dim_dof;
size_t             42 src/io_dgf.cpp   const size_t vec_dim_dof;
size_t            180 src/io_dgf.cpp size_t Handler::no_of_nodes() const noexcept{
size_t            209 src/io_dgf.cpp size_t Esfem::Io::Dgf::get_precision(const string& dgf_file){
size_t            213 src/io_dgf.cpp size_t Esfem::Io::Dgf::calculate_dof(const string& dgf_file){
size_t             89 src/io_l2h1Calculator.cpp   size_t no_nodes = v.size() / d; // assuming the post condition
size_t             96 src/io_l2h1Calculator.cpp     for(size_t it = 0; it < no_nodes; ++it, vfef_ptr += d, ++fef_ptr)
size_t            116 src/io_l2h1Calculator.cpp   for(size_t it = 0; it < d_ptr->vec_fefun1.size(); ++it){
size_t            138 src/io_l2h1Calculator.cpp   for(size_t it = 0; it < d_ptr->vec_fefun1.size(); ++it){
size_t             64 src/io_parameter_impl.cpp   constexpr size_t max_vec_size = 100;
size_t             71 src/io_parameter_impl.cpp   for(std::size_t it = 0; it < vd.size() - 1; ++it)
size_t             59 src/maxH_main.cpp     size_t lineno {1};
size_t            169 src/maxH_main.cpp   for(size_t i = 0; i < v.size() - 1; ++i) cout << v[i] << ", ";
size_t             48 src/secOrd_op_brusselator_impl.cpp inline Range massMatrix_loc(const std::size_t pt, const Quadrature& q,
size_t             54 src/secOrd_op_brusselator_impl.cpp inline Jacobian_range stiffnessMatrix_loc(const std::size_t pt, const Quadrature& q,
size_t             60 src/secOrd_op_brusselator_impl.cpp inline Range quad_massMatrix_loc(const std::size_t pt, const Quadrature& q,
size_t             73 src/secOrd_op_brusselator_impl.cpp inline Range jacobian_quadMass_loc(const std::size_t pt, const Quadrature& q,
size_t             85 src/secOrd_op_brusselator_impl.cpp static std::size_t calculate_matrix_row_size(const FE_function&);
size_t            169 src/secOrd_op_brusselator_impl.cpp     for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            186 src/secOrd_op_brusselator_impl.cpp     for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            218 src/secOrd_op_brusselator_impl.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            241 src/secOrd_op_brusselator_impl.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            263 src/secOrd_op_brusselator_impl.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            273 src/secOrd_op_brusselator_impl.cpp     for(std::size_t localCol = 0; localCol < base_set.size(); ++localCol){
size_t            297 src/secOrd_op_brusselator_impl.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            306 src/secOrd_op_brusselator_impl.cpp     for(std::size_t localCol = 0; localCol < base_set.size(); ++localCol){
size_t            318 src/secOrd_op_brusselator_impl.cpp std::size_t calculate_matrix_row_size(const FE_function& fef){
size_t             60 src/secOrd_op_linearHeat.cpp Range mass_matrix(const std::size_t pt, const Quadrature& q,
size_t             67 src/secOrd_op_linearHeat.cpp Jacobian_range stiffness_matrix(const std::size_t pt, const Quadrature& q,
size_t            172 src/secOrd_op_linearHeat.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            192 src/secOrd_op_linearHeat.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            325 src/secOrd_op_rhs_impl.h     for(std::size_t pt = 0; pt < quad.nop(); ++pt){
size_t            152 src/secOrd_op_rhs_u.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t            145 src/secOrd_op_rhs_w.cpp   for(std::size_t pt = 0; pt < q.nop(); ++pt){
size_t             27 src/secOrd_op_solutionDriven_impl.cpp using std::size_t;
size_t            117 src/secOrd_op_solutionDriven_impl.cpp   for(size_t pt = 0; pt < q.nop(); ++pt){
size_t            136 src/secOrd_op_solutionDriven_impl.cpp   for(size_t pt = 0; pt < q.nop(); ++pt){
size_t            200 src/secOrd_op_solutionDriven_impl.h     evaluate(const std::size_t pt,
size_t            209 src/secOrd_op_solutionDriven_impl.h     evaluate(const std::size_t pt,
size_t            218 src/secOrd_op_solutionDriven_impl.h     jacobian(const std::size_t pt,