Make SkRandom::next[US]Fixed1 private; update documentation for SkRandom::nextSScalar1.

bench/GrMemoryPoolBench.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkTypes.h"
 
 // This tests a Gr class
@@ skipping 32 matching lines @@
         return "grmemorypool_stack";
     }
 
     void onDraw(int loops, SkCanvas*) override {
         SkRandom r;
         enum {
             kMaxObjects = 4 * (1 << 10),
         };
         A* objects[kMaxObjects];
 
-        // We delete if a random [-1, 1] fixed pt is < the thresh. Otherwise,
+        // We delete if a random number [-1, 1] is < the thresh. Otherwise,
         // we allocate. We start allocate-biased and ping-pong to delete-biased
-        SkFixed delThresh = -SK_FixedHalf;
+        SkScalar delThresh = -SK_ScalarHalf;
         const int kSwitchThreshPeriod = loops / (2 * kMaxObjects);
         int s = 0;
 
         int count = 0;
         for (int i = 0; i < loops; i++, ++s) {
             if (kSwitchThreshPeriod == s) {
                 delThresh = -delThresh;
                 s = 0;
             }
-            SkFixed del = r.nextSFixed1();
+            SkScalar del = r.nextSScalar1();
             if (count &&
                 (kMaxObjects == count || del < delThresh)) {
                 delete objects[count-1];
                 --count;
             } else {
                 objects[count] = new A;
                 ++count;
             }
         }
         for (int i = 0; i < count; ++i) {
@@ skipping 95 matching lines @@
     typedef Benchmark INHERITED;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
 
 DEF_BENCH( return new GrMemoryPoolBenchStack(); )
 DEF_BENCH( return new GrMemoryPoolBenchRandom(); )
 DEF_BENCH( return new GrMemoryPoolBenchQueue(); )
 
 #endif