Add a hash function for nodes

This is to be able to use containers such as unordered_set/unordered_map

Author: romainbrenguier

src/solvers/refinement/string_refinement_util.h

@@ -251,6 +251,23 @@ class string_dependenciest
       : kind(STRING), index(string_node.index)
     {
     }
+
+    bool operator==(const nodet &n) const
+    {
+      return n.kind == kind && n.index == index;
+    }
+  };
+
+  /// Hash function for nodes
+  // NOLINTNEXTLINE(readability/identifiers)
+  struct node_hash
+  {
+    size_t
+    operator()(const string_dependenciest::nodet &node) const optional_noexcept
+    {
+      return 2 * node.index +
+             (node.kind == string_dependenciest::nodet::STRING ? 0 : 1);
+    }
   };
 
   mutable std::vector<optionalt<exprt>> eval_string_cache;