EpetraExt Development
Loading...
Searching...
No Matches
EpetraExt_View_CrsGraph.cpp
Go to the documentation of this file.
1//@HEADER
2// ***********************************************************************
3//
4// EpetraExt: Epetra Extended - Linear Algebra Services Package
5// Copyright (2011) Sandia Corporation
6//
7// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
8// the U.S. Government retains certain rights in this software.
9//
10// Redistribution and use in source and binary forms, with or without
11// modification, are permitted provided that the following conditions are
12// met:
13//
14// 1. Redistributions of source code must retain the above copyright
15// notice, this list of conditions and the following disclaimer.
16//
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// 3. Neither the name of the Corporation nor the names of the
22// contributors may be used to endorse or promote products derived from
23// this software without specific prior written permission.
24//
25// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36//
37// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
38//
39// ***********************************************************************
40//@HEADER
41
43
44#include <Epetra_CrsGraph.h>
45#include <Epetra_BlockMap.h>
46
47#include <vector>
48
49namespace EpetraExt {
50
53{
54 if( newObj_ ) delete newObj_;
55}
56
59operator()( OriginalTypeRef orig )
60{
61 origObj_ = &orig;
62
63 //Error, must be local indices
64 assert( !orig.IndicesAreGlobal() );
65
66 //test maps, new std::map must be left subset of old
67 const Epetra_BlockMap & oRowMap = orig.RowMap();
68 const Epetra_BlockMap & oColMap = orig.ColMap();
69
70 int nNumRows = NewRowMap_->NumMyElements();
71 int nNumCols = 0;
72 if( NewColMap_ ) nNumCols = NewColMap_->NumMyElements();
73
74 bool matched = true;
75 for( int i = 0; i < nNumRows; ++i )
76 matched = matched && ( oRowMap.GID64(i) == NewRowMap_->GID64(i) );
77 if( nNumCols )
78 for( int i = 0; i < nNumCols; ++i )
79 matched = matched && ( oColMap.GID64(i) == NewColMap_->GID64(i) );
80
81 if( !matched ) std::cout << "EDT_CrsGraph_View: Bad Row or Col Mapping\n";
82 assert( matched );
83
84 //intial construction of graph
85 std::vector<int> numIndices( nNumRows );
86 std::vector<int*> indices( nNumRows );
87 for( int i = 0; i < nNumRows; ++i )
88 {
89 orig.ExtractMyRowView( i, numIndices[i], indices[i] );
90 int j = 0;
91 if( nNumCols )
92 {
93 while( j < numIndices[i] && NewColMap_->GID64(indices[i][j]) != -1 ) ++j;
94 numIndices[i] = j;
95 }
96 }
97
98 Epetra_CrsGraph * newGraph( new Epetra_CrsGraph( View,
99 *NewRowMap_,
100 *NewColMap_,
101 &numIndices[0] ) );
102
103 //insert views of row indices
104 for( int i = 0; i < nNumRows; ++i )
105 newGraph->InsertMyIndices( i, numIndices[i], indices[i] );
106
107 newGraph->FillComplete();
108
109 newObj_ = newGraph;
110
111 return *newGraph;
112}
113
114} // namespace EpetraExt
115
View
NewTypeRef operator()(OriginalTypeRef orig)
Transformation Operator.
EpetraExt::BlockCrsMatrix: A class for constructing a distributed block matrix.