Connect++ 0.1
A fast, readable connection prover for first-order logic.
Loading...
Searching...
No Matches
Classes | Enumerations | Functions | Variables
schedule Namespace Reference

Hide all the global stuff in this namespace. More...

Classes

struct  add_step
 Semantic action for parser. More...
 
struct  add_time
 Semantic action for parser. More...
 
struct  next_settings
 Semantic action for parser. More...
 
class  Schedule
 Wrap up the parsing process and the operation of a schedule in a single class. More...
 
struct  schedule_grammar
 
struct  set_step
 Semantic action for parser. More...
 
struct  set_value
 Semantic action for parser. More...
 

Enumerations

enum class  schedule_step {
  conjecture , limit , restrict , comp ,
  nocomp , reorder , all , reorder ,
  all_start , pos_neg_start , conjecture_start , restrict_start ,
  no_regularity , no_lemmata , all_lemmata , all_reductions ,
  all_extensions , all_backtrack , lemmata_backtrack , reduction_backtrack ,
  extension_backtrack , explore_left_trees , hard_prune , complete
}
 Possible kinds of schedule step.
 
enum class  schedule_step {
  conjecture , limit , restrict , comp ,
  nocomp , reorder , all , reorder ,
  all_start , pos_neg_start , conjecture_start , restrict_start ,
  no_regularity , no_lemmata , all_lemmata , all_reductions ,
  all_extensions , all_backtrack , lemmata_backtrack , reduction_backtrack ,
  extension_backtrack , explore_left_trees , hard_prune , complete
}
 Possible kinds of schedule step.
 

Functions

string to_string (const schedule_step &s)
 
ostream & operator<< (ostream &out, const Schedule &s)
 

Variables

unsigned int value = 0
 
unsigned int current_time = 0
 
string step
 
vector< pair< schedule_step, unsigned int > > current_settings
 
vector< vector< pair< schedule_step, unsigned int > > > new_schedule
 
vector< unsigned int > new_times
 
qi::rule< Iter, string()> schedule_word
 
qi::rule< Iter, string()> schedule_word_param
 

Detailed Description

Hide all the global stuff in this namespace.

It's easiest to implement a parser using the relevant boost libraries if you use globals to store things as you parse. Hiding them in a namespace makes the use of globals a bit less reprehensible.

Variable Documentation

◆ schedule_word

qi::rule< Iter, string()> schedule::schedule_word
Initial value:
=
ascii::string("conjecturestart")
| ascii::string("nocomplete")
| ascii::string("limitedstart")
| ascii::string("restrictstart")
| ascii::string("allbacktrack")

◆ schedule_word_param

qi::rule< Iter, string()> schedule::schedule_word_param
Initial value:
=
ascii::string("complete")
| ascii::string("reorder")