207{
209 size_t n = g->
size();
210
211 bool needs_parens = p_parens && (n > 1);
212 if (needs_parens)
213 {
214 if (p_plus) o << '+';
215 o << '(';
216 p_plus = false;
217 }
218
219 p_one = false;
221 {
223 int len = *part++;
224 int isone = (len == 1);
225 p_parens = !isone;
227 o, i.getCoefficient(), p_one, p_plus, p_parens);
228 o << "{";
229 for (int j = 0; j < len - 1; j++)
230 {
231 if (j > 0) o << ",";
232 o << part[j];
233 }
234 o << "}";
235 p_plus = true;
236 }
237 if (needs_parens) o << ')';
238}
const Ring * coefficientRing
schur_poly_iterator iterator
const schur_word * const_schur_partition
const schur_poly * get_schur_poly() const