Quadrature<dim> quad = *qp;
FEValues<dim> fe_v(mapping, cell->get_fe(), quad, update_values);
fe_v.reinit(cell);
- std::vector<Vector<typename VectorType::value_type>> vvalues(
+ std::vector<Vector<typename VectorType::value_type>> vector_values(
1, Vector<typename VectorType::value_type>(values.size()));
- fe_v.get_function_values(data_vector, vvalues);
- values = vvalues[0];
+ fe_v.get_function_values(data_vector, vector_values);
+ values = vector_values[0];
}
Quadrature<dim> quad = *qp;
FEValues<dim> fe_v(mapping, cell->get_fe(), quad, update_hessians);
fe_v.reinit(cell);
- std::vector<Vector<typename VectorType::value_type>> vvalues(
+ std::vector<Vector<typename VectorType::value_type>> vector_values(
1, Vector<typename VectorType::value_type>(values.size()));
- fe_v.get_function_laplacians(data_vector, vvalues);
- values = vvalues[0];
+ fe_v.get_function_laplacians(data_vector, vector_values);
+ values = vector_values[0];
}
fe_v.reinit(cells[i], i, 0);
const unsigned int nq = qpoints[i].size();
- std::vector<Vector<typename VectorType::value_type>> vvalues(
+ std::vector<Vector<typename VectorType::value_type>> vector_values(
nq, Vector<typename VectorType::value_type>(this->n_components));
- fe_v.get_present_fe_values().get_function_values(data_vector, vvalues);
+ fe_v.get_present_fe_values().get_function_values(data_vector,
+ vector_values);
for (unsigned int q = 0; q < nq; ++q)
- values[maps[i][q]] = vvalues[q];
+ values[maps[i][q]] = vector_values[q];
}
}
// function. This requires a temporary object, but everything we
// do here is so expensive that that really doesn't make any
// difference any more.
- std::vector<Vector<typename VectorType::value_type>> vvalues(
+ std::vector<Vector<typename VectorType::value_type>> vector_values(
points.size(),
Vector<typename VectorType::value_type>(this->n_components));
- vector_value_list(points, vvalues);
+ vector_value_list(points, vector_values);
for (unsigned int q = 0; q < points.size(); ++q)
- values[q] = vvalues[q](component);
+ values[q] = vector_values[q](component);
}
// do here is so expensive that that really doesn't make any
// difference any more.
std::vector<std::vector<Tensor<1, dim, typename VectorType::value_type>>>
- vvalues(points.size(),
- std::vector<Tensor<1, dim, typename VectorType::value_type>>(
- this->n_components));
+ vector_values(
+ points.size(),
+ std::vector<Tensor<1, dim, typename VectorType::value_type>>(
+ this->n_components));
- vector_gradient_list(points, vvalues);
+ vector_gradient_list(points, vector_values);
for (unsigned int q = 0; q < points.size(); ++q)
- values[q] = vvalues[q][component];
+ values[q] = vector_values[q][component];
}
fe_v.reinit(cells[i], i, 0);
const unsigned int nq = qpoints[i].size();
- std::vector<Vector<typename VectorType::value_type>> vvalues(
+ std::vector<Vector<typename VectorType::value_type>> vector_values(
nq, Vector<typename VectorType::value_type>(this->n_components));
fe_v.get_present_fe_values().get_function_laplacians(data_vector,
- vvalues);
+ vector_values);
for (unsigned int q = 0; q < nq; ++q)
- values[maps[i][q]] = vvalues[q];
+ values[maps[i][q]] = vector_values[q];
}
}
// function. This requires a temporary object, but everything we
// do here is so expensive that that really doesn't make any
// difference any more.
- std::vector<Vector<typename VectorType::value_type>> vvalues(
+ std::vector<Vector<typename VectorType::value_type>> vector_values(
points.size(),
Vector<typename VectorType::value_type>(this->n_components));
- vector_laplacian_list(points, vvalues);
+ vector_laplacian_list(points, vector_values);
for (unsigned int q = 0; q < points.size(); ++q)
- values[q] = vvalues[q](component);
+ values[q] = vector_values[q](component);
}