Home
last modified time | relevance | path

Searched refs:watch_list_out (Results 1 – 2 of 2) sorted by relevance

/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/
H A Dinst_propagator.cpp386 watch_list_out[n].push_back( watch[j] ); in setWatchList()
391 std::map< Node, std::vector< Node > >::iterator it = watch_list_out.find( n ); in collectWatchList()
395 collectWatchList( it->second[j], watch_list_out, watch_list ); in collectWatchList()
414 ret = evaluateTermExp( n, exp, visited, false, pol, watch_list_out, props ); in evaluateTermExp()
469 bool is_watch = watch_list_out.find( c )!=watch_list_out.end(); in evaluateTermExp()
551 setWatchList( ret, watch, watch_list_out ); in evaluateTermExp()
554 ret = evaluateTermExp( ret, exp, visited, hasPol, pol, watch_list_out, props ); in evaluateTermExp()
558 setWatchList( ret, watch, watch_list_out ); in evaluateTermExp()
706 std::map< Node, std::vector< Node > > watch_list_out; in update() local
716 d_qy.collectWatchList( eval, watch_list_out, watch_list ); in update()
[all …]
H A Dinst_propagator.h105 …hList( Node n, std::vector< Node >& watch, std::map< Node, std::vector< Node > >& watch_list_out );
106 …static void collectWatchList( Node n, std::map< Node, std::vector< Node > >& watch_list_out, std::…
109 …bool hasPol, bool pol, std::map< Node, std::vector< Node > >& watch_list_out, std::vector< Node >&…