| /dports/benchmarks/scimark2c/scimark2c-2.1/ |
| H A D | SOR.c | 26 double *Gi; in SOR_execute() local
34 Gi = G[i]; in SOR_execute()
38 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1] in SOR_execute()
39 + Gi[j+1]) + one_minus_omega * Gi[j]; in SOR_execute()
|
| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-config/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-amd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-ldl/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-colamd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-spqr/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-rbio/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-btf/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_Matching.cpp | 192 Int *Gi = graph->i; in matching_Random() local
203 Int neighbor = Gi[p]; in matching_Random()
228 ASSERT(graph->matching[Gi[p]]); in matching_Random()
241 Int *Gi = graph->i; in matching_SR() local
253 ASSERT(graph->isMatched(Gi[p])); in matching_SR()
269 Int neighbor = Gi[p]; in matching_SR()
287 Int neighbor = Gi[p]; in matching_SR()
327 Int *Gi = graph->i; in matching_SRdeg() local
360 Int neighbor = Gi[p]; in matching_SRdeg()
402 Int *Gi = graph->i; in matching_HEM() local
[all …]
|
| /dports/benchmarks/scimark2/scimark2-java-2.0_2/ |
| H A D | SOR.java | 31 double[] Gi = G[i]; in execute() local
35 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1] in execute()
36 + Gi[j+1]) + one_minus_omega * Gi[j]; in execute()
|
| H A D | Jacobi.java | 30 double[] Gi = G[i]; in SOR() local
34 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1] in SOR()
35 + Gi[j+1]) + one_minus_omega * Gi[j]; in SOR()
|
| /dports/benchmarks/scimark2/scimark2-java-2.0_2/jnt/scimark2/ |
| H A D | SOR.java | 31 double[] Gi = G[i]; in execute() local
35 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1] in execute()
36 + Gi[j+1]) + one_minus_omega * Gi[j]; in execute()
|
| H A D | Jacobi.java | 30 double[] Gi = G[i]; in SOR() local
34 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1] in SOR()
35 + Gi[j+1]) + one_minus_omega * Gi[j]; in SOR()
|
| /dports/science/PETSc/petsc-3.14.1/src/mat/color/utils/ |
| H A D | weights.c | 53 PetscInt *Gi,*Gj; in MatColoringGetDegrees() local
67 Gi = aij->i; in MatColoringGetDegrees()
77 ncols = Gi[i+1]-Gi[i]; in MatColoringGetDegrees()
78 cols = &(Gj[Gi[i]]); in MatColoringGetDegrees()
94 ncols = Gi[idx+1]-Gi[idx]; in MatColoringGetDegrees()
175 Gi = aij->i; in MatColoringCreateSmallestLastWeights()
187 ncols = Gi[i+1]-Gi[i]; in MatColoringCreateSmallestLastWeights()
188 cols = &(Gj[Gi[i]]); in MatColoringCreateSmallestLastWeights()
204 ncols = Gi[idx+1]-Gi[idx]; in MatColoringCreateSmallestLastWeights()
257 ncols = Gi[cur+1]-Gi[cur]; in MatColoringCreateSmallestLastWeights()
[all …]
|
| /dports/security/hashcat/hashcat-6.2.5/deps/xxHash/tests/collisions/ |
| H A D | README.md | 105 | __XXH3__ | 255 | 100 Gi | 312.5 | 326 | |
106 | __XXH64__ | 255 | 100 Gi | 312.5 | 294 | |
107 | __XXH128__ low64 | 512 | 100 Gi | 312.5 | 321 | |
108 | __XXH128__ high64| 512 | 100 Gi | 312.5 | 325 | |
115 | __XXH64__ | 8 | 100 Gi | 312.5 | __0__ | `XXH64` is bijective for `len==8` |
117 | __XXH3__ | 16 | 100 Gi | 312.5 | 332 | |
118 | __XXH3__ | 32 | 14 Gi | 6.1 | 3 | |
119 | __XXH128__ | 16 | 25 Gi | 0.0 | 0 | test range 9-16 |
120 | __XXH128__ | 32 | 25 Gi | 0.0 | 0 | test range 17-128 |
121 | __XXH128__ | 100 | 13 Gi | 0.0 | 0 | test range 17-128 |
[all …]
|
| /dports/security/hashcat/hashcat-6.2.5/deps/git/xxHash/tests/collisions/ |
| H A D | README.md | 105 | __XXH3__ | 255 | 100 Gi | 312.5 | 326 | |
106 | __XXH64__ | 255 | 100 Gi | 312.5 | 294 | |
107 | __XXH128__ low64 | 512 | 100 Gi | 312.5 | 321 | |
108 | __XXH128__ high64| 512 | 100 Gi | 312.5 | 325 | |
115 | __XXH64__ | 8 | 100 Gi | 312.5 | __0__ | `XXH64` is bijective for `len==8` |
117 | __XXH3__ | 16 | 100 Gi | 312.5 | 332 | |
118 | __XXH3__ | 32 | 14 Gi | 6.1 | 3 | |
119 | __XXH128__ | 16 | 25 Gi | 0.0 | 0 | test range 9-16 |
120 | __XXH128__ | 32 | 25 Gi | 0.0 | 0 | test range 17-128 |
121 | __XXH128__ | 100 | 13 Gi | 0.0 | 0 | test range 17-128 |
[all …]
|