Searched refs:fib (Results 1 - 11 of 11) sorted by relevance
/third_party/typescript/tests/baselines/reference/ |
H A D | recursiveInference1.js | 2 function fib(x:number) { return x <= 1 ? x : fib(x - 1) + fib(x - 2); } function 3 var result = fib(5);
6 function fib(x) { return x <= 1 ? x : fib(x - 1) + fib(x - 2); }
7 var result = fib(5);
|
/third_party/node/test/fixtures/workload/ |
H A D | fibonacci-exit.js | 2 function fib(n) { function 4 return fib(n - 1) + fib(n - 2); 6 fib(parseInt(process.argv[2]) || 35);
|
H A D | fibonacci-sigint.js | 2 function fib(n) { function 4 return fib(n - 1) + fib(n - 2); 6 fib(parseInt(process.argv[2]) || 35);
|
H A D | fibonacci.js | 2 function fib(n) { function 4 return fib(n - 1) + fib(n - 2); 8 process.stdout.write(`${fib(n)}\n`);
|
/third_party/libuv/docs/code/queue-work/ |
H A D | main.c | 17 void fib(uv_work_t *req) { in fib() function 23 long fib = fib_(n); in fib() local 24 fprintf(stderr, "%dth fibonacci is %lu\n", n, fib); in fib() 40 uv_queue_work(loop, &req[i], fib, after_fib); in main()
|
/third_party/libuv/docs/code/queue-cancel/ |
H A D | main.c | 18 void fib(uv_work_t *req) { in fib() function 24 long fib = fib_(n); in fib() local 25 fprintf(stderr, "%dth fibonacci is %lu\n", n, fib); in fib() 51 uv_queue_work(loop, &fib_reqs[i], fib, after_fib); in main()
|
/third_party/skia/third_party/externals/freetype/builds/amiga/src/base/ |
H A D | ftsystem.c | 384 struct FileInfoBlock* fib; in FT_BASE_DEF() local 413 fib = AllocDosObject( DOS_FIB, NULL ); in FT_BASE_DEF() 414 if ( !fib ) in FT_BASE_DEF() 423 if ( !( ExamineFH( sysfile->file, fib ) ) ) in FT_BASE_DEF() 425 FreeDosObject( DOS_FIB, fib ); in FT_BASE_DEF() 433 stream->size = fib->fib_Size; in FT_BASE_DEF() 434 FreeDosObject( DOS_FIB, fib ); in FT_BASE_DEF()
|
/third_party/python/Lib/test/ |
H A D | test_functools.py | 1278 def fib(n): function 1281 return fib(n-1) + fib(n-2) 1282 self.assertEqual([fib(n) for n in range(16)], 1284 self.assertEqual(fib.cache_info(), 1286 fib.cache_clear() 1287 self.assertEqual(fib.cache_info(), 1512 def fib(n): function 1515 return fib(n-1) + fib( 1594 def fib(n): global() function 1610 def fib(n): global() function [all...] |
H A D | test_named_expressions.py | 326 fib = {(c := a): (a := b) + (b := a + c) - b for __ in range(6)} 327 self.assertEqual(fib, {1: 2, 2: 3, 3: 5, 5: 8, 8: 13, 13: 21})
|
H A D | test_tokenize.py | 2542 def fib(n): 2551 NAME 'fib' (2, 4) (2, 7) 2572 def fib(n):
|
/third_party/rust/crates/once_cell/tests/ |
H A D | it.rs | 622 let fib: &'static Vec<i32> = eval_once! { in eval_once_macro() 632 assert_eq!(fib[5], 8)
|
Completed in 11 milliseconds