index_set.h File Reference

#include <deal.II/base/config.h>
#include <deal.II/base/exceptions.h>
#include <deal.II/base/memory_space.h>
#include <deal.II/base/mpi_stub.h>
#include <deal.II/base/mutex.h>
#include <deal.II/base/trilinos_utilities.h>
#include <deal.II/base/types.h>
#include <deal.II/lac/trilinos_tpetra_types.h>
#include <boost/container/small_vector.hpp>
#include <algorithm>
#include <vector>
#include <Epetra_Map.h>
#include <Tpetra_Map.hpp>
#include <petscis.h>

Go to the source code of this file.

Classes
class	IndexSet
class	IndexSet::IntervalAccessor
class	IndexSet::IntervalIterator
class	IndexSet::ElementIterator
struct	IndexSet::Range

Functions
IndexSet	complete_index_set (const IndexSet::size_type N)

Function Documentation

complete_index_set()

IndexSet complete_index_set ( const IndexSet::size_type N )

inline

Create and return an index set of size that contains every single index within this range. In essence, this function returns an index set created by

IndexSet is (N);
is.add_range(0, N);

This function exists so that one can create and initialize index sets that are complete in one step, or so one can write code like

if (my_index_set == complete_index_set(my_index_set.size())
  ...

Definition at line 1219 of file index_set.h.