Home
last modified time | relevance | path

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

/dports/math/palp/palp-2.20/
H A DE_Poly.c1033 _P_N->n = _DP->n + *_codim - 1; in Make_Gore_Poly()
1034 _P_N->np = 0; in Make_Gore_Poly()
1049 assert(_P_N->np < POINT_Nmax); in Make_Gore_Poly()
1051 _P_N->x[_P_N->np][d + *_codim - 1] = _DP->x[l][d]; in Make_Gore_Poly()
1054 _P_N->x[_P_N->np][d - 1] = 1; in Make_Gore_Poly()
1056 _P_N->x[_P_N->np][d - 1] = 0; in Make_Gore_Poly()
1058 _P_N->np++; in Make_Gore_Poly()
1068 while (ip && (k < _P_N->np)) { in Make_Gore_Poly()
1079 if (_P_N->x[k][d] == 1) in Make_Gore_Poly()
1362 Find_Equations(_P_N, _V_N, _E_N); in Make_E_Poly()
[all …]
H A Dnef.c25 PolyPointList * _P_N, VertexNumList * _V_N, EqList * _E_N,