Frobby 0.10.0
Loading...
Searching...
No Matches
MsmSlice Class Reference

#include <MsmSlice.h>

Inheritance diagram for MsmSlice:
Collaboration diagram for MsmSlice:

Public Member Functions

 MsmSlice (MsmStrategy &strategy)
 MsmSlice (MsmStrategy &strategy, const Ideal &ideal, const Ideal &subtract, const Term &multiply, TermConsumer *consumer)
TermConsumer * getConsumer ()
virtual bool baseCase (bool simplified)
virtual Slice & operator= (const Slice &slice)
virtual bool simplifyStep ()
void setToProjOf (const MsmSlice &slice, const Projection &projection, TermConsumer *consumer)
void swap (MsmSlice &slice)
virtual bool innerSlice (const Term &pivot)
virtual void outerSlice (const Term &pivot)
Public Member Functions inherited from Slice
 Slice (SliceStrategy &strategy)
 Slice (SliceStrategy &strategy, const Ideal &ideal, const Ideal &subtract, const Term &multiply)
size_t getVarCount () const
const Ideal & getIdeal () const
Ideal & getSubtract ()
const Ideal & getSubtract () const
Term & getMultiply ()
const Term & getMultiply () const
const Term & getLcm () const
void print (FILE *file) const
void resetAndSetVarCount (size_t varCount)
void clearIdealAndSubtract ()
void singleDegreeSortIdeal (size_t var)
bool normalize ()
bool adjustMultiply ()
virtual bool simplify ()
virtual void run (TaskEngine &tasks)
virtual void dispose ()

Additional Inherited Members

void setToProjOf (const Slice &slice, const Projection &projection)
void swap (Slice &slice)
bool pruneSubtract ()
bool applyLowerBound ()
Ideal _ideal
Ideal _subtract
Term _multiply
size_t _varCount
Term _lcm
bool _lcmUpdated
size_t _lowerBoundHint
SliceStrategy & _strategy

Detailed Description

Invariant: either the slice is a trivial base case, or removeDoubleLcm returns false.

Todo
expand and check comments.

Member Function Documentation

◆ baseCase()

bool MsmSlice::baseCase ( bool simplified)
virtual

Returns true if this slice is a base case slice, and in that case produces output in a derivative-specific way. If simplified is true, then the slice must be fully simplified when calling baseCase(), while otherwise there is no such requirement.

Implements Slice.

◆ innerSlice()

bool MsmSlice::innerSlice ( const Term & pivot)
virtual

Sets this object to the inner slice according to pivot. To be precise, the slice $(I,S,q)$ is replaced by $(I:p,S:p,qp)$ where $p$ is the pivot, and the slice is then normalized (see normalize).

Returns true if any of the colon operations $I:p$ and $S:p$ were non-trivial in the sense that it changed the support of any minimal generator.

Reimplemented from Slice.

◆ operator=()

Slice & MsmSlice::operator= ( const Slice & slice)
virtual

Performs a deep copy of slice into this object.

Implements Slice.

◆ outerSlice()

void MsmSlice::outerSlice ( const Term & pivot)
virtual

Sets this object to the outer slice according to pivot. To be precise, the slice $(I,S,q)$ is replaced by $(I,S+\ideal
p,q)$ where $p$ is the pivot, and the slice is then normalized (see normalize).

Note that if pivot is a pure power, then pivot is not actually inserted into $S$ since doing so has no effect on the content after the normalization.

Reimplemented from Slice.

◆ simplifyStep()

bool MsmSlice::simplifyStep ( )
virtual

Like simplify(), except that only one simplification step is performed. If the return value is true, then the Slice may not be fully simplified yet. Iterating simplifyStep() has the same result as calling simplify(), though the performance characteristics can be worse.

Todo
Is this method actually used, and does it return true iff this object changed?

Implements Slice.


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