booyah

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

src/math/automata/automaton.h

@@ -18,8 +18,7 @@ Revision History:
 
 --*/
 
-#ifndef AUTOMATON_H_
-#define AUTOMATON_H_
+#pragma once
 
 
 #include "util/util.h"
@@ -750,4 +749,3 @@ private:
 typedef automaton<unsigned> uautomaton;
 
 
-#endif 

src/math/automata/boolean_algebra.h

@@ -18,8 +18,7 @@ Revision History:
 
 --*/
 
-#ifndef BOOLEAN_ALGEBRA_H_
-#define BOOLEAN_ALGEBRA_H_
+#pragma once
 
 #include "util/util.h"
 
@@ -43,4 +42,3 @@ public:
     virtual T mk_not(T x) = 0;
 };
 
-#endif

src/math/automata/symbolic_automata.h

@@ -18,8 +18,7 @@ Revision History:
 
 --*/
 
-#ifndef SYMBOLIC_AUTOMATA_H_
-#define SYMBOLIC_AUTOMATA_H_
+#pragma once
 
 
 #include "math/automata/automaton.h"
@@ -151,4 +150,3 @@ private:
 
 
 
-#endif 

src/math/automata/symbolic_automata_def.h

@@ -18,8 +18,7 @@ Revision History:
 
 --*/
 
-#ifndef SYMBOLIC_AUTOMATA_DEF_H_
-#define SYMBOLIC_AUTOMATA_DEF_H_
+#pragma once
 
 
 #include "math/automata/symbolic_automata.h"
@@ -489,4 +488,3 @@ typename symbolic_automata<T, M>::automaton_t* symbolic_automata<T, M>::mk_diffe
     return mk_product(a,mk_complement(b));
 }
 
-#endif 

src/math/dd/dd_bdd.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef DD_BDD_H_
-#define DD_BDD_H_
+#pragma once
 
 #include "util/vector.h"
 #include "util/map.h"
@@ -264,4 +263,3 @@ namespace dd {
 }
 
 
-#endif

src/math/dd/dd_pdd.h

@@ -28,8 +28,7 @@ Author:
     Nikolaj Bjorner (nbjorner) 2019-12-17
 
 --*/
-#ifndef DD_PDD_H_
-#define DD_PDD_H_
+#pragma once
 
 #include "util/vector.h"
 #include "util/map.h"
@@ -420,4 +419,3 @@ namespace dd {
 }
 
 
-#endif

src/math/grobner/grobner.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef GROBNER_H_
-#define GROBNER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/arith_decl_plugin.h"
@@ -289,5 +288,4 @@ public:
     void display(std::ostream & out) const;
 };
 
-#endif /* GROBNER_H_ */
 

src/math/hilbert/heap_trie.h

@@ -34,8 +34,7 @@ Notes:
 
 --*/
 
-#ifndef HEAP_TRIE_H_
-#define HEAP_TRIE_H_
+#pragma once
 
 #include <cstring>
 #include "util/map.h"
@@ -663,4 +662,3 @@ private:
     }
 };
 
-#endif 

src/math/interval/interval.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef INTERVAL_H_
-#define INTERVAL_H_
+#pragma once
 
 #include "util/mpq.h"
 #include "util/ext_numeral.h"
@@ -391,4 +390,3 @@ public:
     }
 };
 
-#endif

src/math/interval/interval_def.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef INTERVAL_DEF_H_
-#define INTERVAL_DEF_H_
+#pragma once
 
 #include "math/interval/interval.h"
 #include "util/debug.h"
@@ -2007,4 +2006,3 @@ void interval_manager<C>::e(unsigned k, interval & r) {
     m().set(upper(r), hi);
 }
 
-#endif

src/math/polynomial/algebraic_numbers.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef ALGEBRAIC_NUMBERS_H_
-#define ALGEBRAIC_NUMBERS_H_
+#pragma once
 
 #include "util/rational.h"
 #include "util/mpq.h"
