booyah

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>

src/tactic/arith/add_bounds_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef ADD_BOUNDS_H_
-#define ADD_BOUNDS_H_
+#pragma once
 
 #include "util/params.h"
 
@@ -36,4 +35,3 @@ tactic * mk_add_bounds_tactic(ast_manager & m, params_ref const & p = params_ref
   ADD_PROBE("is-unbounded", "true if the goal contains integer/real constants that do not have lower/upper bounds.", "mk_is_unbounded_probe()")
 */
 
-#endif

src/tactic/arith/arith_bounds_tactic.h

@@ -28,10 +28,8 @@ Notes:
     subsumption of atoms. 
 
 --*/
-#ifndef ARITH_BOUNDS_TACTIC_H_
-#define ARITH_BOUNDS_TACTIC_H_
+#pragma once
 #include "tactic/tactic.h"
 
 tactic * mk_arith_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
 
-#endif

src/tactic/arith/bound_manager.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BOUND_MANAGER_H_
-#define BOUND_MANAGER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/arith_decl_plugin.h"
@@ -112,4 +111,3 @@ public:
     void display(std::ostream & out) const;
 };
 
-#endif

src/tactic/arith/bound_propagator.h

@@ -17,8 +17,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef BOUND_PROPAGATOR_H_
-#define BOUND_PROPAGATOR_H_
+#pragma once
 
 #include "util/mpq.h"
 #include "util/vector.h"
@@ -262,4 +261,3 @@ public:
     unsigned get_num_propagations() const { return m_propagations; }
 };
 
-#endif

src/tactic/arith/bv2int_rewriter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV2INT_REWRITER_H_
-#define BV2INT_REWRITER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/rewriter/rewriter.h"
@@ -119,4 +118,3 @@ public:
         m_cfg(m, ctx) {}
 };
 
-#endif

src/tactic/arith/bv2real_rewriter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV2REAL_REWRITER_H_
-#define BV2REAL_REWRITER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/rewriter/rewriter.h"
@@ -230,4 +229,3 @@ public:
         m_cfg(u) {}
 };
 
-#endif

src/tactic/arith/card2bv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef CARD2BV_TACTIC_H_
-#define CARD2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 #include "ast/pb_decl_plugin.h"
@@ -108,4 +107,3 @@ tactic * mk_card2bv_tactic(ast_manager & m, params_ref const & p = params_ref())
 */
 
 
-#endif

src/tactic/arith/degree_shift_tactic.h

@@ -19,8 +19,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef DEGREE_SHIFT_TACTIC_H_
-#define DEGREE_SHIFT_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -32,4 +31,3 @@ tactic * mk_degree_shift_tactic(ast_manager & m, params_ref const & p = params_r
   ADD_TACTIC("degree-shift", "try to reduce degree of polynomials (remark: :mul2power simplification is automatically applied).", "mk_degree_shift_tactic(m, p)")
 */
 
-#endif

src/tactic/arith/diff_neq_tactic.h

@@ -20,8 +20,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef DIFF_NEQ_TACTIC_H_
-#define DIFF_NEQ_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,4 +30,3 @@ tactic * mk_diff_neq_tactic(ast_manager & m, params_ref const & p = params_ref()
 /*
   ADD_TACTIC("diff-neq", "specialized solver for integer arithmetic problems that contain only atoms of the form (<= k x) (<= x k) and (not (= (- x y) k)), where x and y are constants and k is a numeral, and all constants are bounded.", "mk_diff_neq_tactic(m, p)")
 */
-#endif

src/tactic/arith/eq2bv_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef EQ2BV_TACTIC_H_
-#define EQ2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,4 +30,3 @@ tactic * mk_eq2bv_tactic(ast_manager & m);
 */
 
 
-#endif

src/tactic/arith/factor_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef FACTOR_TACTIC_H_
-#define FACTOR_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -27,4 +26,3 @@ tactic * mk_factor_tactic(ast_manager & m, params_ref const & p = params_ref());
 /*
   ADD_TACTIC("factor", "polynomial factorization.", "mk_factor_tactic(m, p)")
 */
-#endif

src/tactic/arith/fix_dl_var_tactic.h

@@ -21,8 +21,7 @@ Author:
 Notes:
 
 --*/
-#ifndef FIX_DL_VAR_TACTIC_H_
-#define FIX_DL_VAR_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -34,4 +33,3 @@ tactic * mk_fix_dl_var_tactic(ast_manager & m, params_ref const & p = params_ref
   ADD_TACTIC("fix-dl-var", "if goal is in the difference logic fragment, then fix the variable with the most number of occurrences at 0.", "mk_fix_dl_var_tactic(m, p)")
 */
 
-#endif

src/tactic/arith/fm_tactic.h

@@ -21,8 +21,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef FM_TACTIC_H_
-#define FM_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -33,4 +32,3 @@ tactic * mk_fm_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("fm", "eliminate variables using fourier-motzkin elimination.", "mk_fm_tactic(m, p)")
 */
 
-#endif

src/tactic/arith/lia2card_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef LIA2CARD_TACTIC_H_
-#define LIA2CARD_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -32,4 +31,3 @@ tactic * mk_lia2card_tactic(ast_manager & m, params_ref const & p = params_ref()
 
 bool get_pb_sum(expr* term, expr_ref_vector& args, vector<rational>& coeffs, rational& coeff);
 
-#endif

src/tactic/arith/lia2pb_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef LIA2PB_TACTIC_H_
-#define LIA2PB_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ tactic * mk_lia2pb_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("lia2pb", "convert bounded integer variables into a sequence of 0-1 variables.", "mk_lia2pb_tactic(m, p)")
 */
 
-#endif

src/tactic/arith/linear_equation.h

@@ -18,8 +18,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef LINEAR_EQUATION_H_
-#define LINEAR_EQUATION_H_
+#pragma once
 
 #include "util/mpq.h"
 #include "util/small_object_allocator.h"
@@ -82,4 +81,3 @@ public:
     void display(std::ostream & out, linear_equation const & eq) const;
 };
 
-#endif

src/tactic/arith/nla2bv_tactic.h

@@ -17,8 +17,7 @@ Notes:
     Ported to tactic framework on 2012-02-28
 
 --*/
-#ifndef NLA2BV_TACTIC_H_
-#define NLA2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,5 +28,4 @@ tactic * mk_nla2bv_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("nla2bv", "convert a nonlinear arithmetic problem into a bit-vector problem, in most cases the resultant goal is an under approximation and is useul for finding models.", "mk_nla2bv_tactic(m, p)")
 */
 
-#endif
 

src/tactic/arith/normalize_bounds_tactic.h

@@ -18,8 +18,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef NORMALIZE_BOUNDS_TACTIC_H_
-#define NORMALIZE_BOUNDS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,4 +30,3 @@ tactic * mk_normalize_bounds_tactic(ast_manager & m, params_ref const & p = para
   ADD_TACTIC("normalize-bounds", "replace a variable x with lower bound k <= x with x' = x - k.", "mk_normalize_bounds_tactic(m, p)")
 */
 
-#endif

src/tactic/arith/pb2bv_model_converter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PB2BV_MODEL_CONVERTER_H_
-#define PB2BV_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 #include "tactic/arith/bound_manager.h"
@@ -37,4 +36,3 @@ public:
     model_converter * translate(ast_translation & translator) override;
 };
 
-#endif

src/tactic/arith/pb2bv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PB2BV_TACTIC_H_
-#define PB2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -34,4 +33,3 @@ probe * mk_is_pb_probe();
   ADD_PROBE("is-pb", "true if the goal is a pseudo-boolean problem.", "mk_is_pb_probe()")
 */
 
-#endif

src/tactic/arith/probe_arith.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef PROBE_ARITH_H_
-#define PROBE_ARITH_H_
+#pragma once
 
 class probe;
 probe * mk_arith_avg_bw_probe();
@@ -68,4 +67,3 @@ probe * mk_is_qfufnra_probe();
   ADD_PROBE("is-lira", "true if the goal is in LIRA (linear integer and real arithmetic, formula may have quantifiers).", "mk_is_lira_probe()")
   ADD_PROBE("is-qfufnra", "true if the goal is QF_UFNRA (quantifier-free nonlinear real arithmetic with other theories).", "mk_is_qfufnra_probe()")
 */
-#endif

src/tactic/arith/propagate_ineqs_tactic.h

@@ -30,8 +30,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PROPAGATE_INEQS_TACTIC_H_
-#define PROPAGATE_INEQS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -42,4 +41,3 @@ tactic * mk_propagate_ineqs_tactic(ast_manager & m, params_ref const & p = param
   ADD_TACTIC("propagate-ineqs", "propagate ineqs/bounds, remove subsumed inequalities.", "mk_propagate_ineqs_tactic(m, p)")
 */
 
-#endif

src/tactic/arith/purify_arith_tactic.h

@@ -45,8 +45,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef PURIFY_ARITH_TACTIC_H_
-#define PURIFY_ARITH_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -58,5 +57,4 @@ tactic * mk_purify_arith_tactic(ast_manager & m, params_ref const & p = params_r
   ADD_TACTIC("purify-arith", "eliminate unnecessary operators: -, /, div, mod, rem, is-int, to-int, ^, root-objects.", "mk_purify_arith_tactic(m, p)")
 */
 
-#endif
 

src/tactic/arith/recover_01_tactic.h

@@ -30,8 +30,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef RECOVER_01_TACTIC_H_
-#define RECOVER_01_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -42,4 +41,3 @@ tactic * mk_recover_01_tactic(ast_manager & m, params_ref const & p = params_ref
   ADD_TACTIC("recover-01", "recover 0-1 variables hidden as Boolean variables.", "mk_recover_01_tactic(m, p)")
 */
 
-#endif