Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(10)

Side by Side Diff: base/rand_util_unittest.cc

Issue 6683060: Private API for extensions like ssh-client that need access to TCP. (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: v Created 9 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
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 <algorithm>
7 #include <limits> 8 #include <limits>
8 9
9 #include "testing/gtest/include/gtest/gtest.h" 10 #include "testing/gtest/include/gtest/gtest.h"
10 11
11 namespace { 12 namespace {
12 13
13 const int kIntMin = std::numeric_limits<int>::min(); 14 const int kIntMin = std::numeric_limits<int>::min();
14 const int kIntMax = std::numeric_limits<int>::max(); 15 const int kIntMax = std::numeric_limits<int>::max();
15 16
16 } // namespace 17 } // namespace
17 18
18 TEST(RandUtilTest, SameMinAndMax) { 19 TEST(RandUtilTest, SameMinAndMax) {
19 EXPECT_EQ(base::RandInt(0, 0), 0); 20 EXPECT_EQ(base::RandInt(0, 0), 0);
20 EXPECT_EQ(base::RandInt(kIntMin, kIntMin), kIntMin); 21 EXPECT_EQ(base::RandInt(kIntMin, kIntMin), kIntMin);
21 EXPECT_EQ(base::RandInt(kIntMax, kIntMax), kIntMax); 22 EXPECT_EQ(base::RandInt(kIntMax, kIntMax), kIntMax);
22 } 23 }
23 24
24 TEST(RandUtilTest, RandDouble) { 25 TEST(RandUtilTest, RandDouble) {
25 // Force 64-bit precision, making sure we're not in a 80-bit FPU register. 26 // Force 64-bit precision, making sure we're not in a 80-bit FPU register.
26 volatile double number = base::RandDouble(); 27 volatile double number = base::RandDouble();
27 EXPECT_GT(1.0, number); 28 EXPECT_GT(1.0, number);
28 EXPECT_LE(0.0, number); 29 EXPECT_LE(0.0, number);
29 } 30 }
30 31
31 TEST(RandUtilTest, RandBytes) { 32 TEST(RandUtilTest, RandBytes) {
32 const size_t buffer_size = 145; 33 const size_t buffer_size = 50;
33 char buffer[buffer_size]; 34 char buffer[buffer_size];
34 memset(buffer, 0, buffer_size); 35 memset(buffer, 0, buffer_size);
35 base::RandBytes(buffer, buffer_size); 36 base::RandBytes(buffer, buffer_size);
36 char accumulator = 0; 37 std::sort(buffer, buffer + buffer_size);
37 for(size_t i = 0; i < buffer_size; ++i) 38 // Probability of occurrence of less than 25 unique bytes in 50 random bytes
38 accumulator |= buffer[i]; 39 // is below 10^-25.
39 // In theory this test can fail, but it won't before the universe dies of 40 EXPECT_GT(std::unique(buffer, buffer + buffer_size) - buffer, 25);
40 // heat death.
41 EXPECT_NE(0, accumulator);
42 } 41 }
43 42
44 TEST(RandUtilTest, RandBytesAsString) { 43 TEST(RandUtilTest, RandBytesAsString) {
45 std::string random_string = base::RandBytesAsString(0); 44 std::string random_string = base::RandBytesAsString(0);
46 EXPECT_EQ(0U, random_string.size()); 45 EXPECT_EQ(0U, random_string.size());
47 random_string = base::RandBytesAsString(145); 46 random_string = base::RandBytesAsString(145);
48 EXPECT_EQ(145U, random_string.size()); 47 EXPECT_EQ(145U, random_string.size());
49 char accumulator = 0; 48 char accumulator = 0;
50 for (size_t i = 0; i < random_string.size(); ++i) 49 for (size_t i = 0; i < random_string.size(); ++i)
51 accumulator |= random_string[i]; 50 accumulator |= random_string[i];
52 // In theory this test can fail, but it won't before the universe dies of 51 // In theory this test can fail, but it won't before the universe dies of
53 // heat death. 52 // heat death.
54 EXPECT_NE(0, accumulator); 53 EXPECT_NE(0, accumulator);
55 } 54 }
56 55
57 // Make sure that it is still appropriate to use RandGenerator in conjunction 56 // Make sure that it is still appropriate to use RandGenerator in conjunction
58 // with std::random_shuffle(). 57 // with std::random_shuffle().
59 TEST(RandUtilTest, RandGeneratorForRandomShuffle) { 58 TEST(RandUtilTest, RandGeneratorForRandomShuffle) {
60 EXPECT_EQ(base::RandGenerator(1), 0U); 59 EXPECT_EQ(base::RandGenerator(1), 0U);
61 EXPECT_LE(std::numeric_limits<ptrdiff_t>::max(), 60 EXPECT_LE(std::numeric_limits<ptrdiff_t>::max(),
62 std::numeric_limits<int64>::max()); 61 std::numeric_limits<int64>::max());
63 } 62 }
OLDNEW
« no previous file with comments | « no previous file | chrome/browser/chromeos/web_socket_proxy.h » ('j') | chrome/browser/chromeos/web_socket_proxy_controller.cc » ('J')

Powered by Google App Engine
This is Rietveld 408576698