244{
245 std::string_view fileView { contents };
247 while (fileView.size() > 0)
248 {
249 std::string_view thisline =
next_line(fileView);
250
251 if (thisline.size() == 0 or thisline[0] == '#')
252 {
253 continue;
254 }
255
258 Fs.push_back(F);
259 }
260 return Fs;
261}
std::vector< BasicPoly > BasicPolyList
std::string_view next_line(std::string_view &str)
void parseBasicPoly(const std::string_view &str, const IdentifierHash &idenHash, BasicPoly &result)
This version is a potentially faster alternative when reading many polynomials.
Standalone, self-contained polynomial representation independent of any engine Ring — coefficients ar...