From 4c07ed5e2f700fb83723f8d1ffd257762415bb9d Mon Sep 17 00:00:00 2001 From: Salome Eriksson Date: Tue, 1 Oct 2024 17:37:07 +0200 Subject: [PATCH] uncrustify --- .../landmarks/landmark_sum_heuristic.cc | 64 +++++++++---------- 1 file changed, 32 insertions(+), 32 deletions(-) diff --git a/src/search/landmarks/landmark_sum_heuristic.cc b/src/search/landmarks/landmark_sum_heuristic.cc index 01a037d4e5..fc359b38d2 100644 --- a/src/search/landmarks/landmark_sum_heuristic.cc +++ b/src/search/landmarks/landmark_sum_heuristic.cc @@ -117,37 +117,37 @@ bool LandmarkSumHeuristic::dead_ends_are_reliable() const { void add_landmark_sum_heuristic_options_to_feature( - plugins::Feature &feature, const string &description) { + plugins::Feature &feature, const string &description) { feature.document_synopsis( - "Landmark progression is implemented according to the following paper:" - + utils::format_conference_reference( - {"Clemens Büchner", "Thomas Keller", "Salomé Eriksson", "Malte Helmert"}, - "Landmarks Progression in Heuristic Search", - "https://ai.dmi.unibas.ch/papers/buechner-et-al-icaps2023.pdf", - "Proceedings of the Thirty-Third International Conference on " - "Automated Planning and Scheduling (ICAPS 2023)", - "70-79", - "AAAI Press", - "2023")); + "Landmark progression is implemented according to the following paper:" + + utils::format_conference_reference( + {"Clemens Büchner", "Thomas Keller", "Salomé Eriksson", "Malte Helmert"}, + "Landmarks Progression in Heuristic Search", + "https://ai.dmi.unibas.ch/papers/buechner-et-al-icaps2023.pdf", + "Proceedings of the Thirty-Third International Conference on " + "Automated Planning and Scheduling (ICAPS 2023)", + "70-79", + "AAAI Press", + "2023")); feature.add_option>( - "lm_factory", - "the set of landmarks to use for this heuristic. " - "The set of landmarks can be specified here, " - "or predefined (see LandmarkFactory)."); + "lm_factory", + "the set of landmarks to use for this heuristic. " + "The set of landmarks can be specified here, " + "or predefined (see LandmarkFactory)."); tasks::add_axioms_option_to_feature(feature); feature.add_option( - "pref", - "enable preferred operators (see note below)", - "false"); + "pref", + "enable preferred operators (see note below)", + "false"); /* TODO: Do we really want these options or should we just always progress everything we can? */ feature.add_option( - "prog_goal", "Use goal progression.", "true"); + "prog_goal", "Use goal progression.", "true"); feature.add_option( - "prog_gn", "Use greedy-necessary ordering progression.", "true"); + "prog_gn", "Use greedy-necessary ordering progression.", "true"); feature.add_option( - "prog_r", "Use reasonable ordering progression.", "true"); + "prog_r", "Use reasonable ordering progression.", "true"); add_heuristic_options_to_feature(feature, description); feature.document_property("preferred operators", @@ -155,19 +155,19 @@ void add_landmark_sum_heuristic_options_to_feature( } tuple, tasks::AxiomHandlingType, bool, bool, bool, - bool, shared_ptr, bool, string, utils::Verbosity> + bool, shared_ptr, bool, string, utils::Verbosity> get_landmark_sum_heuristic_arguments_from_options( - const plugins::Options &opts) { + const plugins::Options &opts) { return tuple_cat( - make_tuple( - opts.get>("lm_factory")), - tasks::get_axioms_arguments_from_options(opts), - make_tuple( - opts.get("pref"), - opts.get("prog_goal"), - opts.get("prog_gn"), - opts.get("prog_r")), - get_heuristic_arguments_from_options(opts)); + make_tuple( + opts.get>("lm_factory")), + tasks::get_axioms_arguments_from_options(opts), + make_tuple( + opts.get("pref"), + opts.get("prog_goal"), + opts.get("prog_gn"), + opts.get("prog_r")), + get_heuristic_arguments_from_options(opts)); } class LandmarkSumHeuristicFeature