Home
last modified time | relevance | path

Searched refs:Fibonacci (Results 1 – 25 of 44) sorted by relevance

12

/external/llvm-project/debuginfo-tests/dexter/
DREADME.md55 8. void Fibonacci(int terms, int& total)
71 24. Fibonacci(5, total);
122 …. [4, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 13, 1, "BREAKPOINT", "FUN…
123 …. [5, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 16, 1, "BREAKPOINT", "VER…
124 …. [6, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 13, 1, "BREAKPOINT", "VER…
125 …. [7, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 15, 1, "BREAKPOINT", "VER…
126 …. [8, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 16, 1, "BREAKPOINT", "VER…
127 …. [9, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 15, 1, "BREAKPOINT", "VER…
128 …. [10, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 13, 1, "BREAKPOINT", "VE…
129 …. [11, "Fibonacci", "c:\\dexter\\tests\\nostdlib\\fibonacci\\test.cpp", 16, 1, "BREAKPOINT", "VE…
[all …]
/external/clang/test/SemaTemplate/
Dfibonacci.cpp7 struct Fibonacci { struct
13 enum { value = Fibonacci<I>::value };
16 template<> struct Fibonacci<0> { struct
20 template<> struct Fibonacci<1> { argument
24 int array5[Fibonacci<5>::value == 5? 1 : -1]; argument
25 int array10[Fibonacci<10>::value == 55? 1 : -1];
/external/llvm-project/clang/test/SemaTemplate/
Dfibonacci.cpp7 struct Fibonacci { struct
13 enum { value = Fibonacci<I>::value };
16 template<> struct Fibonacci<0> { struct
20 template<> struct Fibonacci<1> { struct
24 int array5[Fibonacci<5>::value == 5? 1 : -1]; argument
25 int array10[Fibonacci<10>::value == 55? 1 : -1];
/external/catch2/projects/SelfTest/UsageTests/
DBenchmark.tests.cpp7 std::uint64_t Fibonacci(std::uint64_t number) { in Fibonacci() function
8 return number < 2 ? 1 : Fibonacci(number - 1) + Fibonacci(number - 2); in Fibonacci()
13 CHECK(Fibonacci(0) == 1);
15 CHECK(Fibonacci(5) == 8);
19 return Fibonacci(20);
23 return Fibonacci(25);
27 return Fibonacci(30);
31 return Fibonacci(35);
/external/catch2/docs/
Dbenchmarks.md55 Let's have a look how a naive Fibonacci implementation could be benchmarked:
57 std::uint64_t Fibonacci(std::uint64_t number) {
58 return number < 2 ? 1 : Fibonacci(number - 1) + Fibonacci(number - 2);
63 TEST_CASE("Fibonacci") {
64 CHECK(Fibonacci(0) == 1);
66 CHECK(Fibonacci(5) == 8);
70 BENCHMARK("Fibonacci 20") {
71 return Fibonacci(20);
74 BENCHMARK("Fibonacci 25") {
75 return Fibonacci(25);
[all …]
/external/openscreen/third_party/abseil/src/absl/strings/
Dcord.cc138 constexpr uint64_t Fibonacci(unsigned char n, uint64_t a = 0, uint64_t b = 1) { in Fibonacci() function
139 return n == 0 ? a : Fibonacci(n - 1, b, a + b); in Fibonacci()
142 static_assert(Fibonacci(63) == 6557470319842,
151 Fibonacci(2), Fibonacci(3), Fibonacci(4), Fibonacci(5),
152 Fibonacci(6), Fibonacci(7), Fibonacci(8), Fibonacci(9),
153 Fibonacci(10), Fibonacci(11), Fibonacci(12), Fibonacci(13),
154 Fibonacci(14), Fibonacci(15), Fibonacci(16), Fibonacci(17),
155 Fibonacci(18), Fibonacci(19), Fibonacci(20), Fibonacci(21),
156 Fibonacci(22), Fibonacci(23), Fibonacci(24), Fibonacci(25),
157 Fibonacci(26), Fibonacci(27), Fibonacci(28), Fibonacci(29),
[all …]
/external/webrtc/third_party/abseil-cpp/absl/strings/
Dcord.cc185 constexpr uint64_t Fibonacci(unsigned char n, uint64_t a = 0, uint64_t b = 1) { in Fibonacci() function
186 return n == 0 ? a : Fibonacci(n - 1, b, a + b); in Fibonacci()
189 static_assert(Fibonacci(63) == 6557470319842,
198 Fibonacci(2),
199 Fibonacci(3),
200 Fibonacci(4),
201 Fibonacci(5),
202 Fibonacci(6),
203 Fibonacci(7),
204 Fibonacci(8),
[all …]
/external/libtextclassifier/abseil-cpp/absl/strings/
Dcord.cc144 constexpr uint64_t Fibonacci(unsigned char n, uint64_t a = 0, uint64_t b = 1) { in Fibonacci() function
145 return n == 0 ? a : Fibonacci(n - 1, b, a + b); in Fibonacci()
148 static_assert(Fibonacci(63) == 6557470319842,
157 Fibonacci(2), Fibonacci(3), Fibonacci(4), Fibonacci(5),
158 Fibonacci(6), Fibonacci(7), Fibonacci(8), Fibonacci(9),
159 Fibonacci(10), Fibonacci(11), Fibonacci(12), Fibonacci(13),
160 Fibonacci(14), Fibonacci(15), Fibonacci(16), Fibonacci(17),
161 Fibonacci(18), Fibonacci(19), Fibonacci(20), Fibonacci(21),
162 Fibonacci(22), Fibonacci(23), Fibonacci(24), Fibonacci(25),
163 Fibonacci(26), Fibonacci(27), Fibonacci(28), Fibonacci(29),
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/strings/
Dcord.cc144 constexpr uint64_t Fibonacci(unsigned char n, uint64_t a = 0, uint64_t b = 1) { in Fibonacci() function
145 return n == 0 ? a : Fibonacci(n - 1, b, a + b); in Fibonacci()
148 static_assert(Fibonacci(63) == 6557470319842,
157 Fibonacci(2), Fibonacci(3), Fibonacci(4), Fibonacci(5),
158 Fibonacci(6), Fibonacci(7), Fibonacci(8), Fibonacci(9),
159 Fibonacci(10), Fibonacci(11), Fibonacci(12), Fibonacci(13),
160 Fibonacci(14), Fibonacci(15), Fibonacci(16), Fibonacci(17),
161 Fibonacci(18), Fibonacci(19), Fibonacci(20), Fibonacci(21),
162 Fibonacci(22), Fibonacci(23), Fibonacci(24), Fibonacci(25),
163 Fibonacci(26), Fibonacci(27), Fibonacci(28), Fibonacci(29),
[all …]
/external/abseil-cpp/absl/strings/
Dcord.cc185 constexpr uint64_t Fibonacci(unsigned char n, uint64_t a = 0, uint64_t b = 1) { in Fibonacci() function
186 return n == 0 ? a : Fibonacci(n - 1, b, a + b); in Fibonacci()
189 static_assert(Fibonacci(63) == 6557470319842,
198 Fibonacci(2),
199 Fibonacci(3),
200 Fibonacci(4),
201 Fibonacci(5),
202 Fibonacci(6),
203 Fibonacci(7),
204 Fibonacci(8),
[all …]
/external/angle/third_party/abseil-cpp/absl/strings/
Dcord.cc73 constexpr uint64_t Fibonacci(unsigned char n, uint64_t a = 0, uint64_t b = 1) { in Fibonacci() function
74 return n == 0 ? a : Fibonacci(n - 1, b, a + b); in Fibonacci()
77 static_assert(Fibonacci(63) == 6557470319842,
86 Fibonacci(2), Fibonacci(3), Fibonacci(4), Fibonacci(5),
87 Fibonacci(6), Fibonacci(7), Fibonacci(8), Fibonacci(9),
88 Fibonacci(10), Fibonacci(11), Fibonacci(12), Fibonacci(13),
89 Fibonacci(14), Fibonacci(15), Fibonacci(16), Fibonacci(17),
90 Fibonacci(18), Fibonacci(19), Fibonacci(20), Fibonacci(21),
91 Fibonacci(22), Fibonacci(23), Fibonacci(24), Fibonacci(25),
92 Fibonacci(26), Fibonacci(27), Fibonacci(28), Fibonacci(29),
[all …]
/external/swiftshader/tests/ReactorBenchmarks/
DReactorBenchmarks.cpp30 BENCHMARK_DEFINE_F(Coroutines, Fibonacci) in BENCHMARK_DEFINE_F() argument
70 BENCHMARK_REGISTER_F(Coroutines, Fibonacci)->RangeMultiplier(8)->Range(1, 0x1000000)->ArgName("iter…
/external/llvm/examples/Fibonacci/
DCMakeLists.txt11 add_llvm_example(Fibonacci
/external/llvm-project/llvm/examples/Fibonacci/
DCMakeLists.txt11 add_llvm_example(Fibonacci
/external/llvm/examples/
DCMakeLists.txt2 add_subdirectory(Fibonacci)
/external/llvm-project/llvm/examples/
DCMakeLists.txt2 add_subdirectory(Fibonacci)
/external/grpc-grpc/src/proto/math/
Dmath.proto55 // Fib generates numbers in the Fibonacci sequence. If FibArgs.limit > 0, Fib
/external/rust/crates/grpcio-sys/grpc/src/proto/math/
Dmath.proto55 // Fib generates numbers in the Fibonacci sequence. If FibArgs.limit > 0, Fib
/external/llvm-project/llvm/test/tools/llvm-dwarfdump/X86/
Dstatistics-v3.test6 # Source program - A version of Fibonacci
Dstatistics-dwo.test11 # Source program - A version of Fibonacci
/external/python/cpython2/Doc/tutorial/
Dcontrolflow.rst215 We can create a function that writes the Fibonacci series to an arbitrary
218 >>> def fib(n): # write Fibonacci series up to n
219 ... """Print a Fibonacci series up to n."""
285 Fibonacci series, instead of printing it::
287 >>> def fib2(n): # return Fibonacci series up to n
288 ... """Return a list containing the Fibonacci series up to n."""
/external/python/cpython3/Doc/tutorial/
Dcontrolflow.rst251 We can create a function that writes the Fibonacci series to an arbitrary
254 >>> def fib(n): # write Fibonacci series up to n
255 ... """Print a Fibonacci series up to n."""
323 Fibonacci series, instead of printing it::
325 >>> def fib2(n): # return Fibonacci series up to n
326 ... """Return a list containing the Fibonacci series up to n."""
Dmodules.rst28 # Fibonacci numbers module
30 def fib(n): # write Fibonacci series up to n
37 def fib2(n): # return Fibonacci series up to n
/external/kotlinx.coroutines/ui/
Dcoroutines-guide-ui.md370 perform naive computation of [Fibonacci numbers](https://en.wikipedia.org/wiki/Fibonacci_number):
377 We'll be computing larger and larger Fibonacci number each time the circle is clicked.
501 You can run this code and verify that UI is not frozen while large Fibonacci numbers are being comp…
523 You can now enjoy full-speed naive Fibonacci computation without blocking the main UI thread.
/external/llvm-project/llvm/docs/tutorial/MyFirstLanguageFrontend/
DLangImpl01.rst24 `Fibonacci numbers: <http://en.wikipedia.org/wiki/Fibonacci_number>`_

12