186{
188 Pairs::iterator position = B.begin();
189 for (int i = -n; i < 0; i++)
190 {
192 position = B.insert(position, pair);
193 }
194 IntermediateBasis::const_iterator
end = F.end();
196 for (IntermediateBasis::const_iterator iter = F.begin(); iter !=
end; ++iter)
197 {
198 int j = iter->first;
200 if (pair.good)
201 {
202 position = B.insert(position, pair);
203 }
204 }
205 return B;
206}
S-pair record for the Franzi boolean Groebner basis algorithm.
TermIterator< Nterm > end(Nterm *)