-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathSplitTuples.h
74 lines (63 loc) · 1.64 KB
/
SplitTuples.h
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
#ifndef _SplitTuples_H_
#define _SplitTuples_H_
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cassert>
#include <tuple>
#include <numeric>
#include "CSC.h"
#include "CSR.h"
using namespace std;
template <class IT, class NT>
class SplitTuples
{
public:
SplitTuples (CSC<IT,NT>& A, int numsplits);
SplitTuples (CSR<IT,NT>& A, int numsplits);
IT rows;
IT cols;
IT nnz;
int splits;
std::vector<std::vector<std::tuple<IT, IT, NT>>> splitTuples;
};
template <class IT, class NT>
SplitTuples<IT,NT>::SplitTuples(CSC<IT, NT> & A, int numsplits)
{
rows = A.rows;
cols = A.cols;
nnz = A.nnz;
splits = numsplits;
splitTuples.resize(numsplits);
IT perpiece = A.rows / splits;
for (IT i=0; i < A.cols; ++i)
{
for (IT j = A.colptr[i]; j < A.colptr[i+1]; ++j)
{
IT rowid = A.rowids[j];
IT owner = std::min(rowid / perpiece, static_cast<IT>(numsplits-1));
splitTuples[owner].push_back(std::make_tuple(rowid, i, A.values[j]));
}
}
}
template <class IT, class NT>
SplitTuples<IT,NT>::SplitTuples(CSR<IT, NT> & A, int numsplits)
{
rows = A.rows;
cols = A.cols;
nnz = A.nnz;
splits = numsplits;
splitTuples.resize(numsplits);
IT perpiece = A.cols / splits;
for (IT i=0; i < A.rows; ++i)
{
IT owner = std::min(i / perpiece, static_cast<IT>(numsplits-1));
for (IT j = A.rowptr[i]; j < A.rowptr[i+1]; ++j)
{
IT colid = A.colids[j];
splitTuples[owner].push_back(std::make_tuple(i % perpiece, colid, A.values[j]));
}
}
}
#endif