| /third_party/typescript/tests/baselines/reference/ |
| D | recursiveInference1.types | 2 function fib(x:number) { return x <= 1 ? x : fib(x - 1) + fib(x - 2); }
3 >fib : (x: number) => any
5 >x <= 1 ? x : fib(x - 1) + fib(x - 2) : any
10 >fib(x - 1) + fib(x - 2) : any
11 >fib(x - 1) : any
12 >fib : (x: number) => any
16 >fib(x - 2) : any
17 >fib : (x: number) => any
22 var result = fib(5);
24 >fib(5) : any
[all …]
|
| D | recursiveInference1.symbols | 2 function fib(x:number) { return x <= 1 ? x : fib(x - 1) + fib(x - 2); }
3 >fib : Symbol(fib, Decl(recursiveInference1.ts, 0, 0))
7 >fib : Symbol(fib, Decl(recursiveInference1.ts, 0, 0))
9 >fib : Symbol(fib, Decl(recursiveInference1.ts, 0, 0))
12 var result = fib(5);
14 >fib : Symbol(fib, Decl(recursiveInference1.ts, 0, 0))
|
| 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/typescript/tests/cases/compiler/ |
| D | recursiveInference1.ts | 1 function fib(x:number) { return x <= 1 ? x : fib(x - 1) + fib(x - 2); } function
2 var result = fib(5);
|
| /third_party/node/test/fixtures/workload/ |
| D | fibonacci-exit.js | 2 function fib(n) { function
4 return fib(n - 1) + fib(n - 2);
6 fib(parseInt(process.argv[2]) || 35);
|
| D | fibonacci-sigint.js | 2 function fib(n) { function
4 return fib(n - 1) + fib(n - 2);
6 fib(parseInt(process.argv[2]) || 35);
|
| D | fibonacci.js | 2 function fib(n) { function
4 return fib(n - 1) + fib(n - 2);
15 process.stdout.write(`${fib(n)}\n`);
|
| /third_party/boost/libs/metaparse/example/meta_hs/ |
| D | example_handcrafted.hpp | 20 struct fib struct
22 typedef fib type; argument
38 struct fib::impl : argument
40 typename fib::apply<
43 typename fib::apply<
|
| D | main_handcrafted.cpp | 15 << "fib 6 = " << fib::apply<int_<6> >::type::value << std::endl in main()
|
| D | main_in_haskell.cpp | 15 << "fib 6 = " << fib::apply<int_<6> >::type::value << std::endl in main()
|
| /third_party/libuv/docs/code/queue-work/ |
| 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/quickjs/examples/ |
| D | fib.c | 28 static int fib(int n) in fib() function
35 return fib(n - 1) + fib(n - 2); in fib()
44 res = fib(n); in js_fib()
|
| D | fib_module.js | 2 export function fib(n) function
9 return fib(n - 1) + fib(n - 2);
|
| D | c_module.js | 3 import { fib } from "./fib.so";
6 console.log("fib(10)=", fib(10));
|
| D | hello_module.js | 3 import { fib } from "./fib_module.js";
6 console.log("fib(10)=", fib(10));
|
| D | test_fib.js | 3 import { fib } from "./fib.so";
6 console.log("fib(10)=", fib(10));
|
| /third_party/libuv/docs/code/queue-cancel/ |
| 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/iptables/extensions/ |
| D | libxt_addrtype.txlate | 2 nft add rule ip filter INPUT fib saddr type local counter
5 nft add rule ip filter INPUT fib daddr type local counter
8 nft add rule ip filter INPUT fib daddr type != { local, anycast } counter
11 nft add rule ip filter INPUT fib daddr . iif type { local, anycast } counter
|
| D | libxt_rpfilter.txlate | 2 nft add rule ip mangle PREROUTING fib saddr . iif oif != 0 counter
5 nft add rule ip mangle PREROUTING fib saddr . mark oif != 0 counter
8 nft add rule ip6 mangle PREROUTING fib saddr . mark . iif oif 0 counter
|
| /third_party/flutter/skia/third_party/externals/freetype/builds/amiga/src/base/ |
| D | ftsystem.c | 384 struct FileInfoBlock* fib; in FT_Stream_Open() local
413 fib = AllocDosObject( DOS_FIB, NULL ); in FT_Stream_Open()
414 if ( !fib ) in FT_Stream_Open()
423 if ( !( ExamineFH( sysfile->file, fib ) ) ) in FT_Stream_Open()
425 FreeDosObject( DOS_FIB, fib ); in FT_Stream_Open()
433 stream->size = fib->fib_Size; in FT_Stream_Open()
434 FreeDosObject( DOS_FIB, fib ); in FT_Stream_Open()
|
| /third_party/freetype/builds/amiga/src/base/ |
| D | ftsystem.c | 384 struct FileInfoBlock* fib; in FT_Stream_Open() local
413 fib = AllocDosObject( DOS_FIB, NULL ); in FT_Stream_Open()
414 if ( !fib ) in FT_Stream_Open()
423 if ( !( ExamineFH( sysfile->file, fib ) ) ) in FT_Stream_Open()
425 FreeDosObject( DOS_FIB, fib ); in FT_Stream_Open()
433 stream->size = fib->fib_Size; in FT_Stream_Open()
434 FreeDosObject( DOS_FIB, fib ); in FT_Stream_Open()
|
| /third_party/skia/third_party/externals/freetype/builds/amiga/src/base/ |
| D | ftsystem.c | 384 struct FileInfoBlock* fib; in FT_Stream_Open() local
413 fib = AllocDosObject( DOS_FIB, NULL ); in FT_Stream_Open()
414 if ( !fib ) in FT_Stream_Open()
423 if ( !( ExamineFH( sysfile->file, fib ) ) ) in FT_Stream_Open()
425 FreeDosObject( DOS_FIB, fib ); in FT_Stream_Open()
433 stream->size = fib->fib_Size; in FT_Stream_Open()
434 FreeDosObject( DOS_FIB, fib ); in FT_Stream_Open()
|
| /third_party/quickjs/tests/ |
| D | test_closure.js | 92 function fib(n) function
99 return fib(n - 1) + fib(n - 2);
112 assert(fib(6), 8, "fib");
|
| /third_party/python/Doc/tutorial/ |
| D | modules.rst | 30 def fib(n): # write Fibonacci series up to n
54 >>> fibo.fib(1000)
63 >>> fib = fibo.fib
64 >>> fib(500)
93 >>> from fibo import fib, fib2
94 >>> fib(500)
103 >>> fib(500)
120 >>> import fibo as fib
121 >>> fib.fib(500)
125 will do, with the only difference of it being available as ``fib``.
[all …]
|
| /third_party/python/Lib/test/ |
| D | test_functools.py | 1211 def fib(n): function
1214 return fib(n-1) + fib(n-2)
1215 self.assertEqual([fib(n) for n in range(16)],
1217 self.assertEqual(fib.cache_info(),
1219 fib.cache_clear()
1220 self.assertEqual(fib.cache_info(),
1445 def fib(n): function
1448 return fib(n-1) + fib(n-2)
1449 self.assertEqual([fib(n) for n in range(16)],
1451 self.assertEqual(fib.cache_info(),
[all …]
|