/dports/math/palp/palp-2.20/ |
H A D | Global.h | 53 #define EQUA_Nmax VERT_Nmax 149 typedef Long PairMat[EQUA_Nmax][VERT_Nmax]; 169 Long W[FIB_Nmax][VERT_Nmax]; 170 int nw, PS, ZS, nv, f[VERT_Nmax],r[VERT_Nmax],nf,nz[FIB_Nmax], n0[FIB_Nmax], 171 Z[FIB_Nmax][VERT_Nmax], M[FIB_Nmax]; 172 GL_Long G[VERT_Nmax][POLY_Dmax][POLY_Dmax]; 272 int *SymNum, int V_perm[][VERT_Nmax], 325 Long ANF[][VERT_Nmax]); 508 #if (VERT_Nmax <= INT_Nbits) 510 #elif (VERT_Nmax <= LONG_LONG_Nbits) [all …]
|
H A D | Subpoly.h | 61 #define NB_MAX POLY_Dmax*VERT_Nmax /* an uneducated guess */ 89 nV, nNUC[VERT_Nmax], nVmax, NUCmax, NFnum[VERT_Nmax][NUC_Nmax]; 90 Along Fv_pos[VERT_Nmax][NUC_Nmax]; UPint RAM_pos[VERT_Nmax][NUC_Nmax]; 92 FILE *Finfo, *Fsl, *Fv[VERT_Nmax]; } DataBase; 96 unsigned char nV, nNUC[VERT_Nmax+1], nVmax, NUCmax; 97 unsigned int NFnum[VERT_Nmax+1][NUC_Nmax]; long long NB; 98 unsigned char *NF[VERT_Nmax+1][NUC_Nmax],*NFli;} FInfoList; 136 EqList *E, Long ANF[POLY_Dmax][VERT_Nmax]); 157 subl_int u[][VERT_Nmax], char *mFlag, PolyPointList *P); 194 Long NF[POLY_Dmax][VERT_Nmax], int *MS); /* OUT */ [all …]
|
H A D | Polynf.c | 66 Long VPM[VERT_Nmax][VERT_Nmax], /* in */ 188 Long x[VERT_Nmax][VERT_Nmax]) 226 { int i, j, pi[VERT_Nmax], c[VERT_Nmax]; 227 Long maxP[VERT_Nmax], sumP[VERT_Nmax]; 489 Long VM[POLY_Dmax][VERT_Nmax], VPM[VERT_Nmax][VERT_Nmax]; 516 Long VM[POLY_Dmax][VERT_Nmax], VPM[VERT_Nmax][VERT_Nmax]; 517 Long VPM_NF[VERT_Nmax][VERT_Nmax]; 561 { PERM *CL; Long VM[POLY_Dmax][VERT_Nmax], VPM[VERT_Nmax][VERT_Nmax]; 564 { Long VPM_NF[VERT_Nmax][VERT_Nmax]; 1242 Long kPM[VERT_Nmax][VERT_Nmax]; [all …]
|
H A D | Nef.h | 10 #define FIB_POINT_Nmax VERT_Nmax 74 int S[Nef_Max][VERT_Nmax]; 83 int S[Nef_Max][VERT_Nmax];
|
H A D | MoriCone.c | 321 int m[VERT_Nmax]; Long Z[POLY_Dmax+1]; VertexNumList V; Inci64 IE[VERT_Nmax]; in Print_Mori() 464 Inci64 srI[VERT_Nmax]; in InterSectionRing() 560 void AuxPrintRays(int R[VERT_Nmax][POLY_Dmax],int nrp[VERT_Nmax],int nr){ in AuxPrintRays() argument 637 R[VERT_Nmax][POLY_Dmax],nrp[VERT_Nmax],nr,neg=0,tnt=0;// num.max.tri in Triang2dSFan() 715 int R[VERT_Nmax][POLY_Dmax], nrp[VERT_Nmax], r=0; // Rays, #ray-Pts, #rays in Triang3dSFan() 717 Inci64 Einc[VERT_Nmax]; Long CR[VERT_Nmax][3]; // chamber rays < in Triang3dSFan() 718 int Tli[VERT_Nmax][3],Eli[VERT_Nmax][2],IEli[VERT_Nmax][9],ien[VERT_Nmax]; in Triang3dSFan() 811 Long *Y[VERT_Nmax],YY[VERT_Nmax][3]; in Triang3dSFan() 1007 Inci64 I=CA&CB, IA[VERT_Nmax], IB[VERT_Nmax]; int i, ia=1, ib=1; in Compatible_Tri() 1153 C[3][3],c[3]={0,0,0}, ntp[VERT_Nmax], Tv[VERT_Nmax], Tp[VERT_Nmax]; in Subdivide() [all …]
|
H A D | Subadd.c | 54 Long VPM[VERT_Nmax][VERT_Nmax], /* in */ 58 Long VPM[VERT_Nmax][VERT_Nmax]); /* return reflexive */ 61 typedef struct {int base[VERT_Nmax+1][NB_MAX], nuc[VERT_Nmax+1][NB_MAX], 62 v[VERT_Nmax+1];} Base_List; 337 UPint NFnum[VERT_Nmax][NUC_Nmax]; in Write_Bin_File() 741 if((_E->ne > VERT_Nmax)||(_V->nv > VERT_Nmax)) in Add_NF_to_List() 868 for(i=*d; i<=VERT_Nmax; i++) in Init_BaseList() 904 for(i=*d; i<=VERT_Nmax; i++) in UNIT_Init_BaseList() 980 { Long V_NF[POLY_Dmax][VERT_Nmax], F_NF[POLY_Dmax][VERT_Nmax]; in VF_2_ucNF() 981 Long VM[POLY_Dmax][VERT_Nmax], VPM[VERT_Nmax][VERT_Nmax]; in VF_2_ucNF() [all …]
|
H A D | Subdb.c | 145 for (v=1;v<VERT_Nmax;v++){ in Init_DB() 641 Along HIPli[VERT_Nmax][NUC_Nmax], HSPli[VERT_Nmax][NUC_Nmax]; in Reduce_Aux_File() 960 Long NF[POLY_Dmax][VERT_Nmax]; in Bin2aDBsl() 1027 Long VPM[EQUA_Nmax][VERT_Nmax]; in DB_to_Hodge() 1034 nnf_vd[VERT_Nmax][Hod_Dif_max+1], in DB_to_Hodge() 1035 nnf_v[VERT_Nmax]; in DB_to_Hodge() 1067 for (v=1;v<VERT_Nmax;v++){ in DB_to_Hodge() 1152 nnf_h[Hod_Min_max+1], nnf_v[VERT_Nmax]; in Sort_Hodge() 1473 Long NF[POLY_Dmax][VERT_Nmax]; in Extract_from_Hodge_db() 1713 { Long D[POLY_Dmax],G[POLY_Dmax][POLY_Dmax],PM[VERT_Nmax][VERT_Nmax]; in PH_Sublat_Polys() [all …]
|
H A D | E_Poly.c | 14 Long G[VERT_Nmax][POLY_Dmax][POLY_Dmax],int fd[VERT_Nmax], 64 int OrdFac[VERT_Nmax], in DYNComplete_Poly() 160 Long PM[][VERT_Nmax]){ in DYNMake_VEPM() argument 285 Long G[VERT_Nmax][POLY_Dmax][POLY_Dmax]; in PRINT_Fibrations() 286 int s[VERT_Nmax], CD=_F->f, n, c, i, j, fib, nf, nv, np, dim[VERT_Nmax]; in PRINT_Fibrations() 290 char C[VERT_Nmax]; in PRINT_Fibrations() 338 Long X[VERT_Nmax][VERT_Nmax]; in PRINT_Fibrations() 434 assert(_P->np <= VERT_Nmax); in Make_L() 581 /*int n, */ int S[VERT_Nmax]) in PrintDegrees() argument 718 if((_P_D->np - *_codim) <= VERT_Nmax) in Output() [all …]
|
H A D | poly.c | 79 typedef struct {int p[SYM_Nmax][VERT_Nmax];} VPermList; 225 int SymNum, VPMSymNum; Long NF[POLY_Dmax][VERT_Nmax]; in main() 241 Long VM[POLY_Dmax][VERT_Nmax]; in main() 246 Long ANF[POLY_Dmax][VERT_Nmax]; in main()
|
H A D | Subpoly.c | 17 typedef struct {int nk, k[VERT_Nmax];} KeepList; 881 void Write_VPM(FILE *F,int *v, int *f, subl_int x[][VERT_Nmax]){ in Write_VPM() argument 899 subl_int u[][VERT_Nmax], char *mFlag, PolyPointList *_P){ in Make_All_Sublat() argument 994 subl_int u[][VERT_Nmax] ){ in Col_Recomb() argument 1013 subl_int x[][VERT_Nmax], subl_int u[][VERT_Nmax] ){ in lin_col_swap() argument 1016 subl_int swap_vec[VERT_Nmax]; in lin_col_swap() 1033 void MakePolyOnSublat(NF_List *_L, subl_int x[VERT_Nmax][VERT_Nmax], in MakePolyOnSublat() argument 1043 subl_int u[VERT_Nmax][VERT_Nmax]; in MakePolyOnSublat() 1047 for (i=0;i<VERT_Nmax;i++) { in MakePolyOnSublat() 1115 Long tNF[POLY_Dmax][VERT_Nmax]; int i, j; in uc_nf_to_P() [all …]
|
H A D | Nefpart.c | 10 int GLZ_Make_Trian_NF(Long X[][VERT_Nmax], int *n, int *nv, 14 int V_perm[][VERT_Nmax]); 25 int v[VERT_Nmax]; /* vertices of face */ 40 int s[VERT_Nmax]; 56 Long X[POLY_Dmax][VERT_Nmax]; 65 int Vp[SYM_Nmax][VERT_Nmax]; 598 v[VERT_Nmax], w[VERT_Nmax], nv, nw; in Sort_FVList() 784 int i, f[FACE_Nmax], S[VERT_Nmax] = {0}; in part_nef()
|
H A D | Vertex.c | 19 #if (VERT_Nmax > LONG_LONG_Nbits) 118 assert(_E->ne<=VERT_Nmax); in Make_Incidence() 180 if((nv>EQUA_Nmax)||(ne>VERT_Nmax)) return 0; in Transpose_PM() 627 assert(_V->nv<VERT_Nmax); in Finish_Find_Equations() 661 assert(_V->nv<VERT_Nmax); in Finish_IP_Check() 690 assert(_V->nv<VERT_Nmax); in Finish_REF_Check() 747 void Compute_InvMat(int n, EqList *_E, int OrdFac[VERT_Nmax], in Compute_InvMat() argument 802 int OrdFac[VERT_Nmax], BasFac[POLY_Dmax], position[POLY_Dmax]; in Complete_Poly() 1009 int OrdFac[VERT_Nmax], BasFac[POLY_Dmax], position[POLY_Dmax]; in QComplete_Poly()
|
H A D | class.c | 232 vf=2, vt=VERT_Nmax-1; in main()
|
H A D | Coord.c | 59 void Print_Matrix(Long Matrix[][VERT_Nmax], int n_lines, int n_columns, in Print_Matrix() argument 472 void QuotZ_2_SublatG(Long Z[][VERT_Nmax],int *zm,Long *M,int *d, 476 { int i,j,k,d=C->N-C->nw; Long Z[POLY_Dmax][VERT_Nmax]; *m=C->nz; in CWS_2_SublatZ()
|
H A D | nef.c | 272 Long PM[EQUA_Nmax][VERT_Nmax]; in main()
|
H A D | cws.c | 476 { int n=2; CWS W; EqList E; VertexNumList V; Long *X[VERT_Nmax]; FILE *OF; in Npoly2cws() 1805 if((V1->nv+V2->nv) > VERT_Nmax) Die("increase VERT_Nmax!"); in ConvHull() 1907 Long *G[W_Nmax], GM[W_Nmax][VERT_Nmax]; in L_Point_Count() 1918 Long *G[W_Nmax], GM[W_Nmax][VERT_Nmax]; in W_Point_Count()
|
H A D | LG.c | 136 { Long *PB[W_Nmax], Z[POLY_Dmax][VERT_Nmax], M[POLY_Dmax], D[POLY_Dmax];
|