Zoltan2
Toggle main menu visibility
Loading...
Searching...
No Matches
PrintData.hpp
Go to the documentation of this file.
1
// @HEADER
2
//
3
// ***********************************************************************
4
//
5
// Zoltan2: A package of combinatorial algorithms for scientific computing
6
// Copyright 2012 Sandia Corporation
7
//
8
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9
// the U.S. Government retains certain rights in this software.
10
//
11
// Redistribution and use in source and binary forms, with or without
12
// modification, are permitted provided that the following conditions are
13
// met:
14
//
15
// 1. Redistributions of source code must retain the above copyright
16
// notice, this list of conditions and the following disclaimer.
17
//
18
// 2. Redistributions in binary form must reproduce the above copyright
19
// notice, this list of conditions and the following disclaimer in the
20
// documentation and/or other materials provided with the distribution.
21
//
22
// 3. Neither the name of the Corporation nor the names of the
23
// contributors may be used to endorse or promote products derived from
24
// this software without specific prior written permission.
25
//
26
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37
//
38
// Questions? Contact Karen Devine (kddevin@sandia.gov)
39
// Erik Boman (egboman@sandia.gov)
40
// Siva Rajamanickam (srajama@sandia.gov)
41
//
42
// ***********************************************************************
43
//
44
// @HEADER
45
46
#ifndef PRINTDATA_HPP
47
#define PRINTDATA_HPP
48
49
#include "Zoltan2_config.h"
50
#include "Tpetra_CrsGraph.hpp"
51
#include "Teuchos_ArrayView.hpp"
52
53
#include <iostream>
54
#include <string>
55
56
using
std::string;
57
using
Teuchos::ArrayView;
58
59
template
<
typename
lno_t,
typename
gno_t>
60
void
printTpetraGraph
(
const
Tpetra::CrsGraph<lno_t, gno_t> &graph,
61
std::ostream &os,
size_t
maxSize,
string
info)
62
{
63
size_t
nrows = graph.getLocalNumRows();
64
if
(nrows > maxSize)
65
return
;
66
67
const
RCP<const typename Tpetra::Map<lno_t, gno_t> > &rowMap=
68
graph.getRowMap();
69
const
RCP<const typename Tpetra::Map<lno_t, gno_t> > &colMap=
70
graph.getColMap();
71
72
if
(info.size() > 0)
73
os << info << std::endl;
74
75
if
(graph.isGloballyIndexed()){
76
ArrayView<const gno_t> indices;
77
for
(
size_t
i=0; i < nrows; i++){
78
gno_t
gid = rowMap->getGlobalElement(i);
79
graph.getGlobalRowView(gid, indices);
80
os <<
"Row "
<< gid <<
": "
;
81
for
(
typename
ArrayView<const gno_t>::size_type j=0; j < indices.size(); j++){
82
os << indices[j] <<
" "
;
83
}
84
os << std::endl;
85
}
86
}
87
else
{
88
ArrayView<const lno_t> indices;
89
for
(
size_t
i=0; i < nrows; i++){
90
gno_t
gid = rowMap->getGlobalElement(i);
91
graph.getLocalRowView(i, indices);
92
os <<
"Row "
<< gid <<
": "
;
93
for
(
typename
ArrayView<const lno_t>::size_type j=0; j < indices.size(); j++){
94
os << colMap->getGlobalElement(indices[j]) <<
" "
;
95
}
96
os << std::endl;
97
}
98
}
99
}
100
101
template
<
typename
lno_t,
typename
gno_t>
102
void
printTpetraGraph
(
const
RCP<
const
Comm<int> > &comm,
103
const
Tpetra::CrsGraph<lno_t, gno_t> &graph, std::ostream &os,
104
size_t
maxSize,
string
info)
105
{
106
int
rank = comm->getRank();
107
std::ostringstream oss;
108
oss <<
"rank "
<< rank;
109
110
comm->barrier();
111
if
(rank==0)
112
os << info << std::endl;
113
comm->barrier();
114
115
for
(
int
p=0; p < comm->getSize(); p++){
116
if
(p == rank)
117
printTpetraGraph<lno_t, gno_t>
(graph, os, maxSize, oss.str());
118
comm->barrier();
119
}
120
}
121
122
#endif
printTpetraGraph
void printTpetraGraph(const Tpetra::CrsGraph< lno_t, gno_t > &graph, std::ostream &os, size_t maxSize, string info)
Definition
PrintData.hpp:60
gno_t
map_t::global_ordinal_type gno_t
Definition
mapRemotes.cpp:18
test
core
helpers
PrintData.hpp
Generated by
1.17.0