@@ -490,4 +489,3 @@ inline std::ostream & operator<<(std::ostream & out, interval_pp const & n) {
     return out;
 }
 
-#endif

src/math/polynomial/linear_eq_solver.h

@@ -19,8 +19,7 @@ Author:
 Notes:
 
 --*/
-#ifndef LINEAR_EQ_SOLVER_H_
-#define LINEAR_EQ_SOLVER_H_
+#pragma once
 
 template<typename numeral_manager> 
 class linear_eq_solver {
@@ -149,4 +148,3 @@ public:
 };
 
 
-#endif

src/math/polynomial/polynomial.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef POLYNOMIAL_H_
-#define POLYNOMIAL_H_
+#pragma once
 
 #include "util/mpz.h"
 #include "util/rational.h"
@@ -1415,4 +1414,3 @@ inline void factor(polynomial_ref const & p, polynomial::factors & r, polynomial
 
 std::ostream & operator<<(std::ostream & out, polynomial_ref_vector const & seq);
 
-#endif

src/math/polynomial/polynomial_cache.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef POLYNOMIAL_CACHE_H_
-#define POLYNOMIAL_CACHE_H_
+#pragma once
 
 #include "math/polynomial/polynomial.h"
 
@@ -41,4 +40,3 @@ namespace polynomial {
     };
 };
 
-#endif

