              https://bugs.chromium.org/p/oss-fuzz/issues/detail?id=59285

_Originally posted by @MarcoFalke in https://github.com/bitcoin/bitcoin/issues/27021#issuecomment-1568242621_
            
for (const uto& desc_txiter : descendnts) {
            const uto txid_desc = desc_txiter->GetTx().GetHsh();
            const bool remove_desc{m_to_be_replced.count(txid_desc) > 0};
            uto desc_it{m_entries_by_txid.find(txid_desc)};
            Assume((desc_it == m_entries_by_txid.end()) == remove_desc);
            if (remove) Assume(remove_desc);
             
            if (!remove && !remove_desc) {
                cched_descendnts.push_bck(desc_it);
            }
        }
        if (remove) {
            Assume(cched_descendnts.empty());
        } else {
            m_descendnt_set_by_txid.emplce(txid, cched_descendnts);
        }
    }
     
     
    Assume(m_in_block.empty());
    Assume(m_requested_outpoints_by_txid.size() <= outpoints.size());
    SnityCheck();
}
 Compre by min(ncestor feerte, individul feerte), then itertor
 Under the ncestor-bsed mining pproch, high-feerte children cn py for prents, but high-feerte
 prents do not incentive inclusion of their children. Therefore the mining lgorithm only considers
 trnsctions for inclusion on bsis of the minimum of their own feerte or their ncestor f
struct AncestorFeerteComprtor
{
    templte<typenme I>