mirror of
				https://github.com/Z3Prover/z3
				synced 2025-11-04 05:19:11 +00:00 
			
		
		
		
	tidy
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
		
							parent
							
								
									469f618742
								
							
						
					
					
						commit
						98bfbc2d62
					
				
					 2 changed files with 6 additions and 11 deletions
				
			
		| 
						 | 
				
			
			@ -441,7 +441,7 @@ namespace dd {
 | 
			
		|||
    pdd_manager::PDD pdd_manager::make_node(unsigned lvl, PDD l, PDD h) {
 | 
			
		||||
        m_is_new_node = false;
 | 
			
		||||
        if (is_zero(h)) return l;
 | 
			
		||||
        SASSERT(is_val(l) || level(l) <= lvl);
 | 
			
		||||
        SASSERT(is_val(l) || level(l) < lvl);
 | 
			
		||||
        SASSERT(is_val(h) || level(h) <= lvl);
 | 
			
		||||
        pdd_node n(lvl, l, h, tree_size(l) + tree_size(h) + 1);
 | 
			
		||||
        return insert_node(n);
 | 
			
		||||
| 
						 | 
				
			
			@ -706,7 +706,7 @@ namespace dd {
 | 
			
		|||
            PDD lo = n.m_lo;
 | 
			
		||||
            PDD hi = n.m_hi;
 | 
			
		||||
            if (hi == 0) continue; // it is a value
 | 
			
		||||
            ok &= is_val(lo) || level(lo) <= lvl;
 | 
			
		||||
            ok &= is_val(lo) || level(lo) < lvl;
 | 
			
		||||
            ok &= is_val(hi) || level(hi) <= lvl;
 | 
			
		||||
            ok &= is_val(lo) || !m_nodes[lo].is_internal();
 | 
			
		||||
            ok &= is_val(hi) || !m_nodes[hi].is_internal();
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
| 
						 | 
				
			
			@ -72,16 +72,12 @@ namespace dd {
 | 
			
		|||
    
 | 
			
		||||
    grobner::equation* grobner::pick_next() {
 | 
			
		||||
        equation* eq = nullptr;
 | 
			
		||||
        ptr_buffer<equation> to_delete;
 | 
			
		||||
        for (auto* curr : m_to_simplify) {
 | 
			
		||||
            if (!eq|| is_simpler(*curr, *eq)) {
 | 
			
		||||
            if (!eq || is_simpler(*curr, *eq)) {
 | 
			
		||||
                eq = curr;
 | 
			
		||||
            }
 | 
			
		||||
        }
 | 
			
		||||
        for (auto* e : to_delete)
 | 
			
		||||
            del_equation(e);
 | 
			
		||||
        if (eq) 
 | 
			
		||||
            m_to_simplify.erase(eq);
 | 
			
		||||
        if (eq) m_to_simplify.erase(eq);
 | 
			
		||||
        return eq;
 | 
			
		||||
    }
 | 
			
		||||
 | 
			
		||||
| 
						 | 
				
			
			@ -174,10 +170,9 @@ namespace dd {
 | 
			
		|||
        if (!m.try_spoly(eq1.poly(), eq2.poly(), r)) return;
 | 
			
		||||
        m_stats.m_superposed++;
 | 
			
		||||
        if (r.is_zero()) return;
 | 
			
		||||
        unsigned idx = m_equations.size();
 | 
			
		||||
        equation* eq = alloc(equation, r, m_dep_manager.mk_join(eq1.dep(), eq2.dep()), idx);
 | 
			
		||||
        equation* eq = alloc(equation, r, m_dep_manager.mk_join(eq1.dep(), eq2.dep()), m_equations.size());
 | 
			
		||||
        update_stats_max_degree_and_size(*eq);
 | 
			
		||||
        if (r.is_val()) set_conflict();
 | 
			
		||||
        check_conflict(*eq);
 | 
			
		||||
        m_to_simplify.insert(eq);
 | 
			
		||||
    }
 | 
			
		||||
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue