C++ param_descrs::insert方法代码示例

 virtual void init_pdescrs(cmd_context & ctx, param_descrs & p) {
     th_rewriter::get_param_descrs(p);
     insert_timeout(p);
     p.insert("print", CPK_BOOL, "(default: true)  print the simplified term.");
     p.insert("print_proofs", CPK_BOOL, "(default: false) print a proof showing the original term is equal to the resultant one.");
     p.insert("print_statistics", CPK_BOOL, "(default: false) print statistics.");
 }

 static void collect_param_descrs(param_descrs & d) {
   d.insert("max_memory", CPK_UINT, "maximum amount of memory in megabytes", "4294967295","nnf");
   d.insert("sk_hack", CPK_BOOL, "hack for VCC", "false","nnf");
   d.insert("mode", CPK_SYMBOL, "NNF translation mode: skolem (skolem normal form), quantifiers (skolem normal form + quantifiers in NNF), full", "skolem","nnf");
   d.insert("ignore_labels", CPK_BOOL, "remove/ignore labels in the input formula, this option is ignored if proofs are enabled", "false","nnf");
   d.insert("skolemize", CPK_BOOL, "skolemize (existential force) quantifiers", "true","nnf");
 }

 virtual void init_pdescrs(cmd_context & ctx, param_descrs & p) {
     m_dl_ctx->get_dl_context().collect_params(p);
     insert_timeout(p);
     p.insert(":print-answer", CPK_BOOL, "(default: false) print answer instance(s) to query.");
     p.insert(":print-certificate", CPK_BOOL, "(default: false) print certificate for reachability or non-reachability.");
     p.insert(":print-statistics",  CPK_BOOL, "(default: false) print statistics.");
 }

void context_params::collect_param_descrs(param_descrs & d) {
    d.insert("timeout", CPK_UINT, "default timeout (in milliseconds) used for solvers", "4294967295");
    d.insert("well_sorted_check", CPK_BOOL, "type checker", "true");
    d.insert("type_check", CPK_BOOL, "type checker (alias for well_sorted_check)", "true");
    d.insert("auto_config", CPK_BOOL, "use heuristics to automatically select solver and configure it", "true");
    d.insert("model_validate", CPK_BOOL, "validate models produced by solvers", "false");
    d.insert("trace", CPK_BOOL, "trace generation for VCC", "false");
    d.insert("trace_file_name", CPK_STRING, "trace out file name (see option 'trace')", "z3.log");
    d.insert("debug_ref_count", CPK_BOOL, "debug support for AST reference counting", "false");
    d.insert("smtlib2_compliant", CPK_BOOL, "enable/disable SMT-LIB 2.0 compliance", "false");
    collect_solver_param_descrs(d);
}

 static void collect_param_descrs(param_descrs & d) {
     d.insert("max_memory", CPK_UINT, "maximum amount of memory in megabytes", "4294967295","rewriter");
     d.insert("max_steps", CPK_UINT, "maximum number of steps", "4294967295","rewriter");
     d.insert("flat", CPK_BOOL, "create nary applications for and,or,+,*,bvadd,bvmul,bvand,bvor,bvxor", "true","rewriter");
     d.insert("push_ite_arith", CPK_BOOL, "push if-then-else over arithmetic terms.", "false","rewriter");
     d.insert("push_ite_bv", CPK_BOOL, "push if-then-else over bit-vector terms.", "false","rewriter");
     d.insert("pull_cheap_ite", CPK_BOOL, "pull if-then-else terms when cheap.", "false","rewriter");
     d.insert("cache_all", CPK_BOOL, "cache all intermediate results.", "false","rewriter");
 }

 void init_pdescrs(cmd_context & ctx, param_descrs & p) override {
     insert_timeout(p);
     p.insert("print", CPK_BOOL, "(default: true)  print the simplified term.");
     p.insert("print_statistics", CPK_BOOL, "(default: false) print statistics.");
 }

void insert_timeout(param_descrs & r) {
    r.insert(":timeout", CPK_UINT, "(default: infty) timeout in milliseconds.");
}

void insert_produce_proofs(param_descrs & r) {
    r.insert(":produce-proofs", CPK_BOOL, "(default: false) proof generation.");
}

