binomialGB Class Reference

#include <gb-toric.hpp>

Inheritance diagram for binomialGB:

Classes
struct	gbmin_elem
struct	monomial_list
class	iterator

Public Member Functions
	binomialGB (const binomial_ring *R, bool bigcell, bool homogprime)
	~binomialGB ()
void	enlarge (const binomial_ring *newR)
void	minimalize_and_insert (binomial_gb_elem *f)
monomial_list *	find_divisor (monomial_list *I, monomial0 m) const
monomial_list *	ideal_quotient (monomial0 m) const
void	remove_monomial_list (monomial_list *mm) const
binomial_gb_elem *	find_divisor (monomial0 m) const
void	make_new_pairs (binomial_s_pair_set *Pairs, binomial_gb_elem *f) const
void	reduce_monomial (monomial0 m) const
bool	reduce (binomial &f) const
iterator	begin () const
iterator	end () const
int	n_masks () const
void	debug_display () const

Private Attributes
const binomial_ring *	R
gbmin_elem *	first
int	_max_degree
bool	is_homogeneous_prime

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

Definition at line 229 of file gb-toric.hpp.

---

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

• Macaulay2/e/gb-toric.hpp
• Macaulay2/e/gb-toric.cpp