Cleanup reconvergence-driven cut.

include/mockturtle/algorithms/dont_cares.hpp

@@ -63,10 +63,15 @@ namespace mockturtle
  * \param max_tfi_inputs Maximum number of inputs in the transitive fanin.
  */
 template<class Ntk>
-kitty::dynamic_truth_table satisfiability_dont_cares( Ntk const& ntk, std::vector<node<Ntk>> const& leaves, uint32_t max_tfi_inputs = 16u )
+kitty::dynamic_truth_table satisfiability_dont_cares( Ntk const& ntk, std::vector<node<Ntk>> const& leaves, uint64_t max_tfi_inputs = 16u )
 {
-  auto extended_leaves = reconv_cut( reconv_cut_params{max_tfi_inputs} )( ntk, leaves );
-
+  reconvergence_driven_cut_parameters ps;
+  ps.max_leaves = max_tfi_inputs;
+  reconvergence_driven_cut_statistics st;
+
+  detail::reconvergence_driven_cut_impl<Ntk, false, false> cuts( ntk, ps, st ) ;
+  auto const extended_leaves = cuts.run( leaves ).first;
+
   fanout_view<Ntk> fanout_ntk{ntk};
   fanout_ntk.clear_visited();
 

include/mockturtle/algorithms/extract_linear.hpp

@@ -98,6 +98,7 @@ extract_linear_circuit( xag_network const& xag )
   } );
   for ( auto const& [a, b, _] : and_tuples )
   {
+    (void)_;
     dest.create_po( a );
     dest.create_po( b );
   }

include/mockturtle/algorithms/node_resynthesis/xag_minmc2.hpp

@@ -139,8 +139,9 @@ class xag_minmc_resynthesis
 
     for ( auto i = 0u; i < detail::minmc_xags.size(); ++i )
     {
-      for ( auto const& [cls, word, repr, expr] : detail::minmc_xags[i] )
+      for ( auto const& [_, word, repr, expr] : detail::minmc_xags[i] )
       {
+        (void)_;
         db_[i][word] = repr;
         st_.db_size += sizeof( word ) + sizeof( repr ) + sizeof( uint32_t ) * repr.size();
       }