Rename function to match our conventions.

aibasel · Sep 8, 2023 · 54e374a · 54e374a
1 parent e049da1
commit 54e374a
Show file tree

Hide file tree

Showing 3 changed files with 8 additions and 7 deletions.
diff --git a/src/search/landmarks/landmark_cost_assignment.cc b/src/search/landmarks/landmark_cost_assignment.cc
@@ -40,7 +40,7 @@ UniformCostPartitioningAlgorithm::UniformCostPartitioningAlgorithm(
       use_action_landmarks(use_action_landmarks) {
 }
 
-double UniformCostPartitioningAlgorithm::compute_cost_partitioned_h_value(
+double UniformCostPartitioningAlgorithm::get_cost_partitioned_heuristic_value(
     const LandmarkStatusManager &lm_status_manager,
     const State &ancestor_state) {
     vector<int> achieved_lms_by_op(operator_costs.size(), 0);
@@ -175,7 +175,7 @@ lp::LinearProgram OptimalCostPartitioningAlgorithm::build_initial_lp() {
                              {}, lp_solver.get_infinity());
 }
 
-double OptimalCostPartitioningAlgorithm::compute_cost_partitioned_h_value(
+double OptimalCostPartitioningAlgorithm::get_cost_partitioned_heuristic_value(
     const LandmarkStatusManager &lm_status_manager,
     const State &ancestor_state) {
     /* TODO: We could also do the same thing with action landmarks we

diff --git a/src/search/landmarks/landmark_cost_assignment.h b/src/search/landmarks/landmark_cost_assignment.h
@@ -28,7 +28,7 @@ class CostPartitioningAlgorithm {
                               const LandmarkGraph &graph);
     virtual ~CostPartitioningAlgorithm() = default;
 
-    virtual double compute_cost_partitioned_h_value(
+    virtual double get_cost_partitioned_heuristic_value(
         const LandmarkStatusManager &lm_status_manager,
         const State &ancestor_state) = 0;
 };
@@ -40,7 +40,7 @@ class UniformCostPartitioningAlgorithm : public CostPartitioningAlgorithm {
                                      const LandmarkGraph &graph,
                                      bool use_action_landmarks);
 
-    virtual double compute_cost_partitioned_h_value(
+    virtual double get_cost_partitioned_heuristic_value(
         const LandmarkStatusManager &lm_status_manager,
         const State &ancestor_state) override;
 };
@@ -64,7 +64,7 @@ class OptimalCostPartitioningAlgorithm : public CostPartitioningAlgorithm {
                                      const LandmarkGraph &graph,
                                      lp::LPSolverType solver_type);
 
-    virtual double compute_cost_partitioned_h_value(
+    virtual double get_cost_partitioned_heuristic_value(
         const LandmarkStatusManager &lm_status_manager,
         const State &ancestor_state) override;
 };

diff --git a/src/search/landmarks/landmark_cost_partitioning_heuristic.cc b/src/search/landmarks/landmark_cost_partitioning_heuristic.cc
@@ -66,8 +66,9 @@ int LandmarkCostPartitioningHeuristic::get_heuristic_value(
     const State &ancestor_state) {
     double epsilon = 0.01;
 
-    double h_val = cost_partitioning_algorithm->compute_cost_partitioned_h_value(
-        *lm_status_manager, ancestor_state);
+    double h_val =
+        cost_partitioning_algorithm->get_cost_partitioned_heuristic_value(
+            *lm_status_manager, ancestor_state);
     if (h_val == numeric_limits<double>::max()) {
         return DEAD_END;
     } else {