carl  24.04
Computer ARithmetic Library
sortByPolSize< Polynomial > Class Template Reference

Sorts generators of an ideal by their number of terms. More...

#include <PolynomialSorts.h>

Collaboration diagram for sortByPolSize< Polynomial >:

Public Member Functions

 sortByPolSize (const std::vector< Polynomial > &generators)
 
bool operator() (std::size_t a, std::size_t b) const
 

Private Attributes

const std::vector< Polynomial > & mGenerators
 

Detailed Description

template<class Polynomial>
class sortByPolSize< Polynomial >

Sorts generators of an ideal by their number of terms.

Parameters
generators

Definition at line 36 of file PolynomialSorts.h.

Constructor & Destructor Documentation

◆ sortByPolSize()

template<class Polynomial >
sortByPolSize< Polynomial >::sortByPolSize ( const std::vector< Polynomial > &  generators)
inlineexplicit

Definition at line 40 of file PolynomialSorts.h.

Member Function Documentation

◆ operator()()

template<class Polynomial >
bool sortByPolSize< Polynomial >::operator() ( std::size_t  a,
std::size_t  b 
) const
inline

Definition at line 43 of file PolynomialSorts.h.

Field Documentation

◆ mGenerators

template<class Polynomial >
const std::vector<Polynomial>& sortByPolSize< Polynomial >::mGenerators
private

Definition at line 47 of file PolynomialSorts.h.


The documentation for this class was generated from the following file: