Reference documentation for deal.II version 9.2.0
|
#include <deal.II/matrix_free/dof_info.h>
Public Member Functions | |
ConstraintValues () | |
template<typename number2 > | |
unsigned short | insert_entries (const std::vector< std::pair< types::global_dof_index, number2 >> &entries) |
Public Attributes | |
std::vector< std::pair< types::global_dof_index, double > > | constraint_entries |
std::vector< types::global_dof_index > | constraint_indices |
std::pair< std::vector< Number >, types::global_dof_index > | next_constraint |
std::map< std::vector< Number >, types::global_dof_index, FPArrayComparator< Number > > | constraints |
A struct that takes entries describing a constraint and puts them into a sorted list where duplicates are filtered out
Definition at line 51 of file dof_info.h.
internal::MatrixFreeFunctions::ConstraintValues< Number >::ConstraintValues | ( | ) |
unsigned short internal::MatrixFreeFunctions::ConstraintValues< Number >::insert_entries | ( | const std::vector< std::pair< types::global_dof_index, number2 >> & | entries | ) |
This function inserts some constrained entries to the collection of all values. It stores the (reordered) numbering of the dofs (according to the ordering that matches with the function) in new_indices, and returns the storage position the double array for access later on.
std::vector<std::pair<types::global_dof_index, double> > internal::MatrixFreeFunctions::ConstraintValues< Number >::constraint_entries |
Definition at line 69 of file dof_info.h.
std::vector<types::global_dof_index> internal::MatrixFreeFunctions::ConstraintValues< Number >::constraint_indices |
Definition at line 70 of file dof_info.h.
std::pair<std::vector<Number>, types::global_dof_index> internal::MatrixFreeFunctions::ConstraintValues< Number >::next_constraint |
Definition at line 72 of file dof_info.h.
std::map<std::vector<Number>, types::global_dof_index, FPArrayComparator<Number> > internal::MatrixFreeFunctions::ConstraintValues< Number >::constraints |
Definition at line 76 of file dof_info.h.