| /dports/math/gsl/gsl-2.7/cblas/ |
| H A D | test_scal.c | 19 int i; in test_scal() local
35 int i; in test_scal() local
51 int i; in test_scal() local
67 int i; in test_scal() local
83 int i; in test_scal() local
99 int i; in test_scal() local
115 int i; in test_scal() local
132 int i; in test_scal() local
149 int i; in test_scal() local
166 int i; in test_scal() local
[all …]
|
| H A D | test_rotm.c | 14 float X[] = { -0.034f }; in test_rotm() local
39 float X[] = { -0.034f }; in test_rotm() local
64 float X[] = { -0.034f }; in test_rotm() local
89 float X[] = { -0.034f }; in test_rotm() local
114 float X[] = { -0.034f }; in test_rotm() local
264 double X[] = { 0.84 }; in test_rotm() local
289 double X[] = { 0.84 }; in test_rotm() local
314 double X[] = { 0.84 }; in test_rotm() local
339 double X[] = { 0.84 }; in test_rotm() local
364 double X[] = { 0.84 }; in test_rotm() local
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/shift_right/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() function
44 X(X&& other) in X() function
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = n; i < N; i++) in test01() local
76 for (int i = 0; i < std::min(n, N-n); i++) in test01() local
78 for (int i = std::min(n, N-n); i < std::max(n, N-n); i++) in test01() local
84 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/25_algorithms/shift_right/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() argument
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = n; i < N; i++) in test01() local
76 for (int i = 0; i < std::min(n, N-n); i++) in test01() local
78 for (int i = std::min(n, N-n); i < std::max(n, N-n); i++) in test01() local
84 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/testsuite/25_algorithms/shift_right/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() argument
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = n; i < N; i++) in test01() local
76 for (int i = 0; i < std::min(n, N-n); i++) in test01() local
78 for (int i = std::min(n, N-n); i < std::max(n, N-n); i++) in test01() local
84 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/25_algorithms/shift_right/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() function
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = n; i < N; i++) in test01() local
76 for (int i = 0; i < std::min(n, N-n); i++) in test01() local
78 for (int i = std::min(n, N-n); i < std::max(n, N-n); i++) in test01() local
84 for (int i = 0; i < N; i++) in test01() local
|
| /dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/testsuite/25_algorithms/shift_right/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() function
44 X(X&& other) in X() argument
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = n; i < N; i++) in test01() local
76 for (int i = 0; i < std::min(n, N-n); i++) in test01() local
78 for (int i = std::min(n, N-n); i < std::max(n, N-n); i++) in test01() local
84 for (int i = 0; i < N; i++) in test01() local
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/shift_right/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() function
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = n; i < N; i++) in test01() local
76 for (int i = 0; i < std::min(n, N-n); i++) in test01() local
78 for (int i = std::min(n, N-n); i < std::max(n, N-n); i++) in test01() local
84 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/testsuite/25_algorithms/shift_right/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() function
44 X(X&& other) in X() argument
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = n; i < N; i++) in test01() local
76 for (int i = 0; i < std::min(n, N-n); i++) in test01() local
78 for (int i = std::min(n, N-n); i < std::max(n, N-n); i++) in test01() local
84 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/shift_left/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() argument
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = 0; i < N-n; i++) in test01() local
79 for (int i = std::max(n, N-n); i < N; i++) in test01() local
85 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/25_algorithms/shift_left/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() function
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = 0; i < N-n; i++) in test01() local
79 for (int i = std::max(n, N-n); i < N; i++) in test01() local
85 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/testsuite/25_algorithms/shift_left/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() function
44 X(X&& other) in X() function
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = 0; i < N-n; i++) in test01() local
79 for (int i = std::max(n, N-n); i < N; i++) in test01() local
85 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/25_algorithms/shift_left/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() function
44 X(X&& other) in X() function
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = 0; i < N-n; i++) in test01() local
79 for (int i = std::max(n, N-n); i < N; i++) in test01() local
85 for (int i = 0; i < N; i++) in test01() local
|
| /dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/testsuite/25_algorithms/shift_left/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() argument
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = 0; i < N-n; i++) in test01() local
79 for (int i = std::max(n, N-n); i < N; i++) in test01() local
85 for (int i = 0; i < N; i++) in test01() local
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/shift_left/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() argument
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = 0; i < N-n; i++) in test01() local
79 for (int i = std::max(n, N-n); i < N; i++) in test01() local
85 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/testsuite/25_algorithms/shift_left/ |
| H A D | 1.cc | 30 struct X struct
35 X() = default; argument
37 X(int a) in X() argument
44 X(X&& other) in X() function
51 operator=(X&& other) in operator =() argument
67 for (int i = 0; i < N; i++) in test01() local
74 for (int i = 0; i < N-n; i++) in test01() local
79 for (int i = std::max(n, N-n); i < N; i++) in test01() local
85 for (int i = 0; i < N; i++) in test01() local
|
| /dports/lang/v8/v8-9.6.180.12/src/bigint/ |
| H A D | vector-arithmetic.cc | 17 int i = 0; in AddAndReturnOverflow() local
31 int i = 0; in SubAndReturnBorrow() local
41 void Add(RWDigits Z, Digits X, Digits Y) { in Add()
45 int i = 0; in Add() local
63 int i = 0; in Subtract() local
78 for (int i = 0; i < Y.len(); i++) { in AddAndReturnCarry() local
87 for (int i = 0; i < Y.len(); i++) { in SubtractAndReturnBorrow() local
121 void AddOne(RWDigits Z, Digits X) { in AddOne()
123 int i = 0; in AddOne() local
130 void SubtractOne(RWDigits Z, Digits X) { in SubtractOne()
[all …]
|
| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|
| /dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|
| /dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|
| /dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|
| /dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|
| /dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|
| /dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_binary_search.h | 24 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
42 #define GB_TRIM_BINARY_SEARCH(i,X,pleft,pright) \ argument
75 #define GB_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
93 #define GB_SPLIT_BINARY_SEARCH(i,X,pleft,pright,found) \ argument
116 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
134 #define GB_TRIM_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright) \ argument
161 #define GB_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzombies,is_zombie) \ argument
190 #define GB_SPLIT_BINARY_SEARCH_ZOMBIE(i,X,pleft,pright,found,nzom,is_zombie) \ argument
|