/* Copyright (c) 2014 Microsoft Corporation. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Author: Leonardo de Moura */ #include "library/num.h" #include "library/util.h" #include "library/constants.h" namespace lean { bool is_const_app(expr const & e, name const & n, unsigned nargs) { expr const & f = get_app_fn(e); return is_constant(f) && const_name(f) == n && get_app_num_args(e) == nargs; } bool is_zero(expr const & e) { return is_const_app(e, get_has_zero_zero_name(), 2) || is_constant(e, get_nat_zero_name()); } bool is_one(expr const & e) { return is_const_app(e, get_has_one_one_name(), 2) || (is_const_app(e, get_nat_succ_name(), 1) && is_zero(app_arg(e))); } optional is_bit0(expr const & e) { if (!is_const_app(e, get_bit0_name(), 3)) return none_expr(); return some_expr(app_arg(e)); } optional is_bit1(expr const & e) { if (!is_const_app(e, get_bit1_name(), 4)) return none_expr(); return some_expr(app_arg(e)); } optional is_neg(expr const & e) { if (!is_const_app(e, get_has_neg_neg_name(), 3)) return none_expr(); return some_expr(app_arg(e)); } optional is_of_nat(expr const & e) { if (!is_const_app(e, get_has_of_nat_of_nat_name(), 3)) return none_expr(); return some_expr(app_arg(e)); } optional unfold_num_app(environment const & env, expr const & e) { if (is_zero(e) || is_one(e) || is_bit0(e) || is_bit1(e)) { return unfold_app(env, e); } else { return none_expr(); } } bool is_numeral_const_name(name const & n) { return n == get_has_zero_zero_name() || n == get_has_one_one_name() || n == get_bit0_name() || n == get_bit1_name(); } static bool is_num(expr const & e, bool first) { buffer args; expr const & f = get_app_args(e, args); if (!is_constant(f)) return false; if (const_name(f) == get_has_one_one_name()) return args.size() == 2; else if (const_name(f) == get_has_zero_zero_name()) return first && args.size() == 2; else if (const_name(f) == get_nat_zero_name()) return first && args.size() == 0; else if (const_name(f) == get_bit0_name()) return args.size() == 3 && is_num(args[2], false); else if (const_name(f) == get_bit1_name()) return args.size() == 4 && is_num(args[3], false); return false; } bool is_num(expr const & e) { return is_num(e, true); } bool is_signed_num(expr const & e) { if (is_num(e)) return true; else if (auto r = is_neg(e)) return is_num(*r); else return false; } static optional to_num(expr const & e, bool first) { if (is_zero(e)) { return first ? some(mpz(0)) : optional(); } else if (is_one(e)) { return some(mpz(1)); } else if (auto a = is_of_nat(e)) { return to_num(*a, false); } else if (is_lit(e) && lit_value(e).kind() == literal_kind::Nat) { return some(lit_value(e).get_nat().to_mpz()); } else if (auto a = is_bit0(e)) { if (auto r = to_num(*a, false)) return some(2*(*r)); } else if (auto a = is_bit1(e)) { if (auto r = to_num(*a, false)) return some(2*(*r)+1); } else if (first) { if (auto a = is_neg(e)) { if (auto r = to_num(*a, false)) return some(neg(*r)); } } return optional(); } optional to_num(expr const & e) { return to_num(e, true); } bool is_num_leaf_constant(name const & n) { return n == get_has_zero_zero_name() || n == get_has_one_one_name(); } expr to_nat_expr_core(mpz const & n) { lean_assert(n >= 0); if (n == 1) return mk_nat_one(); else if (n % mpz(2) == 0) return mk_nat_bit0(to_nat_expr(n / 2)); else return mk_nat_bit1(to_nat_expr(n / 2)); } expr to_nat_expr(mpz const & n) { if (n == 0) return mk_nat_zero(); else return to_nat_expr_core(n); } void initialize_num() {} void finalize_num() {} }