26 #ifndef F4_AVL_MONOMIAL_H
27 #define F4_AVL_MONOMIAL_H
119 int insert(
int numMon,
bool lt);
166 template <
typename dataType>
171 #include "../src/avl-monomial.inl"
174 #endif // F4_AVL_MONOMIAL_H
DynamicArray< NodeAvlMonomial > _array
int insert(int numMon, bool lt)
If numMon if already in the AVL, update its lt flag, otherwise insert a new node. ...
NodeAvlMonomial * findNextBiggest(NodeAvlMonomial *node)
Find the next biggest NodeAvlMonomial after node.
Represent an avl of pair (number of a monomial, is leading monomial).
std::ostream & operator<<(std::ostream &stream, AvlCriticalPair< Element > const &avlCriticalPair)
Overload the operator <<.
Declaration of class DynamicArray.
void printAvlMonomial(std::ostream &stream) const
Print the AVL.
Wrapper for config.h in order to avoid multiple definitions.
Represent a dynamic array whose the width is fixed, the memory is allocated by blocs.
NodeAvlMonomial()
Constructor.
Represent a node of the AVL of monomials.
NodeAvlMonomial * _parent
size_t size() const
Get the number of element in the AVL.
void reset()
Reset the AVL for a new usage, memory is not clear.
void printNode(NodeAvlCriticalPair< Element > *p, int indent=0)
Print the AVL of root p.
AvlMonomial()
Constructor.
NodeAvlMonomial * findBiggest()
Find the biggest NodeAvlMonomial of the AVL.