pruneComplex(...,Strategy=>...) -- Whether to use the methods in the package or C++ algorithms in the engine

Possible values:

null: use the algorithms written using the Macaulay2 language;

Engine: use the algorithms implemented using C++ in the Engine (version 1.11 and up).

For optional inputs, the Engine algorithms only support PruningMap, "left" or "right" as Direction, and isUnit or isScalar as UnitTest.

Advanced users can implement their own strategies in packages/PruneComplex.m2 and run pruneComplex using the Strategy => null option.

Functions with optional argument named Strategy:

• addHook(...,Strategy=>...) -- see addHook -- add a hook function to an object for later processing
• annihilator(...,Strategy=>...)
• basis(...,Strategy=>...) -- see basis -- basis or generating set of all or part of a ring, ideal or module
• mingens(...,Strategy=>...) -- see Complement -- a Strategy option value
• trim(...,Strategy=>...) -- see Complement -- a Strategy option value
• compose(Module,Module,Module,Strategy=>...) -- see compose -- composition as a pairing on Hom-modules
• determinant(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• dual(MonomialIdeal,List,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,RingElement,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,Strategy=>...)
• End(...,Strategy=>...) -- see End -- module of endomorphisms
• epicResolutionMap(...,Strategy=>...) (missing documentation)
• exteriorPower(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• gb(...,Strategy=>...) -- see gb -- compute a Gröbner basis
• GF(...,Strategy=>...) -- see GF -- make a finite field
• groebnerBasis(...,Strategy=>...) -- see groebnerBasis -- Gröbner basis, as a matrix
• Hom(...,Strategy=>...) -- see Hom -- module of homomorphisms
• homomorphism'(...,Strategy=>...) -- see homomorphism' -- get the element of Hom from a homomorphism
• hooks(...,Strategy=>...) -- see hooks -- list hooks attached to a key
• intersect(Ideal,Ideal,Strategy=>...) -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
• intersect(Module,Module,Strategy=>...) -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
• match(...,Strategy=>...) -- see match -- regular expression matching
• minors(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• parallelApply(...,Strategy=>...) -- see parallelApply -- apply a function to each element in parallel
• pruneComplex(...,Strategy=>...) -- Whether to use the methods in the package or C++ algorithms in the engine
• pushForward(...,Strategy=>...) -- see pushForward(RingMap,Module) -- compute the pushforward of a module along a ring map
• quotient'(...,Strategy=>...) (missing documentation)
• quotient(...,Strategy=>...)
• resolution(...,Strategy=>...)
• resolutionMap(...,Strategy=>...) -- see resolutionMap -- map from a free resolution to the given complex
• saturate(...,Strategy=>...)
• freeResolution(...,Strategy=>...) -- see Strategies for free resolutions -- overview of the different algorithms for computing free resolutions
• syz(...,Strategy=>...) -- see syz(Matrix) -- compute the syzygy matrix

Further information

• Default value: Engine
• Function: pruneComplex -- Prunes a chain complex or list of mutable matrices
• Option key: Strategy -- an optional argument