A data structure to store all the SPolynomial pairs which have to be checked.
More...
#include <CriticalPairs.h>
template<template< class > class Datastructure, class Configuration>
class carl::CriticalPairs< Datastructure, Configuration >
A data structure to store all the SPolynomial pairs which have to be checked.
Definition at line 53 of file CriticalPairs.h.
◆ CriticalPairs()
template<template< class > class Datastructure, class Configuration >
◆ elimMultiples()
template<template< class > class Datastructure, class Configuration >
Eliminate multiples of the given monomial.
- Parameters
-
◆ empty()
template<template< class > class Datastructure, class Configuration >
Checks whether there are any pairs in the data structure.
- Returns
Definition at line 88 of file CriticalPairs.h.
◆ pop()
template<template< class > class Datastructure, class Configuration >
Gets the first SPol from the data structure and removes it from the data structure.
- Returns
◆ print()
template<template< class > class Datastructure, class Configuration >
◆ push()
template<template< class > class Datastructure, class Configuration >
Add a list of s-pairs to the list.
- Parameters
-
Definition at line 66 of file CriticalPairs.h.
◆ size()
template<template< class > class Datastructure, class Configuration >
Checks the size of the data structure.
Please notice that this is not necessarily the number of pairs in the data structure, as the underlying elements may be lists themselves.
- Returns
Definition at line 106 of file CriticalPairs.h.
◆ mDatastruct
template<template< class > class Datastructure, class Configuration >
The documentation for this class was generated from the following file: