Sorts generators of an ideal by their number of terms.
More...
#include <PolynomialSorts.h>
template<class Polynomial>
class sortByPolSize< Polynomial >
Sorts generators of an ideal by their number of terms.
- Parameters
-
Definition at line 36 of file PolynomialSorts.h.
◆ sortByPolSize()
template<class Polynomial >
◆ operator()()
template<class Polynomial >
bool sortByPolSize< Polynomial >::operator() |
( |
std::size_t |
a, |
|
|
std::size_t |
b |
|
) |
| const |
|
inline |
◆ mGenerators
template<class Polynomial >
const std::vector<Polynomial>& sortByPolSize< Polynomial >::mGenerators |
|
private |
The documentation for this class was generated from the following file: