Classes
struct	mi_node

Public Member Functions
	F4MonomialLookupTableT (int nvars)
	~F4MonomialLookupTableT ()
void	insert_minimal_vp (long comp, const_varpower_monomial m, Key k)
bool	insert_vp (long comp, const_varpower_monomial m, Key &k)
bool	find_one_divisor_vp (long comp, const_varpower_monomial m, Key &result_k) const
bool	find_one_divisor_packed (const MonomialInfo *M, const_packed_monomial m, Key &result_k) const
void	find_all_divisors_vp (long comp, const_varpower_monomial m, std::vector< Key > &result_k) const
void	find_all_divisors_packed (const MonomialInfo *M, const_packed_monomial m, std::vector< Key > &result_k) const
void	text_out (buffer &o) const
int	length () const

Private Member Functions
mi_node *	new_mi_node (varpower_word v, varpower_word e, mi_node *d)
mi_node *	new_mi_node (varpower_word v, varpower_word e, Key k)
void	delete_mi_node (mi_node *p)
void	update_expvector (int topvar, const_varpower_monomial m)
void	reset_expvector (const_varpower_monomial m)
bool	find_one_divisor1 (mi_node *mi, const_ntuple_monomial exp, Key &result_k) const
void	find_all_divisors1 (mi_node *mi, const_ntuple_monomial exp, std::vector< Key > &result_k) const
void	insert1 (mi_node *&p, const_varpower_monomial m, Key k)
mi_node *	next (mi_node *p) const
mi_node *	prev (mi_node *p) const
void	do_node (mi_node *p, int indent, int disp) const
void	do_tree (mi_node *p, int depth, int indent, int disp) const
int	debug_check (mi_node p, const mi_node up) const
void	debug_out (int disp=1) const
void	debug_check () const

Detailed Description

template<typename Key>
class F4MonomialLookupTableT< Key >

Definition at line 55 of file f4-monlookup.hpp.

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

Classes