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
|
/*
Copyright (c) 2005-2021 Intel Corporation
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#ifndef TBB_examples_parallel_preorder_matrix_H
#define TBB_examples_parallel_preorder_matrix_H
class Matrix {
static const int n = 20;
float array[n][n];
public:
Matrix() {}
Matrix(float z) {
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
array[i][j] = i == j ? z : 0;
}
friend Matrix operator-(const Matrix& x) {
Matrix result;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
result.array[i][j] = -x.array[i][j];
return result;
}
friend Matrix operator+(const Matrix& x, const Matrix& y) {
Matrix result;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
result.array[i][j] = x.array[i][j] + y.array[i][j];
return result;
}
friend Matrix operator-(const Matrix& x, const Matrix& y) {
Matrix result;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
result.array[i][j] = x.array[i][j] - y.array[i][j];
return result;
}
friend Matrix operator*(const Matrix& x, const Matrix& y) {
Matrix result(0);
for (int i = 0; i < n; ++i)
for (int k = 0; k < n; ++k)
for (int j = 0; j < n; ++j)
result.array[i][j] += x.array[i][k] * y.array[k][j];
return result;
}
};
#endif /* TBB_examples_parallel_preorder_matrix_H */
|
