template <typename Number>
ConstraintValues<Number>::ConstraintValues ()
:
- constraints(FPArrayComparator<Number>(1.))
+ constraints(FPArrayComparator<double>(1.))
{}
template <typename Number>
// lenghty and now we use a std::map with a
// user-defined comparator to compare floating
// point arrays to a tolerance 1e-13.
- std::pair<typename std::map<std::vector<Number>, unsigned int,
- FPArrayComparator<Number> >::iterator,
+ std::pair<typename std::map<std::vector<double>, unsigned int,
+ FPArrayComparator<double> >::iterator,
bool> it = constraints.insert(next_constraint);
unsigned int insert_position = deal_II_numbers::invalid_unsigned_int;
if (it.second == false)
{
cartesian_data.resize(cartesians.size());
for (typename std::map<Tensor<1,dim,VEC_ARRAY>,
- unsigned int>::iterator it = cartesians.begin();
- it != cartesians.end(); ++it)
+ unsigned int, FPArrayComparator<Number> >::iterator
+ it = cartesians.begin(); it != cartesians.end(); ++it)
{
VectorizedArray<Number> det = make_vectorized_array<Number>(1.);
for (unsigned int d=0; d<dim; ++d)
}
affine_data.resize(affines.size());
for (typename std::map<Tensor<2,dim,VEC_ARRAY>,
- unsigned int>::iterator it = affines.begin();
- it != affines.end(); ++it)
+ unsigned int, FPArrayComparator<Number> >::iterator
+ it = affines.begin(); it != affines.end(); ++it)
{
Tensor<2,dim,VectorizedArray<Number> > jac;
for (unsigned int d=0; d<dim; ++d)
// set constraint pool from the std::map and
// reorder the indices
typename std::map<std::vector<double>, unsigned int,
- internal::MatrixFreeFunctions::FPArrayComparator<Number> >::iterator
+ internal::MatrixFreeFunctions::FPArrayComparator<double> >::iterator
it = constraint_values.constraints.begin(),
end = constraint_values.constraints.end();
std::vector<const std::vector<double>*>