carl::ReductorConfiguration< Polynomial > Class Template Reference

Class with the settings for the reduction algorithm. More...

#include <Reductor.h>

Inheritance diagram for carl::ReductorConfiguration< Polynomial >:

Public Types
using	EntryType = ReductorEntry< Polynomial >
using	Entry = EntryType *
using	CompareResult = carl::CompareResult

Static Public Member Functions
static CompareResult	compare (Entry e1, Entry e2)
static bool	cmpLessThan (CompareResult res)
static bool	cmpEqual (CompareResult res)
static bool	deduplicate (Entry e1, Entry e2)
	should only be called if the compare result was EQUAL eliminate duplicate leading monomials More...

Static Public Attributes
static const bool	supportDeduplicationWhileOrdering = false
static const bool	fastIndex = true

Detailed Description

template<class Polynomial>
class carl::ReductorConfiguration< Polynomial >

Class with the settings for the reduction algorithm.

Definition at line 23 of file Reductor.h.

Member Typedef Documentation

CompareResult

template<class Polynomial >

using carl::ReductorConfiguration< Polynomial >::CompareResult = carl::CompareResult

Definition at line 29 of file Reductor.h.

Entry

template<class Polynomial >

using carl::ReductorConfiguration< Polynomial >::Entry = EntryType*

Definition at line 28 of file Reductor.h.

EntryType

template<class Polynomial >

using carl::ReductorConfiguration< Polynomial >::EntryType = ReductorEntry<Polynomial>

Definition at line 27 of file Reductor.h.

Member Function Documentation

cmpEqual()

template<class Polynomial >

static bool carl::ReductorConfiguration< Polynomial >::cmpEqual ( CompareResult  res )

inlinestatic

Definition at line 42 of file Reductor.h.

cmpLessThan()

template<class Polynomial >

static bool carl::ReductorConfiguration< Polynomial >::cmpLessThan ( CompareResult  res )

inlinestatic

Definition at line 36 of file Reductor.h.

compare()

template<class Polynomial >

static CompareResult carl::ReductorConfiguration< Polynomial >::compare ( Entry  e1, Entry  e2  )

inlinestatic

Definition at line 31 of file Reductor.h.

Here is the call graph for this function:

deduplicate()

template<class Polynomial >

static bool carl::ReductorConfiguration< Polynomial >::deduplicate ( Entry  e1, Entry  e2  )

inlinestatic

should only be called if the compare result was EQUAL eliminate duplicate leading monomials

Parameters

e1	upper entry
e2	lower entry

Returns

true if e1->lt is cancelled

Definition at line 54 of file Reductor.h.

Here is the call graph for this function:

Field Documentation

fastIndex

template<class Polynomial >

const bool carl::ReductorConfiguration< Polynomial >::fastIndex = true

static

Definition at line 60 of file Reductor.h.

supportDeduplicationWhileOrdering

template<class Polynomial >

const bool carl::ReductorConfiguration< Polynomial >::supportDeduplicationWhileOrdering = false

static

Definition at line 40 of file Reductor.h.

---

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

• carl-arith/groebner/Reductor.h