Connect++ 0.5.0
A fast, readable connection prover for first-order logic.
Loading...
Searching...
No Matches
schedule::add_step Struct Reference

Semantic action for parser. More...

#include <Schedule.hpp>

Public Member Functions

void operator() (qi::unused_type, qi::unused_type) const
 

Detailed Description

Semantic action for parser.

Definition at line 188 of file Schedule.hpp.

Member Function Documentation

◆ operator()()

void schedule::add_step::operator() ( qi::unused_type ,
qi::unused_type  ) const

Definition at line 130 of file Schedule.cpp.

130 {
131 schedule_step step2;
132 if (step == "--all-definitional") step2 = schedule_step::all_definitional;
133 if (step == "--no-definitional") step2 = schedule_step::no_definitional;
134 if (step == "--reorder") step2 = schedule_step::reorder;
135 // Remember: you *do* need the extra space!
136 if (step == "--random-reorder ") step2 = schedule_step::rand_reorder;
137 if (step == "--random-reorder-literals") step2 = schedule_step::rand_lits;
138 if (step == "--all-start") step2 = schedule_step::all_start;
139 if (step == "--pos-neg-start") step2 = schedule_step::pos_neg_start;
140 if (step == "--conjecture-start") step2 = schedule_step::conjecture_start;
141 if (step == "--restrict-start") step2 = schedule_step::restrict_start;
142 if (step == "--no-regularity") step2 = schedule_step::no_regularity;
143 if (step == "--all-lemmata") step2 = schedule_step::all_lemmata;
144 if (step == "--all-reductions") step2 = schedule_step::all_reductions;
145 if (step == "--all-extensions") step2 = schedule_step::all_extensions;
146 if (step == "--no-lemmata") step2 = schedule_step::no_lemmata;
147 if (step == "--all-backtrack") step2 = schedule_step::all_backtrack;
148 if (step == "--lemmata-backtrack") step2 = schedule_step::lemmata_backtrack;
149 if (step == "--reduction-backtrack") step2 = schedule_step::reduction_backtrack;
150 if (step == "--extension-backtrack") step2 = schedule_step::extension_backtrack;
151 if (step == "--explore-left-trees") step2 = schedule_step::explore_left_trees;
152 if (step == "--complete") step2 = schedule_step::complete;
153 if (step == "--start-depth") step2 = schedule_step::start_depth;
154 if (step == "--depth-increment") step2 = schedule_step::depth_inc;
155 if (step == "--limit-by-tree-depth") step2 = schedule_step::limit_by_tree_depth;
156 current_settings.push_back(pair<schedule_step, unsigned int>(step2, value));
157 step = "";
158 value = 0;
159}
schedule_step
Possible kinds of schedule step.
Definition Schedule.hpp:63

The documentation for this struct was generated from the following files: