* matrix with @p m rows and
* @p n columns.
*/
- CompressedSetSparsityPattern (const unsigned int m,
- const unsigned int n);
+ CompressedSetSparsityPattern (const types::global_dof_index m,
+ const types::global_dof_index n);
/**
* Initialize a square matrix of
* dimension @p n.
*/
- CompressedSetSparsityPattern (const unsigned int n);
+ CompressedSetSparsityPattern (const types::global_dof_index n);
/**
* Copy operator. For this the
* max_entries_per_row() nonzero
* entries per row.
*/
- void reinit (const unsigned int m,
- const unsigned int n);
+ void reinit (const types::global_dof_index m,
+ const types::global_dof_index n);
/**
* Since this object is kept
* matrix. If the entry already
* exists, nothing bad happens.
*/
- void add (const unsigned int i,
- const unsigned int j);
+ void add (const types::global_dof_index i,
+ const types::global_dof_index j);
/**
* Add several nonzero entries to the
* happens.
*/
template <typename ForwardIterator>
- void add_entries (const unsigned int row,
- ForwardIterator begin,
- ForwardIterator end,
- const bool indices_are_sorted = false);
+ void add_entries (const types::global_dof_index row,
+ ForwardIterator begin,
+ ForwardIterator end,
+ const bool indices_are_sorted = false);
/**
* Check if a value at a certain
* position may be non-zero.
*/
- bool exists (const unsigned int i,
- const unsigned int j) const;
+ bool exists (const types::global_dof_index i,
+ const types::global_dof_index j) const;
/**
* Make the sparsity pattern
* matrix, which equals the dimension
* of the image space.
*/
- unsigned int n_rows () const;
+ types::global_dof_index n_rows () const;
/**
* Return number of columns of this
* matrix, which equals the dimension
* of the range space.
*/
- unsigned int n_cols () const;
+ types::global_dof_index n_cols () const;
/**
* Number of entries in a specific row.
*/
- unsigned int row_length (const unsigned int row) const;
+ unsigned int row_length (const types::global_dof_index row) const;
/**
* Return an iterator that can loop over
* row. Dereferencing the iterator yields
* a column index.
*/
- row_iterator row_begin (const unsigned int row) const;
+ row_iterator row_begin (const types::global_dof_index row) const;
/**
* End iterator for the given row.
*/
- row_iterator row_end (const unsigned int row) const;
+ row_iterator row_end (const types::global_dof_index row) const;
/**
* Number of rows that this sparsity
* structure shall represent.
*/
- unsigned int rows;
+ types::global_dof_index rows;
/**
* Number of columns that this sparsity
* structure shall represent.
*/
- unsigned int cols;
+ types::global_dof_index cols;
/**
* For each row of the matrix, store the
* Add the given column number to
* this line.
*/
- void add (const unsigned int col_num);
+ void add (const types::global_dof_index col_num);
/**
* Add the columns specified by the
inline
void
-CompressedSetSparsityPattern::Line::add (const unsigned int j)
+CompressedSetSparsityPattern::Line::add (const types::global_dof_index j)
{
entries.insert (j);
}
inline
-unsigned int
+types::global_dof_index
CompressedSetSparsityPattern::n_rows () const
{
return rows;
inline
-unsigned int
+types::global_dof_index
CompressedSetSparsityPattern::n_cols () const
{
return cols;
inline
void
-CompressedSetSparsityPattern::add (const unsigned int i,
- const unsigned int j)
+CompressedSetSparsityPattern::add (const types::global_dof_index i,
+ const types::global_dof_index j)
{
Assert (i<rows, ExcIndexRange(i, 0, rows));
Assert (j<cols, ExcIndexRange(j, 0, cols));
template <typename ForwardIterator>
inline
void
-CompressedSetSparsityPattern::add_entries (const unsigned int row,
+CompressedSetSparsityPattern::add_entries (const types::global_dof_index row,
ForwardIterator begin,
ForwardIterator end,
const bool /*indices_are_sorted*/)
inline
unsigned int
-CompressedSetSparsityPattern::row_length (const unsigned int row) const
+CompressedSetSparsityPattern::row_length (const types::global_dof_index row) const
{
Assert (row < n_rows(), ExcIndexRange (row, 0, n_rows()));
inline
CompressedSetSparsityPattern::row_iterator
-CompressedSetSparsityPattern::row_begin (const unsigned int row) const
+CompressedSetSparsityPattern::row_begin (const types::global_dof_index row) const
{
return (lines[row].entries.begin ());
}
inline
CompressedSetSparsityPattern::row_iterator
-CompressedSetSparsityPattern::row_end (const unsigned int row) const
+CompressedSetSparsityPattern::row_end (const types::global_dof_index row) const
{
return (lines[row].entries.end ());
}
-CompressedSetSparsityPattern::CompressedSetSparsityPattern (const unsigned int m,
- const unsigned int n)
+CompressedSetSparsityPattern::CompressedSetSparsityPattern (const types::global_dof_index m,
+ const types::global_dof_index n)
:
rows(0),
cols(0)
-CompressedSetSparsityPattern::CompressedSetSparsityPattern (const unsigned int n)
+CompressedSetSparsityPattern::CompressedSetSparsityPattern (const types::global_dof_index n)
:
rows(0),
cols(0)
void
-CompressedSetSparsityPattern::reinit (const unsigned int m,
- const unsigned int n)
+CompressedSetSparsityPattern::reinit (const types::global_dof_index m,
+ const types::global_dof_index n)
{
rows = m;
cols = n;
bool
-CompressedSetSparsityPattern::exists (const unsigned int i,
- const unsigned int j) const
+CompressedSetSparsityPattern::exists (const types::global_dof_index i,
+ const types::global_dof_index j) const
{
Assert (i<rows, ExcIndexRange(i, 0, rows));
Assert (j<cols, ExcIndexRange(j, 0, cols));