OLD | NEW |
1 // Copyright (c) 2011 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 <math.h> | 7 #include <math.h> |
8 | 8 |
9 #include <limits> | 9 #include <limits> |
10 | 10 |
11 #include "base/basictypes.h" | 11 #include "base/basictypes.h" |
12 #include "base/logging.h" | 12 #include "base/logging.h" |
13 | 13 |
14 namespace base { | 14 namespace base { |
15 | 15 |
16 int RandInt(int min, int max) { | 16 int RandInt(int min, int max) { |
17 DCHECK_LE(min, max); | 17 DCHECK_LE(min, max); |
18 | 18 |
19 uint64 range = static_cast<uint64>(max) - min + 1; | 19 uint64 range = static_cast<uint64>(max) - min + 1; |
20 int result = min + static_cast<int>(base::RandGenerator(range)); | 20 int result = min + static_cast<int>(base::RandGenerator(range)); |
21 DCHECK(result >= min && result <= max); | 21 DCHECK(result >= min && result <= max); |
22 return result; | 22 return result; |
23 } | 23 } |
24 | 24 |
25 double RandDouble() { | 25 double RandDouble() { |
| 26 return BitsToOpenEndedUnitInterval(base::RandUint64()); |
| 27 } |
| 28 |
| 29 double BitsToOpenEndedUnitInterval(uint64 bits) { |
26 // We try to get maximum precision by masking out as many bits as will fit | 30 // We try to get maximum precision by masking out as many bits as will fit |
27 // in the target type's mantissa, and raising it to an appropriate power to | 31 // in the target type's mantissa, and raising it to an appropriate power to |
28 // produce output in the range [0, 1). For IEEE 754 doubles, the mantissa | 32 // produce output in the range [0, 1). For IEEE 754 doubles, the mantissa |
29 // is expected to accommodate 53 bits. | 33 // is expected to accommodate 53 bits. |
30 | 34 |
31 COMPILE_ASSERT(std::numeric_limits<double>::radix == 2, otherwise_use_scalbn); | 35 COMPILE_ASSERT(std::numeric_limits<double>::radix == 2, otherwise_use_scalbn); |
32 static const int kBits = std::numeric_limits<double>::digits; | 36 static const int kBits = std::numeric_limits<double>::digits; |
33 uint64 random_bits = base::RandUint64() & ((GG_UINT64_C(1) << kBits) - 1); | 37 uint64 random_bits = bits & ((GG_UINT64_C(1) << kBits) - 1); |
34 double result = ldexp(static_cast<double>(random_bits), -1 * kBits); | 38 double result = ldexp(static_cast<double>(random_bits), -1 * kBits); |
35 DCHECK(result >= 0.0 && result < 1.0); | 39 DCHECK(result >= 0.0 && result < 1.0); |
36 return result; | 40 return result; |
37 } | 41 } |
38 | 42 |
39 uint64 RandGenerator(uint64 max) { | 43 uint64 RandGenerator(uint64 max) { |
40 DCHECK_GT(max, 0ULL); | 44 DCHECK_GT(max, 0ULL); |
41 return base::RandUint64() % max; | 45 return base::RandUint64() % max; |
42 } | 46 } |
43 | 47 |
44 std::string RandBytesAsString(size_t length) { | 48 std::string RandBytesAsString(size_t length) { |
45 const size_t kBitsPerChar = 8; | 49 const size_t kBitsPerChar = 8; |
46 const int kCharsPerInt64 = sizeof(uint64)/sizeof(char); | 50 const int kCharsPerInt64 = sizeof(uint64)/sizeof(char); |
47 | 51 |
48 std::string result(length, '\0'); | 52 std::string result(length, '\0'); |
49 uint64 entropy = 0; | 53 uint64 entropy = 0; |
50 for (size_t i = 0; i < result.size(); ++i) { | 54 for (size_t i = 0; i < result.size(); ++i) { |
51 if (i % kCharsPerInt64 == 0) | 55 if (i % kCharsPerInt64 == 0) |
52 entropy = RandUint64(); | 56 entropy = RandUint64(); |
53 result[i] = static_cast<char>(entropy); | 57 result[i] = static_cast<char>(entropy); |
54 entropy >>= kBitsPerChar; | 58 entropy >>= kBitsPerChar; |
55 } | 59 } |
56 | 60 |
57 return result; | 61 return result; |
58 } | 62 } |
59 | 63 |
60 } // namespace base | 64 } // namespace base |
OLD | NEW |