wip: more but may be too many

src/descriptor/checksum.rs

@@ -73,6 +73,7 @@ pub(super) fn verify_checksum(s: &str) -> Result<&str, Error> {
 }
 
 /// An engine to compute a checksum from a string
+#[derive(Hash)]
 pub struct Engine {
     c: u64,
     cls: u64,

src/descriptor/tr.rs

@@ -391,7 +391,7 @@ impl<Pk: MiniscriptKey + ToPublicKey> Tr<Pk> {
 ///                                           D    E
 /// would yield (2, A), (2, B), (2,C), (3, D), (3, E).
 ///
-#[derive(Debug, Clone)]
+#[derive(Debug, Clone, Hash)]
 pub struct TapTreeIter<'a, Pk: MiniscriptKey> {
     stack: Vec<(u8, &'a TapTree<Pk>)>,
 }

src/miniscript/analyzable.rs

@@ -25,7 +25,7 @@ use crate::{Miniscript, MiniscriptKey, ScriptContext, Terminal};
 ///    guarantees are not satisfied.
 /// 4. It has repeated public keys
 /// 5. raw pkh fragments without the pk. This could be obtained when parsing miniscript from script
-#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Default)]
+#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Default, Hash)]
 pub struct ExtParams {
     /// Allow parsing of non-safe miniscripts
     pub top_unsafe: bool,

src/miniscript/decode.rs

@@ -213,7 +213,7 @@ macro_rules! match_token {
 }
 
 ///Vec representing terminals stack while decoding.
-#[derive(Debug)]
+#[derive(Debug, Hash)]
 struct TerminalStack<Pk: MiniscriptKey, Ctx: ScriptContext>(Vec<Miniscript<Pk, Ctx>>);
 
 impl<Pk: MiniscriptKey, Ctx: ScriptContext> TerminalStack<Pk, Ctx> {

src/miniscript/iter.rs

@@ -109,6 +109,7 @@ impl<Pk: MiniscriptKey, Ctx: ScriptContext> Miniscript<Pk, Ctx> {
 
 /// Iterator for traversing all [Miniscript] miniscript AST references starting from some specific
 /// node which constructs the iterator via [Miniscript::iter] method.
+#[derive(Hash)]
 pub struct Iter<'a, Pk: MiniscriptKey, Ctx: ScriptContext> {
     next: Option<&'a Miniscript<Pk, Ctx>>,
     // Here we store vec of path elements, where each element is a tuple, consisting of: