![]() |
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 | 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_rp , ringorder_Dp , ringorder_wp , ringorder_Wp , ringorder_ls , ringorder_ds , ringorder_Ds , ringorder_ws , ringorder_Ws , ringorder_am , ringorder_L , ringorder_aa , ringorder_rs , 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 |
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 97 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 5834 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 652 of file ring.h.
Definition at line 5046 of file ring.cc.
makes sure that c/C ordering is last ordering
Definition at line 4703 of file ring.cc.
Definition at line 4634 of file ring.cc.
Definition at line 4906 of file ring.cc.
Definition at line 4444 of file ring.cc.
makes sure that c/C ordering is last ordering and SyzIndex is first
Definition at line 4758 of file ring.cc.
Definition at line 4536 of file ring.cc.
Definition at line 4859 of file ring.cc.
Definition at line 4414 of file ring.cc.
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
Definition at line 647 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 3459 of file ring.cc.
Definition at line 1421 of file ring.cc.
ring rCopy0AndAddA | ( | ring | r, |
int64vec * | wv64, | ||
BOOLEAN | copy_qideal = TRUE , |
||
BOOLEAN | copy_ordering = TRUE |
||
) |
Definition at line 1564 of file ring.cc.
Definition at line 2047 of file ring.cc.
Definition at line 4131 of file ring.cc.
ring rDefault | ( | const coeffs | cf, |
int | N, | ||
char ** | n, | ||
const rRingOrder_t | o = ringorder_lp |
||
) |
Definition at line 138 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 102 of file ring.cc.
Definition at line 155 of file ring.cc.
unconditionally deletes fields in r
Definition at line 450 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 1746 of file ring.cc.
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
Definition at line 552 of file ring.h.
Definition at line 548 of file ring.h.
Definition at line 490 of file ring.h.
Definition at line 487 of file ring.h.
Definition at line 515 of file ring.h.
Definition at line 479 of file ring.h.
Definition at line 482 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 5061 of file ring.cc.
return the max-comonent wchich has syzIndex i Assume: i<= syzIndex_limit
Definition at line 5219 of file ring.cc.
rOrderType_t rGetOrderType | ( | ring | r | ) |
Definition at line 1840 of file ring.cc.
Definition at line 4423 of file ring.cc.
Definition at line 5824 of file ring.cc.
returns TRUE, if simple lp or ls ordering
Definition at line 1919 of file ring.cc.
< How many induced ordering block do we have?
Definition at line 2707 of file ring.cc.
ring rModifyRing_Simple | ( | ring | r, |
BOOLEAN | omit_degree, | ||
BOOLEAN | omit_comp, | ||
unsigned long | exp_limit, | ||
BOOLEAN & | simple | ||
) |
Definition at line 3002 of file ring.cc.
construct Wp, C ring
Definition at line 2954 of file ring.cc.
Definition at line 5342 of file ring.cc.
Definition at line 2026 of file ring.cc.
Definition at line 2013 of file ring.cc.
rRingOrder_t rOrderName | ( | char * | ordername | ) |
Definition at line 521 of file ring.cc.
(r->cf->P)
Definition at line 599 of file ring.h.
(r->cf->parameter)
Definition at line 625 of file ring.h.
K[x],"y" -> K[x,y] resp. K[y,x].
Definition at line 5855 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 5093 of file ring.cc.
Definition at line 5147 of file ring.cc.
Definition at line 673 of file ring.cc.
Definition at line 1402 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 749 of file ring.cc.
Definition at line 3974 of file ring.cc.
Definition at line 226 of file ring.cc.
EXTERN_VAR omBin sip_sring_bin |