| /third_party/skia/resources/sksl/runtime_errors/ |
| D | IllegalRecursionSimple.rts | 4 int fibonacci(int n) { return n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2); }
|
| /third_party/skia/tests/sksl/runtime_errors/ |
| D | IllegalRecursionSimple.skvm | 4 int fibonacci(int n)
5 int fibonacci(int n)
|
| /third_party/typescript/tests/arkTSTest/testcase/arkts-no-nested-funcs/ |
| D | arkts-no-nested-funcs-10-error.ets | 21 function fibonacci(n: number): number {
33 const result = fibonacci(9)
|
| D | arkts-no-nested-funcs-10-ok.ets | 21 function fibonacci(n: number): number {
33 const result = fibonacci(9)
|
| /third_party/ffmpeg/libavcodec/ |
| D | 8svx.c | 60 static const int8_t fibonacci[16] = { -34, -21, -13, -8, -5, -3, -2, -1, 0, 1, 2, 3, 5, 8, 13,… variable
167 case AV_CODEC_ID_8SVX_FIB: esc->table = fibonacci; break; in eightsvx_decode_init()
|
| /third_party/protobuf/src/google/protobuf/ |
| D | repeated_field_unittest.cc | 1861 std::list<int> fibonacci; member in google::protobuf::__anone75e04120111::RepeatedFieldInsertionIteratorsTest
1869 fibonacci.push_back(1); in SetUp()
1870 fibonacci.push_back(1); in SetUp()
1871 fibonacci.push_back(2); in SetUp()
1872 fibonacci.push_back(3); in SetUp()
1873 fibonacci.push_back(5); in SetUp()
1874 fibonacci.push_back(8); in SetUp()
1875 std::copy(fibonacci.begin(), fibonacci.end(), in SetUp()
1919 EXPECT_TRUE(std::equal(fibonacci.begin(), fibonacci.end(), in TEST_F()
1923 fibonacci.begin())); in TEST_F()
|
| /third_party/littlefs/tests/ |
| D | test_bd.toml | 200 // write/read every fibonacci number on our device
227 // read every fibonacci number again
|
| /third_party/typescript/tests/baselines/reference/ |
| D | underscoreTest1.js | 756 var fibonacci = _.memoize(function (n) { variable
757 return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
978 var fibonacci = _.memoize(function (n) {
979 return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
|
| D | underscoreTest1.types | 865 var fibonacci = _.memoize(function (n) {
866 >fibonacci : (n: any) => any
867 >_.memoize(function (n) { return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);}) : (n: any) =…
871 >function (n) { return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);} : (n: any) => any
874 return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
875 >n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2) : any
880 >fibonacci(n - 1) + fibonacci(n - 2) : any
881 >fibonacci(n - 1) : any
882 >fibonacci : (n: any) => any
886 >fibonacci(n - 2) : any
[all …]
|
| D | underscoreTest1.errors.txt | 125 var fibonacci = _.memoize(function (n) {
126 return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
|
| D | underscoreTest1.symbols | 416 var fibonacci = _.memoize(function (n) {
417 >fibonacci : Symbol(fibonacci, Decl(underscoreTest1_underscoreTests.ts, 104, 3))
423 return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
426 >fibonacci : Symbol(fibonacci, Decl(underscoreTest1_underscoreTests.ts, 104, 3))
428 >fibonacci : Symbol(fibonacci, Decl(underscoreTest1_underscoreTests.ts, 104, 3))
|
| /third_party/libuv/docs/src/guide/ |
| D | threads.rst | 208 calculate fibonacci numbers, sleeping a bit along the way, but run it in
212 .. rubric:: queue-work/main.c - lazy fibonacci
251 Let's modify the fibonacci example to demonstrate ``uv_cancel()``. We first set
|
| /third_party/skia/third_party/externals/swiftshader/tests/ReactorUnitTests/ |
| D | ReactorUnitTests.cpp | 2435 static const std::vector<int> fibonacci = { variable
2485 for(size_t i = 0; i < fibonacci.size(); i++) in TEST()
2487 EXPECT_EQ(routine(i), fibonacci[i]); in TEST()
2517 for(size_t i = 0; i < fibonacci.size(); i++) in TEST()
2521 EXPECT_EQ(out, fibonacci[i]); in TEST()
2661 for(size_t i = 0; i < fibonacci.size(); i++) in TEST()
2665 EXPECT_EQ(out, fibonacci[i]); in TEST()
|
| /third_party/typescript/tests/cases/compiler/ |
| D | underscoreTest1.ts | 754 var fibonacci = _.memoize(function (n) { variable
755 return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
|
| /third_party/ffmpeg/tests/fate/ |
| D | video.mak | 186 …E_IFF-$(call ENCDEC, PCM_S16LE EIGHTSVX_FIB, PCM_S16LE IFF, ARESAMPLE_FILTER) += fate-iff-fibonacci
187 fate-iff-fibonacci: CMD = md5 -i $(TARGET_SAMPLES)/iff/dasboot-in-compressed -f s16le -af aresample
|
| /third_party/python/Doc/tutorial/ |
| D | modules.rst | 129 >>> from fibo import fib as fibonacci
130 >>> fibonacci(500)
|
| /third_party/ffmpeg/doc/ |
| D | general_contents.texi | 1122 @item 8SVX fibonacci @tab @tab X
|