Skip to content

Commit

Permalink
uncrustify
Browse files Browse the repository at this point in the history
  • Loading branch information
salome-eriksson committed Oct 1, 2024
1 parent b7efd04 commit 4c07ed5
Showing 1 changed file with 32 additions and 32 deletions.
64 changes: 32 additions & 32 deletions src/search/landmarks/landmark_sum_heuristic.cc
Original file line number Diff line number Diff line change
Expand Up @@ -117,57 +117,57 @@ 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<shared_ptr<LandmarkFactory>>(
"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<bool>(
"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<bool>(
"prog_goal", "Use goal progression.", "true");
"prog_goal", "Use goal progression.", "true");
feature.add_option<bool>(
"prog_gn", "Use greedy-necessary ordering progression.", "true");
"prog_gn", "Use greedy-necessary ordering progression.", "true");
feature.add_option<bool>(
"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",
"yes (if enabled; see ``pref`` option)");
}

tuple<shared_ptr<LandmarkFactory>, tasks::AxiomHandlingType, bool, bool, bool,
bool, shared_ptr<AbstractTask>, bool, string, utils::Verbosity>
bool, shared_ptr<AbstractTask>, 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<shared_ptr<LandmarkFactory>>("lm_factory")),
tasks::get_axioms_arguments_from_options(opts),
make_tuple(
opts.get<bool>("pref"),
opts.get<bool>("prog_goal"),
opts.get<bool>("prog_gn"),
opts.get<bool>("prog_r")),
get_heuristic_arguments_from_options(opts));
make_tuple(
opts.get<shared_ptr<LandmarkFactory>>("lm_factory")),
tasks::get_axioms_arguments_from_options(opts),
make_tuple(
opts.get<bool>("pref"),
opts.get<bool>("prog_goal"),
opts.get<bool>("prog_gn"),
opts.get<bool>("prog_r")),
get_heuristic_arguments_from_options(opts));
}

class LandmarkSumHeuristicFeature
Expand Down

0 comments on commit 4c07ed5

Please sign in to comment.