Macaulay2 Engine
Loading...
Searching...
No Matches

◆ erase()

MonomialIdeal * MonomialIdeal::erase ( const_varpower m) const

Definition at line 853 of file monideal.cpp.

854{
855 debug_check();
856 VECTOR(Bag*) new_elems;
857 for (Bag& a : *this)
858 {
859 Bag *b = new Bag(a.basis_elem());
860 varpower::erase(a.monom().data(), m, b->monom());
861 new_elems.push_back(b);
862 }
863 MonomialIdeal *result = new MonomialIdeal(get_ring(), new_elems);
864 result->debug_check();
865 return result;
866}
static void erase(ConstExponents a, ConstExponents b, Vector &result)
MonomialIdeal(const PolynomialRing *RR, stash *mi_stash=nullptr)
Definition monideal.cpp:91
void debug_check() const
Definition monideal.cpp:567
const PolynomialRing * get_ring() const
Definition monideal.hpp:190
int basis_elem() const
Definition int-bag.hpp:66
gc_vector< int > & monom()
Definition int-bag.hpp:60
int_bag Bag
Definition int-bag.hpp:70
VALGRIND_MAKE_MEM_DEFINED & result(result)
#define VECTOR(T)
Definition newdelete.hpp:78

References int_bag::basis_elem(), debug_check(), ExponentList< int, true >::erase(), get_ring(), int_bag::monom(), MonomialIdeal(), result(), and VECTOR.

Referenced by rawSaturateMonomialIdeal1(), and sat().