Dense ids produce a vec of u32s
pub fn dense_txids_from(&self, start: usize) -> Vec<AnyTxId> {
...
(start..total)
.map(|idx| dense::TxId::new(u32::try_from(idx).expect("dense txid should fit in u32")))
.map(AnyTxId::from)
}
This is already overkill. Source nodes can simply output low and high tuple. hashsets are probably the wrong tools entirely.
As filters prune the tx set, we can store more granular ranges -- vec of tuples. Of course this only works for dense ids.
Need to do some back of the envelope math but if this ends up being bottleneck, would it make sense to have sequential ids for the loose repr as well?
Dense ids produce a vec of u32s
This is already overkill. Source nodes can simply output low and high tuple. hashsets are probably the wrong tools entirely.
As filters prune the tx set, we can store more granular ranges -- vec of tuples. Of course this only works for dense ids.
Need to do some back of the envelope math but if this ends up being bottleneck, would it make sense to have sequential ids for the loose repr as well?