Changeset f0d1e8 in git for kernel/tgb.cc

Timestamp:

Dec 9, 2005, 10:28:48 AM (18 years ago)

Author:

Michael Brickenstein <bricken@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

c6ed6f55d03d3ddc39f98de45cab426a2f727023

Parents:

7e0aa3a2c5008594e5362bf5644283501107a42d

Message:

*bricken: without vector


git-svn-id: file:///usr/local/Singular/svn/trunk@8839 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• kernel/tgb.cc (modified) (5 diffs)

kernel/tgb.cc

@@ -5 +5 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: tgb.cc,v 1.49 2005-12-08 08:59:41 bricken Exp $ */
+/* $Id: tgb.cc,v 1.50 2005-12-09 09:28:48 bricken Exp $ */
 /*
 * ABSTRACT: slimgb and F4 implementation
 */
-#include <vector>
-using namespace std;
+//#include <vector>
+//using namespace std;
 #include "mod2.h"
 #include "tgb.h"
@@ -2972 +2972 @@
 static void multi_reduction(red_object* los, int & losl, slimgb_alg* c)
 {
-  vector<poly> delay;
+  poly* delay=(poly*) omalloc(losl*sizeof(poly));
+  int delay_s=0;
   //initialize;
   assume(c->strat->sl>=0);
@@ -3042 +3043 @@
                                    PrintS(".");
                                los[i].clear_to_poly();
-                               delay.push_back(los[i].p);
+                               //delay.push_back(los[i].p);
+                               delay[delay_s]=los[i].p;
+                               delay_s++;
                                //add_to_basis_ideal_quotient(
                                //   los[i].p,-1,-1,c,NULL);
@@ -3080 +3083 @@
   }
   
-  int delay_s=delay.size();
+  //int delay_s=delay.size();
   //int i;
   sorted_pair_node** pairs=(sorted_pair_node**)
@@ -3104 +3107 @@
   c->apairs=spn_merge(c->apairs,c->pair_top+1,pairs,delay_s,c);
   c->pair_top+=delay_s;
-  
+  omfree(delay);
   return;
 }