| 4621 | } |
| 4622 | |
| 4623 | bool operator()(std::set<uint256>::iterator a, std::set<uint256>::iterator b) |
| 4624 | { |
| 4625 | /* As std::make_heap produces a max-heap, we want the entries with the |
| 4626 | * fewest ancestors/highest fee to sort later. */ |
| 4627 | return mp->CompareDepthAndScore(*b, *a, m_wtxid_relay); |
| 4628 | } |
| 4629 | }; |
| 4630 | } |
| 4631 |
nothing calls this directly
no test coverage detected