160{
162 Pairs::iterator position = B.begin();
163 IntermediateBasis::const_iterator
end = F.end();
164 for (IntermediateBasis::const_iterator iter = F.begin(); iter !=
end; ++iter)
165 {
166 int j = iter->first;
167 for (int i = -n; i < 0; i++)
168 {
170 position = B.insert(position, pair);
171 }
172 for (int i = 0; i < j; i++)
173 {
175 if (pair.good)
176 {
177 position = B.insert(position, pair);
178 }
179 }
180 }
181 return B;
182}
S-pair record for the Franzi boolean Groebner basis algorithm.
TermIterator< Nterm > end(Nterm *)