Home
last modified time | relevance | path

Searched refs:d_uf (Results 1 – 3 of 3) sorted by relevance

/dports/math/cvc4/CVC4-1.7/src/theory/uf/
H A Dtheory_uf.h46 TheoryUF& d_uf; variable
48 NotifyClass(TheoryUF& uf): d_uf(uf) {} in NotifyClass()
54 return d_uf.propagate(equality); in eqNotifyTriggerEquality()
57 return d_uf.propagate(equality.notNode()); in eqNotifyTriggerEquality()
65 return d_uf.propagate(predicate); in eqNotifyTriggerPredicate()
78 return d_uf.propagate(t1.eqNode(t2)); in eqNotifyTriggerTermEquality()
87 d_uf.conflict(t1, t2); in eqNotifyConstantTermMerge()
93 d_uf.eqNotifyNewClass(t); in eqNotifyNewClass()
99 d_uf.eqNotifyPreMerge(t1, t2); in eqNotifyPreMerge()
105 d_uf.eqNotifyPostMerge(t1, t2); in eqNotifyPostMerge()
[all …]
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/
H A Dinst_propagator.cpp35 d_uf.clear(); in reset()
190 std::map< Node, Node >::iterator it = d_uf.find( a ); in getUfRepresentative()
191 if( it!=d_uf.end() ){ in getUfRepresentative()
200 d_uf[ a ] = m; in getUfRepresentative()
300 d_uf[ar] = br; in setEqual()
306 d_uf[br] = br; in setEqual()
339 if( d_uf.find( n )==d_uf.end() ){ in registerUfTerm()
H A Dinst_propagator.h77 std::map<Node, Node> d_uf; variable