carl  24.04
Computer ARithmetic Library
carl::Factorization< P > Class Template Reference

#include <PolynomialFactorizationPair.h>

Inheritance diagram for carl::Factorization< P >:
Collaboration diagram for carl::Factorization< P >:

Public Member Functions

std::pair< typename super::iterator, bool > insert (typename super::const_iterator _hint, const std::pair< FactorizedPolynomial< P >, carl::exponent > &_val)
 
super::iterator insert (typename super::const_iterator _hint, std::pair< FactorizedPolynomial< P >, carl::exponent > &&_val)
 
std::pair< typename super::iterator, bool > insert (const std::pair< FactorizedPolynomial< P >, carl::exponent > &_val)
 
std::pair< typename super::iterator, bool > insert (std::pair< FactorizedPolynomial< P >, carl::exponent > &&_val)
 
void insert (typename super::const_iterator _first, typename super::const_iterator _last)
 

Data Fields

keys
 STL member. More...
 
elements
 STL member. More...
 

Private Types

using super = std::map< FactorizedPolynomial< P >, carl::exponent >
 

Private Member Functions

bool checkFactorization () const
 

Detailed Description

template<typename P>
class carl::Factorization< P >

Definition at line 22 of file PolynomialFactorizationPair.h.

Member Typedef Documentation

◆ super

template<typename P >
using carl::Factorization< P >::super = std::map<FactorizedPolynomial<P>, carl::exponent>
private

Definition at line 25 of file PolynomialFactorizationPair.h.

Member Function Documentation

◆ checkFactorization()

template<typename P >
bool carl::Factorization< P >::checkFactorization ( ) const
inlineprivate

Definition at line 27 of file PolynomialFactorizationPair.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ insert() [1/5]

template<typename P >
std::pair<typename super::iterator, bool> carl::Factorization< P >::insert ( const std::pair< FactorizedPolynomial< P >, carl::exponent > &  _val)
inline

Definition at line 51 of file PolynomialFactorizationPair.h.

Here is the call graph for this function:

◆ insert() [2/5]

template<typename P >
std::pair<typename super::iterator, bool> carl::Factorization< P >::insert ( std::pair< FactorizedPolynomial< P >, carl::exponent > &&  _val)
inline

Definition at line 56 of file PolynomialFactorizationPair.h.

Here is the call graph for this function:

◆ insert() [3/5]

template<typename P >
void carl::Factorization< P >::insert ( typename super::const_iterator  _first,
typename super::const_iterator  _last 
)
inline

Definition at line 69 of file PolynomialFactorizationPair.h.

◆ insert() [4/5]

template<typename P >
std::pair<typename super::iterator, bool> carl::Factorization< P >::insert ( typename super::const_iterator  _hint,
const std::pair< FactorizedPolynomial< P >, carl::exponent > &  _val 
)
inline

Definition at line 38 of file PolynomialFactorizationPair.h.

Here is the caller graph for this function:

◆ insert() [5/5]

template<typename P >
super::iterator carl::Factorization< P >::insert ( typename super::const_iterator  _hint,
std::pair< FactorizedPolynomial< P >, carl::exponent > &&  _val 
)
inline

Definition at line 43 of file PolynomialFactorizationPair.h.

Here is the call graph for this function:

Field Documentation

◆ elements

T std::map< K, T >::elements
inherited

STL member.

◆ keys

K std::map< K, T >::keys
inherited

STL member.


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