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