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
|
/****************************************************************/
/* 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.
*/
#ifndef _SP_MAT_H
#define _SP_MAT_H
#include <iostream>
#include <vector>
#include <utility>
#include "CombBLAS.h"
#include "SpDefs.h"
#include "promote.h"
#include "LocArr.h"
namespace combblas {
// Forward declaration (required since a friend function returns a SpTuples object)
template <class IU, class NU>
class SpTuples;
/**
** The abstract base class for all derived sequential sparse matrix classes
** Contains no data members, hence no copy constructor/assignment operator
** Uses static polymorphism through curiously recurring templates (CRTP)
** Template parameters: IT (index type), NT (numerical type), DER (derived class type)
**/
template < class IT, class NT, class DER >
class SpMat
{
public:
//! Standard destructor, copy ctor and assignment are generated by compiler, they all do nothing !
//! Default constructor also exists, and does nothing more than creating Base<Derived>() and Derived() objects
//! One has to call one of the overloaded create functions to get an nonempty object
void Create(const std::vector<IT> & essentials)
{
static_cast<DER*>(this)->CreateImpl(essentials);
}
void Create(IT size, IT nRow, IT nCol, std::tuple<IT, IT, NT> * mytuples)
{
static_cast<DER*>(this)->CreateImpl(size, nRow, nCol, mytuples);
}
SpMat< IT,NT,DER > operator() (const std::vector<IT> & ri, const std::vector<IT> & ci) const;
template <typename SR>
void SpGEMM( SpMat< IT,NT,DER > & A, SpMat< IT,NT,DER > & B, bool isAT, bool isBT);
// ABAB: A semiring elementwise operation with automatic type promotion is required for completeness (should cover +/- and .* ?)
// ABAB: A neat version of ConvertNumericType should be in base class (an operator SpMat<NIT,NNT,NDER>())
void Split( SpMat< IT,NT,DER > & partA, SpMat< IT,NT,DER > & partB);
void Merge( SpMat< IT,NT,DER > & partA, SpMat< IT,NT,DER > & partB);
Arr<IT,NT> GetArrays() const
{
return static_cast<const DER*>(this)->GetArrays();
}
std::vector<IT> GetEssentials() const
{
return static_cast<const DER*>(this)->GetEssentials();
}
auto GetInternal() const
{
return static_cast<const DER*>(this)->GetInternal();
}
auto GetInternal(int i) const
{
return static_cast<const DER*>(this)->GetInternal(i);
}
int getnsplit() const // \TODO: Normalize the interface so that nsplit = 1 for serial cases
{
return static_cast<const DER*>(this)->getnsplit();
}
void Transpose()
{
static_cast<DER*>(this)->Transpose();
}
auto begcol() // serial version
{
return static_cast<DER*>(this)->begcol();
}
auto endcol() //serial version
{
return static_cast<DER*>(this)->endcol();
}
auto begcol(int i) // multithreaded version
{
return static_cast<DER*>(this)->begcol(i);
}
auto endcol(int i) //multithreaded version
{
return static_cast<DER*>(this)->endcol(i);
}
template <typename X = DER> // <-- (requires C++0x to have a default)
auto begnz(const typename X::SpColIter & ccol) //!< Return the beginning iterator for the nonzeros of the current column
{
return static_cast<DER*>(this)->begnz(ccol);
}
template <typename X = DER> // <-- (requires C++0x to have a default)
auto endnz(const typename X::SpColIter & ccol) //!< Return the ending iterator for the nonzeros of the current column
{
return static_cast<DER*>(this)->endnz(ccol);
}
template <typename X = DER> // <-- (requires C++0x to have a default)
auto begnz(const typename X::SpColIter & ccol, int i) //!< multithreaded version
{
return static_cast<DER*>(this)->begnz(ccol, i);
}
template <typename X = DER> // <-- (requires C++0x to have a default)
auto endnz(const typename X::SpColIter & ccol, int i) //!< multithreaded version
{
return static_cast<DER*>(this)->endnz(ccol, i);
}
bool operator== (const SpMat< IT,NT,DER > & rhs) const;
std::ofstream& put(std::ofstream& outfile) const;
std::ifstream& get(std::ifstream& infile);
bool isZero() const { return static_cast<const DER*>(this)->isZero(); }
IT getnrow() const { return static_cast<const DER*>(this)->getnrow(); }
IT getncol() const { return static_cast<const DER*>(this)->getncol(); }
IT getnnz() const { return static_cast<const DER*>(this)->getnnz(); }
protected:
template < typename UIT, typename UNT, typename UDER >
friend std::ofstream& operator<< (std::ofstream& outfile, const SpMat< UIT,UNT,UDER > & s);
template < typename UIT, typename UNT, typename UDER >
friend std::ifstream& operator>> (std::ifstream& infile, SpMat< UIT,UNT,UDER > & s);
//! Returns a pointer to SpTuples, in order to avoid temporaries
//! It is the caller's responsibility to delete the returned pointer afterwards
template< class SR, class NUO, class IU, class NU1, class NU2, class DER1, class DER2 >
friend SpTuples< IU, NUO > *
MultiplyReturnTuples (const SpMat< IU, NU1, DER1 > & A, const SpMat< IU, NU2, DER2 > & B, bool isAT, bool isBT, bool clearA, bool clearB);
};
}
#include "SpMat.cpp"
#endif
|
