Changeset e48f702 in git for kernel/fast_mult.cc

Timestamp:

May 10, 2005, 3:24:00 PM (19 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

ec8a6b60305edbff1b9d4efb76f18e4f2fb506de

Parents:

9d39fe2131fa89a739cbed0a208e9cfc11e3bc2d

Message:

*hannes: om(re)alloc -> om(Re)Alloc


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

File:

• kernel/fast_mult.cc (modified) (4 diffs)

kernel/fast_mult.cc

@@ -311 +311 @@
   }
   int field_size=pot_max+1;
-  int* int_pot_array=(int*) omalloc(field_size*sizeof(int));
-  poly* pot_array=(poly*) omalloc(field_size*sizeof(poly));
+  int* int_pot_array=(int*) omAlloc(field_size*sizeof(int));
+  poly* pot_array=(poly*) omAlloc(field_size*sizeof(poly));
   int i;
   int pot=1;
@@ -540 +540 @@
     Werror("not implemented for so small lenght of f, recursion fails");
   //  number null_number=n_Init(0,r);
-  number* facult=(number*) omalloc((n+1)*sizeof(number));
+  number* facult=(number*) omAlloc((n+1)*sizeof(number));
   facult[0]=n_Init(1,r);
   int i;
@@ -554 +554 @@
   kBucketInit(erg_bucket,NULL,0);
   const int f_len=pLength(f);
-  int* exp=(int*)omalloc(f_len*sizeof(int));
+  int* exp=(int*)omAlloc(f_len*sizeof(int));
   //poly f_terms[f_len];
-  poly* f_terms=(poly*)omalloc(f_len*sizeof(poly));
-  poly** term_potences=(poly**) omalloc(f_len*sizeof(poly*));
+  poly* f_terms=(poly*)omAlloc(f_len*sizeof(poly));
+  poly** term_potences=(poly**) omAlloc(f_len*sizeof(poly*));
   
   poly f_iter=f;
@@ -565 +565 @@
   }
   for(i=0;i<f_len;i++){
-    term_potences[i]=(poly*)omalloc((n+1)*sizeof(poly));
+    term_potences[i]=(poly*)omAlloc((n+1)*sizeof(poly));
     term_potences[i][0]=p_ISet(1,r);
     int j;