Changeset 7375424 in git
- Timestamp:
- Mar 25, 1997, 4:40:20 PM (27 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 20d92caa4109d20c8c2efc03cef380a023380d3b
- Parents:
- b97e9443c01e49fa114378e8959f26e5069da3b4
- Location:
- Singular
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/fglm.cc
rb97e94 r7375424 1 1 // emacs edit mode for this file is -*- C++ -*- 2 // $Id: fglm.cc,v 1. 2 1997-03-20 16:59:33 obachmanExp $2 // $Id: fglm.cc,v 1.3 1997-03-25 15:40:16 Singular Exp $ 3 3 //============================================= 4 4 // FGLM - Algorithm … … 1621 1621 //. check if rings are compatible: 1622 1622 if ( currRing->N == destRing->N ) { 1623 maFindPerm( currRing->names, pVariables, NULL, destRing->names, pVariables, NULL, 0, perm, NULL ); 1623 maFindPerm( currRing->names, pVariables, NULL, 0, 1624 destRing->names, pVariables, NULL, 0, perm, NULL ); 1624 1625 for ( int k = 1; state == FglmOk && k <= pVariables; k++ ) 1625 1626 if ( perm[k] <= 0 ) state= FglmIncompatibleRings; -
Singular/iparith.cc
rb97e94 r7375424 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 static char rcsid[] = "$Id: iparith.cc,v 1. 6 1997-03-24 14:24:51Singular Exp $";4 static char rcsid[] = "$Id: iparith.cc,v 1.7 1997-03-25 15:40:18 Singular Exp $"; 5 5 /* 6 6 * ABSTRACT: table driven kernel interface, used by interpreter … … 1398 1398 if (par_perm_size!=0) 1399 1399 par_perm=(int *)Alloc0(par_perm_size*sizeof(int)); 1400 maFindPerm(r->names, r->N, r->parameter, 1400 maFindPerm(r->names, r->N, r->parameter, r->P, 1401 1401 currRing->names,currRing->N,currRing->parameter, currRing->P, 1402 1402 perm,par_perm); -
Singular/maps.cc
rb97e94 r7375424 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 static char rcsid[] = "$Id: maps.cc,v 1. 3 1997-03-24 14:25:18Singular Exp $";4 static char rcsid[] = "$Id: maps.cc,v 1.4 1997-03-25 15:40:19 Singular Exp $"; 5 5 /* 6 6 * ABSTRACT - the mapping of polynomials to other rings … … 268 268 } 269 269 270 void maFindPerm(char **preim_names, int preim_n, char **preim_par, 271 char **names, int n, char **par,int nop,270 void maFindPerm(char **preim_names, int preim_n, char **preim_par, int preim_p, 271 char **names, int n, char **par, int nop, 272 272 int * perm, int *par_perm) 273 273 { … … 303 303 if (par_perm!=NULL) 304 304 { 305 for (i=0; preim_par[i]!=NULL; i++)305 for (i=0; i<preim_p; i++) 306 306 { 307 307 for(j=0; j<n; j++) … … 343 343 int *perm=(int *)Alloc0((r->N+1)*sizeof(int)); 344 344 //int *par_perm=(int *)Alloc0(rPar(r)*sizeof(int)); 345 maFindPerm(r->names,r->N, r->parameter, 345 maFindPerm(r->names,r->N, r->parameter, r->P, 346 346 currRing->names,currRing->N,currRing->parameter, currRing->P, 347 347 perm,NULL/*par_perm*/); -
Singular/maps.h
rb97e94 r7375424 19 19 int *perm,int N, 20 20 int *par_perm,int P); 21 void maFindPerm(char **preim_names, int preim_n, char **preim_par, 22 char **names, int n, char ** par,int nop,23 21 void maFindPerm(char **preim_names, int preim_n, char **preim_par, int preim_p, 22 char **names, int n, char **par, int nop, 23 int * perm, int *par_perm); 24 24 #endif
Note: See TracChangeset
for help on using the changeset viewer.