mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-28 19:35:50 +00:00
Code Activity

Use nullptr.

Browse source
This commit is contained in:
Bruce Mitchener 2018-02-12 14:05:55 +07:00
parent f01328c65f
commit 76eb7b9ede
625 changed files with 4639 additions and 4639 deletions
Download patch file Download diff file Expand all files Collapse all files

8
src/math/hilbert/heap_trie.h
View file

@ -195,9 +195,9 @@ public:
m_le(le),
m_num_keys(0),
m_do_reshuffle(4),
m_root(0),
m_spare_leaf(0),
m_spare_trie(0)
m_root(nullptr),
m_spare_leaf(nullptr),
m_spare_trie(nullptr)
{}
~heap_trie() {
@ -283,7 +283,7 @@ public:
++m_stats.m_num_removes;
// assumption: key is in table.
node* n = m_root;
node* m = 0;
node* m = nullptr;
for (unsigned i = 0; i < num_keys(); ++i) {
n->dec_ref();
VERIFY (to_trie(n)->find(get_key(keys, i), m));

4
src/math/hilbert/hilbert_basis.cpp
View file

@ -174,7 +174,7 @@ class hilbert_basis::value_index2 {
struct checker : public ht::check_value {
hilbert_basis* hb;
offset_t m_value;
checker(): hb(0) {}
checker(): hb(nullptr) {}
bool operator()(unsigned const& v) override {
if (m_value.m_offset != v) { // && hb->is_subsumed(m_value, offset_t(v))) {
return true;
@ -278,7 +278,7 @@ public:
m_zero.insert(idx, vs);
}
else {
value_index* map = 0;
value_index* map = nullptr;
if (!m_neg.find(vs.weight(), map)) {
map = alloc(value_index, hb);
map->reset(m_num_ineqs);