Home
last modified time | relevance | path

Searched refs:QS_swap (Results 1 – 8 of 8) sorted by relevance

/dports/math/R-cran-lpSolve/lpSolve/src/
H A Dcommonlib.c478 void QS_swap(UNIONTYPE QSORTrec a[], int i, int j) in QS_swap() function
523 { nmove++; QS_swap(a,l,i); } in QS_sort()
525 { nmove++; QS_swap(a,l,r); } in QS_sort()
527 { nmove++; QS_swap(a,i,r); } in QS_sort()
530 QS_swap(a,i,j); in QS_sort()
537 nmove++; QS_swap (a,i,j); in QS_sort()
539 nmove++; QS_swap(a,i,r-1); in QS_sort()
H A Dcommonlib.h290 void QS_swap(UNIONTYPE QSORTrec a[], int i, int j);
H A Dlp_price.c2053 QS_swap(multi->sortedList, bestindex, multi->used-1); in multi_enteringvar()
/dports/science/siconos/siconos-4.4.0/externals/SOL/lumod-c/
H A Dcommonlib.c522 void QS_swap(UNIONTYPE QSORTrec a[], int i, int j) in QS_swap() function
571 QS_swap(a,l,i); in QS_sort()
576 QS_swap(a,l,r); in QS_sort()
581 QS_swap(a,i,r); in QS_sort()
585 QS_swap(a,i,j); in QS_sort()
594 QS_swap(a,i,j); in QS_sort()
597 QS_swap(a,i,r-1); in QS_sort()
H A Dcommonlib.h307 void QS_swap(UNIONTYPE QSORTrec a[], int i, int j);
/dports/math/lp_solve/lp_solve_5.5/shared/
H A Dcommonlib.c623 void QS_swap(UNIONTYPE QSORTrec a[], int i, int j) in QS_swap() function
668 { nmove++; QS_swap(a,l,i); } in QS_sort()
670 { nmove++; QS_swap(a,l,r); } in QS_sort()
672 { nmove++; QS_swap(a,i,r); } in QS_sort()
675 QS_swap(a,i,j); in QS_sort()
682 nmove++; QS_swap (a,i,j); in QS_sort()
684 nmove++; QS_swap(a,i,r-1); in QS_sort()
H A Dcommonlib.h301 void QS_swap(UNIONTYPE QSORTrec a[], int i, int j);
/dports/math/lp_solve/lp_solve_5.5/
H A Dlp_price.c2052 QS_swap(multi->sortedList, bestindex, multi->used-1); in multi_enteringvar()