Changeset 40df4d in git
 Timestamp:
 Dec 17, 2013, 1:44:17 PM (9 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
 Children:
 035192fb77c255d934b21cd0a32eb12359bda176
 Parents:
 a1e807a999ad81c88502c684ee93531e7840ea82
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/grobcov.lib
ra1e807a r40df4d 113 113 Can be used without calling presiouly setglobalrings(), 114 114 115 locus(G) ;Special routine for determining the locus of points115 locus(G): Special routine for determining the locus of points 116 116 of objects. Given a parametric ideal J with 117 117 parameters (a_1,..a_m) and variables (x_1,..,xn), … … 131 131 Can be used without calling presiouly setglobalrings(), 132 132 133 locusdg(G) ;Is a special routine for computing the locus in dinamical geometry.133 locusdg(G): Is a special routine for computing the locus in dinamical geometry. 134 134 It detects automatically a possible point that is to be avoided by the mover, 135 135 whose coordinates must be the last two coordinates in the definition of the ring. … … 139 139 Can be used without calling presiouly setglobalrings(), 140 140 141 locusto(L) ;Transforms the output of locus to a string that141 locusto(L): Transforms the output of locus to a string that 142 142 can be reed from different computational systems. 143 143 Can be used without calling presiouly setglobalrings(), 144 144 145 addcons(L) ;Given a disjoint set of locally closed subsets in Prepresentation,145 addcons(L): Given a disjoint set of locally closed subsets in Prepresentation, 146 146 it returns the canonical Prepresentation of the constructible set 147 147 formed by the union of them. … … 1222 1222 proc PtoCrep(list L) 1223 1223 { 1224 int te=0; 1224 1225 def RR=basering; 1226 if(defined(@P)){te=1;} 1227 else{te=0; setglobalrings();} 1225 1228 setring(@P); 1226 1229 def Lp=imap(RR,L); … … 1240 1243 def La=list(ida,idb); 1241 1244 setring(RR); 1242 return(imap(@P,La)); 1245 def LL=imap(@P,La); 1246 if(te==0){kill @P; kill @R; kill @RP;} 1247 return(LL); 1243 1248 } 1244 1249 … … 3895 3900 int i; int j; int k; int l; 3896 3901 intvec v; intvec v1; intvec v0; 3897 ideal J; list K; 3902 ideal J; list K; list L1; 3903 for(i=1;i<=size(L);i++) 3904 { 3905 if(equalideals(L[i][1][1],ideal(1))==0) 3906 {L1[size(L1)+1]=L[i];} 3907 } 3908 L=L1; 3898 3909 for(i=1;i<=size(L);i++) 3899 3910 {
Note: See TracChangeset
for help on using the changeset viewer.