src/math/polynomial/polynomial_primes.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef POLYNOMIAL_PRIMES_H_
-#define POLYNOMIAL_PRIMES_H_
+#pragma once
 
 namespace polynomial {
 #define NUM_SMALL_PRIMES 11
@@ -69,4 +68,3 @@ namespace polynomial {
 
 };
 
-#endif

src/math/polynomial/polynomial_var2value.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef POLYNOMIAL_VAR2VALUE_H_
-#define POLYNOMIAL_VAR2VALUE_H_
+#pragma once
 
 #include "math/polynomial/polynomial.h"
 #include "util/scoped_numeral_vector.h"
@@ -47,4 +46,3 @@ namespace polynomial {
 };
 
 
-#endif

src/math/polynomial/rpolynomial.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef RPOLYNOMIAL_H_
-#define RPOLYNOMIAL_H_
+#pragma once
 
 #include "util/mpz.h"
 #include "util/rational.h"
@@ -203,4 +202,3 @@ inline rpolynomial_ref operator+(rpolynomial_ref const & p, int a) {
 
 
 
-#endif

src/math/polynomial/sexpr2upolynomial.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef SEXPR2UPOLYNOMIAL_H_
-#define SEXPR2UPOLYNOMIAL_H_
+#pragma once
 
 #include "math/polynomial/upolynomial.h"
 #include "util/cmd_context_types.h"
@@ -30,4 +29,3 @@ public:
 
 void sexpr2upolynomial(upolynomial::manager & m, sexpr const * s, upolynomial::numeral_vector & p);
 
-#endif

src/math/polynomial/upolynomial.h

@@ -21,8 +21,7 @@ Author:
 Notes:
 
 --*/
-#ifndef UPOLYNOMIAL_H_
-#define UPOLYNOMIAL_H_
+#pragma once
 
 #include "util/mpzzp.h"
 #include "util/rational.h"
@@ -919,4 +918,3 @@ namespace upolynomial {
 
 };
 
-#endif

src/math/polynomial/upolynomial_factorization.h

@@ -22,8 +22,7 @@ Notes:
    [3] Henri Cohen. A Course in Computational Algebraic Number Theory. Springer Verlag, 1993.
 
 --*/
-#ifndef UPOLYNOMIAL_FACTORIZATION_H_
-#define UPOLYNOMIAL_FACTORIZATION_H_
+#pragma once
 
 #include "math/polynomial/upolynomial.h"
 #include "math/polynomial/polynomial.h"
@@ -93,4 +92,3 @@ namespace upolynomial {
     bool factor_square_free(z_manager & upm, numeral_vector const & f, factors & fs, unsigned k, factor_params const & ps = factor_params());
 };
 
-#endif

src/math/polynomial/upolynomial_factorization_int.h

@@ -23,8 +23,7 @@ Notes:
    [3] Henri Cohen. A Course in Computational Algebraic Number Theory. Springer Verlag, 1993.
 
 --*/
-#ifndef UPOLYNOMIAL_FACTORIZATION_INT_H_
-#define UPOLYNOMIAL_FACTORIZATION_INT_H_
+#pragma once
 
 #include "math/polynomial/upolynomial_factorization.h"
 
@@ -417,4 +416,3 @@ namespace upolynomial {
     };
 };
 
-#endif

src/math/realclosure/mpz_matrix.h

@@ -28,8 +28,7 @@ Author:
 Notes:
 
 --*/
-#ifndef MPZ_MATRIX_H_
-#define MPZ_MATRIX_H_
+#pragma once
 
 #include "util/mpz.h"
 
@@ -153,4 +152,3 @@ inline std::ostream & operator<<(std::ostream & out, scoped_mpz_matrix const & m
     return out;
 }
 
-#endif

src/math/realclosure/realclosure.h

@@ -19,8 +19,7 @@ Author:
 Notes:
 
 --*/
-#ifndef REALCLOSURE_H_
-#define REALCLOSURE_H_
+#pragma once
 
 #include "util/mpq.h"
 #include "util/params.h"
@@ -401,4 +400,3 @@ inline rc_interval_pp interval_pp(scoped_rcnumeral const & n) {
     return rc_interval_pp(n);
 }
 
-#endif

src/math/simplex/bit_matrix.h

@@ -20,8 +20,7 @@ Notes:
 
 --*/
 
-#ifndef BIT_MATRIX_H_
-#define BIT_MATRIX_H_
+#pragma once
 
 #include "util/region.h"
 #include "util/vector.h"
@@ -112,4 +111,3 @@ private:
 inline std::ostream& operator<<(std::ostream& out, bit_matrix& m) { return m.display(out); }
 inline std::ostream& operator<<(std::ostream& out, bit_matrix::row const& r) { return r.display(out); }
 
-#endif

src/math/simplex/model_based_opt.h

@@ -18,8 +18,7 @@ Revision History:
 
 --*/
 
-#ifndef __MODEL_BASED_OPT_H__
-#define __MODEL_BASED_OPT_H__
+#pragma once
 
 #include "util/util.h"
 #include "util/rational.h"
@@ -207,4 +206,3 @@ inline std::ostream& operator<<(std::ostream& out, opt::model_based_opt::row con
 
 inline std::ostream& operator<<(std::ostream& out, opt::model_based_opt::var const v) { return out << "v" << v.m_id; }
 
-#endif 

src/math/simplex/network_flow.h

@@ -25,8 +25,7 @@ Notes:
     A naive approach is to run an algorithm on max flow in order to get a spanning tree.
    
 --*/
-#ifndef NETWORK_FLOW_H_
-#define NETWORK_FLOW_H_
+#pragma once
 
 #include "util/inf_rational.h"
 #include "smt/diff_logic.h"
@@ -197,4 +196,3 @@ namespace smt {
     };
 }
 
-#endif

src/math/simplex/network_flow_def.h

@@ -17,8 +17,7 @@ Notes:
    
 --*/
 
-#ifndef NETWORK_FLOW_DEF_H_
-#define NETWORK_FLOW_DEF_H_
+#pragma once
 
 #include "math/simplex/network_flow.h"
 #include "util/uint_set.h"
@@ -523,4 +522,3 @@ namespace smt {
     }
 }
 
-#endif

src/math/simplex/simplex.h

@@ -29,8 +29,7 @@ Notes:
 
 --*/
 
-#ifndef SIMPLEX_H_
-#define SIMPLEX_H_
+#pragma once
 
 #include "math/simplex/sparse_matrix.h"
 #include "util/mpq_inf.h"
