@@ -494,7 +494,7 @@ void inline fence_insertert::mip_fill_matrix(
494
494
e_c_it!=e_i->end ();
495
495
++e_c_it)
496
496
{
497
- std::set<event_idt > pt_set;
497
+ std::set<unsigned > pt_set;
498
498
assert (map_to_e.find (*e_c_it)!=map_to_e.end ());
499
499
const_graph_visitor.PT (map_to_e.find (*e_c_it)->second , pt_set);
500
500
/* sum_e' f_e' */
@@ -538,7 +538,7 @@ void inline fence_insertert::mip_fill_matrix(
538
538
e_nc_it!=e_i->end ();
539
539
++e_nc_it)
540
540
{
541
- std::set<event_idt > pt_set;
541
+ std::set<unsigned > pt_set;
542
542
assert (map_to_e.find (*e_nc_it)!=map_to_e.end ());
543
543
const_graph_visitor.PT (map_to_e.find (*e_nc_it)->second , pt_set);
544
544
/* sum_e' (f_e' + lwf_e') */
@@ -582,7 +582,7 @@ void inline fence_insertert::mip_fill_matrix(
582
582
e_nc_it!=e_i->end ();
583
583
++e_nc_it)
584
584
{
585
- std::set<event_idt > pt_set;
585
+ std::set<unsigned > pt_set;
586
586
assert (map_to_e.find (*e_nc_it)!=map_to_e.end ());
587
587
const_graph_visitor.PT (map_to_e.find (*e_nc_it)->second , pt_set);
588
588
/* dp_e + sum_e' (f_e' + lwf_e' + br_e') */
@@ -649,12 +649,12 @@ void inline fence_insertert::mip_fill_matrix(
649
649
e_nc_it!=e_i->end ();
650
650
++e_nc_it)
651
651
{
652
- std::set<event_idt > pt_set;
652
+ std::set<unsigned > pt_set;
653
653
assert (map_to_e.find (*e_nc_it)!=map_to_e.end ());
654
654
const_graph_visitor.PT (map_to_e.find (*e_nc_it)->second , pt_set);
655
655
// uncomment for cf
656
656
#if 0
657
- std::set<event_idt > it_set;
657
+ std::set<unsigned > it_set;
658
658
IT(map_to_e.find(*e_nc_it)->second, it_set);
659
659
#endif
660
660
/* dp_e + sum_e' (f_e' + lwf_e') + sum_e'' cf_e'') */
@@ -722,13 +722,13 @@ void inline fence_insertert::mip_fill_matrix(
722
722
{
723
723
unsigned possibilities_met=0 ;
724
724
725
- std::set<event_idt > ct_set;
725
+ std::set<unsigned > ct_set;
726
726
assert (invisible_var.map_to_e .find (*e_c_it)!=
727
727
invisible_var.map_to_e .end ());
728
728
const_graph_visitor.CT (invisible_var.map_to_e .find (*e_c_it)->second ,
729
729
ct_set);
730
730
731
- std::set<event_idt > ct_not_powr_set;
731
+ std::set<unsigned > ct_not_powr_set;
732
732
const_graph_visitor.CT_not_powr (invisible_var.map_to_e .find (
733
733
*e_c_it)->second , ct_not_powr_set);
734
734
@@ -801,7 +801,7 @@ void fence_insertert::solve()
801
801
assert (i-1 ==constraints_number);
802
802
803
803
const std::size_t const_constraints_number=constraints_number;
804
- const event_idt const_unique=unique;
804
+ const unsigned const_unique=unique;
805
805
806
806
const std::size_t mat_size=
807
807
// NOLINTNEXTLINE(whitespace/operators)
@@ -1234,13 +1234,13 @@ void fence_insertert::print_vars() const
1234
1234
{
1235
1235
instrumenter.message .statistics ()
1236
1236
<< " ---- pos/pos+ (visible) variables ----" << messaget::eom;
1237
- for (std::map<edget, event_idt >::const_iterator it=map_from_e.begin ();
1237
+ for (std::map<edget, unsigned >::const_iterator it=map_from_e.begin ();
1238
1238
it!=map_from_e.end (); ++it)
1239
1239
instrumenter.message .statistics () << it->first .first << " ,"
1240
1240
<< it->first .second << messaget::eom;
1241
1241
instrumenter.message .statistics () << " ---- cmp (invisible) variables ----"
1242
1242
<< messaget::eom;
1243
- for (std::map<edget, event_idt >::const_iterator it=
1243
+ for (std::map<edget, unsigned >::const_iterator it=
1244
1244
invisible_var.map_from_e .begin ();
1245
1245
it!=invisible_var.map_from_e .end (); ++it)
1246
1246
instrumenter.message .statistics () << it->first .first << " ,"
0 commit comments