HomeSort by relevance Sort by last modified time
    Searched defs:ran (Results 1 - 8 of 8) sorted by null

  /external/guava/guava-tests/test/com/google/common/testing/
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/icu4c/test/cintltst/
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/icu4c/test/intltest/
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/speex/libspeex/
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;
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/
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...]
  /ndk/sources/host-tools/make-3.81/
remake.c 803 int ran = file->command_state == cs_running;
815 or won when they ran (i.e. status is 0). */
838 /* Pretend we ran a real touch command, to suppress the
843 to the double-colon entries). Simply setting ran=1 would
854 if ((ran && !file->phony) || touched)
858 /* If -n, -t, or -q and all the commands are recursive, we ran them so
905 if (ran && file->update_status != -1)
916 if (ran && !d->file->phony)
799 int ran = file->command_state == cs_running; local
    [all...]
  /cts/tests/tests/database/src/android/database/cts/
AbstractCursorTest.java 382 Random ran = new Random(); local
390 Integer r = ran.nextInt();

Completed in 1590 milliseconds