Remove unused code.

jendrikseipp · Nov 29, 2024 · 88bd907 · 88bd907
1 parent ee5af01
commit 88bd907
Show file tree

Hide file tree

Showing 3 changed files with 0 additions and 16 deletions.
diff --git a/src/search/novelty/novelty_table.cc b/src/search/novelty/novelty_table.cc
@@ -39,17 +39,6 @@ FactIndexer::FactIndexer(const TaskProxy &task_proxy) {
     cout << "Facts: " << num_facts << endl;
     cout << "Pairs: " << num_pairs << endl;
     cout << "Pair offsets: " << pair_offsets << endl;
-    int expected_id = 0;
-    for (FactProxy fact_proxy1 : task_proxy.get_variables().get_facts()) {
-        FactPair fact1 = fact_proxy1.get_pair();
-        for (FactProxy fact_proxy2 : task_proxy.get_variables().get_facts()) {
-            FactPair fact2 = fact_proxy2.get_pair();
-            if (!(fact1 < fact2) || fact1.var == fact2.var) {
-                continue;
-            }
-            ++expected_id;
-        }
-    }
 #endif
 }
 

diff --git a/src/search/search_algorithms/iterative_width_search.cc b/src/search/search_algorithms/iterative_width_search.cc
@@ -14,8 +14,6 @@ IterativeWidthSearch::IterativeWidthSearch(
     int width, OperatorCost cost_type, int bound, double max_time,
     const string &description, utils::Verbosity verbosity)
     : SearchAlgorithm(cost_type, bound, max_time, description, verbosity),
-      width(width),
-      debug(verbosity == utils::Verbosity::DEBUG),
       novelty_table(task_proxy, width) {
     utils::g_log << "Setting up iterative width search." << endl;
 }

diff --git a/src/search/search_algorithms/iterative_width_search.h b/src/search/search_algorithms/iterative_width_search.h
@@ -10,9 +10,6 @@
 // TODO: rename to IteratedWidthSearch.
 namespace iterative_width_search {
 class IterativeWidthSearch : public SearchAlgorithm {
-    const int width;
-    const bool debug;
-
     std::deque<StateID> open_list;
     novelty::NoveltyTable novelty_table;