Nmi_node Class Reference

Internal tree node of the MonomialIdeal decision tree. More...

#include <monideal.hpp>

Inheritance diagram for Nmi_node:

Private Types
enum	{ node , leaf }

Private Member Functions
Nmi_node *&	down ()
Bag *&	baggage ()
gc_vector< int > &	monom ()
const gc_vector< int > &	monom () const
void	insert_to_left (Nmi_node *q)

Private Attributes
int	var
int	exp
Nmi_node *	left
Nmi_node *	right
Nmi_node *	header
enum Nmi_node:: { ... }	tag
union {
Nmi_node *   down
Bag *   bag
}	val

Friends
class	MonomialIdeal
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

Internal tree node of the MonomialIdeal decision tree.

Note

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

One node per (variable, exponent) step along the path from the root to a stored monomial. left / right are sibling pointers inside one variable's exponent list, header points back to the list head, and val is either down (next-variable list head, when tag == node) or bag (the stored monomial's baggage, when tag == leaf). Insertion / lookup walks the tree following variable indices in increasing order.

Definition at line 73 of file monideal.hpp.

---

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

• Macaulay2/e/monideal.hpp