-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMapMatrix.hpp
More file actions
243 lines (199 loc) · 5.58 KB
/
Copy pathMapMatrix.hpp
File metadata and controls
243 lines (199 loc) · 5.58 KB
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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
#ifndef MAP_MATRIX_HPP
#define MAP_MATRIX_HPP
using namespace std;
#include <map>
#include <fstream>
#include <string>
#include <sstream>
#include <cassert>
template <typename type_t>
class MapMatrix{
public:
int nr;
int nc;
typedef tuple<int, int> NxN;
map<NxN, type_t> data;
MapMatrix(const int& nr=0, const int& nc=0){
/* Constructor. */
this->nr = nr;
this->nc = nc;
}
MapMatrix(const MapMatrix& M){
/* Constructor. */
this->nr = M.nr;
this->nc = M.nc;
this->data = M.data;
}
MapMatrix operator =(const MapMatrix& M){
/* Equal operator. */
return MapMatrix(M);
}
void insert(const int& i, const int& j, const type_t& v){
// Checking if j,k are correct indices.
assert(0<=i && i<nr && 0<=j && j<nc);
// Inserting.
NxN key = {i, j};
this->data[key] = v;
}
double& operator()(const int& i, const int& j){
NxN key = {i, j};
return data[key];
}
void operator +=(MapMatrix& M){
/* Self-adds with a MapMatrix. */
assert(this->nc == M.nc && this->nr == M.nr);
for (auto it = M.data.begin(); it != M.data.end(); it++){
NxN key = it->first;
this->data[key] += M.data[key];
}
}
void operator *=(MapMatrix& M2){
/* Self-multiplies with a MapMatrix.
Can probably be done in nlogn.
*/
MapMatrix& M1 = *this;
assert(M1.nc == M2.nr);
MapMatrix res(M1.nr, M2.nc);
for (auto it = M1.data.begin(); it != M1.data.end(); it++){
for (auto it2 = M2.data.begin(); it2 != M2.data.end(); it2++){
int i1 = get<0> (it->first);
int j1 = get<1> (it->first);
int i2 = get<0> (it2->first);
int j2 = get<1> (it2->first);
if (j1 == i2){
NxN key = {i1, j2};
res.data[key] += it->second * it2->second;
}
}
}
*this = MapMatrix(res);
}
void operator *=(type_t l){
/* Self-multiplies with a type_t. */
for (auto it = this->data.begin(); it != this->data.end(); it++){
// this->data[it->first] *= l;
it->second *= l; // Cela fonctionne;
}
}
MapMatrix operator +(MapMatrix& M2){
/* Adds two MapMatrix. */
MapMatrix& M1 = *this;
assert(M1.nc == M2.nc && M1.nr == M2.nr);
MapMatrix res(M1.nr, M1.nc);
for (auto it = M1.data.begin(); it != M1.data.end(); it++){
NxN key = it->first;
res.data[key] += M1.data[key];
}
for (auto it = M2.data.begin(); it != M2.data.end(); it++){
NxN key = it->first;
res.data[key] += M2.data[key];
}
return res;
}
MapMatrix operator *(MapMatrix& M2){
/* Multiplies two MapMatrix. */
MapMatrix& M1 = *this;
assert(M1.nc == M2.nr);
MapMatrix res(M1.nr, M2.nc);
for (auto it = M1.data.begin(); it != M1.data.end(); it++){
for (auto it2 = M2.data.begin(); it2 != M2.data.end(); it2++){
int i1 = get<0> (it->first);
int j1 = get<1> (it->first);
int i2 = get<0> (it2->first);
int j2 = get<1> (it2->first);
if (j1 == i2){
// NxN key = {i1, j2};
// res.data[key] += it->second * it2->second;
res.insert(i1, j2, it->second* it2->second);
}
}
}
return res;
}
vector<type_t> operator *(vector<type_t> V){
/* Multiplies a MapMatrix with a vector. */
assert(((size_t) this->nc) == V.size());
vector<type_t> res(this->nr);
for (auto it = this->data.begin(); it != this->data.end(); it++){
int i = get<0> (it->first);
int j = get<1> (it->first);
res[i] += this->data[it->first] * V[j];
}
return res;
}
friend const int& NbRow(const MapMatrix& M){
return M.nr;
}
friend const int& NbCol(const MapMatrix& M){
return M.nc;
}
};
template<typename type_t>
ostream& operator <<(ostream& o, const MapMatrix<type_t>& M){
/* Output stream operator. */
for (auto it = M.data.begin(); it != M.data.end(); it++){
tuple<int, int> key = it->first;
int i = get<0> (key);
int j = get<1> (key);
o << "(" << i << "," << j << "): \t" << it->second << "\n";
}
return o;
}
template<typename type_t>
MapMatrix<type_t> operator *(type_t l, MapMatrix<type_t>& M){
/* Operator: Multiplies a type_t (left) with a MapMatrix (right). */
MapMatrix<type_t> res(M.nr, M.nc);
for (auto it = M.data.begin(); it != M.data.end(); it++){
res.data[it->first] = l * it->second;
}
return res;
}
MapMatrix<double> LoadMapMatrix(const string& filename){
/* Reads a file and construct the MapMatrix. */
fstream f;
f.open(filename);
if (f.is_open() == false){
cout << "File is not open !" << endl;
return MapMatrix<double> (0, 0);
}
string line;
istringstream iss;
if (!getline(f, line)){
cout << "Line is not read !" << endl;
return MapMatrix<double> (0, 0);
}
istringstream ss(line);
int nr;
int nc;
ss >> nr >> nc;
cout << "NR = " << nr << endl << "NC = " << nc << endl;
MapMatrix<double> res(nr, nc);
int row, col;
double val;
while (getline(f, line)) {
istringstream ss(line); // input string -> stream;
ss >> row >> col >> val;
res.insert(row, col, val);
iss.clear();
}
f.close();
return res;
}
void Write(const string& filename, const MapMatrix<double>& m){
/* Writes an matrix into a file. */
ofstream f;
f.open(filename);
if (!f.is_open()){
cout << "Error f.open: NOT OPEN !" << endl;
}
f << m.nr << " " << m.nc << endl;
for (auto it = m.data.begin(); it != m.data.end(); it++){
int i = get<0> (it->first);
int j = get<1> (it->first);
double value = it->second;
f << i << " " << j << " " << value << endl;
cout << i << " " << j << " " << value << endl;
}
f.close();
}
#endif