1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

crate::ix!();

pub struct CompareInvMempoolOrder {
    mp:          Amo<TxMemPool>,
    wtxid_relay: bool,
}

impl CompareInvMempoolOrder {

    pub fn new(
        mempool:   Amo<TxMemPool>,
        use_wtxid: bool) -> Self {
    
        todo!();
        /*


            mp = _mempool;
            m_wtxid_relay = use_wtxid;
        */
    }
}

impl Comparator<u256> for CompareInvMempoolOrder {

    fn compare(&self, a: &u256, b: &u256) -> Ordering {

        todo!();
        /*
            /* As std::make_heap produces a max-heap, we want the entries with the
             * fewest ancestors/highest fee to sort later. */
            return mp->CompareDepthAndScore(*b, *a, m_wtxid_relay);
        */
    }
}