#include <deal.II/base/config.h>
#include <deal.II/base/utilities.h>
#include <deal.II/base/exceptions.h>
-
#include <vector>
#include <algorithm>
* a member of this index set, i.e. if
* is_element(global_index) is false.
*/
- unsigned int index_within_set (const types::global_dof_index global_index) const;
+ types::global_dof_index index_within_set (const types::global_dof_index global_index) const;
/**
* Each index set can be
inline
-unsigned int
+types::global_dof_index
IndexSet::index_within_set (const types::global_dof_index n) const
{
// to make this call thread-safe, compress()
* @ingroup Exceptions
*/
DeclException4 (ExcEntryAlreadyExists,
- int, int, double, double,
+ size_type, size_type, double, double,
<< "The entry for the indices " << arg1 << " and "
<< arg2 << " already exists, but the values "
<< arg3 << " (old) and " << arg4 << " (new) differ "
* @ingroup Exceptions
*/
DeclException1 (ExcDoFIsConstrainedFromBothObjects,
- int,
+ size_type,
<< "Degree of freedom " << arg1
<< " is constrained from both object in a merge operation.");
/**
* @ingroup Exceptions
*/
DeclException1 (ExcDoFIsConstrainedToConstrainedDoF,
- int,
+ size_type,
<< "In the given argument a degree of freedom is constrained "
<< "to another DoF with number " << arg1
<< ", which however is constrained by this object. This is not"
* @ingroup Exceptions
*/
DeclException1 (ExcRowNotStoredHere,
- int,
+ size_type,
<< "The index set given to this constraint matrix indicates "
<< "constraints for degree of freedom " << arg1
<< " should not be stored by this object, but a constraint "
SparsityPattern::iterator
SparsityPattern::begin (const size_type r) const
{
- Assert (r<n_rows(), ExcIndexRange(r,0,n_rows()));
+ Assert (r<n_rows(), ExcIndexRangeType<size_type>(r,0,n_rows()));
return iterator(this, rowstart[r]);
}
SparsityPattern::iterator
SparsityPattern::end (const size_type r) const
{
- Assert (r<n_rows(), ExcIndexRange(r,0,n_rows()));
+ Assert (r<n_rows(), ExcIndexRangeType<size_type>(r,0,n_rows()));
return iterator(this, rowstart[r+1]);
}
SparsityPattern::row_iterator
SparsityPattern::row_begin (const size_type r) const
{
- Assert (r<n_rows(), ExcIndexRange(r,0,n_rows()));
+ Assert (r<n_rows(), ExcIndexRangeType<size_type>(r,0,n_rows()));
return &colnums[rowstart[r]];
}
SparsityPattern::row_iterator
SparsityPattern::row_end (const size_type r) const
{
- Assert (r<n_rows(), ExcIndexRange(r,0,n_rows()));
+ Assert (r<n_rows(), ExcIndexRangeType<size_type>(r,0,n_rows()));
return &colnums[rowstart[r+1]];
}
SparsityPattern::size_type
SparsityPattern::row_length (const size_type row) const
{
- Assert(row<rows, ExcIndexRange(row,0,rows));
+ Assert(row<rows, ExcIndexRangeType<size_type>(row,0,rows));
return rowstart[row+1]-rowstart[row];
}
SparsityPattern::column_number (const size_type row,
const size_type index) const
{
- Assert(row<rows, ExcIndexRange(row,0,rows));
- Assert(index<row_length(row), ExcIndexRange(index,0,row_length(row)));
+ Assert(row<rows, ExcIndexRangeType<size_type>(row,0,rows));
+ Assert(index<row_length(row), ExcIndexRangeType<size_type>(index,0,row_length(row)));
return colnums[rowstart[row]+index];
}