MonomialSetFixedSize Class Reference

#include <monomial-sets.hpp>

Public Member Functions
	MonomialSetFixedSize (int monomialSize)
int	elementSize () const
	size of each monomial
std::size_t	numElements () const
	number of (unique) monomials in this set.
std::pair< const int *, bool >	findOrInsert (const int *monom)
const int *	find (const int *monom) const
	returns nullptr if monom is not present, otherwise returns the pointer equivalent to 'monom'.

Private Attributes
int	mMonomialSize
MonomialHashAndEqFixedSize	mMonomialHashAndEq
std::unordered_set< const int *, MonomialHashAndEqFixedSize, MonomialHashAndEqFixedSize >	mHash

Detailed Description

A set of monomials, all of the same fixed size. This class assumes that a monomial is a contiguous sequence of ints, the corresponding range (for a monomial m) is [m, m + elementSize()) Additionally, this class does no allocation of monomials.

Definition at line 185 of file monomial-sets.hpp.

---

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

• Macaulay2/e/monomial-sets.hpp