本文整理汇总了C++中Poly::ring方法的典型用法代码示例。如果您正苦于以下问题:C++ Poly::ring方法的具体用法?C++ Poly::ring怎么用?C++ Poly::ring使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Poly
的用法示例。
在下文中一共展示了Poly::ring方法的5个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: pos
ReducerPack<Q>::MultipleWithPos::MultipleWithPos(
const Poly& poly,
NewConstTerm multipleParam
):
pos(poly.begin()),
end(poly.end()),
current(poly.ring().allocMonomial())
{
multiple.mono = poly.ring().monoid().alloc().release();
poly.ring().monoid().copy(*multipleParam.mono, *multiple.mono);
multiple.coef = multipleParam.coef;
}
示例2: insertEntry
void ReducerHashPack<Q>::insert(ConstMonoRef multiple, const Poly& poly) {
MATHICGB_ASSERT(&poly.ring() == &mRing);
if (poly.isZero())
return;
NewConstTerm termMultiple = {1, multiple.ptr()};
insertEntry(new (mPool.alloc()) MultipleWithPos(poly, termMultiple));
}
示例3: new
void ReducerHashPack<Q>::insertTail(NewConstTerm multiple, const Poly& poly) {
MATHICGB_ASSERT(&poly.ring() == &mRing);
if (poly.termCount() <= 1)
return;
auto entry = new (mPool.alloc()) MultipleWithPos(poly, multiple);
++entry->pos;
insertEntry(entry);
}
示例4: new
void ReducerPackDedup<Q>::insert(ConstMonoRef multiple, const Poly& poly) {
if (poly.isZero())
return;
mLeadTermKnown = false;
NewConstTerm termMultiple = {1, multiple.ptr()};
auto entry = new (mPool.alloc()) MultipleWithPos(poly, termMultiple);
entry->computeCurrent(poly.ring());
mQueue.push(entry);
}
示例5: pos
TournamentReducer::MultipleWithPos::MultipleWithPos
(const Poly& poly, const_term multiple):
pos(poly.begin()),
end(poly.end()),
multiple(allocTerm(poly.ring(), multiple)),
current(poly.ring().allocMonomial()) {}