1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/****************************************************************/
/* Parallel Combinatorial BLAS Library (for Graph Computations) */
/* version 1.6 -------------------------------------------------*/
/* date: 6/15/2017 ---------------------------------------------*/
/* authors: Ariful Azad, Aydin Buluc --------------------------*/
/****************************************************************/
/*
Copyright (c) 2010-2017, The Regents of the University of California
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include <cstdlib>
#include "SpMat.h"
#include "Friends.h"
namespace combblas {
template <class IT, class NT, class DER>
SpMat<IT, NT, DER> SpMat<IT, NT, DER>::operator() (const std::vector<IT> & ri, const std::vector<IT> & ci) const
{
if( (!ci.empty()) && (ci.back() > getncol()))
{
std::cerr << "Col indices out of bounds" << std::endl;
abort();
}
if( (!ri.empty()) && (ri.back() > getnrow()))
{
std::cerr << "Row indices out of bounds" << std::endl;
abort();
}
return ((static_cast<DER>(*this)) (ri, ci));
}
template <class IT, class NT, class DER>
bool SpMat<IT, NT, DER>::operator== (const SpMat<IT, NT, DER> & rhs) const
{
return ((static_cast<DER &>(*this)) == (static_cast<DER &>(rhs)) );
}
template <class IT, class NT, class DER>
void SpMat<IT, NT, DER>::Split( SpMat< IT,NT,DER > & partA, SpMat< IT,NT,DER > & partB)
{
static_cast< DER* >(this)->Split(static_cast< DER & >(partA), static_cast< DER & >(partB));
}
template <class IT, class NT, class DER>
void SpMat<IT, NT, DER>::Merge( SpMat< IT,NT,DER > & partA, SpMat< IT,NT,DER > & partB)
{
static_cast< DER* >(this)->Merge(static_cast< DER & >(partA), static_cast< DER & >(partB));
}
template <class IT, class NT, class DER>
template <typename SR>
void SpMat<IT, NT, DER>::SpGEMM(SpMat<IT, NT, DER> & A,
SpMat<IT, NT, DER> & B, bool isAT, bool isBT)
{
IT A_m, A_n, B_m, B_n;
if(isAT)
{
A_m = A.getncol();
A_n = A.getnrow();
}
else
{
A_m = A.getnrow();
A_n = A.getncol();
}
if(isBT)
{
B_m = B.getncol();
B_n = B.getnrow();
}
else
{
B_m = B.getnrow();
B_n = B.getncol();
}
if(getnrow() == A_m && getncol() == B_n)
{
if(A_n == B_m)
{
if(isAT && isBT)
{
static_cast< DER* >(this)->template PlusEq_AtXBt< SR >(static_cast< DER & >(A), static_cast< DER & >(B));
}
else if(isAT && (!isBT))
{
static_cast< DER* >(this)->template PlusEq_AtXBn< SR >(static_cast< DER & >(A), static_cast< DER & >(B));
}
else if((!isAT) && isBT)
{
static_cast< DER* >(this)->template PlusEq_AnXBt< SR >(static_cast< DER & >(A), static_cast< DER & >(B));
}
else
{
static_cast< DER* >(this)->template PlusEq_AnXBn< SR >(static_cast< DER & >(A), static_cast< DER & >(B));
}
}
else
{
std::cerr <<"Not multipliable: " << A_n << "!=" << B_m << std::endl;
}
}
else
{
std::cerr<< "Not addable: "<< getnrow() << "!=" << A_m << " or " << getncol() << "!=" << B_n << std::endl;
}
};
template<typename SR, typename NUO, typename IU, typename NU1, typename NU2, typename DER1, typename DER2>
SpTuples<IU, NUO> * MultiplyReturnTuples
(const SpMat<IU, NU1, DER1> & A,
const SpMat<IU, NU2, DER2> & B,
bool isAT, bool isBT,
bool clearA = false, bool clearB = false)
{
IU A_n, B_m;
if(isAT)
{
A_n = A.getnrow();
}
else
{
A_n = A.getncol();
}
if(isBT)
{
B_m = B.getncol();
}
else
{
B_m = B.getnrow();
}
if(A_n == B_m)
{
if(isAT && isBT)
{
return Tuples_AtXBt<SR, NUO>(static_cast< const DER1 & >(A), static_cast< const DER2 & >(B), clearA, clearB);
}
else if(isAT && (!isBT))
{
return Tuples_AtXBn<SR, NUO>(static_cast< const DER1 & >(A), static_cast< const DER2 & >(B), clearA, clearB);
}
else if((!isAT) && isBT)
{
return Tuples_AnXBt<SR, NUO>(static_cast< const DER1 & >(A), static_cast< const DER2 & >(B), clearA, clearB);
}
else
{
return Tuples_AnXBn<SR, NUO>(static_cast< const DER1 & >(A), static_cast< const DER2 & >(B), clearA, clearB);
}
}
else
{
std::cerr <<"Not multipliable: " << A_n << "!=" << B_m << std::endl;
return new SpTuples<IU, NUO> (0, 0, 0);
}
}
template <class IT, class NT, class DER>
inline std::ofstream& SpMat<IT, NT, DER>::put(std::ofstream& outfile) const
{
return static_cast<const DER*>(this)->put(outfile);
}
template <class IT, class NT, class DER>
inline std::ifstream& SpMat<IT, NT, DER>::get(std::ifstream& infile)
{
std::cout << "Getting... SpMat" << std::endl;
return static_cast<DER*>(this)->get(infile);
}
template < typename UIT, typename UNT, typename UDER >
std::ofstream& operator<<(std::ofstream& outfile, const SpMat< UIT,UNT,UDER > & s)
{
return s.put(outfile);
}
template < typename UIT, typename UNT, typename UDER >
std::ifstream& operator>> (std::ifstream& infile, SpMat< UIT,UNT,UDER > & s)
{
return s.get(infile);
}
}
|
