HomeSort by relevance Sort by last modified time
    Searched refs:fib (Results 1 - 4 of 4) sorted by null

  /external/webkit/SunSpider/tests/sunspider-0.9/
controlflow-recursive.js 11 function fib(n) { function
13 return fib(n-2) + fib(n-1);
23 fib(17.0+i);
  /external/webkit/SunSpider/tests/sunspider-0.9.1/
controlflow-recursive.js 11 function fib(n) { function
13 return fib(n-2) + fib(n-1);
23 fib(17.0+i);
  /system/core/libacc/tests/data/
bellard.otccex.c 20 * for fib(35)), you'll notice that OTCC is quite fast because it
23 fib(n) function
28 return fib(n-1) + fib(n-2);
104 printf("fib(%d) = ", n);
105 print_num(fib(n), base);
124 printf("Compute fib(n) and fact(n) and output the result in base 'base'\n");
  /frameworks/base/tests/CoreTests/android/core/
PipedStreamTest.java 78 Fibonacci fib = new Fibonacci();
93 assertEquals(readByte, (byte) fib.next());
102 Fibonacci fib = new Fibonacci();
107 int toWrite = fib.next();
146 Fibonacci fib = new Fibonacci();
172 assertEquals("Error at " + countRead, fib.next(), readInt);
182 Fibonacci fib = new Fibonacci();
188 int toWrite = fib.next();
254 Fibonacci fib = new Fibonacci();
260 int toWrite = fib.next()
290 Fibonacci fib = new Fibonacci(); local
    [all...]

Completed in 168 milliseconds