mirror of
https://github.com/Z3Prover/z3
synced 2025-09-02 08:10:43 +00:00
Remove int64, uint64 typedefs in favor of int64_t / uint64_t.
This commit is contained in:
parent
16a2ad9afd
commit
2fa304d8de
80 changed files with 437 additions and 449 deletions
|
@ -38,9 +38,9 @@ unsigned get_p_from_manager(zp_numeral_manager const & zp_nm) {
|
|||
if (!nm.is_uint64(p)) {
|
||||
throw upolynomial_exception("The prime number attempted in factorization is too big!");
|
||||
}
|
||||
uint64 p_uint64 = nm.get_uint64(p);
|
||||
uint64_t p_uint64 = nm.get_uint64(p);
|
||||
unsigned p_uint = static_cast<unsigned>(p_uint64);
|
||||
if (((uint64)p_uint) != p_uint64) {
|
||||
if (((uint64_t)p_uint) != p_uint64) {
|
||||
throw upolynomial_exception("The prime number attempted in factorization is too big!");
|
||||
}
|
||||
return p_uint;
|
||||
|
@ -1075,7 +1075,7 @@ bool factor_square_free(z_manager & upm, numeral_vector const & f, factors & fs,
|
|||
while (trials < params.m_p_trials) {
|
||||
upm.checkpoint();
|
||||
// construct prime to check
|
||||
uint64 next_prime = prime_it.next();
|
||||
uint64_t next_prime = prime_it.next();
|
||||
if (next_prime > params.m_max_p) {
|
||||
fs.push_back(f_pp, k);
|
||||
return false;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue