OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 17 matching lines...) Expand all Loading... |
28 #include "v8.h" | 28 #include "v8.h" |
29 | 29 |
30 #include "cctest.h" | 30 #include "cctest.h" |
31 #include "utils/random-number-generator.h" | 31 #include "utils/random-number-generator.h" |
32 | 32 |
33 using namespace v8::internal; | 33 using namespace v8::internal; |
34 | 34 |
35 | 35 |
36 static const int kMaxRuns = 12345; | 36 static const int kMaxRuns = 12345; |
37 static const int kRandomSeeds[] = { | 37 static const int kRandomSeeds[] = { |
38 -1, 1, 42, 100, 1234567890, 987654321, 0xdeadbeef | 38 -1, 1, 42, 100, 1234567890, 987654321 |
39 }; | 39 }; |
40 | 40 |
41 | 41 |
42 TEST(NextIntWithMaxValue) { | 42 TEST(NextIntWithMaxValue) { |
43 for (unsigned n = 0; n < ARRAY_SIZE(kRandomSeeds); ++n) { | 43 for (unsigned n = 0; n < ARRAY_SIZE(kRandomSeeds); ++n) { |
44 RandomNumberGenerator rng(kRandomSeeds[n]); | 44 RandomNumberGenerator rng(kRandomSeeds[n]); |
45 for (int max = 1; max <= kMaxRuns; ++max) { | 45 for (int max = 1; max <= kMaxRuns; ++max) { |
46 int n = rng.NextInt(max); | 46 int n = rng.NextInt(max); |
47 CHECK_LE(0, n); | 47 CHECK_LE(0, n); |
48 CHECK_LT(n, max); | 48 CHECK_LT(n, max); |
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
83 int64_t i1, i2; | 83 int64_t i1, i2; |
84 rng1.NextBytes(&i1, sizeof(i1)); | 84 rng1.NextBytes(&i1, sizeof(i1)); |
85 rng2.NextBytes(&i2, sizeof(i2)); | 85 rng2.NextBytes(&i2, sizeof(i2)); |
86 CHECK_EQ(i2, i1); | 86 CHECK_EQ(i2, i1); |
87 CHECK_EQ(rng2.NextInt(), rng1.NextInt()); | 87 CHECK_EQ(rng2.NextInt(), rng1.NextInt()); |
88 CHECK_EQ(rng2.NextInt(k), rng1.NextInt(k)); | 88 CHECK_EQ(rng2.NextInt(k), rng1.NextInt(k)); |
89 CHECK_EQ(rng2.NextDouble(), rng1.NextDouble()); | 89 CHECK_EQ(rng2.NextDouble(), rng1.NextDouble()); |
90 } | 90 } |
91 } | 91 } |
92 } | 92 } |
OLD | NEW |