|
Macaulay2 Engine
|
Comparator (and trivial hash) functor wired into the std::priority_queue inside PriorityQueuePolynomialHeap. More...
Public Types | |
| using | Entry = std::pair<Monom,ring_elem> |
Public Member Functions | |
| EntryConfig (const FreeMonoid &M) | |
| size_t | operator() (Monom m) const |
| bool | operator() (Entry a, Entry b) const |
Private Attributes | |
| const FreeMonoid & | mMonoid |
Comparator (and trivial hash) functor wired into the std::priority_queue inside PriorityQueuePolynomialHeap.
operator()(Entry, Entry) returns true when the first entry's monomial is LT under the FreeMonoid's ordering — so the priority queue, which extracts max under its Compare, yields the largest monomial as the lead term. The operator()(Monom) overload is a placeholder hash that always returns zero; it exists so the same configuration object can also be used as the hasher in std::unordered_map<Monom, ...>.
Definition at line 926 of file NCReduction.cpp.