26 #ifndef OPENF4_AVL_POLYNOMIAL_H
27 #define OPENF4_AVL_POLYNOMIAL_H
120 int insert(
int numPol,
int numMon,
int nbTerms);
165 template <
typename dataType>
170 #include "../src/avl-polynomial.inl"
173 #endif // OPENF4_AVL_POLYNOMIAL_H
AvlPolynomial()
Constructor.
Declaration of class DynamicArray.
void printNode(NodeAvlPolynomial *p, int indent=0)
Print the AVL of root p.
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.
DynamicArray< NodeAvlPolynomial > _array
NodeAvlPolynomial * _parent
int insert(int numPol, int numMon, int nbTerms)
Insert a new polynomial into the AVL.
void reset()
Reset the AVL for a new usage, memory is not clear.
NodeAvlPolynomial * _left
NodeAvlPolynomial * _root
NodeAvlPolynomial * findBiggest()
Find the biggest node of the AVL.
NodeAvlPolynomial * findNextBiggest(NodeAvlPolynomial *node)
Find the next biggest node after node.
Represent an avl of triple (number of a polynomial, number of its leading monomial, number of terms).
NodeAvlPolynomial * _right
Represent a node of the AVL of polynomial.
NodeAvlPolynomial()
Constructor.
size_t size() const
Get the number of element in the AVL.
void printAvlPolynomial(std::ostream &stream) const
Print the AVL.
std::ostream & operator<<(std::ostream &stream, Term< Element > const &term)
Overload the operator <<.