Reference documentation for deal.II version 9.5.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
No Matches
Classes | Functions
index_set.h File Reference
#include <deal.II/base/config.h>
#include <deal.II/base/exceptions.h>
#include <deal.II/base/mpi_stub.h>
#include <deal.II/base/mutex.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.


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


IndexSet complete_index_set (const IndexSet::size_type N)

Function Documentation

◆ complete_index_set()

IndexSet complete_index_set ( const IndexSet::size_type  N)

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())
IndexSet complete_index_set(const IndexSet::size_type N)
Definition index_set.h:1089

Definition at line 1089 of file index_set.h.