Changeset 512a2b in git for Singular/p_Copy__Template.cc


Ignore:
Timestamp:
Sep 18, 2000, 11:19:39 AM (24 years ago)
Author:
Olaf Bachmann <obachman@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
d1655e92ca71fb37d1b57af88efdff5b65b8988b
Parents:
f3398d316400fe1ee1677fc397cacb80566ac664
Message:
p_polys.h


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

Legend:

Unmodified
Added
Removed
  • Singular/p_Copy__Template.cc

    rf3398d r512a2b  
    77 *  Author:  obachman (Olaf Bachmann)
    88 *  Created: 8/00
    9  *  Version: $Id: p_Copy__Template.cc,v 1.2 2000-09-12 16:01:06 obachman Exp $
     9 *  Version: $Id: p_Copy__Template.cc,v 1.3 2000-09-18 09:19:25 obachman Exp $
    1010 *******************************************************************/
    1111
    1212poly p_Copy(poly s_p, const ring r)
    1313{
    14   pTest(s_p);
     14  // let's not do tests here -- but instead allow
     15  // to be sloppy
    1516  spolyrec dp;
    1617  poly d_p = &dp;
     
    2223  while (s_p != NULL)
    2324  {
    24     omTypeAllocBin(poly, pNext(d_p), bin);
     25    p_AllocBin(pNext(d_p), bin, r);
    2526    pIter(d_p);
    26     pSetCoeff0(d_p, p_nCopy(pGetCoeff(s_p), r));
     27    pSetCoeff0(d_p, n_Copy(pGetCoeff(s_p), r));
    2728    // it is better to iter here,
    2829    // for MemCopy advances goes from low to high addresses
     
    3334  pNext(d_p) = NULL;
    3435
    35   pTest(dp.next);
    36 #if PDEBUG
    37   assume(pEqual(s_p, dp.next));
    38 #endif
    3936  return dp.next;
    4037}
Note: See TracChangeset for help on using the changeset viewer.