Changeset ec9db9 in git for Singular/minpoly.h

Timestamp:

May 24, 2011, 5:35:16 PM (13 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

0415f923fdb78a69504a400113e65cd371cb2150

Parents:

db33b222f62ceda81505d77c37cc004904d921ba

Message:

attempt to fix some issues with minpoly.cc

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

File:

• Singular/minpoly.h (modified) (6 diffs)

Singular/minpoly.h

@@ -67 +67 @@
 #define MINPOLY_H
 
-#include<iostream>
+//#include<iostream>
 
 class NewVectorMatrix;
@@ -88 +88 @@
     // Note: there is no need to reinitalize the matrix and vectors!
     void resetMatrix();
-    
+
 
     // return the first nonzero entry in row (only the first n entries are checked,
@@ -99 +99 @@
 
     void normalizeTmp(unsigned i);
-            
+
     bool findLinearDependency(unsigned long* newRow, unsigned long* dep);
 
-    friend std::ostream& operator<<(std::ostream& out, const LinearDependencyMatrix& mat);
+   //friend std::ostream& operator<<(std::ostream& out, const LinearDependencyMatrix& mat);
 };
 
@@ -119 +119 @@
     NewVectorMatrix(unsigned n, unsigned long p);
     ~NewVectorMatrix();
-    
+
     // return the first nonzero entry in row (only the first n entries are checked,
     // regardless of the size, since we will also apply this for rows with
@@ -137 +137 @@
     int findSmallestNonpivot();
 };
-                
+
 
 // compute the minimal polynomial of matrix \in \F_p^{n \times n}.
@@ -174 +174 @@
 
 
-// NOTE: since we don't know the size of result (the list can be longer than the degree of the polynomial), 
+// NOTE: since we don't know the size of result (the list can be longer than the degree of the polynomial),
 // every entry has to be preinitialized to zero!
 void mult(unsigned long* result, unsigned long* a, unsigned long* b, unsigned long p, int dega, int degb);