mirror of
https://github.com/schrodinger/pymol-open-source.git
synced 2026-06-05 20:14:24 +08:00
237 lines
3.7 KiB
C++
237 lines
3.7 KiB
C++
|
|
|
|
#ifndef TNT_ARRAY3D_UTILS_H
|
|
#define TNT_ARRAY3D_UTILS_H
|
|
|
|
#include <cstdlib>
|
|
#include <cassert>
|
|
|
|
namespace TNT
|
|
{
|
|
|
|
|
|
template <class T>
|
|
std::ostream& operator<<(std::ostream &s, const Array3D<T> &A)
|
|
{
|
|
int M=A.dim1();
|
|
int N=A.dim2();
|
|
int K=A.dim3();
|
|
|
|
s << M << " " << N << " " << K << "\n";
|
|
|
|
for (int i=0; i<M; i++)
|
|
{
|
|
for (int j=0; j<N; j++)
|
|
{
|
|
for (int k=0; k<K; k++)
|
|
s << A[i][j][k] << " ";
|
|
s << "\n";
|
|
}
|
|
s << "\n";
|
|
}
|
|
|
|
|
|
return s;
|
|
}
|
|
|
|
template <class T>
|
|
std::istream& operator>>(std::istream &s, Array3D<T> &A)
|
|
{
|
|
|
|
int M, N, K;
|
|
|
|
s >> M >> N >> K;
|
|
|
|
Array3D<T> B(M,N,K);
|
|
|
|
for (int i=0; i<M; i++)
|
|
for (int j=0; j<N; j++)
|
|
for (int k=0; k<K; k++)
|
|
s >> B[i][j][k];
|
|
|
|
A = B;
|
|
return s;
|
|
}
|
|
|
|
|
|
|
|
template <class T>
|
|
Array3D<T> operator+(const Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() != m || B.dim2() != n || B.dim3() != p )
|
|
return Array3D<T>();
|
|
|
|
else
|
|
{
|
|
Array3D<T> C(m,n,p);
|
|
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
C[i][j][k] = A[i][j][k] + B[i][j][k];
|
|
|
|
return C;
|
|
}
|
|
}
|
|
|
|
|
|
template <class T>
|
|
Array3D<T> operator-(const Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() != m || B.dim2() != n || B.dim3() != p )
|
|
return Array3D<T>();
|
|
|
|
else
|
|
{
|
|
Array3D<T> C(m,n,p);
|
|
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
C[i][j][k] = A[i][j][k] - B[i][j][k];
|
|
|
|
return C;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
template <class T>
|
|
Array3D<T> operator*(const Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() != m || B.dim2() != n || B.dim3() != p )
|
|
return Array3D<T>();
|
|
|
|
else
|
|
{
|
|
Array3D<T> C(m,n,p);
|
|
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
C[i][j][k] = A[i][j][k] * B[i][j][k];
|
|
|
|
return C;
|
|
}
|
|
}
|
|
|
|
|
|
template <class T>
|
|
Array3D<T> operator/(const Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() != m || B.dim2() != n || B.dim3() != p )
|
|
return Array3D<T>();
|
|
|
|
else
|
|
{
|
|
Array3D<T> C(m,n,p);
|
|
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
C[i][j][k] = A[i][j][k] / B[i][j][k];
|
|
|
|
return C;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template <class T>
|
|
Array3D<T>& operator+=(Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() == m && B.dim2() == n && B.dim3() == p )
|
|
{
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
A[i][j][k] += B[i][j][k];
|
|
}
|
|
|
|
return A;
|
|
}
|
|
|
|
template <class T>
|
|
Array3D<T>& operator-=(Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() == m && B.dim2() == n && B.dim3() == p )
|
|
{
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
A[i][j][k] -= B[i][j][k];
|
|
}
|
|
|
|
return A;
|
|
}
|
|
|
|
template <class T>
|
|
Array3D<T>& operator*=(Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() == m && B.dim2() == n && B.dim3() == p )
|
|
{
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
A[i][j][k] *= B[i][j][k];
|
|
}
|
|
|
|
return A;
|
|
}
|
|
|
|
|
|
template <class T>
|
|
Array3D<T>& operator/=(Array3D<T> &A, const Array3D<T> &B)
|
|
{
|
|
int m = A.dim1();
|
|
int n = A.dim2();
|
|
int p = A.dim3();
|
|
|
|
if (B.dim1() == m && B.dim2() == n && B.dim3() == p )
|
|
{
|
|
for (int i=0; i<m; i++)
|
|
for (int j=0; j<n; j++)
|
|
for (int k=0; k<p; k++)
|
|
A[i][j][k] /= B[i][j][k];
|
|
}
|
|
|
|
return A;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
} // namespace TNT
|
|
|
|
#endif
|