Home
last modified time | relevance | path

Searched refs:_PTL (Results 1 – 3 of 3) sorted by relevance

/dports/math/palp/palp-2.20/
H A DNefpart.c219 while((j < _PTL->codim) && !_PTL->DirProduct[i]){ in REC_Dir_Product()
229 CPset.m = (_PTL->codim - 1); CPset.M = _PTL->codim; in REC_Dir_Product()
283 c = COMP_S(S, _PTL->S[s[pos]], &_PTL->nv); in Bisection_PTL()
303 if(COMP_S(_PTL->S[s[j-1]], _PTL->S[s[j]], &_PTL->nv) == 1) in Bubble_PTL()
306 if(COMP_S(_PTL->S[s[i-1]], _PTL->S[s[i]], &_PTL->nv) == 0) in Bubble_PTL()
311 _PTL->n = _PTL->n - diff; in Bubble_PTL()
334 NForm_S(_PTL->S[i], &_PTL->nv); in Remove_Sym()
556 _PTL->n = 0; in Initial_Conditions()
767 _PTL->S[_PTL->n][i] = S[i]; in Select_Sv()
768 _PTL->n += 1; in Select_Sv()
[all …]
H A DE_Poly.c373 if(_PTL->Proj[i]) p++; in Print_Nefinfo()
381 int N_Part(PartList *_PTL){ in N_Part() argument
385 if((!_PTL->DirProduct[i]) && (!_PTL->Proj[i])) in N_Part()
676 m = Max_S(_PTL, _n); in Output()
677 if (((!_PTL->DirProduct[*_n]) || _F->Dir) && ((!_PTL->Proj[*_n]) || _F->Proj)) { in Output()
715 if (_PTL->S[*_n][j] == i) in Output()
740 if(_PTL->DProj[*_n]) in Output()
1268 PartList *_PTL; in Make_E_Poly() local
1365 if (((!_PTL->Proj[n]) || _F->Proj) && ((!_PTL->DirProduct[n]) || _F->Dir) in Make_E_Poly()
1377 if (((!_PTL->Proj[n]) || _F->Proj) && ((!_PTL->DirProduct[n]) || _F->Dir)) in Make_E_Poly()
[all …]
H A Dnef.c51 void Print_Nefinfo(PartList *_PTL, /* Flags *_F,*/ time_t *_Tstart, clock_t *_Cstart);