Add elided lifetime

clippy emits:

   warning: hiding a lifetime that's elided elsewhere is confusing

As suggested add the elided lifetime.

Author: tcharding

bitcoin/src/base58.rs

@@ -205,12 +205,12 @@ impl<T: Default + Copy> SmallVec<T> {
         }
     }
 
-    fn iter(&self) -> iter::Chain<slice::Iter<T>, slice::Iter<T>> {
+    fn iter(&self) -> iter::Chain<slice::Iter<'_, T>, slice::Iter<'_, T>> {
         // If len<100 then we just append an empty vec
         self.stack[0..self.len].iter().chain(self.heap.iter())
     }
 
-    fn iter_mut(&mut self) -> iter::Chain<slice::IterMut<T>, slice::IterMut<T>> {
+    fn iter_mut(&mut self) -> iter::Chain<slice::IterMut<'_, T>, slice::IterMut<'_, T>> {
         // If len<100 then we just append an empty vec
         self.stack[0..self.len].iter_mut().chain(self.heap.iter_mut())
     }

bitcoin/src/bip32.rs

@@ -377,17 +377,17 @@ impl DerivationPath {
 
     /// Get an [Iterator] over the children of this [DerivationPath]
     /// starting with the given [ChildNumber].
-    pub fn children_from(&self, cn: ChildNumber) -> DerivationPathIterator {
+    pub fn children_from(&self, cn: ChildNumber) -> DerivationPathIterator<'_> {
         DerivationPathIterator::start_from(self, cn)
     }
 
     /// Get an [Iterator] over the unhardened children of this [DerivationPath].
-    pub fn normal_children(&self) -> DerivationPathIterator {
+    pub fn normal_children(&self) -> DerivationPathIterator<'_> {
         DerivationPathIterator::start_from(self, ChildNumber::Normal { index: 0 })
     }
 
     /// Get an [Iterator] over the hardened children of this [DerivationPath].
-    pub fn hardened_children(&self) -> DerivationPathIterator {
+    pub fn hardened_children(&self) -> DerivationPathIterator<'_> {
         DerivationPathIterator::start_from(self, ChildNumber::Hardened { index: 0 })
     }
 

bitcoin/src/blockdata/script/borrowed.rs

@@ -346,7 +346,7 @@ impl Script {
     ///
     /// To force minimal pushes, use [`instructions_minimal`](Self::instructions_minimal).
     #[inline]
-    pub fn instructions(&self) -> Instructions {
+    pub fn instructions(&self) -> Instructions<'_> {
         Instructions {
             data: self.0.iter(),
             enforce_minimal: false,
@@ -358,7 +358,7 @@ impl Script {
     /// This is similar to [`instructions`](Self::instructions) but an error is returned if a push
     /// is not minimal.
     #[inline]
-    pub fn instructions_minimal(&self) -> Instructions {
+    pub fn instructions_minimal(&self) -> Instructions<'_> {
         Instructions {
             data: self.0.iter(),
             enforce_minimal: true,
@@ -373,7 +373,7 @@ impl Script {
     ///
     /// To force minimal pushes, use [`Self::instruction_indices_minimal`].
     #[inline]
-    pub fn instruction_indices(&self) -> InstructionIndices {
+    pub fn instruction_indices(&self) -> InstructionIndices<'_> {
         InstructionIndices::from_instructions(self.instructions())
     }
 
@@ -382,7 +382,7 @@ impl Script {
     /// This is similar to [`instruction_indices`](Self::instruction_indices) but an error is
     /// returned if a push is not minimal.
     #[inline]
-    pub fn instruction_indices_minimal(&self) -> InstructionIndices {
+    pub fn instruction_indices_minimal(&self) -> InstructionIndices<'_> {
         InstructionIndices::from_instructions(self.instructions_minimal())
     }
 

bitcoin/src/blockdata/witness.rs

@@ -215,7 +215,7 @@ impl Witness {
     }
 
     /// Returns a struct implementing [`Iterator`].
-    pub fn iter(&self) -> Iter {
+    pub fn iter(&self) -> Iter<'_> {
         Iter {
             inner: self.content.as_slice(),
             indices_start: self.indices_start,

bitcoin/src/taproot.rs

@@ -690,7 +690,7 @@ impl TapTree {
 
     /// Returns [`TapTreeIter<'_>`] iterator for a taproot script tree, operating in DFS order over
     /// tree [`ScriptLeaf`]s.
-    pub fn script_leaves(&self) -> ScriptLeaves { ScriptLeaves { leaf_iter: self.0.leaf_nodes() } }
+    pub fn script_leaves(&self) -> ScriptLeaves<'_> { ScriptLeaves { leaf_iter: self.0.leaf_nodes() } }
 }
 
 impl TryFrom<TaprootBuilder> for TapTree {
@@ -839,7 +839,7 @@ impl NodeInfo {
     }
 
     /// Creates an iterator over all leaves (including hidden leaves) in the tree.
-    pub fn leaf_nodes(&self) -> LeafNodes { LeafNodes { leaf_iter: self.leaves.iter() } }
+    pub fn leaf_nodes(&self) -> LeafNodes<'_> { LeafNodes { leaf_iter: self.leaves.iter() } }
 }
 
 impl TryFrom<TaprootBuilder> for NodeInfo {