/external/skia/tests/ |
D | PathOpsTightBoundsTest.cpp | 15 SkRandom ran; in testTightBoundsLines() local 18 int contourCount = ran.nextRangeU(1, 10); in testTightBoundsLines() 20 int lineCount = ran.nextRangeU(1, 10); in testTightBoundsLines() 21 path.moveTo(ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)); in testTightBoundsLines() 23 path.lineTo(ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)); in testTightBoundsLines() 25 if (ran.nextBool()) { in testTightBoundsLines() 50 SkRandom ran; in testTightBoundsQuads() local 63 int contourCount = ran.nextRangeU(1, 10); in testTightBoundsQuads() 65 int lineCount = ran.nextRangeU(1, 10); in testTightBoundsQuads() 66 path.moveTo(ran.nextRangeF(1, pathMax), ran.nextRangeF(pathMin, pathMax)); in testTightBoundsQuads() [all …]
|
D | PathOpsCubicLineIntersectionIdeas.cpp | 140 SkRandom ran; in DEF_TEST() local 147 SkDPoint origin = {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}; in DEF_TEST() 149 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, in DEF_TEST() 150 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, in DEF_TEST() 151 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)} in DEF_TEST() 154 double t = ran.nextRangeF(0, 1); in DEF_TEST()
|
D | PathOpsAngleIdeas.cpp | 573 SkRandom ran; in DEF_TEST() local 576 SkDPoint origin = {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}; in DEF_TEST() 577 SkDQuad quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, in DEF_TEST() 578 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}}}; in DEF_TEST() 582 SkDQuad quad2 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, in DEF_TEST() 583 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}}}; in DEF_TEST() 601 SkRandom ran; in DEF_TEST() local 606 SkDPoint origin = {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}; in DEF_TEST() 607 SkDQuad quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, in DEF_TEST() 608 {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}}}; in DEF_TEST() [all …]
|
D | PathOpsAngleTest.cpp | 37 SkRandom ran; in DEF_TEST() local 40 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}}; in DEF_TEST() 42 float t = ran.nextRangeF(0.0001f, 1); in DEF_TEST() 71 SkRandom ran; in DEF_TEST() local 75 SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}}; in DEF_TEST() 76 float t = ran.nextRangeF(0.0001f, 1); in DEF_TEST() 78 float t2 = ran.nextRangeF(0.0001f, 1); in DEF_TEST() 80 float t3 = ran.nextRangeF(0.0001f, 1); in DEF_TEST()
|
/external/guava/guava-testlib/test/com/google/common/testing/ |
D | TearDownStackTest.java | 37 assertEquals(false, tearDown.ran); in testSingleTearDown() 41 assertEquals("tearDown should have run", true, tearDown.ran); in testSingleTearDown() 54 false, tearDownOne.ran); in testMultipleTearDownsHappenInOrder() 61 assertEquals(false, tearDownOne.ran); in testMultipleTearDownsHappenInOrder() 62 assertEquals(false, tearDownTwo.ran); in testMultipleTearDownsHappenInOrder() 66 assertEquals("tearDownOne should have run", true, tearDownOne.ran); in testMultipleTearDownsHappenInOrder() 67 assertEquals("tearDownTwo should have run", true, tearDownTwo.ran); in testMultipleTearDownsHappenInOrder() 79 assertEquals(false, tearDownOne.ran); in testThrowingTearDown() 80 assertEquals(false, tearDownTwo.ran); in testThrowingTearDown() 92 assertEquals(true, tearDownOne.ran); in testThrowingTearDown() [all …]
|
/external/icu/icu4c/source/test/intltest/ |
D | winnmtst.cpp | 62 int64_t ran = 0; in randomInt64() local 71 for (i = 0; i < sizeof(ran); i += 1) { in randomInt64() 72 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4); in randomInt64() 75 return ran; in randomInt64() 83 double ran = 0; in randomDouble() local 93 for (i = 0; i < sizeof(ran); i += 1) { in randomDouble() 94 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4); in randomDouble() 96 } while (_isnan(ran)); in randomDouble() 105 ran = (double)numerator / (double)denomenator; in randomDouble() 108 return ran; in randomDouble() [all …]
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/timescale/ |
D | TimeScaleMonkeyTest.java | 35 private Random ran = null; field in TimeScaleMonkeyTest 49 if (ran == null) { in initRandom() 50 ran = createRandom(); in initRandom() 63 value = ran.nextLong() % ranInt; in randomInRange() 72 value = ran.nextLong(); in randomInRange()
|
/external/dhcpcd/ |
D | ipv6rs.c | 235 struct ra *rap, *sorted, *ran, *rat; in ipv6rs_sort() local 244 for (rap = ifp->ras; rap && (ran = rap->next, 1); rap = ran) { in ipv6rs_sort() 667 struct ra *rap, *ran; in ipv6rs_free() local 671 for (rap = ifp->ras; rap && (ran = rap->next, 1); rap = ran) { in ipv6rs_free() 683 struct ra *rap, *ran, *ral; in ipv6rs_expire() local 696 rap && (ran = rap->next, 1); in ipv6rs_expire() 697 ral = rap, rap = ran) in ipv6rs_expire() 707 ral->next = ran; in ipv6rs_expire() 709 ifp->ras = ran; in ipv6rs_expire()
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
D | DateFormatRoundTripTest.java | 38 private Random ran; field in DateFormatRoundTripTest 47 ran = createRandom(); // use test framework's random seed in TestDateFormatRoundTrip() 106 int random = (int) (ran.nextDouble() * 24); in _test() 266 double a = ran.nextDouble(); in generateDate()
|
/external/speex/libspeex/ |
D | math_approx.h | 53 union {int i; float f;} ran; in speex_rand() local 55 ran.i = jflone | (jflmsk & *seed); in speex_rand() 56 ran.f -= 1.5; in speex_rand() 57 return 3.4642*std*ran.f; in speex_rand()
|
D | scal.c | 123 union {int i; float f;} ran; in uni_rand() local 125 ran.i = jflone | (jflmsk & *seed); in uni_rand() 126 ran.f -= 1.5; in uni_rand() 127 return 2*ran.f; in uni_rand()
|
/external/v8/test/mjsunit/regress/ |
D | regress-2185-2.js | 102 function ran(a) { function 109 var random = ran([]);
|
/external/v8/tools/push-to-trunk/ |
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/ |
D | utmstest.c | 43 int64_t ran = 0; in randomInt64() local 53 for (i = 0; i < sizeof(ran); i += 1) { in randomInt64() 54 ((char*)&ran)[i] = (char)((rand() & 0x0FF0) >> 4); in randomInt64() 57 return ran; in randomInt64()
|
/external/bison/runtime-po/ |
D | sv.po | 4 # Göran Uddeborg <goeran@uddeborg.se>, 2001-2006, 2008, 2010, 2012. 14 "Last-Translator: Göran Uddeborg <goeran@uddeborg.se>\n"
|
/external/valgrind/none/tests/ |
D | empty-exe.vgtest | 4 # indicate it ran to completion. If the crash occurs, the .stderr.out file
|
/external/llvm/test/CodeGen/MSP430/ |
D | misched-msp430.ll | 10 ; only verifies that the code generator ran successfully.
|
/external/llvm/test/Analysis/ScalarEvolution/ |
D | 2011-10-04-ConstEvolve.ll | 6 ; Just check that it actually ran trip count analysis.
|
/external/llvm/test/CodeGen/X86/ |
D | anyregcc-crash.ll | 5 ; CHECK: LLVM ERROR: ran out of registers during register allocation
|
/external/llvm/test/Transforms/SimplifyCFG/ |
D | preserve-branchweights-partial.ll | 5 ; -simplifycfg ran successfully. Thus we only check that the function still
|
/external/llvm/test/CodeGen/Mips/ |
D | 2013-11-18-fp64-const0.ll | 7 ; LLVM ERROR: ran out of registers during register allocation
|
/external/selinux/libsepol/cil/test/unit/ |
D | CuTest.c | 139 t->ran = 0; in CuTestInit() 165 tc->ran = 1; in CuTestRun()
|
/external/llvm/test/CodeGen/AArch64/ |
D | arm64-anyregcc-crash.ll | 5 ; CHECK: LLVM ERROR: ran out of registers during register allocation
|
/external/llvm/test/CodeGen/PowerPC/ |
D | ppc64-anyregcc-crash.ll | 5 ; CHECK: LLVM ERROR: ran out of registers during register allocation
|
/external/icu/icu4c/source/data/lang/ |
D | lag.txt | 50 uk{"Kɨukɨranía"}
|