Changeset 2f436b in git for Singular/prCopy.h

Timestamp:

Dec 31, 2000, 4:14:47 PM (23 years ago)

Author:

Olaf Bachmann <obachman@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

e609098c45a74ac91c002ffa7ece5eebe7f8c002

Parents:

33ec1145a109507ad3e3cf4a69a847b703358e93

Message:

* version 1-3-13: sparsemat improivements


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

File:

• Singular/prCopy.h (modified) (4 diffs)

Singular/prCopy.h

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: prCopy.h,v 1.1 1999-11-15 17:20:42 obachman Exp $ */
+/* $Id: prCopy.h,v 1.2 2000-12-31 15:14:43 obachman Exp $ */
 /*
 * ABSTRACT - declarations of functions for Copy/Move/Delete for Polys
@@ -12 +12 @@
  * MoveR, CopyR, DeleteR, HeadR, SortR
  * Assume: ideal/poly from ring r
- *         Coef(r) == Coef(currRing)
+ *         Coeff(r) == Coeff(currRing)
  * Move, Delete: input object is destroyed and set to NULL
  *
- * Sort: revert == TRUE is faster for polys which are almost sorted correctly
  *
  ************************************************************************/
@@ -23 +22 @@
 poly prCopyR(poly p, ring r);
 poly prHeadR(poly p, ring r);
-void prDeleteR(poly &p, ring r);
-poly prSortR(poly p, ring r, BOOLEAN revert = TRUE);
-poly prMergeR(poly p1, poly p2, ring r);
 
 ideal idrMoveR_NoSort(ideal &id, ring r);
@@ -32 +28 @@
 ideal idrCopyR(ideal id, ring r);
 ideal idrHeadR(ideal id, ring r);
-void  idrDeleteR(ideal &id, ring r);
-
-/*************************************************************************
- *
- * Copy, Delete, Sort
- *
- *************************************************************************/
-
-inline poly pSort(poly p, BOOLEAN revert = TRUE)
-{
-  return prSortR(p, currRing, revert);
-}
-
-inline poly pMerge(poly p1, poly p2)
-{
-  return prMergeR(p1, p2, currRing);
-}
-
-/*************************************************************************
- *
- * Specialized sort routines
- *
- *************************************************************************/
-// TBC: 
-// Assume: If considerd only as poly in any component of p 
-// (say, monomials of other components of p are set to 0), 
-// then p is already sorted correctly 
-#define pSortCompCorrect(p) pSort(p, TRUE)
 
 
+
+