Changeset 818958f in git

Timestamp:

Feb 15, 2007, 12:13:40 PM (16 years ago)

Author:

Michael Brickenstein <bricken@…>

Branches:

(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')

Children:

e4ad0e8e6de45042f972bec1aa6320c24864ca99

Parents:

f238523916268f4defd17e161a8279773f4fcf31

Message:

*bricken: tuning back


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

File:

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

kernel/tgb.cc

@@ -5 +5 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: tgb.cc,v 1.135 2007-02-15 10:57:42 bricken Exp $ */
+/* $Id: tgb.cc,v 1.136 2007-02-15 11:13:40 bricken Exp $ */
 /*
 * ABSTRACT: slimgb and F4 implementation
@@ -33 +33 @@
 #define SR_HDL(A) ((long)(A))
 static const int bundle_size=1000;
+static const int bundle_size_noro=1000;
 static const int delay_factor=3;
 int QlogSize(number n);
@@ -2959 +2960 @@
   c->average_length=c->average_length/c->n;
   i=0;
-  poly* p=(poly*) omalloc((bundle_size+1)*sizeof(poly));//nullterminated
+  int max_pairs=bundle_size;
+  if (use_noro)
+    max_pairs=bundle_size_noro;
+  poly* p=(poly*) omalloc((max_pairs+1)*sizeof(poly));//nullterminated
 
   int curr_deg=-1;
-  while(i<bundle_size){
+  while(i<max_pairs){
     sorted_pair_node* s=top_pair(c);//here is actually chain criterium done