Changeset 9982049 in git


Ignore:
Timestamp:
Aug 13, 2009, 7:31:50 PM (14 years ago)
Author:
Motsak Oleksandr <motsak@…>
Branches:
(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
Children:
6a4509cdda6450d69b9c13e445571024e407a07d
Parents:
e024c6c7d55e55f6cf66fb9de0d37e618f6e601a
Message:
*motsak: some fixes and addons


git-svn-id: file:///usr/local/Singular/svn/trunk@12064 2c84dea3-7e68-4137-9b89-c4e89433aadc
Location:
kernel
Files:
7 edited

Legend:

Unmodified
Added
Removed
  • kernel/ideals.cc

    re024c6c r9982049  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: ideals.cc,v 1.76 2009-07-27 08:31:18 Singular Exp $ */
     4/* $Id: ideals.cc,v 1.77 2009-08-13 17:31:49 motsak Exp $ */
    55/*
    66* ABSTRACT - all basic methods to manipulate ideals
     
    7070}
    7171
    72 #ifndef __OPTIMIZE__
    73 // this is mainly for outputting an ideal within the debugger
     72//#ifndef __OPTIMIZE__
     73// this is mainly for outputting an ideal within the debugger & DetailedPrint
    7474void idShow(const ideal id, const ring lmRing, const ring tailRing, const int debugPrint)
    7575{
     
    9191  }
    9292}
    93 #endif
     93//#endif
    9494
    9595/*2
  • kernel/kstd1.cc

    re024c6c r9982049  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: kstd1.cc,v 1.57 2009-07-27 08:31:44 Singular Exp $ */
     4/* $Id: kstd1.cc,v 1.58 2009-08-13 17:31:49 motsak Exp $ */
    55/*
    66* ABSTRACT:
     
    17641764
    17651765#if MYTEST
    1766   PrintS("kSTD: currRing: "); rWrite(currRing);
     1766  if (TEST_OPT_DEBUG)
     1767  {
     1768    PrintS("// kSTD: currRing: ");
     1769    rWrite(currRing);
     1770  }
    17671771#endif
    17681772
  • kernel/kstd2.cc

    re024c6c r9982049  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: kstd2.cc,v 1.99 2009-07-20 12:00:51 motsak Exp $ */
     4/* $Id: kstd2.cc,v 1.100 2009-08-13 17:31:49 motsak Exp $ */
    55/*
    66*  ABSTRACT -  Kernel: alg. of Buchberger
     
    10021002#ifdef KDEBUG
    10031003#if MYTEST
    1004   PrintS("bba start GB: currRing: ");
    1005   rWrite(currRing);PrintLn(); rDebugPrint(currRing);
    1006   PrintLn();
    1007 
    1008   if(strat->tailRing != NULL && strat->tailRing != currRing)
    1009   {
    1010     PrintS("bba start GB: tailRing: ");
    1011     rWrite(strat->tailRing);PrintLn(); rDebugPrint(strat->tailRing);
     1004  if (TEST_OPT_DEBUG)
     1005  { 
     1006    PrintS("bba start GB: currRing: ");
     1007    // rWrite(currRing);PrintLn();
     1008    rDebugPrint(currRing);
     1009    PrintLn();
     1010
     1011    if(strat->tailRing != NULL && strat->tailRing != currRing)
     1012    {
     1013      PrintS("// **** bba start GB: tailRing: ");
     1014      rWrite(strat->tailRing);PrintLn(); rDebugPrint(strat->tailRing);
     1015    }
    10121016  }
    10131017#endif /* MYTEST */
  • kernel/kutil.cc

    re024c6c r9982049  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: kutil.cc,v 1.149 2009-07-28 14:15:05 Singular Exp $ */
     4/* $Id: kutil.cc,v 1.150 2009-08-13 17:31:50 motsak Exp $ */
    55/*
    66* ABSTRACT: kernel: utils for kStd
     
    15861586      if (TEST_OPT_DEBUG)
    15871587      {
    1588         PrintS("strat->S[i]: "); pWrite(strat->S[i]);
     1588        PrintS("enterOnePairNormal::\n strat->S[i]: "); pWrite(strat->S[i]);
    15891589        PrintS("p: "); pWrite(p);
    15901590        PrintS("SPoly: "); pWrite(Lp.p);
     
    16011601      if (TEST_OPT_DEBUG)
    16021602      {
    1603         PrintS("strat->S[i]: "); pWrite(strat->S[i]);
     1603        PrintS("enterOnePairNormal::\n strat->S[i]: "); pWrite(strat->S[i]);
    16041604        PrintS("p: "); pWrite(p);
    16051605        PrintS("commutative SPoly: "); pWrite(Lp.p);
  • kernel/mod2.h.in

    re024c6c r9982049  
    66 *          DO NOT EDIT!
    77 *
    8  *  Version: $Id: mod2.h.in,v 1.40 2009-07-28 14:15:05 Singular Exp $
     8 *  Version: $Id: mod2.h.in,v 1.41 2009-08-13 17:31:50 motsak Exp $
    99 *******************************************************************/
    1010#ifndef MOD2_H
     
    109109#undef HAVE_SIGINTERRUPT
    110110/* define for boost includes and lib */
    111 #undef HAVE_BOOST_DYNAMIC_BITSET_HPP
     111/////////////////////// #undef HAVE_BOOST_DYNAMIC_BITSET_HPP
    112112/* define for std:vector includes */
    113113#undef USE_STDVECBOOL
  • kernel/p_polys.cc

    re024c6c r9982049  
    77 *  Author:  obachman (Olaf Bachmann)
    88 *  Created: 8/00
    9  *  Version: $Id: p_polys.cc,v 1.18 2009-07-20 12:00:51 motsak Exp $
     9 *  Version: $Id: p_polys.cc,v 1.19 2009-08-13 17:31:50 motsak Exp $
    1010 *******************************************************************/
    1111
     12
    1213#include "mod2.h"
     14
     15#ifndef NDEBUG
     16# define MYTEST 0
     17#else /* ifndef NDEBUG */
     18# define MYTEST 0
     19#endif /* ifndef NDEBUG */
     20
    1321#include "structs.h"
    1422#include "structs.h"
  • kernel/ring.cc

    re024c6c r9982049  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: ring.cc,v 1.127 2009-07-28 10:01:32 Singular Exp $ */
     4/* $Id: ring.cc,v 1.128 2009-08-13 17:31:50 motsak Exp $ */
    55
    66/*
     
    41554155  else
    41564156    PrintS("0\n");
     4157}
     4158
     4159
     4160
     4161//    F = system("ISUpdateComponents", F, V, MIN );
     4162//    // replace gen(i) -> gen(MIN + V[i-MIN]) for all i > MIN in all terms from F!
     4163void pISUpdateComponents(ideal F, const intvec *const V, const int MIN, const ring r = currRing)
     4164{
     4165  assume( V != NULL );
     4166  assume( MIN >= 0 );
     4167
     4168  if( F == NULL )
     4169    return;
     4170
     4171  for( int j = (F->ncols*F->nrows) - 1; j >= 0; j-- )
     4172  {
     4173#ifdef PDEBUG
     4174    Print("F[%d]:", j);
     4175    p_DebugPrint(F->m[j], r, r, 0);
     4176#endif
     4177   
     4178    for( poly p = F->m[j]; p != NULL; pIter(p) )
     4179    {     
     4180      int c = p_GetComp(p, r);
     4181
     4182      if( c > MIN )
     4183      {
     4184#ifdef PDEBUG   
     4185        Print("gen[%d] -> gen(%d)\n", c, MIN + (*V)[ c - MIN - 1 ]);
     4186#endif
     4187       
     4188        p_SetComp( p, MIN + (*V)[ c - MIN - 1 ], r );
     4189      }
     4190    }
     4191#ifdef PDEBUG   
     4192    Print("new F[%d]:", j);
     4193    p_Test(F->m[j], r);
     4194    p_DebugPrint(F->m[j], r, r, 0);
     4195#endif
     4196  }
     4197
    41574198}
    41584199
Note: See TracChangeset for help on using the changeset viewer.