removed annotiny messages

Author: francosansone

algorithms/partitioner/dfs_on_sbg.cpp

@@ -50,16 +50,6 @@ vector<map<unsigned, set<Set, setCompare>>> partitionate()
   sort_object.start();
   sort_object.iterate();
   vector<map<unsigned, set<Set, setCompare>>> partitions = sort_object.partitions();
-  for (size_t i = 0; i < partitions.size(); i++) {
-    const auto& part = partitions.at(i);
-    for (const auto& [id, p] : part) {
-      cout << id << ": ";
-      for (const auto& s : p) {
-        cout << s << " ";
-      }
-      cout << endl;
-    }
-  }
 
   return partitions;
 }
@@ -78,7 +68,6 @@ void DFS::initialize_adjacents()
   // Fill adjacents
   for (auto it = _nodes.begin(); it != _nodes.end(); ++it) {
     const auto incoming_node = *it;
-    std::cout << *it << std::endl;
 
     auto incoming_node_set = SET_FACT.createSet(incoming_node);
 

algorithms/partitioner/main.cpp

@@ -240,13 +240,6 @@ SBG::LIB::WeightedSBGraph build_computational_sbg(const PartitionerParams& param
 {
   cout << "Building computational SB Graph" << endl;
   SBG::LIB::WeightedSBGraph sb_graph = get_sbg(*params.filename, *params.number_of_partitions);
-  for (auto it1 = sb_graph.map1().begin(), it2 = sb_graph.map2().begin(); it1 != sb_graph.map1().end() and it2 != sb_graph.map2().end();
-       ++it1, ++it2) {
-    auto n1 = (*it1).image();
-    auto n2 = (*it2).image();
-    cout << n1 << ", " << n2 << " from " << (*it1).dom() << " " << (*it1).dom().cardinal() << "\n";
-  }
-  cout << endl;
 
   if (not params.filename->find("air_conditioners_cont") != std::string::npos) {
     return sb_graph;

algorithms/partitioner/partition_graph.cpp

@@ -94,23 +94,12 @@ vector<PartitionMap> make_initial_partitions(SBG::LIB::WeightedSBGraph& graph, u
   }
 
   vector<map<unsigned, set<Set, setCompare>>> partitions = partitionate();
-  for (size_t i = 0; i < partitions.size(); i++) {
-    const auto& part = partitions.at(i);
-    for (const auto& [id, p] : part) {
-      cout << id << ": ";
-      for (const auto& s : p) {
-        cout << s << " ";
-      }
-      cout << endl;
-    }
-  }
 
   for (const auto& partition : partitions) {
     PartitionMap partition_set;
     for (const auto& [id, set] : partition) {
       Set one_partition_set = SET_FACT.createSet();
       Partition p;
-      cout << id << " ";
       for (auto& s : set) {
         // Set intervals = SET_FACT.createSet();
         // if (not s.intervals().empty()) {
@@ -120,9 +109,7 @@ vector<PartitionMap> make_initial_partitions(SBG::LIB::WeightedSBGraph& graph, u
         //   }
         // }
         p.emplace_back(s);
-        cout << s << " ";
       }
-      cout << endl;
       partition_set.push_back(p);
     }
 

algorithms/partitioner/partition_graph.hpp

@@ -32,7 +32,7 @@
 
 namespace sbg_partitioner {
 
-constexpr bool sanity_check_enabled = true;
+constexpr bool sanity_check_enabled = false;
 
 
 /// @brief Converts a Partition element into a Set.

algorithms/partitioner/partition_strategy.cpp

@@ -86,7 +86,6 @@ void PartitionStrategyGreedy::operator()(const Set& node_to_be_added)
       elements_can_take = min(pending_node_elements, elements_can_take);
       pending_node_elements -= elements_can_take;
       size_by_partition[i] = elements_can_take * node_weight;
-      cout << i << ", " << size_by_partition[i] << endl;
       _current_size_by_partition[i] += size_by_partition[i];
     }
   }
@@ -104,7 +103,6 @@ void PartitionStrategyGreedy::operator()(const Set& node_to_be_added)
 
   Set remaining_node = node_to_be_added;
   for (unsigned i = 0; i < _number_of_partitions; i++) {
-    cout << i << ": " << size_by_partition[i] << endl;
     if (size_by_partition[i] == 0) {
       continue;
     }
@@ -113,7 +111,6 @@ void PartitionStrategyGreedy::operator()(const Set& node_to_be_added)
 
     Set node_to_be_added = SET_FACT.createSet();
     tie(node_to_be_added, remaining_node) = cut_interval_by_dimension(remaining_node, _node_weight, size_by_partition[i]);
-    cout << i << ", " << size_by_partition[i] << ", " << node_to_be_added << ", " << remaining_node << endl;
 
     for_each(node_to_be_added.begin(), node_to_be_added.end(), [&p](const auto& set_piece) { p.insert(SET_FACT.createSet(set_piece)); });
   }

test/partitioner/external_tools/graph_partitioner.cpp

@@ -109,9 +109,9 @@ static void write_node_by_partition(const sbg_partitioner::PartitionMap &partiti
       }
     }
   }
-  std::cout << "parts ok" << std::endl;
 
   for_each(partition_vector.begin(), partition_vector.end(), [&output_file](const auto val) { output_file << val << "\n"; });
+  std::cout << "parts ok" << std::endl;
 }
 
 std::tuple<Partition, std::chrono::duration<double>> GraphPartitioner::createPartition(const std::string &partition_method_name,