79 value SerialFib(int n) {  in SerialFib()  argument
80     if (n < 2)  in SerialFib()
81         return n;  in SerialFib()
84     for (i = 2; i <= n; i++) { // n is really index of Fibonacci number  in SerialFib()
92 value SerialMatrixFib(int n) {  in SerialMatrixFib()  argument
95     for (i = 2; i < n; i++) { // Using condition to prevent copying of values  in SerialMatrixFib()
104 value SerialRecursiveFib(int n) {  in SerialRecursiveFib()  argument
106     if (n < 2)  in SerialRecursiveFib()
107         result = n;  in SerialRecursiveFib()
109         result = SerialRecursiveFib(n - 1) + SerialRecursiveFib(n - 2);  in SerialRecursiveFib()
123 value SerialQueueFib(int n) {  in SerialQueueFib()  argument
125     for (int i = 1; i < n; i++)  in SerialQueueFib()
140 value SerialVectorFib(int n) {  in SerialVectorFib()  argument
145     for (int i = 2; i <= n; i++) {  in SerialVectorFib()
149     return A[n];  in SerialVectorFib()
197 value SharedSerialFib(int n) {  in SharedSerialFib()  argument
201     SharedN = n;  in SharedSerialFib()
227     ConcurrentHashSerialFibTask(NumbersTable &cht, int n) : Fib(cht), my_n(n) {}  in ConcurrentHashSerialFibTask()  argument
246 value ConcurrentHashSerialFib(int n) {  in ConcurrentHashSerialFib()  argument
257     tg.run(ConcurrentHashSerialFibTask(Fib, n));  in ConcurrentHashSerialFib()
258     tg.run(ConcurrentHashSerialFibTask(Fib, n));  in ConcurrentHashSerialFib()
261     okay = Fib.find(fresult, n);  in ConcurrentHashSerialFib()
280         int n = --N;  in operator ()()  local
281         if (n <= 0) {  in operator ()()
305 value ParallelPipeFib(int n) {  in ParallelPipeFib()  argument
308     N = n - 1;  in ParallelPipeFib()
312         n,  in ParallelPipeFib()
350 value parallel_reduceFib(int n) {  in parallel_reduceFib()  argument
352     oneapi::tbb::parallel_reduce(oneapi::tbb::blocked_range<int>(2, n, 3),  in parallel_reduceFib()
399 value parallel_scanFib(int n) {  in parallel_scanFib()  argument
400     value *output = new value[n];  in parallel_scanFib()
402     oneapi::tbb::parallel_scan(oneapi::tbb::blocked_range<int>(0, n, 3), b);  in parallel_scanFib()
405     assert(n < 2 || output[n - 2] + output[n - 1] == b.product.v[0][1]);  in parallel_scanFib()
438 value Measure(const char *name, MeasureFunc func, int n) {  in Measure()  argument
443     for (int number = 2; number <= n; number++)  in Measure()