3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-03 11:25:40 +00:00

fix compilation warnings

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2014-03-28 08:34:54 -07:00
parent 2103bc3831
commit a6d7d23bb5
3 changed files with 4 additions and 4 deletions

View file

@ -29,7 +29,7 @@ using namespace stl_ext;
namespace Duality { namespace Duality {
class implicant_solver; struct implicant_solver;
/* Generic operations on Z3 formulas */ /* Generic operations on Z3 formulas */

View file

@ -2201,7 +2201,7 @@ namespace Duality {
#endif #endif
int expand_max = 1; int expand_max = 1;
if(0&&duality->BatchExpand){ if(0&&duality->BatchExpand){
int thing = stack.size() * 0.1; int thing = stack.size() /10;
expand_max = std::max(1,thing); expand_max = std::max(1,thing);
if(expand_max > 1) if(expand_max > 1)
std::cout << "foo!\n"; std::cout << "foo!\n";

View file

@ -52,7 +52,7 @@ namespace hash_space {
class hash<std::string> { class hash<std::string> {
public: public:
size_t operator()(const std::string &s) const { size_t operator()(const std::string &s) const {
return string_hash(s.c_str(), s.size(), 0); return string_hash(s.c_str(), static_cast<unsigned>(s.size()), 0);
} }
}; };
@ -107,7 +107,7 @@ namespace hash_space {
4294967291ul 4294967291ul
}; };
inline unsigned long next_prime(unsigned long n) { inline size_t next_prime(size_t n) {
const unsigned long* to = primes + (int)num_primes; const unsigned long* to = primes + (int)num_primes;
for(const unsigned long* p = primes; p < to; p++) for(const unsigned long* p = primes; p < to; p++)
if(*p >= n) return *p; if(*p >= n) return *p;