Skip to content

Commit

Permalink
MultiArray2d.cpp (+2) [8+/4-] - code style
Browse files Browse the repository at this point in the history
  • Loading branch information
skynowa committed Jan 2, 2025
1 parent b9c371f commit a6b456d
Show file tree
Hide file tree
Showing 2 changed files with 8 additions and 4 deletions.
6 changes: 4 additions & 2 deletions Libs/Boost/MultiArray2d.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -33,12 +33,14 @@ int main(int argc, char **argv)
boost::multi_array<double, 2> A(boost::extents[n][m]);

for (std::size_t i = 0; i < n; i++)
for (std::size_t j = 0; j < m; j++) A[i][j] = i * m + j;
for (std::size_t j = 0; j < m; j++)
A[i][j] = i * m + j;

boost::multi_array<double, 2> B(boost::extents[n][m]);

for (std::size_t i = 0; i < n; i++)
for (std::size_t j = 0; j < m; j++) B[i][j] = i * m + j + 0.5;
for (std::size_t j = 0; j < m; j++)
B[i][j] = i * m + j + 0.5;

print(A);
print(B);
Expand Down
6 changes: 4 additions & 2 deletions Libs/Boost/MultiArray3d.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -36,13 +36,15 @@ int main(int argc, char **argv)

for (std::size_t i = 0; i < o; i++)
for (std::size_t j = 0; j < n; j++)
for (std::size_t k = 0; k < m; k++) A[i][j][k] = i * m * n + j * m + k;
for (std::size_t k = 0; k < m; k++)
A[i][j][k] = i * m * n + j * m + k;

boost::multi_array<double, 3> B(boost::extents[o][n][m]);

for (std::size_t i = 0; i < o; i++)
for (std::size_t j = 0; j < n; j++)
for (std::size_t k = 0; k < m; k++) B[i][j][k] = i * m * n + j * m + k + 0.5;
for (std::size_t k = 0; k < m; k++)
B[i][j][k] = i * m * n + j * m + k + 0.5;

print(A);
print(B);
Expand Down

0 comments on commit a6b456d

Please sign in to comment.