|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Graded reverse lexicographic monomial order (default). More...
#include <tpl_multi_polynomial.H>
Public Member Functions | |
| bool | operator() (const Array< size_t > &a, const Array< size_t > &b) const noexcept |
Graded reverse lexicographic monomial order (default).
Total degree first; among same-degree monomials the one with the larger rightmost exponent is smaller. This is the standard ordering used by most computer algebra systems.
Definition at line 284 of file tpl_multi_polynomial.H.
|
inlinenoexcept |
Definition at line 286 of file tpl_multi_polynomial.H.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::multi_poly_detail::total_degree().