summaryrefslogtreecommitdiffstats
path: root/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp
diff options
context:
space:
mode:
authorEric Fiselier <eric@efcs.ca>2016-05-02 19:20:16 +0000
committerEric Fiselier <eric@efcs.ca>2016-05-02 19:20:16 +0000
commitc090b04045a0e080ed9bbab08581d5a1b6c21acc (patch)
treebabbe95d7a5112a2267334a47e59ea3a91c67be7 /libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp
parentfb42f4c44adc1e2ac25c1305e77d53e735012b77 (diff)
downloadbcm5719-llvm-c090b04045a0e080ed9bbab08581d5a1b6c21acc.tar.gz
bcm5719-llvm-c090b04045a0e080ed9bbab08581d5a1b6c21acc.zip
Initialize local doubles to NaN. Patch from STL@microsoft.com
llvm-svn: 268285
Diffstat (limited to 'libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp')
-rw-r--r--libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp49
1 files changed, 25 insertions, 24 deletions
diff --git a/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp b/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp
index 9606f96f911..6b0af42429c 100644
--- a/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp
+++ b/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/eval.pass.cpp
@@ -24,6 +24,7 @@
#include <iterator>
#include <numeric>
#include <cassert>
+#include <limits>
template <class T>
inline
@@ -60,10 +61,10 @@ int main()
}
std::sort(u.begin(), u.end());
int kp = -1;
- double a;
- double m;
- double bk;
- double c;
+ double a = std::numeric_limits<double>::quiet_NaN();
+ double m = std::numeric_limits<double>::quiet_NaN();
+ double bk = std::numeric_limits<double>::quiet_NaN();
+ double c = std::numeric_limits<double>::quiet_NaN();
std::vector<double> areas(Np);
double S = 0;
for (int i = 0; i < areas.size(); ++i)
@@ -110,10 +111,10 @@ int main()
}
std::sort(u.begin(), u.end());
int kp = -1;
- double a;
- double m;
- double bk;
- double c;
+ double a = std::numeric_limits<double>::quiet_NaN();
+ double m = std::numeric_limits<double>::quiet_NaN();
+ double bk = std::numeric_limits<double>::quiet_NaN();
+ double c = std::numeric_limits<double>::quiet_NaN();
std::vector<double> areas(Np);
double S = 0;
for (int i = 0; i < areas.size(); ++i)
@@ -160,10 +161,10 @@ int main()
}
std::sort(u.begin(), u.end());
int kp = -1;
- double a;
- double m;
- double bk;
- double c;
+ double a = std::numeric_limits<double>::quiet_NaN();
+ double m = std::numeric_limits<double>::quiet_NaN();
+ double bk = std::numeric_limits<double>::quiet_NaN();
+ double c = std::numeric_limits<double>::quiet_NaN();
std::vector<double> areas(Np);
double S = 0;
for (int i = 0; i < areas.size(); ++i)
@@ -210,10 +211,10 @@ int main()
}
std::sort(u.begin(), u.end());
int kp = -1;
- double a;
- double m;
- double bk;
- double c;
+ double a = std::numeric_limits<double>::quiet_NaN();
+ double m = std::numeric_limits<double>::quiet_NaN();
+ double bk = std::numeric_limits<double>::quiet_NaN();
+ double c = std::numeric_limits<double>::quiet_NaN();
std::vector<double> areas(Np);
double S = 0;
for (int i = 0; i < areas.size(); ++i)
@@ -260,10 +261,10 @@ int main()
}
std::sort(u.begin(), u.end());
int kp = -1;
- double a;
- double m;
- double bk;
- double c;
+ double a = std::numeric_limits<double>::quiet_NaN();
+ double m = std::numeric_limits<double>::quiet_NaN();
+ double bk = std::numeric_limits<double>::quiet_NaN();
+ double c = std::numeric_limits<double>::quiet_NaN();
std::vector<double> areas(Np);
double S = 0;
for (int i = 0; i < areas.size(); ++i)
@@ -310,10 +311,10 @@ int main()
}
std::sort(u.begin(), u.end());
int kp = -1;
- double a;
- double m;
- double bk;
- double c;
+ double a = std::numeric_limits<double>::quiet_NaN();
+ double m = std::numeric_limits<double>::quiet_NaN();
+ double bk = std::numeric_limits<double>::quiet_NaN();
+ double c = std::numeric_limits<double>::quiet_NaN();
std::vector<double> areas(Np);
double S = 0;
for (int i = 0; i < areas.size(); ++i)
OpenPOWER on IntegriCloud