/external/guava/guava-tests/test/com/google/common/testing/ |
H A D | TearDownStackTest.java | 43 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 D | PathOpsTightBoundsTest.cpp | 16 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 D | PathOpsCubicQuadIntersectionTest.cpp | 137 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 D | PathOpsCubicLineIntersectionIdeas.cpp | 140 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 D | PathOpsAngleTest.cpp | 38 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 D | PathOpsAngleIdeas.cpp | 570 SkRandom ran; 573 SkDPoint origin = {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}; 574 SkDQuad quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, 575 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}}}; 579 SkDQuad quad2 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, 580 {ran [all...] |
/external/chromium_org/build/android/pylib/utils/ |
H A D | reraiser_thread_unittest.py | 47 ran = [False] * 5 49 ran[i] = True 55 for v in ran: 59 ran = [False] * 5 61 ran[i] = True 68 for v in ran:
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | winnmtst.cpp | 58 * 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/icu/icu4c/source/test/intltest/ |
H A D | winnmtst.cpp | 58 * 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/skia/tests/ |
H A D | PathOpsCubicQuadIntersectionTest.cpp | 137 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 D | PathOpsCubicLineIntersectionIdeas.cpp | 140 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 D | PathOpsAngleTest.cpp | 38 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 D | PathOpsAngleIdeas.cpp | 570 SkRandom ran; 573 SkDPoint origin = {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}; 574 SkDQuad quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, 575 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}}}; 579 SkDQuad quad2 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, 580 {ran [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-2185-2.js | 102 function ran(a) { function 109 var random = ran([]);
|
/external/chromium_org/third_party/speex/libspeex/ |
H A D | math_approx.h | 53 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/speex/libspeex/ |
H A D | math_approx.h | 53 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 D | scal.c | 123 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 D | ipv6rs.c | 235 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...] |
/external/chromium_org/third_party/icu/source/test/cintltst/ |
H A D | utmstest.c | 40 * 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/v8/tools/push-to-trunk/ |
H A D | releases.py | 95 ran = "%s:%d" % (cr_from[0], int(cr_to[0]) - 1) 98 range_lists.setdefault(cr_from[1], []).append(ran) 105 return dict((rev, ", ".join(ran)) for rev, ran in range_lists.iteritems())
|
/external/icu/icu4c/source/test/cintltst/ |
H A D | utmstest.c | 40 * 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/yasm/source/patched-yasm/tools/re2c/ |
H A D | actions.c | 564 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/antlr/antlr-3.4/runtime/Ruby/test/functional/main/ |
H A D | main-scripts.rb | 18 raise( "the main block ran" ) 34 out.should =~ /the main block ran/
|