@@ -203,4 +202,3 @@ namespace simplex {
     void ensure_rational_solution(simplex<mpq_ext>& s);
 };
 
-#endif

src/math/simplex/simplex_def.h

@@ -17,8 +17,7 @@ Notes:
 
 --*/
 
-#ifndef SIMPLEX_DEF_H_
-#define SIMPLEX_DEF_H_
+#pragma once
 
 
 namespace simplex {
@@ -1038,5 +1037,4 @@ namespace simplex {
 
 };
 
-#endif
 

src/math/simplex/sparse_matrix_def.h

@@ -18,8 +18,7 @@ Notes:
 
 --*/
 
-#ifndef SPARSE_MATRIX_DEF_H_
-#define SPARSE_MATRIX_DEF_H_
+#pragma once
 
 #include "math/simplex/sparse_matrix.h"
 #include "util/uint_set.h"
@@ -582,4 +581,3 @@ namespace simplex {
 
 };
 
-#endif

src/math/subpaving/subpaving.h

@@ -22,8 +22,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_H_
-#define SUBPAVING_H_
+#pragma once
 
 #include "util/mpq.h"
 #include "math/subpaving/subpaving_types.h"
@@ -120,4 +119,3 @@ context * mk_mpfx_context(reslimit& lim, mpfx_manager & m, unsynch_mpq_manager &
 };
 
 
-#endif

src/math/subpaving/subpaving_hwf.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_HWF_H_
-#define SUBPAVING_HWF_H_
+#pragma once
 
 #include "math/subpaving/subpaving_t.h"
 #include "util/f2n.h"
@@ -45,4 +44,3 @@ public:
 
 };
 
-#endif

src/math/subpaving/subpaving_mpf.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_MPF_H_
-#define SUBPAVING_MPF_H_
+#pragma once
 
 #include "math/subpaving/subpaving_t.h"
 #include "util/mpf.h"
@@ -46,4 +45,3 @@ public:
 
 };
 
-#endif

src/math/subpaving/subpaving_mpff.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_MPFF_H_
-#define SUBPAVING_MPFF_H_
+#pragma once
 
 #include "math/subpaving/subpaving_t.h"
 #include "util/mpff.h"
@@ -42,4 +41,3 @@ typedef context_t<config_mpff> context_mpff;
 
 };
 
-#endif

src/math/subpaving/subpaving_mpfx.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_MPFX_H_
-#define SUBPAVING_MPFX_H_
+#pragma once
 
 #include "math/subpaving/subpaving_t.h"
 #include "util/mpfx.h"
@@ -42,4 +41,3 @@ typedef context_t<config_mpfx> context_mpfx;
 
 };
 
-#endif

src/math/subpaving/subpaving_mpq.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_MPQ_H_
-#define SUBPAVING_MPQ_H_
+#pragma once
 
 #include "math/subpaving/subpaving_t.h"
 #include "util/mpq.h"
@@ -40,4 +39,3 @@ typedef context_t<config_mpq> context_mpq;
 
 };
 
-#endif

src/math/subpaving/subpaving_t.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_T_H_
-#define SUBPAVING_T_H_
+#pragma once
 
 #include<iostream>
 #include "util/tptr.h"
@@ -848,4 +847,3 @@ public:
 
 };
 
-#endif

src/math/subpaving/tactic/expr2subpaving.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef EXPR2SUBPAVING_H_
-#define EXPR2SUBPAVING_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "math/subpaving/subpaving.h"
@@ -50,4 +49,3 @@ public:
 };
 
 
-#endif

src/math/subpaving/tactic/subpaving_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SUBPAVING_TACTIC_H_
-#define SUBPAVING_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ tactic * mk_subpaving_tactic(ast_manager & m, params_ref const & p = params_ref(
   ADD_TACTIC("subpaving", "tactic for testing subpaving module.", "mk_subpaving_tactic(m, p)")
 */
 
-#endif