Revision | bc389f6a4dffa2e708011d9995bbdc01be540b54 (tree) |
---|---|
Zeit | 2013-08-22 18:04:45 |
Autor | Mikiya Fujii <mikiya.fujii@gmai...> |
Commiter | Mikiya Fujii |
MolDS_base::MathUtilities::Max and MolDS_base::MathUtilities::min is replaced with std::max and std::min.
git-svn-id: https://svn.sourceforge.jp/svnroot/molds/trunk@1482 1136aad2-a195-0410-b898-f5ea1d11b9d8
@@ -32,7 +32,6 @@ | ||
32 | 32 | #include"../mpi/MpiProcess.h" |
33 | 33 | #include"../wrappers/Lapack.h" |
34 | 34 | #include"MathUtilities.h" |
35 | -#include"MallocerFreer.h" | |
36 | 35 | using namespace std; |
37 | 36 | |
38 | 37 | namespace MolDS_base{ |
@@ -69,26 +68,6 @@ int Conbination(int n, int k){ | ||
69 | 68 | } |
70 | 69 | } |
71 | 70 | |
72 | -// max | |
73 | -template <typename T> T Max(T a, T b){ | |
74 | - if(a<b){ | |
75 | - return b; | |
76 | - } | |
77 | - else{ | |
78 | - return a; | |
79 | - } | |
80 | -} | |
81 | - | |
82 | -// min | |
83 | -template <typename T> T min(T a, T b){ | |
84 | - if(a<b){ | |
85 | - return a; | |
86 | - } | |
87 | - else{ | |
88 | - return b; | |
89 | - } | |
90 | -} | |
91 | - | |
92 | 71 | // rotating matrix |
93 | 72 | void CalcRotatingMatrix(double matrix[][3], double theta, CartesianType cartesianType){ |
94 | 73 | if(cartesianType == XAxis){ |
@@ -23,10 +23,6 @@ namespace MolDS_base{ | ||
23 | 23 | int Factorial(int n); |
24 | 24 | // nCk |
25 | 25 | int Conbination(int n, int k); |
26 | -// max | |
27 | -template <typename T> T Max(T a, T b); | |
28 | -// min | |
29 | -template <typename T> T min(T a, T b); | |
30 | 26 | // rotating matrix |
31 | 27 | void CalcRotatingMatrix(double matrix[][3], double theta, CartesianType cartesianType); |
32 | 28 | // calculate determinant of the matrix. Note taht the matrix will be destroid |
@@ -21,6 +21,7 @@ | ||
21 | 21 | #include<stdlib.h> |
22 | 22 | #include<string.h> |
23 | 23 | #include<iostream> |
24 | +#include<algorithm> | |
24 | 25 | #include<sstream> |
25 | 26 | #include<math.h> |
26 | 27 | #include<string> |