Internal/nested sweep/2 level cuts

CHANGELOG.md

@@ -89,6 +89,9 @@
 
 - Fixed overflow error when a single BDD's width outgrows 32 bits (96 GiB).
 
+- Fixed Outer Reduce in Nested Sweeping framework crashes due to assuming its priority queues are
+  (like the regular Reduce) only inducing a 1-level cut on the input.
+
 - Fixed "Not enough phase 1 memory for 128 KB items and an open stream!" error
   messages when running `bdd_exists(f, ...)` and `bdd_forall(f, ...)` with
   exclusively external memory data structures.

src/adiar/internal/algorithms/nested_sweeping.h

@@ -2147,11 +2147,7 @@ namespace adiar::internal
     const tpie::memory_size_type outer_roots_memory_fits =
       internal_roots_sorter_t::memory_fits(outer_pq_memory);
 
-    size_t pq_roots_bound = dag->max_1level_cut;
-    if constexpr (nesting_policy::fast_reduce) {
-      // If 'fast_reduce' will be used, then the priority queue is a 2-level cut
-      pq_roots_bound = (pq_roots_bound * 3u) / 2u;
-    }
+    const size_t pq_roots_bound = (dag->max_1level_cut * 3u) / 2u;
 
     const size_t outer_pq_roots_max =
       ep.template get<exec_policy::memory>() == exec_policy::memory::Internal

src/adiar/internal/io/levelized_file_stream.h

@@ -102,8 +102,7 @@ namespace adiar::internal
     {
       if (!f->exists()) f->touch();
 
-      for (size_t s_idx = 0; s_idx < streams; s_idx++)
-        _streams[s_idx].attach(f->_files[s_idx], f);
+      for (size_t s_idx = 0; s_idx < streams; s_idx++) _streams[s_idx].attach(f->_files[s_idx], f);
     }
 
     ////////////////////////////////////////////////////////////////////////////////////////////////