Home
last modified time | relevance | path

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

/dports/math/cvc4/CVC4-1.7/src/theory/sep/
H A Dtheory_sep.cpp681 if (ContainsKey(d_label_map[s_atom], s_lbl)) in check()
693 d_label_map[s_atom][s_lbl]) in check()
1249 std::map< int, Node >::iterator it = d_label_map[atom][lbl].find( child ); in getLabel()
1250 if( it==d_label_map[atom][lbl].end() ){ in getLabel()
1257 d_label_map[atom][lbl][child] = n_lbl; in getLabel()
1314 Assert( d_label_map[n].find( lbl )!=d_label_map[n].end() ); in instantiateLabel()
1316 …for( std::map< int, Node >::iterator itl = d_label_map[n][lbl].begin(); itl != d_label_map[n][lbl]… in instantiateLabel()
1323 Assert( d_label_map[n][lbl].find( 0 )!=d_label_map[n][lbl].end() ); in instantiateLabel()
1324 Node sub_lbl_0 = d_label_map[n][lbl][0]; in instantiateLabel()
1349 …for( std::map< int, Node >::iterator itl = d_label_map[n][lbl].begin(); itl != d_label_map[n][lbl]… in instantiateLabel()
[all …]
H A Dtheory_sep.h257 std::map< Node, std::map< Node, std::map< int, Node > > > d_label_map; variable