![]() |
Reference documentation for deal.II version 8.1.0
|
This is the complete list of members for SparsityPattern, including all inherited members.
add(const size_type i, const size_type j) | SparsityPattern | |
add_entries(const size_type row, ForwardIterator begin, ForwardIterator end, const bool indices_are_sorted=false) | SparsityPattern | |
bandwidth() const | SparsityPattern | |
begin() const | SparsityPattern | |
begin(const size_type r) const | SparsityPattern | |
block_read(std::istream &in) | SparsityPattern | |
block_write(std::ostream &out) const | SparsityPattern | |
ChunkSparseMatrix (defined in SparsityPattern) | SparsityPattern | friend |
ChunkSparsityPattern (defined in SparsityPattern) | SparsityPattern | friend |
ChunkSparsityPatternIterators::Accessor (defined in SparsityPattern) | SparsityPattern | friend |
colnums | SparsityPattern | private |
cols | SparsityPattern | private |
column_number(const size_type row, const unsigned int index) const | SparsityPattern | |
compress() | SparsityPattern | |
compressed | SparsityPattern | private |
const_iterator typedef | SparsityPattern | |
copy_from(const size_type n_rows, const size_type n_cols, const ForwardIterator begin, const ForwardIterator end, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
copy_from(const size_type n_rows, const size_type n_cols, const ForwardIterator begin, const ForwardIterator end) | SparsityPattern | |
copy_from(const CompressedSparsityType &csp, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
copy_from(const CompressedSparsityType &csp) | SparsityPattern | |
copy_from(const FullMatrix< number > &matrix, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
copy_from(const FullMatrix< number > &matrix) | SparsityPattern | |
DeclException0(ExcNotCompressed) | SparsityPattern | |
DeclException0(ExcMatrixIsCompressed) | SparsityPattern | |
DeclException0(ExcInvalidConstructorCall) | SparsityPattern | |
DeclException0(ExcDiagonalNotOptimized) | SparsityPattern | |
DeclException1(ExcInvalidNumberOfPartitions, int,<< "The number of partitions you gave is "<< arg1<< ", but must be greater than zero.") | SparsityPattern | |
DeclException2(ExcNotEnoughSpace, int, int,<< "Upon entering a new entry to row "<< arg1<< ": there was no free entry any more. "<< std::endl<< "(Maximum number of entries for this row: "<< arg2<< "; maybe the matrix is already compressed?)") | SparsityPattern | |
DeclException2(ExcIteratorRange, int, int,<< "The iterators denote a range of "<< arg1<< " elements, but the given number of rows was "<< arg2) | SparsityPattern | |
Subscriptor::DeclException2(ExcNoSubscriber, char *, char *,<< "No subscriber with identifier \""<< arg2<< "\" did subscribe to this object of class "<< arg1) | Subscriptor | |
DeclException3(ExcInUse, int, char *, std::string &,<< "Object of class "<< arg2<< " is still used by "<< arg1<< " other objects.\n"<< "(Additional information: "<< arg3<< ")\n"<< "Note the entry in the Frequently Asked Questions of "<< "deal.II (linked to from http://www.dealii.org/) for "<< "more information on what this error means.") | Subscriptor | |
empty() const | SparsityPattern | |
end() const | SparsityPattern | |
end(const size_type r) const | SparsityPattern | |
exists(const size_type i, const size_type j) const | SparsityPattern | |
get_column_numbers() const DEAL_II_DEPRECATED | SparsityPattern | |
get_rowstart_indices() const DEAL_II_DEPRECATED | SparsityPattern | |
invalid_entry | SparsityPattern | static |
is_compressed() const | SparsityPattern | |
iterator typedef | SparsityPattern | |
list_subscribers() const | Subscriptor | |
load(Archive &ar, const unsigned int version) | SparsityPattern | |
matrix_position(const size_type global_index) const | SparsityPattern | |
max_dim | SparsityPattern | private |
max_entries_per_row() const | SparsityPattern | |
max_row_length | SparsityPattern | private |
max_vec_len | SparsityPattern | private |
memory_consumption() const | SparsityPattern | |
n_cols() const | SparsityPattern | |
n_nonzero_elements() const | SparsityPattern | |
n_rows() const | SparsityPattern | |
n_subscriptions() const | Subscriptor | |
operator()(const size_type i, const size_type j) const | SparsityPattern | |
operator=(const SparsityPattern &) | SparsityPattern | |
Subscriptor::operator=(const Subscriptor &) | Subscriptor | |
operator==(const SparsityPattern &) const | SparsityPattern | |
optimize_diagonal() const DEAL_II_DEPRECATED | SparsityPattern | |
partition(const unsigned int n_partitions, std::vector< unsigned int > &partition_indices) const DEAL_II_DEPRECATED | SparsityPattern | |
print(std::ostream &out) const | SparsityPattern | |
print_gnuplot(std::ostream &out) const | SparsityPattern | |
reinit(const size_type m, const size_type n, const unsigned int max_per_row, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
reinit(const size_type m, const size_type n, const unsigned int max_per_row) | SparsityPattern | |
reinit(const size_type m, const size_type n, const std::vector< unsigned int > &row_lengths, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
reinit(const size_type m, const size_type n, const std::vector< unsigned int > &row_lengths) | SparsityPattern | |
reinit(const size_type m, const size_type n, const VectorSlice< const std::vector< unsigned int > > &row_lengths, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
reinit(const size_type m, const size_type n, const VectorSlice< const std::vector< unsigned int > > &row_lengths) | SparsityPattern | |
row_begin(const size_type r) const DEAL_II_DEPRECATED | SparsityPattern | |
row_end(const size_type r) const DEAL_II_DEPRECATED | SparsityPattern | |
row_iterator typedef | SparsityPattern | |
row_length(const size_type row) const | SparsityPattern | |
row_position(const size_type i, const size_type j) const | SparsityPattern | |
rows | SparsityPattern | private |
rowstart | SparsityPattern | private |
save(Archive &ar, const unsigned int version) const | SparsityPattern | |
serialize(Archive &ar, const unsigned int version) | Subscriptor | inline |
size_type typedef | SparsityPattern | |
SparseILU (defined in SparsityPattern) | SparsityPattern | friend |
SparseLUDecomposition (defined in SparsityPattern) | SparsityPattern | friend |
SparseMatrix class | SparsityPattern | friend |
SparsityPattern() | SparsityPattern | |
SparsityPattern(const SparsityPattern &) | SparsityPattern | |
SparsityPattern(const size_type m, const size_type n, const unsigned int max_per_row, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
SparsityPattern(const size_type m, const size_type n, const unsigned int max_per_row) | SparsityPattern | |
SparsityPattern(const size_type m, const size_type n, const std::vector< unsigned int > &row_lengths, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
SparsityPattern(const size_type m, const size_type n, const std::vector< unsigned int > &row_lengths) | SparsityPattern | |
SparsityPattern(const size_type n, const unsigned int max_per_row) | SparsityPattern | |
SparsityPattern(const size_type m, const std::vector< unsigned int > &row_lengths, const bool optimize_diagonal) DEAL_II_DEPRECATED | SparsityPattern | |
SparsityPattern(const size_type m, const std::vector< unsigned int > &row_lengths) | SparsityPattern | |
SparsityPattern(const SparsityPattern &original, const unsigned int max_per_row, const size_type extra_off_diagonals) | SparsityPattern | |
SparsityPatternIterators::Accessor (defined in SparsityPattern) | SparsityPattern | friend |
SparsityPatternIterators::Iterator class | SparsityPattern | friend |
store_diagonal_first_in_row | SparsityPattern | private |
stores_only_added_elements() const | SparsityPattern | |
subscribe(const char *identifier=0) const | Subscriptor | |
Subscriptor() | Subscriptor | |
Subscriptor(const Subscriptor &) | Subscriptor | |
symmetrize() | SparsityPattern | |
unsubscribe(const char *identifier=0) const | Subscriptor | |
~SparsityPattern() | SparsityPattern | |
~Subscriptor() | Subscriptor | virtual |