v                 160 include/io_dgf.h 	  Vertex v(dim);
v                 161 include/io_dgf.h 	  for(auto& it : v){
v                 165 include/io_dgf.h 	  rv.emplace_back(std::move(v));
v                 174 include/io_dgf.h       FEfun& operator<<(FEfun& fef, const Handler::Vertices& v){
v                 178 include/io_dgf.h 	auto first = cbegin(v);
v                 179 include/io_dgf.h 	auto last = cend(v);
v                  36 old_code/2015linfty/dune_bdf.hxx 	double operator() (Eigen::Vector3d v) const{
v                  37 old_code/2015linfty/dune_bdf.hxx 		return v.norm();
v                 436 old_code/tumor_growth/tumor_growth.h     Domain<Vector> v = p2 - p0;
v                 445 old_code/tumor_growth/tumor_growth.h     n_p_chi[0] = v[1] * w[2] - v[2] * w[1];
v                 446 old_code/tumor_growth/tumor_growth.h     n_p_chi[1] = - v[0] * w[2] + v[2] * w[0];
v                 447 old_code/tumor_growth/tumor_growth.h     n_p_chi[2] = v[0] * w[1] - v[1] * w[0];
v                 449 src/brusselator_algo.cpp   :u {gt, Growth::promoting}, w {gt, Growth::inhibiting}, v {gt},
v                 454 src/brusselator_algo.cpp   :u {p, Growth::promoting}, w {p, Growth::inhibiting}, v {gt},
v                 353 src/brusselator_algo.h       SecOrd_op::Exact_velocity v;
v                 155 src/grid_GridAndTime_impl.cpp std::size_t Esfem::Impl::max(const std::vector<std::size_t>& v){
v                 156 src/grid_GridAndTime_impl.cpp   const auto rv_ptr = max_element(cbegin(v), cend(v));
v                 157 src/grid_GridAndTime_impl.cpp   if(rv_ptr == cend(v)) throw logic_error {"Error in max()"};
v                  59 src/io_l2h1Calculator.cpp   void assign_v1(const Vec_FEfun& v){ assign(v, vec_fefun1); }
v                  62 src/io_l2h1Calculator.cpp   void assign_v2(const Vec_FEfun& v){ assign(v, vec_fefun2); }
v                  65 src/io_l2h1Calculator.cpp   void init_vec(vector<FEfun>& v, const Grid::Grid_and_time::FE_space& fes);
v                  69 src/io_l2h1Calculator.cpp   void assign(const Vec_FEfun& v, vector<FEfun>& vec);
v                  78 src/io_l2h1Calculator.cpp (vector<FEfun>& v, const Grid::Grid_and_time::FE_space& fes){
v                  80 src/io_l2h1Calculator.cpp   v.reserve(d);
v                  82 src/io_l2h1Calculator.cpp     v.emplace_back("vec_fefun", fes);
v                  83 src/io_l2h1Calculator.cpp     v.back().clear();
v                  87 src/io_l2h1Calculator.cpp (const Vec_FEfun& v, vector<FEfun>& vec){
v                  89 src/io_l2h1Calculator.cpp   size_t no_nodes = v.size() / d; // assuming the post condition
v                  90 src/io_l2h1Calculator.cpp   Assert::dynamic(v.size() == no_nodes * d, 
v                  93 src/io_l2h1Calculator.cpp     auto vfef_ptr = v.dbegin();
v                 126 src/maxH_main.cpp vector<pair<int, int> > all_combinations(const valarray<int>& v){
v                 127 src/maxH_main.cpp   Assert::dynamic(v.size() == 3, Assert::compose(__FILE__, __LINE__, "!= 3"));
v                 128 src/maxH_main.cpp   return {{v[0], v[1]}, {v[0], v[2]}, {v[1], v[2]}}; // has size 3
v                 167 src/maxH_main.cpp void print(const valarray<T>& v){
v                 169 src/maxH_main.cpp   for(size_t i = 0; i < v.size() - 1; ++i) cout << v[i] << ", ";
v                 170 src/maxH_main.cpp   cout << v[v.size()-1] << ")" << endl;
v                 181 src/secOrd_op_solutionDriven_impl.cpp   const Domain<Vector_fef> v = p2 - p0;
v                 183 src/secOrd_op_solutionDriven_impl.cpp   return {v, w};
v                 190 src/secOrd_op_solutionDriven_impl.cpp   const auto& v = basis[0];
v                 195 src/secOrd_op_solutionDriven_impl.cpp   normal[0] = v[1] * w[2] - v[2] * w[1];
v                 196 src/secOrd_op_solutionDriven_impl.cpp   normal[1] = - v[0] * w[2] + v[2] * w[0];
v                 197 src/secOrd_op_solutionDriven_impl.cpp   normal[2] = v[0] * w[1] - v[1] * w[0];
v                 178 src/secOrd_op_solutionDriven_impl.h     euclidean_norm(const MCF_op::Range<MCF_op::Vector_fef>& v){
v                 180 src/secOrd_op_solutionDriven_impl.h       return std::sqrt(v[0] * v[0] + v[1] * v[1] + v[2] * v[2]);