Searched defs:ran (Results 1 - 13 of 13) sorted by relevance

/external/v8/test/mjsunit/regress/
H A Dregress-2185-2.js102 function ran(a) { function
109 var random = ran([]);
/external/guava/guava-testlib/test/com/google/common/testing/
H A DTearDownStackTest.java37 assertEquals(false, tearDown.ran);
41 assertEquals("tearDown should have run", true, tearDown.ran);
54 false, tearDownOne.ran);
61 assertEquals(false, tearDownOne.ran);
62 assertEquals(false, tearDownTwo.ran);
66 assertEquals("tearDownOne should have run", true, tearDownOne.ran);
67 assertEquals("tearDownTwo should have run", true, tearDownTwo.ran);
79 assertEquals(false, tearDownOne.ran);
80 assertEquals(false, tearDownTwo.ran);
92 assertEquals(true, tearDownOne.ran);
130 boolean ran = false; field in class:TearDownStackTest.ThrowingTearDown
145 boolean ran = false; field in class:TearDownStackTest.SimpleTearDown
[all...]
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/timescale/
H A DTimeScaleMonkeyTest.java35 private Random ran = null; field in class:TimeScaleMonkeyTest
49 if (ran == null) {
50 ran = createRandom();
63 value = ran.nextLong() % ranInt;
72 value = ran.nextLong();
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
H A DDateFormatRoundTripTest.java38 private Random ran; field in class:DateFormatRoundTripTest
47 ran = createRandom(); // use test framework's random seed
106 int random = (int) (ran.nextDouble() * 24);
266 double a = ran.nextDouble();
/external/skia/tests/
H A DPathOpsTightBoundsTest.cpp15 SkRandom ran; local
18 int contourCount = ran.nextRangeU(1, 10);
20 int lineCount = ran.nextRangeU(1, 10);
21 path.moveTo(ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000));
23 path.lineTo(ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000));
25 if (ran.nextBool()) {
50 SkRandom ran; local
63 int contourCount = ran
[all...]
H A DPathOpsCubicLineIntersectionIdeas.cpp140 SkRandom ran; local
147 SkDPoint origin = {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)};
149 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
150 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
151 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}
154 double t = ran
[all...]
H A DPathOpsAngleTest.cpp37 SkRandom ran; local
40 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
42 float t = ran.nextRangeF(0.0001f, 1);
71 SkRandom ran; local
75 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
76 float t = ran.nextRangeF(0.0001f, 1);
78 float t2 = ran.nextRangeF(0.0001f, 1);
80 float t3 = ran
[all...]
/external/selinux/libsepol/cil/test/unit/
H A DCuTest.h71 int ran; member in struct:CuTest
/external/icu/icu4c/source/test/cintltst/
H A Dutmstest.c39 * Return a random int64_t where U_INT64_MIN <= ran <= U_INT64_MAX.
43 int64_t ran = 0; local
53 for (i = 0; i < sizeof(ran); i += 1) {
54 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4);
57 return ran;
/external/icu/icu4c/source/test/intltest/
H A Dwinnmtst.cpp58 * Return a random int64_t where U_INT64_MIN <= ran <= U_INT64_MAX.
62 int64_t ran = 0; local
71 for (i = 0; i < sizeof(ran); i += 1) {
72 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4);
75 return ran;
79 * Return a random double where U_DOUBLE_MIN <= ran <= U_DOUBLE_MAX.
83 double ran = 0; local
93 for (i = 0; i < sizeof(ran); i += 1) {
94 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4);
96 } while (_isnan(ran));
116 int32_t ran = 0; local
[all...]
/external/speex/libspeex/
H A Dmath_approx.h53 union {int i; float f;} ran; local
55 ran.i = jflone | (jflmsk & *seed);
56 ran.f -= 1.5;
57 return 3.4642*std*ran.f;
H A Dscal.c123 union {int i; float f;} ran; local
125 ran.i = jflone | (jflmsk & *seed);
126 ran.f -= 1.5;
127 return 2*ran.f;
/external/dhcpcd/
H A Dipv6rs.c235 struct ra *rap, *sorted, *ran, *rat; local
244 for (rap = ifp->ras; rap && (ran = rap->next, 1); rap = ran) {
667 struct ra *rap, *ran; local
671 for (rap = ifp->ras; rap && (ran = rap->next, 1); rap = ran) {
683 struct ra *rap, *ran, *ral; local
696 rap && (ran = rap->next, 1);
697 ral = rap, rap = ran)
707 ral->next = ran;
[all...]

Completed in 838 milliseconds