/// a [`TxOut`] with it's script pubkey.
pub fn last_used_indices(&self) -> BTreeMap<K, u32> {
self.keychain_to_descriptor_id
- .iter()
- .filter_map(|(keychain, _)| {
+ .keys()
+ .filter_map(|keychain| {
self.last_used_index(keychain.clone())
.map(|index| (keychain.clone(), index))
})
let mut map2: BTreeMap<i32, &str> = BTreeMap::new();
map2.insert(2, "b");
- map1.merge(map2);
+ Merge::merge(&mut map1, map2);
let expected: BTreeMap<i32, &str> = BTreeMap::from([(1, "a"), (2, "b")]);
assert_eq!(map1, expected);
let mut map2: BTreeMap<i32, &str> = BTreeMap::new();
map2.insert(1, "b");
- map1.merge(map2);
+ Merge::merge(&mut map1, map2);
let expected: BTreeMap<i32, &str> = BTreeMap::from([(1, "b")]);
assert_eq!(map1, expected);
.inner
.batch_script_get_history(unique_spks.iter().map(|spk| spk.as_script()))?;
let mut spk_map = HashMap::new();
- for (spk, history) in unique_spks.into_iter().zip(histories.into_iter()) {
+ for (spk, history) in unique_spks.into_iter().zip(histories) {
spk_map.insert(spk, history);
}
let proofs = self.inner.batch_transaction_get_merkle(to_fetch.iter())?;
// Validate each proof, retrying once for each stale header.
- for ((txid, height), proof) in to_fetch.into_iter().zip(proofs.into_iter()) {
+ for ((txid, height), proof) in to_fetch.into_iter().zip(proofs) {
let mut header = {
let cache = self.block_header_cache.lock().unwrap();
cache