void insert_produce_models(param_descrs & r) {
    r.insert(":produce-models", CPK_BOOL, "(default: false) model generation.");
}

void insert_max_steps(param_descrs & r) {
    r.insert(":max-steps", CPK_UINT, "(default: infty) maximum number of steps.");
}

void insert_max_memory(param_descrs & r) {
    r.insert(":max-memory", CPK_UINT, "(default: infty) maximum amount of memory in megabytes.");
}

void bound_propagator::get_param_descrs(param_descrs & r) {
    r.insert("bound_max_refinements", CPK_UINT, "(default: 16) maximum number of bound refinements (per round) for unbounded variables.");
    r.insert("bound_threshold", CPK_DOUBLE, "(default: 0.05) bound propagation improvement threshold ratio.");
}

 virtual void init_pdescrs(cmd_context & ctx, param_descrs & p) {
     p.insert("weight", CPK_NUMERAL, "(default: 1) penalty of not satisfying constraint.");
     p.insert("id", CPK_SYMBOL, "(default: null) partition identifier for soft constraints.");
 }

 virtual void collect_param_descrs(param_descrs & r) { 
     insert_max_memory(r);
     r.insert("aig_per_assertion", CPK_BOOL, "(default: true) process one assertion at a time.");
 }

 static void collect_param_descrs(param_descrs & d) {
   d.insert("elim_blocked_clauses", CPK_BOOL, "eliminate blocked clauses", "false","sat");
   d.insert("elim_blocked_clauses_at", CPK_UINT, "eliminate blocked clauses only once at the given simplification round", "2","sat");
   d.insert("blocked_clause_limit", CPK_UINT, "maximum number of literals visited during blocked clause elimination", "100000000","sat");
   d.insert("resolution", CPK_BOOL, "eliminate boolean variables using resolution", "true","sat");
   d.insert("resolution.limit", CPK_UINT, "approx. maximum number of literals visited during variable elimination", "500000000","sat");
   d.insert("resolution.occ_cutoff", CPK_UINT, "first cutoff (on number of positive/negative occurrences) for Boolean variable elimination", "10","sat");
   d.insert("resolution.occ_cutoff_range1", CPK_UINT, "second cutoff (number of positive/negative occurrences) for Boolean variable elimination, for problems containing less than res_cls_cutoff1 clauses", "8","sat");
   d.insert("resolution.occ_cutoff_range2", CPK_UINT, "second cutoff (number of positive/negative occurrences) for Boolean variable elimination, for problems containing more than res_cls_cutoff1 and less than res_cls_cutoff2", "5","sat");
   d.insert("resolution.occ_cutoff_range3", CPK_UINT, "second cutoff (number of positive/negative occurrences) for Boolean variable elimination, for problems containing more than res_cls_cutoff2", "3","sat");
   d.insert("resolution.lit_cutoff_range1", CPK_UINT, "second cutoff (total number of literals) for Boolean variable elimination, for problems containing less than res_cls_cutoff1 clauses", "700","sat");
   d.insert("resolution.lit_cutoff_range2", CPK_UINT, "second cutoff (total number of literals) for Boolean variable elimination, for problems containing more than res_cls_cutoff1 and less than res_cls_cutoff2", "400","sat");
   d.insert("resolution.lit_cutoff_range3", CPK_UINT, "second cutoff (total number of literals) for Boolean variable elimination, for problems containing more than res_cls_cutoff2", "300","sat");
   d.insert("resolution.cls_cutoff1", CPK_UINT, "limit1 - total number of problems clauses for the second cutoff of Boolean variable elimination", "100000000","sat");
   d.insert("resolution.cls_cutoff2", CPK_UINT, "limit2 - total number of problems clauses for the second cutoff of Boolean variable elimination", "700000000","sat");
   d.insert("elim_vars", CPK_BOOL, "enable variable elimination during simplification", "true","sat");
   d.insert("subsumption", CPK_BOOL, "eliminate subsumed clauses", "true","sat");
   d.insert("subsumption.limit", CPK_UINT, "approx. maximum number of literals visited during subsumption (and subsumption resolution)", "100000000","sat");
 }