MonomialIdeal Class Reference

Engine-side monomial ideal: a decision tree of Nmi_nodes storing the (typically minimal) generators by variable / exponent path. More...

#include <monideal.hpp>

Inheritance diagram for MonomialIdeal:

Classes
class	Iterator
	Bidirectional forward iterator over the Bags stored in a MonomialIdeal. More...

Public Member Functions
	MonomialIdeal (const PolynomialRing *RR, stash *mi_stash=nullptr)
virtual	~MonomialIdeal ()
	MonomialIdeal (const PolynomialRing *R0, VECTOR(Bag *) &elems, VECTOR(Bag *) &rejects, stash *mi_stash0=nullptr)
	MonomialIdeal (const PolynomialRing *R0, VECTOR(Bag *) &elems, stash *mi_stash0=nullptr)
MonomialIdeal *	copy () const
void	remove_MonomialIdeal ()
const_varpower	first_elem () const
const_varpower	second_elem () const
int	size () const
int	topvar () const
void	text_out (buffer &o) const
const PolynomialRing *	get_ring () const
void	insert_minimal (Bag *b)
int	insert (Bag *b)
void	insert_w_deletions (Bag *b, VECTOR(Bag *) &deletions)
int	remove (Bag *&b)
int	search_expvector (const_exponents m, Bag *&b) const
int	search (const_varpower m, Bag *&b) const
void	find_all_divisors (const_exponents exp, VECTOR(Bag *)&b) const
Iterator	begin () const
Iterator	beginAtLast () const
Iterator	end () const
void *	next (void *p) const
void *	prev (void *p) const
int	valid (void *p) const
void	debug_out (int disp=1) const
void	debug_check () const
bool	is_equal (const MonomialIdeal &mi) const
MonomialIdeal *	intersect (const_varpower m) const
MonomialIdeal *	intersect (const MonomialIdeal &J) const
MonomialIdeal *	quotient (const_varpower m) const
MonomialIdeal *	quotient (const MonomialIdeal &J) const
MonomialIdeal *	erase (const_varpower m) const
MonomialIdeal *	sat (const MonomialIdeal &J) const
M2_arrayint	lcm () const
MonomialIdeal *	alexander_dual (const M2_arrayint a) const
MonomialIdeal *	radical () const
MonomialIdeal *	borel () const
bool	is_borel () const
MonomialIdeal *	operator+ (const MonomialIdeal &F) const
MonomialIdeal *	operator- (const MonomialIdeal &F) const
MonomialIdeal *	operator* (const MonomialIdeal &G) const
bool	is_one () const
int	n_pure_powers () const
Public Member Functions inherited from EngineObject
	EngineObject ()
virtual	~EngineObject ()
unsigned int	hash () const

Protected Member Functions
virtual unsigned int	computeHashValue () const

Private Member Functions
Nmi_node *	new_internal_mi_node (int v, int e, Nmi_node *d)
Nmi_node *	new_leaf_mi_node (int v, int e, Bag *b)
void	delete_mi_node (Nmi_node *p)
Nmi_node *	first_node () const
Nmi_node *	last_node () const
Nmi_node *	next (Nmi_node *p) const
Nmi_node *	prev (Nmi_node *p) const
void	insert1 (Nmi_node *&p, Bag *b)
void	remove1 (Nmi_node *p)
void	do_node (Nmi_node *p, int indent, int disp) const
void	do_tree (Nmi_node *p, int depth, int indent, int disp) const
int	debug_check (Nmi_node *p, const Nmi_node *up) const
bool	isWellFormed () const

Private Attributes
const PolynomialRing *	R
Nmi_node *	mi
int	count
stash *	mi_stash

Friends
class	AssociatedPrimes
class	MinimalPrimes

Additional Inherited Members
Static Public Member Functions inherited from our_new_delete
static void *	operator new (size_t size)
static void *	operator new[] (size_t size)
static void	operator delete (void *obj)
static void	operator delete[] (void *obj)
static void *	operator new (size_t size, void *existing_memory)
static void *	operator new[] (size_t size, void *existing_memory)
static void	operator delete (void *obj, void *existing_memory)
static void	operator delete[] (void *obj, void *existing_memory)

Detailed Description

Engine-side monomial ideal: a decision tree of Nmi_nodes storing the (typically minimal) generators by variable / exponent path.

Note

AI-generated documentation. Verify against the source before relying on it.

The tree representation makes divisibility queries (search_expvector, search, find_all_divisors) and minimal-generator maintenance (insert_w_deletions) efficient compared with a flat list. count packs two pieces of info: the low bit records whether this MonomialIdeal owns its mi_stash (so the destructor knows whether to free it), and count / 2 is the actual number of stored monomials. The ideal is immutable once exposed to the front end (its computeHashValue is called to pin the hash). Iteration is via the nested Iterator class, with begin() / end() and beginAtLast() for reverse-style loops.

Definition at line 133 of file monideal.hpp.

---

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

• Macaulay2/e/monideal.hpp
• Macaulay2/e/monideal.cpp