Lines Matching refs:rand
835 SkRandom rand;
840 SkScalar size = rand.nextUScalar1() * 30;
844 r.fLeft = rand.nextUScalar1() * 300;
845 r.fTop = rand.nextUScalar1() * 300;
862 SkRandom rand;
867 SkScalar size = rand.nextUScalar1() * 30;
871 r.fLeft = rand.nextUScalar1() * 300;
872 r.fTop = rand.nextUScalar1() * 300;
1012 SkRandom rand;
1015 pts[i].fX = rand.nextSScalar1();
1016 pts[i].fY = rand.nextSScalar1();
3150 SkRandom rand(9876543);
3161 int numVerbs = (rand.nextU() >> 16) % 10;
3165 nextVerb = static_cast<SkPathVerb>((rand.nextU() >> 16) % SkPath::kDone_Verb);
3169 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3182 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3193 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3194 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
3205 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3206 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
3208 rand.nextUScalar1() * 4);
3218 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
3219 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
3220 expectedPts[numPoints + 2] = randomPts[(rand.nextU() >> 16) % 25];
5006 static void rand_path(SkPath* path, SkRandom& rand, SkPath::Verb verb, int n) {
5010 path->lineTo(rand.nextF()*100, rand.nextF()*100);
5013 path->quadTo(rand.nextF()*100, rand.nextF()*100,
5014 rand.nextF()*100, rand.nextF()*100);
5017 path->conicTo(rand.nextF()*100, rand.nextF()*100,
5018 rand.nextF()*100, rand.nextF()*100, rand.nextF()*10);
5021 path->cubicTo(rand.nextF()*100, rand.nextF()*100,
5022 rand.nextF()*100, rand.nextF()*100,
5023 rand.nextF()*100, rand.nextF()*100);
5033 SkRandom rand;
5042 rand_path(&path, rand, verb, n);