Home
last modified time | relevance | path

Searched refs:cmpij (Results 1 – 2 of 2) sorted by relevance

/dports/cad/gmsh/gmsh-4.9.2-source/Solver/
H A DlinearSystemCSR.cpp270 static int cmpij(INDEX_TYPE ai, INDEX_TYPE aj, INDEX_TYPE bi, INDEX_TYPE bj) in cmpij() function
297 if(cmpij(ai[i - 1], aj[i - 1], b, c) <= 0) break; in _sort2_xkws()
319 if(cmpij(ai[l + 1 - 1], aj[l + 1 - 1], ai[ir - 1], aj[ir - 1]) > 0) { in _sort2_xkws()
324 if(cmpij(ai[l - 1], aj[l - 1], ai[ir - 1], aj[ir - 1]) > 0) { in _sort2_xkws()
329 if(cmpij(ai[l + 1 - 1], aj[l + 1 - 1], ai[l - 1], aj[l - 1]) > 0) { in _sort2_xkws()
342 while(cmpij(ai[i - 1], aj[i - 1], b, c) < 0); in _sort2_xkws()
345 while(cmpij(ai[j - 1], aj[j - 1], b, c) > 0); in _sort2_xkws()
/dports/science/getdp/getdp-3.4.0-source/contrib/Sparskit/
H A DSparskit.cpp2049 static int cmpij(int ai,int aj,int bi,int bj){ in cmpij() function
2088 if (cmpij(ai[i M1],aj[i M1],b,c) <= 0) break; in sort2()
2110 if (cmpij(ai[l+1 M1],aj[l+1 M1],ai[ir M1],aj[ir M1])>0){ in sort2()
2115 if (cmpij(ai[l M1],aj[l M1],ai[ir M1],aj[ir M1])>0){ in sort2()
2120 if (cmpij(ai[l+1 M1],aj[l+1 M1],ai[l M1],aj[l M1])>0){ in sort2()
2131 do i++; while (cmpij(ai[i M1],aj[i M1],b,c) < 0); in sort2()
2132 do j--; while (cmpij(ai[j M1],aj[j M1],b,c) > 0); in sort2()