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

/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-2185-2.js102 function ran(a) { function
109 var random = ran([]);
/external/guava/guava-tests/test/com/google/common/testing/
H A DTearDownStackTest.java43 assertEquals(false, tearDown.ran);
47 assertEquals("tearDown should have run", true, tearDown.ran);
61 false, tearDownOne.ran);
68 assertEquals(false, tearDownOne.ran);
69 assertEquals(false, tearDownTwo.ran);
73 assertEquals("tearDownOne should have run", true, tearDownOne.ran);
74 assertEquals("tearDownTwo should have run", true, tearDownTwo.ran);
87 assertEquals(false, tearDownOne.ran);
88 assertEquals(false, tearDownTwo.ran);
100 assertEquals(true, tearDownOne.ran);
138 boolean ran = false; field in class:TearDownStackTest.ThrowingTearDown
153 boolean ran = false; field in class:TearDownStackTest.SimpleTearDown
[all...]
/external/chromium_org/third_party/skia/tests/
H A DPathOpsTightBoundsTest.cpp16 SkRandom ran; local
19 int contourCount = ran.nextRangeU(1, 10);
21 int lineCount = ran.nextRangeU(1, 10);
22 path.moveTo(ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000));
24 path.lineTo(ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000));
26 if (ran.nextBool()) {
51 SkRandom ran; local
64 int contourCount = ran
[all...]
H A DPathOpsCubicQuadIntersectionTest.cpp137 SkRandom ran; local
141 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
142 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
143 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
144 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}
164 SkDPoint endDisplacement = {ran
[all...]
H A DPathOpsAngleTest.cpp38 SkRandom ran; local
41 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
43 float t = ran.nextRangeF(0.0001f, 1);
72 SkRandom ran; local
76 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
77 float t = ran.nextRangeF(0.0001f, 1);
79 float t2 = ran.nextRangeF(0.0001f, 1);
81 float t3 = 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...]
/external/skia/tests/
H A DPathOpsCubicQuadIntersectionTest.cpp137 SkRandom ran; local
141 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
142 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
143 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
144 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}
164 SkDPoint endDisplacement = {ran
[all...]
H A DPathOpsAngleTest.cpp38 SkRandom ran; local
41 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
43 float t = ran.nextRangeF(0.0001f, 1);
72 SkRandom ran; local
76 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
77 float t = ran.nextRangeF(0.0001f, 1);
79 float t2 = ran.nextRangeF(0.0001f, 1);
81 float t3 = 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...]
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dutmstest.c40 * Return a random int64_t where U_INT64_MIN <= ran <= U_INT64_MAX.
44 int64_t ran = 0; local
54 for (i = 0; i < sizeof(ran); i += 1) {
55 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4);
58 return ran;
/external/chromium_org/third_party/icu/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/chromium_org/third_party/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;
/external/icu/icu4c/source/test/cintltst/
H A Dutmstest.c40 * Return a random int64_t where U_INT64_MIN <= ran <= U_INT64_MAX.
44 int64_t ran = 0; local
54 for (i = 0; i < sizeof(ran); i += 1) {
55 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4);
58 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/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
H A Dactions.c564 RegExp *any, *ran, *inv; local
577 ran = ranToRE(s);
578 inv = mkDiff(any, ran);
580 free(ran);
590 RegExp * ran = matchChar('\n'); local
591 RegExp * inv = mkDiff(any, ran);
594 free(ran);
/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 975 milliseconds