Home
last modified time | relevance | path

Searched refs:Rbegin (Results 1 – 15 of 15) sorted by path

/dports/math/giacxcas/giac-1.6.0/src/
H A Dcocoa.cc10876 typename std::vector<tdeg_t>::const_iterator Rbegin=R.begin(),jt=Rbegin,jtend=R.end(); in zmakelinesplit() local
10899 end=Rbegin+Rpos; in zmakelinesplit()
10903 if (jt-Rbegin<a) in zmakelinesplit()
10904 jt=Rbegin+a; in zmakelinesplit()
10905 if (end-Rbegin>b) in zmakelinesplit()
10906 end=Rbegin+b; in zmakelinesplit()
10909 pushsplit(v,pos,unsigned(jt-Rbegin)); in zmakelinesplit()
10916 pushsplit(v,pos,int(jt-Rbegin)); in zmakelinesplit()
10936 pushsplit(v,pos,unsigned(jt-Rbegin)); in zmakelinesplit()
10943 pushsplit(v,pos,int(jt-Rbegin)); in zmakelinesplit()
/dports/math/highs/HiGHS-cfe064e/src/ipm/basiclu/src/
H A Dlu_build_factors.c140 lu_int *Rbegin = this->Rbegin; in lu_build_factors() local
293 Rbegin[0] = 2*(Lnz+m); /* beginning of update etas */ in lu_build_factors()
H A Dlu_internal.c154 this->Rbegin = this->rowcount_flink; in lu_load()
H A Dlu_internal.h119 lu_int *rowcount_flink; lu_int *Rbegin, *eta_row; member
H A Dlu_solve_dense.c21 const lu_int *Rbegin = this->Rbegin; in lu_solve_dense() local
66 for (pos = Rbegin[t]; pos < Rbegin[t+1]; pos++) in lu_solve_dense()
104 pos = Rbegin[0]; in lu_solve_dense()
109 for ( ; pos < Rbegin[t+1]; pos++) in lu_solve_dense()
H A Dlu_solve_for_update.c29 lu_int *Rbegin = this->Rbegin; in lu_solve_for_update() local
81 room = this->Lmem - Rbegin[nforrest]; in lu_solve_for_update()
99 put = Rbegin[nforrest]; in lu_solve_for_update()
108 Rbegin[nforrest+1] = put; in lu_solve_for_update()
128 for (pos = Rbegin[nforrest]; pos < Rbegin[nforrest+1]; pos++) in lu_solve_for_update()
148 for (pos = Rbegin[t]; pos < Rbegin[t+1]; pos++) in lu_solve_for_update()
250 pos = Rbegin[0]; in lu_solve_for_update()
255 for ( ; pos < Rbegin[t+1]; pos++) in lu_solve_for_update()
266 Rflops += Rbegin[nforrest] - Rbegin[0]; in lu_solve_for_update()
H A Dlu_solve_sparse.c29 const lu_int *Rbegin = this->Rbegin; in lu_solve_sparse() local
100 for (pos = Rbegin[t]; pos < Rbegin[t+1]; pos++) in lu_solve_sparse()
203 pos = Rbegin[0]; in lu_solve_sparse()
208 for ( ; pos < Rbegin[t+1]; pos++) in lu_solve_sparse()
219 Rflops += Rbegin[nforrest] - Rbegin[0]; in lu_solve_sparse()
H A Dlu_update.c442 lu_int *Rbegin = this->Rbegin; in lu_update() local
508 nz_roweta = Rbegin[nforrest+1] - Rbegin[nforrest]; in lu_update()
534 for (pos = Rbegin[nforrest]; pos < Rbegin[nforrest+1]; pos++) in lu_update()
674 pos = Rbegin[nforrest]; in lu_update()
825 put = Rbegin[nforrest]; in lu_update()
827 for (pos = put; pos < Rbegin[nforrest+1]; pos++) in lu_update()
837 Rbegin[nforrest+1] = put; in lu_update()
/dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_highs/src/ipm/basiclu/src/
H A Dlu_build_factors.c140 lu_int *Rbegin = this->Rbegin; in lu_build_factors() local
293 Rbegin[0] = 2*(Lnz+m); /* beginning of update etas */ in lu_build_factors()
H A Dlu_internal.c154 this->Rbegin = this->rowcount_flink; in lu_load()
H A Dlu_internal.h119 lu_int *rowcount_flink; lu_int *Rbegin, *eta_row; member
H A Dlu_solve_dense.c21 const lu_int *Rbegin = this->Rbegin; in lu_solve_dense() local
66 for (pos = Rbegin[t]; pos < Rbegin[t+1]; pos++) in lu_solve_dense()
104 pos = Rbegin[0]; in lu_solve_dense()
109 for ( ; pos < Rbegin[t+1]; pos++) in lu_solve_dense()
H A Dlu_solve_for_update.c29 lu_int *Rbegin = this->Rbegin; in lu_solve_for_update() local
81 room = this->Lmem - Rbegin[nforrest]; in lu_solve_for_update()
99 put = Rbegin[nforrest]; in lu_solve_for_update()
108 Rbegin[nforrest+1] = put; in lu_solve_for_update()
128 for (pos = Rbegin[nforrest]; pos < Rbegin[nforrest+1]; pos++) in lu_solve_for_update()
148 for (pos = Rbegin[t]; pos < Rbegin[t+1]; pos++) in lu_solve_for_update()
250 pos = Rbegin[0]; in lu_solve_for_update()
255 for ( ; pos < Rbegin[t+1]; pos++) in lu_solve_for_update()
266 Rflops += Rbegin[nforrest] - Rbegin[0]; in lu_solve_for_update()
H A Dlu_solve_sparse.c29 const lu_int *Rbegin = this->Rbegin; in lu_solve_sparse() local
100 for (pos = Rbegin[t]; pos < Rbegin[t+1]; pos++) in lu_solve_sparse()
203 pos = Rbegin[0]; in lu_solve_sparse()
208 for ( ; pos < Rbegin[t+1]; pos++) in lu_solve_sparse()
219 Rflops += Rbegin[nforrest] - Rbegin[0]; in lu_solve_sparse()
H A Dlu_update.c442 lu_int *Rbegin = this->Rbegin; in lu_update() local
508 nz_roweta = Rbegin[nforrest+1] - Rbegin[nforrest]; in lu_update()
534 for (pos = Rbegin[nforrest]; pos < Rbegin[nforrest+1]; pos++) in lu_update()
674 pos = Rbegin[nforrest]; in lu_update()
825 put = Rbegin[nforrest]; in lu_update()
827 for (pos = put; pos < Rbegin[nforrest+1]; pos++) in lu_update()
837 Rbegin[nforrest+1] = put; in lu_update()