Change old PRG to be SkLCGRandom; change new one to SkRandom

tests/RandomTest.cpp

 
 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "Test.h"
 #include "SkRandom.h"
@@ skipping 43 matching lines @@
     t *= -1.77245385091;  // -sqrt(PI)
     double p = 1.0/(1.0 + exp(t));
 
     return p;
 }
 
 static void test_random_byte(skiatest::Reporter* reporter, int shift) {
     int bins[256];
     memset(bins, 0, sizeof(int)*256);
 
-    SkMWCRandom rand;
+    SkRandom rand;
     for (int i = 0; i < 256*10000; ++i) {
         bins[(rand.nextU() >> shift) & 0xff]++;
     }
 
     REPORTER_ASSERT(reporter, chi_square_test(bins, 10000));
 }
 
 static void test_random_float(skiatest::Reporter* reporter) {
     int bins[256];
     memset(bins, 0, sizeof(int)*256);
 
-    SkMWCRandom rand;
+    SkRandom rand;
     for (int i = 0; i < 256*10000; ++i) {
         float f = rand.nextF();
         REPORTER_ASSERT(reporter, 0.0f <= f && f < 1.0f);
         bins[(int)(f*256.f)]++;
     }
     REPORTER_ASSERT(reporter, chi_square_test(bins, 10000));
 
     double p[32];
     for (int j = 0; j < 32; ++j) {
         float f = rand.nextF();
@@ skipping 14 matching lines @@
 // The original test used 26 bit strings, but is somewhat slow. This version uses 16
 // bits which is less rigorous but much faster to generate.
 static double test_single_gorilla(skiatest::Reporter* reporter, int shift) {
     const int kWordWidth = 16;
     const double kMean = 24108.0;
     const double kStandardDeviation = 127.0;
     const int kN = (1 << kWordWidth);
     const int kNumEntries = kN >> 5;  // dividing by 32
     unsigned int entries[kNumEntries];
 
-    SkMWCRandom rand;
+    SkRandom rand;
     memset(entries, 0, sizeof(unsigned int)*kNumEntries);
     // pre-seed our string value
     int value = 0;
     for (int i = 0; i < kWordWidth-1; ++i) {
         value <<= 1;
         unsigned int rnd = rand.nextU();
         value |= ((rnd >> shift) & 0x1);
     }
 
     // now make some strings and track them
@@ skipping 32 matching lines @@
 
     double p[32];
     for (int bit_position = 0; bit_position < 32; ++bit_position) {
         p[bit_position] = test_single_gorilla(reporter, bit_position);
     }
 
     REPORTER_ASSERT(reporter, anderson_darling_test(p));
 }
 
 static void test_range(skiatest::Reporter* reporter) {
-    SkMWCRandom rand;
+    SkRandom rand;
 
     // just to make sure we don't crash in this case
     (void) rand.nextRangeU(0, 0xffffffff);
 
     // check a case to see if it's uniform
     int bins[256];
     memset(bins, 0, sizeof(int)*256);
     for (int i = 0; i < 256*10000; ++i) {
         unsigned int u = rand.nextRangeU(17, 17+255);
         REPORTER_ASSERT(reporter, 17 <= u && u <= 17+255);
@@ skipping 12 matching lines @@
 
     test_random_float(reporter);
 
     test_gorilla(reporter);
 
     test_range(reporter);
 }
 
 #include "TestClassDef.h"
 DEFINE_TESTCLASS("Random", RandomTestClass, TestRandom)