Loading...
Searching...
No Matches
prCopy.h
Go to the documentation of this file.
#ifndef PRCOPY_H
#define PRCOPY_H
/****************************************
* Computer Algebra System SINGULAR *
****************************************/
/*
* ABSTRACT - declarations of functions for Copy/Move/Delete for Polys
*/
#include "polys/monomials/ring.h"
typedef number (*nMapFunc)(number a, const coeffs src, const coeffs dst);
/*************************************************************************
*
* MoveR, CopyR, ShallowCopyR: operations to get ideals/polys
* from source_r to dest_r where
* - Coeff(source_r) == Coeff(dest_r)
* - dest_r->N <= source_r->N
* Move: input is destroyed
* ShallowCopy: monomials are copied, coeffs are set
* Copy: monomials and coeffs are copied
*
************************************************************************/
poly prMoveR_NoSort(poly &p, ring r, ring dest_r);
poly prMoveR(poly &p, ring r, ring dest_r);
poly prCopyR_NoSort(poly p, ring r, ring dest_r);
poly prCopyR(poly p, ring r, ring dest_r);
poly prShallowCopyR_NoSort(poly p, ring r, ring dest_t);
poly prShallowCopyR(poly p, ring r, ring dest_t);
poly prHeadR(poly p, ring r, ring dest_rg);
ideal idrMoveR_NoSort(ideal &id, ring r, ring dest_r );
ideal idrMoveR(ideal &id, ring r, ring dest_r );
ideal idrCopyR_NoSort(ideal id, ring r, ring dest_r );
ideal idrCopyR(ideal id, ring r, ring dest_r );
ideal idrShallowCopyR_NoSort(ideal id, ring r, ring dest_r );
ideal idrShallowCopyR(ideal id, ring r, ring dest_r );
/// Copy leading terms of id[i] via prHeeadR into dest_r
ideal idrHeadR(ideal id, ring r, ring dest_r );
poly prMapR(poly src, nMapFunc nMap, ring src_r, ring dest_r);
#endif
p
int p
Definition cfModGcd.cc:4086
nMapFunc
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
Definition coeffs.h:80
coeffs
The main handler for Singular numbers which are suitable for Singular polynomials.
idrCopyR_NoSort
ideal idrCopyR_NoSort(ideal id, ring r, ring dest_r)
Definition prCopy.cc:205
prCopyR_NoSort
poly prCopyR_NoSort(poly p, ring r, ring dest_r)
Definition prCopy.cc:77
idrCopyR
ideal idrCopyR(ideal id, ring r, ring dest_r)
Definition prCopy.cc:192
prMapR
poly prMapR(poly src, nMapFunc nMap, ring src_r, ring dest_r)
Definition prCopy.cc:45
prCopyR
poly prCopyR(poly p, ring r, ring dest_r)
Definition prCopy.cc:34
idrMoveR_NoSort
ideal idrMoveR_NoSort(ideal &id, ring r, ring dest_r)
Definition prCopy.cc:261
prMoveR_NoSort
poly prMoveR_NoSort(poly &p, ring r, ring dest_r)
Definition prCopy.cc:101
idrShallowCopyR
ideal idrShallowCopyR(ideal id, ring r, ring dest_r)
Definition prCopy.cc:220
prShallowCopyR_NoSort
poly prShallowCopyR_NoSort(poly p, ring r, ring dest_t)
Definition prCopy.cc:112
prShallowCopyR
poly prShallowCopyR(poly p, ring r, ring dest_t)
Definition prCopy.cc:117
idrShallowCopyR_NoSort
ideal idrShallowCopyR_NoSort(ideal id, ring r, ring dest_r)
Definition prCopy.cc:225
idrMoveR
ideal idrMoveR(ideal &id, ring r, ring dest_r)
Definition prCopy.cc:248
prHeadR
poly prHeadR(poly p, ring r, ring dest_rg)
Definition prCopy.cc:141
idrHeadR
ideal idrHeadR(ideal id, ring r, ring dest_r)
Copy leading terms of id[i] via prHeeadR into dest_r.
Definition prCopy.cc:156
prMoveR
poly prMoveR(poly &p, ring r, ring dest_r)
Definition prCopy.cc:90
ring.h