libMesh::SparsityPattern Namespace Reference


class  Graph
class  NonlocalGraph
class  Build


typedef std::vector
< dof_id_type,
< dof_id_type > > 


template<typename BidirectionalIterator >
static void sort_row (const BidirectionalIterator begin, BidirectionalIterator middle, const BidirectionalIterator end)
void _dummy_function (void)

Detailed Description

This defines the sparsity pattern, or graph, of a sparse matrix. The format is quite simple – the global indices of the nonzero entries in each row are packed into a vector. The global indices (i,j) of the nth nonzero entry of row i are given by j = sparsity_pattern[i][n];

Typedef Documentation

Function Documentation

void libMesh::SparsityPattern::_dummy_function ( void  )

Dummy function that does nothing but can be used to prohibit compiler optimization in some situations where some compilers have optimization bugs.

Definition at line 2197 of file dof_map.C.

2198 {
2199 }
template<typename BidirectionalIterator >
static void libMesh::SparsityPattern::sort_row ( const BidirectionalIterator  begin,
BidirectionalIterator  middle,
const BidirectionalIterator  end 

Splices the two sorted ranges [begin,middle) and [middle,end) into one sorted range [begin,end). This method is much like std::inplace_merge except it assumes the intersection of the two sorted ranges is empty and that any element in each range occurs only once in that range. Additionally, this sort occurs in-place, while std::inplace_merge may use a temporary buffer.

Referenced by libMesh::SparsityPattern::Build::operator()().

Site Created By: libMesh Developers
Last modified: February 07 2014 16:57:33 UTC

Hosted By: Logo