source: git/Singular/p_Copy__T.cc @ 7497ef3

fieker-DuValspielwiese
Last change on this file since 7497ef3 was a3bc95e, checked in by Hans Schönemann <hannes@…>, 23 years ago
*hannes: namespaces ->ns git-svn-id: file:///usr/local/Singular/svn/trunk@5651 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 1.0 KB
RevLine 
[9d72fe]1/****************************************
2*  Computer Algebra System SINGULAR     *
3****************************************/
4/***************************************************************
5 *  File:    p_Copy__Template.cc
6 *  Purpose: template for p_Copy
7 *  Author:  obachman (Olaf Bachmann)
8 *  Created: 8/00
[a3bc95e]9 *  Version: $Id: p_Copy__T.cc,v 1.3 2001-10-09 16:36:13 Singular Exp $
[9d72fe]10 *******************************************************************/
11
[7e5a38]12LINKAGE poly p_Copy(poly s_p, const ring r)
[9d72fe]13{
[512a2b]14  // let's not do tests here -- but instead allow
15  // to be sloppy
[9d72fe]16  spolyrec dp;
17  poly d_p = &dp;
18  omBin bin = r->PolyBin;
19  poly h;
[a3bc95e]20
[4e6cf2]21  DECLARE_LENGTH(const unsigned long length = r->ExpL_Size);
[9d72fe]22
23  while (s_p != NULL)
24  {
[512a2b]25    p_AllocBin(pNext(d_p), bin, r);
[9d72fe]26    pIter(d_p);
[512a2b]27    pSetCoeff0(d_p, n_Copy(pGetCoeff(s_p), r));
[9d72fe]28    // it is better to iter here,
29    // for MemCopy advances goes from low to high addresses
30    h = s_p;
31    s_p = pNext(s_p);
[a6a239]32    p_MemCopy(d_p->exp, h->exp, length);
[9d72fe]33  }
34  pNext(d_p) = NULL;
35
36  return dp.next;
37}
38
Note: See TracBrowser for help on using the repository browser.