OLD | NEW |
1 // Copyright (c) 2008 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "base/rand_util.h" | 5 #include "base/rand_util.h" |
6 | 6 |
7 #include <limits> | 7 #include <limits> |
8 | 8 |
9 #include "testing/gtest/include/gtest/gtest.h" | 9 #include "testing/gtest/include/gtest/gtest.h" |
10 | 10 |
11 namespace { | 11 namespace { |
12 | 12 |
13 const int kIntMin = std::numeric_limits<int>::min(); | 13 const int kIntMin = std::numeric_limits<int>::min(); |
14 const int kIntMax = std::numeric_limits<int>::max(); | 14 const int kIntMax = std::numeric_limits<int>::max(); |
15 | 15 |
16 } // namespace | 16 } // namespace |
17 | 17 |
18 TEST(RandUtilTest, SameMinAndMax) { | 18 TEST(RandUtilTest, SameMinAndMax) { |
19 EXPECT_EQ(base::RandInt(0, 0), 0); | 19 EXPECT_EQ(base::RandInt(0, 0), 0); |
20 EXPECT_EQ(base::RandInt(kIntMin, kIntMin), kIntMin); | 20 EXPECT_EQ(base::RandInt(kIntMin, kIntMin), kIntMin); |
21 EXPECT_EQ(base::RandInt(kIntMax, kIntMax), kIntMax); | 21 EXPECT_EQ(base::RandInt(kIntMax, kIntMax), kIntMax); |
22 } | 22 } |
23 | 23 |
24 TEST(RandUtilTest, RandDouble) { | 24 TEST(RandUtilTest, RandDouble) { |
25 // Force 64-bit precision, making sure we're not in a 80-bit FPU register. | 25 // Force 64-bit precision, making sure we're not in a 80-bit FPU register. |
26 volatile double number = base::RandDouble(); | 26 volatile double number = base::RandDouble(); |
27 EXPECT_GT(1.0, number); | 27 EXPECT_GT(1.0, number); |
28 EXPECT_LE(0.0, number); | 28 EXPECT_LE(0.0, number); |
| 29 } |
| 30 |
| 31 TEST(RandUtilTest, RandString) { |
| 32 std::string random_string = base::RandString(0); |
| 33 EXPECT_EQ(0U, random_string.size()); |
| 34 random_string = base::RandString(145); |
| 35 EXPECT_EQ(145U, random_string.size()); |
| 36 char accumulator = 0; |
| 37 for (size_t i = 0; i < random_string.size(); ++i) |
| 38 accumulator |= random_string[i]; |
| 39 // In theory this test can fail, but it won't before the universe dies of |
| 40 // heat death. |
| 41 EXPECT_NE(0, accumulator); |
29 } | 42 } |
30 | 43 |
31 // Make sure that it is still appropriate to use RandGenerator in conjunction | 44 // Make sure that it is still appropriate to use RandGenerator in conjunction |
32 // with std::random_shuffle(). | 45 // with std::random_shuffle(). |
33 TEST(RandUtilTest, RandGeneratorForRandomShuffle) { | 46 TEST(RandUtilTest, RandGeneratorForRandomShuffle) { |
34 EXPECT_EQ(base::RandGenerator(1), 0U); | 47 EXPECT_EQ(base::RandGenerator(1), 0U); |
35 EXPECT_LE(std::numeric_limits<ptrdiff_t>::max(), | 48 EXPECT_LE(std::numeric_limits<ptrdiff_t>::max(), |
36 std::numeric_limits<int64>::max()); | 49 std::numeric_limits<int64>::max()); |
37 } | 50 } |
OLD | NEW |