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

Side by Side Diff: base/rand_util_unittest.cc

Issue 8418034: Make string_util::WriteInto() DCHECK() that the supplied |length_with_null| > 1, meaning that the... (Closed) Base URL: svn://chrome-svn/chrome/trunk/src/
Patch Set: '' Created 9 years, 1 month 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 <algorithm>
8 #include <limits> 8 #include <limits>
9 9
10 #include "testing/gtest/include/gtest/gtest.h" 10 #include "testing/gtest/include/gtest/gtest.h"
(...skipping 23 matching lines...) Expand all
34 char buffer[buffer_size]; 34 char buffer[buffer_size];
35 memset(buffer, 0, buffer_size); 35 memset(buffer, 0, buffer_size);
36 base::RandBytes(buffer, buffer_size); 36 base::RandBytes(buffer, buffer_size);
37 std::sort(buffer, buffer + buffer_size); 37 std::sort(buffer, buffer + buffer_size);
38 // Probability of occurrence of less than 25 unique bytes in 50 random bytes 38 // Probability of occurrence of less than 25 unique bytes in 50 random bytes
39 // is below 10^-25. 39 // is below 10^-25.
40 EXPECT_GT(std::unique(buffer, buffer + buffer_size) - buffer, 25); 40 EXPECT_GT(std::unique(buffer, buffer + buffer_size) - buffer, 25);
41 } 41 }
42 42
43 TEST(RandUtilTest, RandBytesAsString) { 43 TEST(RandUtilTest, RandBytesAsString) {
44 std::string random_string = base::RandBytesAsString(0); 44 std::string random_string = base::RandBytesAsString(1);
45 EXPECT_EQ(0U, random_string.size()); 45 EXPECT_EQ(1U, random_string.size());
46 random_string = base::RandBytesAsString(145); 46 random_string = base::RandBytesAsString(145);
47 EXPECT_EQ(145U, random_string.size()); 47 EXPECT_EQ(145U, random_string.size());
48 char accumulator = 0; 48 char accumulator = 0;
49 for (size_t i = 0; i < random_string.size(); ++i) 49 for (size_t i = 0; i < random_string.size(); ++i)
50 accumulator |= random_string[i]; 50 accumulator |= random_string[i];
51 // 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
52 // heat death. 52 // heat death.
53 EXPECT_NE(0, accumulator); 53 EXPECT_NE(0, accumulator);
54 } 54 }
55 55
(...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after
113 uint64 value = base::RandUint64(); 113 uint64 value = base::RandUint64();
114 found_ones |= value; 114 found_ones |= value;
115 found_zeros &= value; 115 found_zeros &= value;
116 116
117 if (found_zeros == kAllZeros && found_ones == kAllOnes) 117 if (found_zeros == kAllZeros && found_ones == kAllOnes)
118 return; 118 return;
119 } 119 }
120 120
121 FAIL() << "Didn't achieve all bit values in maximum number of tries."; 121 FAIL() << "Didn't achieve all bit values in maximum number of tries.";
122 } 122 }
OLDNEW
« no previous file with comments | « base/rand_util.cc ('k') | base/string_util.h » ('j') | crypto/encryptor_mac.cc » ('J')

Powered by Google App Engine
This is Rietveld 408576698