index_set.h File Reference

#include <deal.II/base/config.h>
#include <deal.II/base/exceptions.h>
#include <deal.II/base/thread_management.h>
#include <deal.II/base/utilities.h>
#include <boost/serialization/vector.hpp>
#include <algorithm>
#include <iterator>
#include <vector>
#include <Epetra_Map.h>
#include <Tpetra_Map.hpp>
#include <mpi.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 \(N\) 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 1013 of file index_set.h.