fun 147 include/grid.h operator Dune_FEfun&(){ return fun; } fun 148 include/grid.h operator const Dune_FEfun&() const { return fun; } fun 150 include/grid.h auto size() const { return fun.size(); } fun 151 include/grid.h auto begin() { return fun.dbegin(); } fun 152 include/grid.h auto end() { return fun.dend(); } fun 153 include/grid.h auto begin() const { return fun.dbegin(); } fun 154 include/grid.h auto end() const { return fun.dend(); } fun 155 include/grid.h auto cbegin() const { return fun.dbegin(); } fun 156 include/grid.h auto cend() const { return fun.dend(); } fun 157 include/grid.h auto name() const { return fun.name(); } fun 162 include/grid.h Dune_FEfun fun; fun 175 include/grid.h operator Dune_FEfun&(){ return fun; } fun 176 include/grid.h operator const Dune_FEfun&() const { return fun; } fun 178 include/grid.h auto size() const { return fun.size(); } fun 179 include/grid.h auto begin() { return fun.dbegin(); } fun 180 include/grid.h auto end() { return fun.dend(); } fun 181 include/grid.h auto begin() const { return fun.dbegin(); } fun 182 include/grid.h auto end() const { return fun.dend(); } fun 183 include/grid.h auto cbegin() const { return fun.dbegin(); } fun 184 include/grid.h auto cend() const { return fun.dend(); } fun 185 include/grid.h auto name() const { return fun.name(); } fun 190 include/grid.h Dune_FEfun fun; fun 94 src/brusselator_algo.cpp solver.u.mass_matrix(fef.u.fun, fef.u.rhs_les); fun 95 src/brusselator_algo.cpp solver.w.mass_matrix(fef.w.fun, fef.w.rhs_les); fun 105 src/brusselator_algo.cpp solver.u.solve(fef.u.rhs_les, fef.u.fun); fun 106 src/brusselator_algo.cpp fef.u.app = fef.u.fun; fun 107 src/brusselator_algo.cpp solver.w.solve(fef.w.rhs_les, fef.w.fun); fun 108 src/brusselator_algo.cpp fef.w.app = fef.w.fun; fun 117 src/brusselator_algo.cpp io.identity.interpolate(fef.surface.fun); fun 121 src/brusselator_algo.cpp Grid::compose_dgfName(fef.surface.fun.name(), fef.tmpFile_path), fun 131 src/brusselator_algo.cpp X.app = fef.surface.fun; fun 135 src/brusselator_algo.cpp X_solver.solve(X.rhs_les, X.fun); fun 140 src/brusselator_algo.cpp fef.surface.fun = X.fun; // swap would be more efficient fun 146 src/brusselator_algo.cpp << norm.l2_err(fef.surface.fun, fef.surface.exact) << ' ' fun 147 src/brusselator_algo.cpp << norm.h1_err(fef.surface.fun, fef.surface.exact) fun 173 src/brusselator_algo.cpp ex_ptr->interpolate(fef.surface.fun); fun 174 src/brusselator_algo.cpp fef.surface.exact = fef.surface.fun; fun 176 src/brusselator_algo.cpp X_solver.brusselator_rhs(fef.surface.fun, fef.surface.rhs_les); fun 178 src/brusselator_algo.cpp X_solver.solve(fef.surface.rhs_les, fef.surface.fun); fun 184 src/brusselator_algo.cpp << norm.l2_err(fef.surface.fun, fef.surface.exact) << ' ' fun 185 src/brusselator_algo.cpp << norm.h1_err(fef.surface.fun, fef.surface.exact) fun 187 src/brusselator_algo.cpp fix_grid.new_nodes(fef.surface.fun); fun 198 src/brusselator_algo.cpp ex_ptr->interpolate(fef.surface.fun); fun 200 src/brusselator_algo.cpp fef.surface.exact = fef.surface.fun; fun 202 src/brusselator_algo.cpp X_solver.brusselator_rhs(fef.surface.fun, fef.surface.rhs_les); fun 206 src/brusselator_algo.cpp X_solver.solve(fef.surface.rhs_les, fef.surface.fun); fun 213 src/brusselator_algo.cpp << norm.l2_err(fef.surface.fun, fef.surface.exact) << ' ' fun 214 src/brusselator_algo.cpp << norm.h1_err(fef.surface.fun, fef.surface.exact) fun 216 src/brusselator_algo.cpp fix_grid.new_nodes(fef.surface.fun); fun 225 src/brusselator_algo.cpp ex_ptr->interpolate(fef.surface.fun); fun 226 src/brusselator_algo.cpp fef.surface.exact = fef.surface.fun; fun 228 src/brusselator_algo.cpp X_solver.brusselator_rhs(fef.surface.fun, fef.surface.rhs_les); fun 230 src/brusselator_algo.cpp X_solver.solve(fef.surface.rhs_les, fef.surface.fun); fun 235 src/brusselator_algo.cpp << norm.l2_err(fef.surface.fun, fef.surface.exact) << ' ' fun 236 src/brusselator_algo.cpp << norm.h1_err(fef.surface.fun, fef.surface.exact) fun 238 src/brusselator_algo.cpp fix_grid.new_nodes(fef.surface.fun); fun 252 src/brusselator_algo.cpp X_ex->interpolate(fef.surface.fun); fun 254 src/brusselator_algo.cpp fef.surface.exact = fef.surface.fun; fun 255 src/brusselator_algo.cpp fef.u.fun = fef.u.app; fun 258 src/brusselator_algo.cpp fef.velocity.rhs_les = fef.surface.fun; // old surface for velocity fun 259 src/brusselator_algo.cpp X_solver.brusselator_rhs(fef.surface.fun, fef.surface.rhs_les); fun 261 src/brusselator_algo.cpp X_solver.solve(fef.surface.rhs_les, fef.surface.fun); fun 262 src/brusselator_algo.cpp fef.velocity.app = fef.surface.fun; // new surface for velocity fun 263 src/brusselator_algo.cpp solver.u.mass_matrix(fef.u.fun, fef.u.rhs_les); fun 265 src/brusselator_algo.cpp fef.velocity.rhs_les.cbegin(), fef.velocity.fun.begin()); fun 272 src/brusselator_algo.cpp fix_grid.new_nodes(fef.surface.fun); fun 274 src/brusselator_algo.cpp solver.u.solve(fef.u.rhs_les, fef.u.fun); fun 275 src/brusselator_algo.cpp fef.u.app = fef.u.fun; fun 284 src/brusselator_algo.cpp fix_grid.new_nodes(fef.surface.fun); fun 318 src/brusselator_algo.cpp Esfem::Io::Paraview paraview {data, fix_grid, fef.u.fun, fef.w.fun}; fun 320 src/brusselator_algo.cpp X_solver.brusselator_rhs(fef.surface.fun, fef.surface.rhs_les); fun 321 src/brusselator_algo.cpp X_solver.solve(fef.surface.rhs_les, fef.surface.fun); fun 322 src/brusselator_algo.cpp solver.u.mass_matrix(fef.u.fun, fef.u.rhs_les); fun 323 src/brusselator_algo.cpp solver.w.mass_matrix(fef.w.fun, fef.w.rhs_les); fun 326 src/brusselator_algo.cpp fix_grid.new_nodes(fef.surface.fun); fun 329 src/brusselator_algo.cpp solver.u.solve(fef.u.rhs_les, fef.u.fun); fun 330 src/brusselator_algo.cpp fef.u.app = fef.u.fun; fun 331 src/brusselator_algo.cpp solver.w.solve(fef.w.rhs_les, fef.w.fun); fun 332 src/brusselator_algo.cpp fef.w.app = fef.w.fun; fun 363 src/brusselator_algo.cpp fef.surface.app = fef.surface.fun; fun 374 src/brusselator_algo.cpp << norm.l2_err(fef.u.exact, fef.u.fun) << '\t' fun 375 src/brusselator_algo.cpp << norm.h1_err(fef.u.exact, fef.u.fun) << std::endl; fun 377 src/brusselator_algo.cpp << norm.l2_err(fef.w.exact, fef.w.fun) << '\t' fun 378 src/brusselator_algo.cpp << norm.h1_err(fef.w.exact, fef.w.fun) << std::endl; fun 387 src/brusselator_algo.cpp << norm.l2_err(fef.velocity.fun, fef.velocity.exact) fun 389 src/brusselator_algo.cpp << norm.h1_err(fef.velocity.fun, fef.velocity.exact) fun 397 src/brusselator_algo.cpp exact.X_ptr->interpolate(fef.surface.fun); fun 400 src/brusselator_algo.cpp io.identity.interpolate(fef.surface.fun); fun 425 src/brusselator_algo.h << norm.l2_err(fem.fun, fem.exact) << ' ' fun 426 src/brusselator_algo.h << norm.h1_err(fem.fun, fem.exact) << std::endl; fun 63 src/brusselator_algo_impl.cpp :u {p, g, Growth::promoting, u_set.fun, w_set.fun}, fun 64 src/brusselator_algo_impl.cpp w {p, g, Growth::inhibiting, u_set.fun, u_set.fun} fun 80 src/brusselator_algo_impl.cpp paraview {bs.data, bs.fix_grid, bs.fef.u.fun, bs.fef.w.fun}, fun 92 src/brusselator_algo_impl.cpp bs.io.identity.interpolate(bs.fef.surface.fun); fun 106 src/brusselator_algo_impl.cpp solver.u.mass_matrix(u.fun, u.rhs_les); fun 107 src/brusselator_algo_impl.cpp solver.w.mass_matrix(w.fun, w.rhs_les); fun 118 src/brusselator_algo_impl.cpp paraview {bs.data, bs.fix_grid, u.fun, w.fun}, fun 124 src/brusselator_algo_impl.cpp solver.u.mass_matrix(u.fun, u.rhs_les); fun 125 src/brusselator_algo_impl.cpp solver.w.mass_matrix(w.fun, w.rhs_les); fun 130 src/brusselator_algo_impl.cpp solver.u.solve(u.rhs_les, u.fun); fun 131 src/brusselator_algo_impl.cpp u.app = u.fun; fun 132 src/brusselator_algo_impl.cpp solver.w.solve(w.rhs_les, w.fun); fun 133 src/brusselator_algo_impl.cpp w.app = w.fun; fun 136 src/brusselator_algo_impl.cpp solver.u.mass_matrix(u.fun, u.rhs_les); fun 137 src/brusselator_algo_impl.cpp solver.w.mass_matrix(w.fun, w.rhs_les); fun 147 src/brusselator_algo_impl.cpp Grid::compose_dgfName(fef.surface.fun.name(), fef.tmpFile_path), fun 153 src/brusselator_algo_impl.cpp vs {bs.data, grid, u.fun}, fun 160 src/brusselator_algo_impl.cpp ss.u.mass_matrix(u.fun, u.rhs_les); fun 161 src/brusselator_algo_impl.cpp ss.w.mass_matrix(w.fun, w.rhs_les); fun 166 src/brusselator_algo_impl.cpp vs.brusselator_rhs(X.fun, X.rhs_les); fun 172 src/brusselator_algo_impl.cpp vs.solve(X.rhs_les, X.fun); fun 173 src/brusselator_algo_impl.cpp fef.surface.fun = X.fun; fun 185 src/brusselator_algo_impl.cpp Grid::compose_dgfName(bs.fef.surface.fun.name(), bs.fef.tmpFile_path ), fun 190 src/brusselator_algo_impl.cpp paraview {bs.data, grid, u.fun, w.fun}, fun 202 src/brusselator_algo_impl.cpp solver.u.solve(u.rhs_les, u.fun); fun 203 src/brusselator_algo_impl.cpp u.app = u.fun; fun 204 src/brusselator_algo_impl.cpp solver.w.solve(w.rhs_les, w.fun); fun 205 src/brusselator_algo_impl.cpp w.app = w.fun; fun 225 src/brusselator_algo_impl.cpp id.interpolate(f.fun); fun 226 src/brusselator_algo_impl.cpp f.app = f.fun; fun 227 src/brusselator_algo_impl.cpp f.exact = f.fun; fun 48 src/grid_FEfunSet.h FEfun fun; /*!< \brief Numerical solution */ fun 74 src/grid_FEfunSet.h FEfun fun; /*!< \brief Numerical solution */ fun 117 src/grid_FEfunSet.h : fun {name, gt}, app {name + "_app", gt}, fun 123 src/grid_FEfunSet.h : fun {other.fun, gt}, app {other.app, gt}, fun 131 src/grid_FEfunSet.h h.write(compose_dgfName(fun.name(), dir), fun); fun 139 src/grid_FEfunSet.h h.read(compose_dgfName(fun.name(), dir), fun); fun 148 src/grid_FEfunSet.h : fun {fef.fun, gt}, fun 27 src/grid_fef.cpp : fun {fun_name, gt.fe_space()} fun 29 src/grid_fef.cpp fun.clear(); fun 32 src/grid_fef.cpp fun.assign(other.fun); fun 36 src/grid_fef.cpp for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it += d; fun 40 src/grid_fef.cpp for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it *= d; fun 44 src/grid_fef.cpp : fun {other.name() + "+", gt.fe_space()} fun 46 src/grid_fef.cpp fun.assign(other.fun); fun 53 src/grid_fef.cpp : fun {fun_name, gt.vec_fe_space()} fun 55 src/grid_fef.cpp fun.clear(); fun 58 src/grid_fef.cpp : fun {other.name() + "+", gt.vec_fe_space()} fun 60 src/grid_fef.cpp fun.assign(other.fun); fun 63 src/grid_fef.cpp fun.assign(other.fun); fun 68 src/grid_fef.cpp for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it += d; fun 72 src/grid_fef.cpp for(auto it = fun.dbegin(); it != fun.dend(); ++it) *it *= d;