Changeset 244ed5 in git
- Timestamp:
- Nov 27, 2008, 6:18:05 PM (15 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- 4e803e313f457e20c95ef5350e02ebdfe4a1e3a0
- Parents:
- 99d87535652761aa8ed969de6b6ab84ee03fea8a
- Location:
- kernel
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/f5gb.cc
r99d8753 r244ed5 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: f5gb.cc,v 1.1 2 2008-11-22 20:48:23ederc Exp $ */4 /* $Id: f5gb.cc,v 1.13 2008-11-27 17:17:32 ederc Exp $ */ 5 5 /* 6 6 * ABSTRACT: f5gb interface 7 7 */ 8 8 #include "mod2.h" 9 #include <list>10 9 #ifdef HAVE_F5 11 10 #include "kutil.h" … … 24 23 #include "f5gb.h" 25 24 #include "lpolynomial.h" 25 #include "lplist.h" 26 26 27 27 … … 66 66 * gb{f_m} -> gb{f_m,f_(m-1)} -> gb{f_m,...,f_1} 67 67 68 lpoly *f5_inc(lpoly* lp, lpoly* g_prev)68 LPoly *f5_inc(LPoly* lp, LPoly* g_prev) 69 69 { 70 70 long length = 1; … … 91 91 */ 92 92 // generating the list lp of ideal generators and test if 1 is in lp 93 bool generate_input_list( lpoly* lp, ideal id, poly ONE)93 bool generate_input_list(LPoly* lp, ideal id, poly ONE) 94 94 { 95 95 long j; … … 107 107 lp[j].setDel(false); 108 108 lp[j].setNext(&lp[j+1]); 109 Print("Labeled Polynomial % d: ",j+1);109 Print("Labeled Polynomial %ld: ",j+1); 110 110 Print("Label Term: "); 111 111 pWrite(lp[j].getTerm()); 112 Print("Index: % d\n", lp[j].getIndex());112 Print("Index: %ld\n", lp[j].getIndex()); 113 113 Print("Delete? %d\n", lp[j].getDel()); 114 114 pWrite(lp[j].getPoly()); … … 124 124 */ 125 125 ideal F5main(ideal i, ring r) { 126 lpoly* lp; 126 127 127 long j; 128 128 LPoly * lp = new LPoly; 129 129 // definition of one-polynomial as global constant ONE 130 130 poly one = pInit(); … … 153 153 } 154 154 */ 155 Print("Es klappt!\nWIRKLICH!"); 156 return(i); 157 155 Print("Es klappt!\nWIRKLICH!\n"); 156 // only for debugging 157 lp->get(); 158 //return(i); 159 LpList lp_list; 160 while(NULL != lp->getNext()) { 161 lp_list.insert(lp); 162 lp = lp->getNext(); 163 } 164 lp_list.get(); 165 return i; 158 166 159 167 -
kernel/f5gb.h
r99d8753 r244ed5 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: f5gb.h,v 1.1 1 2008-11-22 20:48:23ederc Exp $ */4 /* $Id: f5gb.h,v 1.12 2008-11-27 17:18:05 ederc Exp $ */ 5 5 /* 6 6 * ABSTRACT: f5gb interface … … 11 11 #ifdef HAVE_F5 12 12 #include "lpolynomial.h" 13 #include "lplist.h" 13 14 14 15 … … 19 20 // generating the list lp of ideal generators and 20 21 // test if 1 is in lp(return 1) or not(return 0) 21 bool generate_input_list( lpoly* lp, ideal id, poly one);22 bool generate_input_list(LPoly* lp, ideal id, poly one); 22 23 23 24 /* computes incrementally gbs of subsets of the input
Note: See TracChangeset
for help on using the changeset viewer.