![]() |
My Project
|
#include "misc/auxiliary.h"
#include "coeffs/coeffs.h"
#include "misc/intvec.h"
#include "misc/int64vec.h"
#include "polys/monomials/monomials.h"
Go to the source code of this file.
Data Structures | |
struct | sro_dp |
struct | sro_wp |
struct | sro_am |
struct | sro_wp64 |
struct | sro_cp |
struct | sro_syzcomp |
struct | sro_syz |
struct | sro_ISTemp |
struct | sro_IS |
struct | sro_ord |
struct | ring |
union | sro_ord.data |
Macros | |
#define | ringorder_rp ringorder_ip |
#define | ringorder_rs ringorder_is |
#define | rField_is_Ring(R) nCoeff_is_Ring((R)->cf) |
#define | rTest(r) rDBTest(r, __FILE__, __LINE__) |
Typedefs | |
typedef idrec * | idhdl |
typedef struct p_Procs_s | p_Procs_s |
typedef kBucket * | kBucket_pt |
typedef long(* | pLDegProc) (poly p, int *length, ring r) |
typedef long(* | pFDegProc) (poly p, ring r) |
typedef void(* | p_SetmProc) (poly p, const ring r) |
typedef poly(* | pShallowCopyDeleteProc) (poly s_p, ring source_r, ring dest_r, omBin dest_bin) |
returns a poly from dest_r which is a ShallowCopy of s_p from source_r assumes that source_r->N == dest_r->N and that orderings are the same | |
typedef skStrategy * | kStrategy |
typedef poly(* | NF_Proc) (ideal, ideal, poly, int, int, const ring _currRing) |
typedef ideal(* | BBA_Proc) (const ideal, const ideal, const intvec *, const intvec *, kStrategy strat, const ring) |
Enumerations | |
enum | ro_typ { ro_dp , ro_wp , ro_am , ro_wp64 , ro_wp_neg , ro_cp , ro_syzcomp , ro_syz , ro_isTemp , ro_is , ro_none } |
enum | rRingOrder_t { ringorder_no = 0 , ringorder_a , ringorder_a64 , ringorder_c , ringorder_C , ringorder_M , ringorder_S , ringorder_s , ringorder_lp , ringorder_dp , ringorder_ip , ringorder_Dp , ringorder_wp , ringorder_Wp , ringorder_Ip , ringorder_ls , ringorder_ds , ringorder_Ds , ringorder_ws , ringorder_Ws , ringorder_am , ringorder_L , ringorder_aa , ringorder_is , ringorder_IS , ringorder_unspec } |
order stuff More... | |
enum | rOrderType_t { rOrderType_General = 0 , rOrderType_CompExp , rOrderType_ExpComp , rOrderType_Exp , rOrderType_Syz , rOrderType_Schreyer , rOrderType_Syz2dpc , rOrderType_ExpNoComp } |
Variables | |
EXTERN_VAR omBin | sip_sring_bin |
struct sro_wp |
struct sro_am |
struct sro_wp64 |
struct sro_syzcomp |
struct sro_syz |
struct sro_ISTemp |
struct sro_IS |
struct sro_ord |
Data Fields | ||
---|---|---|
union sro_ord.data | data | |
ro_typ | ord_typ | |
int | order_index |
union sro_ord.data |
#define ringorder_rp ringorder_ip |
#define ringorder_rs ringorder_is |
Enumerator | |
---|---|
ro_dp | |
ro_wp | |
ro_am | |
ro_wp64 | |
ro_wp_neg | |
ro_cp | |
ro_syzcomp | |
ro_syz | |
ro_isTemp | |
ro_is | |
ro_none |
Definition at line 102 of file ring.h.
order stuff
Definition at line 67 of file ring.h.
if m == var(i)/1 => return i,
if m == var(i)/1 => return i,
Definition at line 5861 of file ring.cc.
return the specified parameter as a (new!) number in the given polynomial ring, or NULL if invalid parameters (as variables) begin with 1!
Definition at line 657 of file ring.h.
Definition at line 5069 of file ring.cc.
makes sure that c/C ordering is last ordering
Definition at line 4726 of file ring.cc.
Definition at line 4657 of file ring.cc.
Definition at line 4929 of file ring.cc.
Definition at line 4467 of file ring.cc.
makes sure that c/C ordering is last ordering and SyzIndex is first
Definition at line 4781 of file ring.cc.
Definition at line 4559 of file ring.cc.
Definition at line 4882 of file ring.cc.
Definition at line 4437 of file ring.cc.
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
Definition at line 649 of file ring.cc.
this needs to be called whenever a new ring is created: new fields in ring are created (like VarOffset), unless they already exist with force == 1, new fields are always created (overwritten), even if they exist
Definition at line 3466 of file ring.cc.
Definition at line 1423 of file ring.cc.
ring rCopy0AndAddA | ( | ring | r, |
int64vec * | wv64, | ||
BOOLEAN | copy_qideal = TRUE, | ||
BOOLEAN | copy_ordering = TRUE ) |
Definition at line 1566 of file ring.cc.
Definition at line 2054 of file ring.cc.
Definition at line 4154 of file ring.cc.
ring rDefault | ( | const coeffs | cf, |
int | N, | ||
char ** | n, | ||
const rRingOrder_t | o = ringorder_lp ) |
Definition at line 139 of file ring.cc.
ring rDefault | ( | const coeffs | cf, |
int | N, | ||
char ** | n, | ||
int | ord_size, | ||
rRingOrder_t * | ord, | ||
int * | block0, | ||
int * | block1, | ||
int ** | wvhdl = NULL, | ||
unsigned long | bitmask = 0 ) |
Definition at line 103 of file ring.cc.
Definition at line 156 of file ring.cc.
unconditionally deletes fields in r
Definition at line 452 of file ring.cc.
returns TRUE, if r1 equals r2 FALSE, otherwise Equality is determined componentwise, if qr == 1, then qrideal equality is tested, as well
Definition at line 1748 of file ring.cc.
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
Definition at line 557 of file ring.h.
Definition at line 553 of file ring.h.
Definition at line 495 of file ring.h.
Definition at line 492 of file ring.h.
Definition at line 520 of file ring.h.
Definition at line 484 of file ring.h.
Definition at line 487 of file ring.h.
|
inlinestatic |
return the position of the p^th IS block order block in r->typ[]...
return the position of the p^th IS block order block in r->typ[]...
Definition at line 5084 of file ring.cc.
return the max-comonent wchich has syzIndex i Assume: i<= syzIndex_limit
Definition at line 5242 of file ring.cc.
rOrderType_t rGetOrderType | ( | ring | r | ) |
Definition at line 1842 of file ring.cc.
Definition at line 4446 of file ring.cc.
Definition at line 5851 of file ring.cc.
returns TRUE, if simple lp or ls ordering
Definition at line 1921 of file ring.cc.
< How many induced ordering block do we have?
Definition at line 2714 of file ring.cc.
ring rModifyRing_Simple | ( | ring | r, |
BOOLEAN | omit_degree, | ||
BOOLEAN | omit_comp, | ||
unsigned long | exp_limit, | ||
BOOLEAN & | simple ) |
Definition at line 3009 of file ring.cc.
construct Wp, C ring
Definition at line 2961 of file ring.cc.
Definition at line 5365 of file ring.cc.
Definition at line 2028 of file ring.cc.
Definition at line 2035 of file ring.cc.
Definition at line 2015 of file ring.cc.
rRingOrder_t rOrderName | ( | char * | ordername | ) |
Definition at line 523 of file ring.cc.
(r->cf->P)
Definition at line 604 of file ring.h.
(r->cf->parameter)
Definition at line 630 of file ring.h.
K[x],"y" -> K[x,y] resp. K[y,x].
Definition at line 5882 of file ring.cc.
returns TRUE, if r1 and r2 represents the monomials in the same way FALSE, otherwise this is an analogue to rEqual but not so strict
Changes r by setting induced ordering parameters: limit and reference leading terms F belong to r, we will DO a copy! We will use it AS IS! returns true is everything was allright!
Definition at line 5116 of file ring.cc.
Definition at line 5170 of file ring.cc.
Definition at line 675 of file ring.cc.
Definition at line 1404 of file ring.cc.
returns -1 for not compatible, 1 for compatible (and sum) dp_dp:0: block ordering, 1: dp,dp, 2: aa(...),dp vartest: check for name conflicts
Definition at line 751 of file ring.cc.
Definition at line 3997 of file ring.cc.
Definition at line 227 of file ring.cc.
EXTERN_VAR omBin sip_sring_bin |