rv 108 include/io_dgf.h It rv = std::find(first, last, keyword); rv 109 include/io_dgf.h if(rv == last) throw std::runtime_error rv 111 include/io_dgf.h ++rv; rv 112 include/io_dgf.h return rv; rv 116 include/io_dgf.h It rv = std::find(first, last, keyword); rv 117 include/io_dgf.h if(rv == last) throw std::runtime_error rv 119 include/io_dgf.h return rv; rv 131 include/io_dgf.h C rv {}; rv 132 include/io_dgf.h for(Number n {0}; iss >> n; ) rv.push_back(n); rv 133 include/io_dgf.h return rv; rv 157 include/io_dgf.h Handler::Vertices rv {}; rv 158 include/io_dgf.h rv.reserve(size); rv 165 include/io_dgf.h rv.emplace_back(std::move(v)); rv 167 include/io_dgf.h return rv; rv 119 src/grid_GridAndTime_impl.cpp Map rv {}; rv 120 src/grid_GridAndTime_impl.cpp rv.reserve(nodes_lines.size()); rv 122 src/grid_GridAndTime_impl.cpp rv[normalize_node(line, precision)] = string_to_node(line); rv 123 src/grid_GridAndTime_impl.cpp return rv; rv 141 src/grid_GridAndTime_impl.cpp vector<size_t> rv {}; rv 144 src/grid_GridAndTime_impl.cpp rv.reserve(vertex_list.size() * world_dim); rv 150 src/grid_GridAndTime_impl.cpp rv.push_back(get_relevant_precision(s)); rv 152 src/grid_GridAndTime_impl.cpp return rv; rv 186 src/grid_GridAndTime_impl.cpp Node rv; rv 189 src/grid_GridAndTime_impl.cpp if(interpreter >> value) rv[it] = value; rv 194 src/grid_GridAndTime_impl.cpp return rv; rv 315 src/grid_GridAndTime_impl.cpp key rv {}; rv 317 src/grid_GridAndTime_impl.cpp rv[i] = static_cast<int>(fac * r[i]); rv 318 src/grid_GridAndTime_impl.cpp return rv; rv 73 src/grid_GridAndTime_impl.h bool rv = true; rv 75 src/grid_GridAndTime_impl.h rv = rv && lhs[i] == rhs[i]; rv 76 src/grid_GridAndTime_impl.h return rv; rv 86 src/grid_GridAndTime_impl.h bool rv = true; rv 88 src/grid_GridAndTime_impl.h rv = rv && lhs[i] == rhs[i]; rv 89 src/grid_GridAndTime_impl.h return rv; rv 234 src/grid_GridAndTime_impl.h It rv = std::find(first, last, "VERTEX"); rv 235 src/grid_GridAndTime_impl.h if(rv == last) rv 239 src/grid_GridAndTime_impl.h ++rv; // "VERTEX" is not part of the list rv 240 src/grid_GridAndTime_impl.h return rv; rv 245 src/grid_GridAndTime_impl.h It rv = std::find(first, last, ending_point); rv 246 src/grid_GridAndTime_impl.h if(rv == last) rv 250 src/grid_GridAndTime_impl.h return rv; rv 188 src/io_dgf.cpp Simplices rv {}; rv 190 src/io_dgf.cpp rv.reserve(simplices_list.size()); rv 192 src/io_dgf.cpp rv.emplace_back(to<Simplex>(line)); rv 193 src/io_dgf.cpp return rv; rv 220 src/io_dgf.cpp Vertices rv {}; rv 222 src/io_dgf.cpp rv.reserve(vertices_list.size()); rv 224 src/io_dgf.cpp rv.emplace_back(to<Vertex>(line)); rv 225 src/io_dgf.cpp return rv; rv 115 src/io_l2h1Calculator.cpp auto rv = 0.; rv 117 src/io_l2h1Calculator.cpp rv += d_ptr-> rv 120 src/io_l2h1Calculator.cpp return rv; rv 137 src/io_l2h1Calculator.cpp auto rv = 0.; rv 139 src/io_l2h1Calculator.cpp rv += d_ptr-> rv 142 src/io_l2h1Calculator.cpp return rv; rv 191 src/io_parameter.cpp const double rv = d_ptr->t_end - global_timeStep() * max_timeSteps(); rv 192 src/io_parameter.cpp return rv > 0 ? rv : 0; rv 135 src/maxH_main.cpp double rv {}; rv 136 src/maxH_main.cpp for(int i = 0; i < 3; ++i) rv += pow(vd1[i] - vd2[i],2); rv 137 src/maxH_main.cpp return sqrt(rv); rv 254 src/secOrd_op_initData_impl.cpp double rv = 0.; rv 257 src/secOrd_op_initData_impl.cpp rv = p.u_hom_value(); rv 260 src/secOrd_op_initData_impl.cpp rv = p.w_hom_value(); rv 266 src/secOrd_op_initData_impl.cpp return rv; rv 271 src/secOrd_op_initData_impl.cpp double rv = 0.; rv 274 src/secOrd_op_initData_impl.cpp rv = p.u_pertubation(); rv 277 src/secOrd_op_initData_impl.cpp rv = p.w_pertubation(); rv 283 src/secOrd_op_initData_impl.cpp return rv; rv 297 src/secOrd_op_initData_impl.cpp std::string rv {}; rv 300 src/secOrd_op_initData_impl.cpp rv = p.u_init_dof(); rv 303 src/secOrd_op_initData_impl.cpp rv = p.w_init_dof(); rv 309 src/secOrd_op_initData_impl.cpp return rv;