Home
last modified time | relevance | path

Searched refs:fibonacci (Results 1 – 25 of 54) sorted by relevance

123

/external/cronet/stable/third_party/libc++/src/test/support/
Dmaths.h47 constexpr I fibonacci(I const n) { in fibonacci() function
57 static_assert(fibonacci(0) == 0);
58 static_assert(fibonacci(1) == 1);
59 static_assert(fibonacci(2) == 1);
60 static_assert(fibonacci(3) == 2);
61 static_assert(fibonacci(4) == 3);
62 static_assert(fibonacci(5) == 5);
63 static_assert(fibonacci(6) == 8);
64 static_assert(fibonacci(7) == 13);
65 static_assert(fibonacci(8) == 21);
[all …]
/external/cronet/tot/third_party/libc++/src/test/support/
Dmaths.h47 constexpr I fibonacci(I const n) { in fibonacci() function
57 static_assert(fibonacci(0) == 0);
58 static_assert(fibonacci(1) == 1);
59 static_assert(fibonacci(2) == 1);
60 static_assert(fibonacci(3) == 2);
61 static_assert(fibonacci(4) == 3);
62 static_assert(fibonacci(5) == 5);
63 static_assert(fibonacci(6) == 8);
64 static_assert(fibonacci(7) == 13);
65 static_assert(fibonacci(8) == 21);
[all …]
/external/skia/tests/sksl/errors/
DIllegalRecursionSimple.glsl4 int fibonacci(int n)
5 int fibonacci(int n)
6 int fibonacci(int n) { return n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2); }
/external/skia/resources/sksl/errors/
DIllegalRecursionSimple.rts4 int fibonacci(int n) { return n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2); }
8 int fibonacci(int n)
9 int fibonacci(int n)
/external/bazelbuild-rules_rust/test/rust_test_suite_shared/tests/
Dintegrated_test_a.rs4 use math_lib::fibonacci;
8 let fib6 = fibonacci(6); in fibonacci_test()
9 assert_eq!(fib6, fibonacci(5) + fibonacci(4)); in fibonacci_test()
Dintegrated_test_b.rs4 use math_lib::fibonacci;
8 let fib7 = fibonacci(7); in fibonacci_test()
9 assert_eq!(fib7, fibonacci(6) + fibonacci(5)); in fibonacci_test()
/external/bazelbuild-rules_rust/examples/fibonacci/
DBUILD.bazel4 name = "fibonacci",
10 crate = ":fibonacci",
15 crate = ":fibonacci",
20 crate = ":fibonacci",
/external/rust/android-crates-io/crates/criterion/benches/benchmarks/
Dexternal_process.py5 def fibonacci(n): function
8 return fibonacci(n - 1) + fibonacci(n - 2)
25 fibonacci(depth)
/external/bazelbuild-rules_rust/test/rust_test_suite_shared/src/
Dlib.rs2 pub fn fibonacci(n: i32) -> i32 { in fibonacci() function
6 _ => fibonacci(n - 1) + fibonacci(n - 2), in fibonacci()
/external/bazelbuild-rules_rust/examples/fibonacci/benches/
Dfibonacci_bench.rs17 extern crate fibonacci;
24 b.iter(|| fibonacci::fibonacci(40)); in bench_fibonacci()
/external/bazelbuild-rules_rust/test/rust_test_suite/src/
Dlib.rs8 pub fn fibonacci(n: i32) -> i32 { in fibonacci() function
12 _ => fibonacci(n - 1) + fibonacci(n - 2), in fibonacci()
/external/bazelbuild-rules_rust/examples/fibonacci/src/
Dlib.rs22 pub fn fibonacci(n: u64) -> u64 { in fibonacci() function
38 use super::fibonacci;
44 assert_eq!(*number, fibonacci(i as u64)); in test_fibonacci()
/external/bazelbuild-rules_rust/test/rust_test_suite/tests/patterns/
Dfibonacci_test.rs1 use math_lib::fibonacci;
5 assert_eq!(fibonacci(6), 13); in fibonacci_test()
/external/rust/android-crates-io/crates/crossbeam-channel/examples/
Dfibonacci.rs8 fn fibonacci(sender: Sender<u64>) { in fibonacci() function
19 thread::spawn(|| fibonacci(s)); in main()
/external/elfutils/tests/
Drun-all-dwarf-ranges.sh167 die: fibonacci (1d)
172 die: fibonacci (1d)
220 die: fibonacci (1d)
225 die: fibonacci (1d)
Dtestfile-dwp.source22 fibonacci (unsigned int n)
88 struct Bar mybar { fibonacci (argc), FRY (argc) };
/external/sdv/vsomeip/third_party/boost/mpl/doc/src/refmanual/
Dpush_front.rst97 typedef push_front< v,integral_c<int,1> >::type fibonacci;
98 BOOST_MPL_ASSERT_RELATION( size<fibonacci>::value, ==, 8 );
101 fibonacci
Dlist_c.rst70 typedef list_c<int,1,2,3,5,7,12,19,31> fibonacci;
71 typedef push_front<fibonacci,int_<1> >::type fibonacci2;
Dvector_c.rst71 typedef vector_c<int,1,1,2,3,5,8,13,21,34> fibonacci;
72 typedef push_back<fibonacci,int_<55> >::type fibonacci2;
/external/dexmaker/dexmaker-tests/src/androidTest/java/com/android/dx/examples/
DFibonacciMaker.java34 TypeId<?> fibonacci = TypeId.get("Lcom/google/dexmaker/examples/Fibonacci;"); in main() local
38 dexMaker.declare(fibonacci, fileName, Modifier.PUBLIC, TypeId.OBJECT); in main()
40 MethodId<?, Integer> fib = fibonacci.getMethod(TypeId.INT, "fib", TypeId.INT); in main()
/external/starlark-go/starlark/
Dprofile_test.go33 def fibonacci(n):
39 fibonacci(100000)
/external/starlark-go/starlark/testdata/
Dcontrol.star59 for x in fibonacci: # fibonacci is an infinite iterable defined in eval_test.go
/external/rust/android-crates-io/crates/num-integer/benches/
Dgcd.rs116 fn fibonacci() -> impl Iterator<Item = u128> { in fibonacci() function
131 let pairs: Vec<(T, T)> = fibonacci() in run_bench()
/external/rust/android-crates-io/crates/debug_tree/
DREADME.md9 * [Recursive Fibonacci Example](#recursive-fibonacci-example)
22 <!--{ fibonacci.rs | code: rust }-->
37 defer_write!("examples/out/fibonacci.txt");
45 <!--{ out/fibonacci.txt | code }-->
/external/llvm/examples/Fibonacci/
DCMakeLists.txt12 fibonacci.cpp

123