Changeset 43b04d in git
- Timestamp:
- Jul 3, 2015, 9:57:43 AM (8 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- Children:
- 1550ecaad46efdce1c9032818b53259c1f6c108a
- Parents:
- 74dcead93fa7d8032514e5919362facbb50b1c0e
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/combinatorics/hdegree.cc
r74dcead r43b04d 1031 1031 else 1032 1032 hNstc = hNexist; 1033 if (hNexist==0) 1034 { 1035 return; 1036 } 1033 1037 hwork = (scfmon)omAlloc(hNexist * sizeof(scmon)); 1034 1038 hvar = (varset)omAlloc((hNvar + 1) * sizeof(int)); -
libpolys/polys/kbuckets.cc
r74dcead r43b04d 14 14 #include <coeffs/coeffs.h> 15 15 #include <polys/monomials/ring.h> 16 //#include < kernel/p_Procs.h>16 //#include <libpolys/polys/templates/p_Procs.h> 17 17 //#include <kernel/GBEngine/kutil.h> 18 18 #include <polys/kbuckets.h> -
libpolys/polys/monomials/p_polys.cc
r74dcead r43b04d 4530 4530 unsigned long p_GetShortExpVector(const poly p, const ring r) 4531 4531 { 4532 if (p == NULL) return 0; 4532 4533 assume(p != NULL); 4533 if (p == NULL) return 0;4534 4534 unsigned long ev = 0; // short exponent vector 4535 4535 unsigned int n = BIT_SIZEOF_LONG / r->N; // number of bits per exp -
libpolys/polys/monomials/ring.cc
r74dcead r43b04d 4861 4861 { 4862 4862 return rAssure_Global(ringorder_C, ringorder_dp, r); 4863 } 4864 4865 ring rAssure_c_dp(const ring r) 4866 { 4867 return rAssure_Global(ringorder_c, ringorder_dp, r); 4863 4868 } 4864 4869 -
libpolys/polys/monomials/ring.h
r74dcead r43b04d 724 724 ring rAssure_dp_C(const ring r); 725 725 ring rAssure_C_dp(const ring r); 726 ring rAssure_c_dp(const ring r); 726 727 727 728 /// makes sure that c/C ordering is last ordering
Note: See TracChangeset
for help on using the changeset viewer.