* src/sanity/style.test: Suggest ++i over i++ when it does not
matter, for consistency. * src/tgbaalgos/tarjan_on_fly.cc, iface/gspn/ssp.cc, src/tgbaalgos/reductgba_sim_del.cc, src/tgbaalgos/reductgba_sim.cc, src/tgbaalgos/minimalce.cc, src/tgba/tgbareduc.cc: Adjust.
This commit is contained in:
parent
3780650ea0
commit
3f2cba6304
9 changed files with 38 additions and 30 deletions
|
|
@ -176,7 +176,7 @@ namespace spot
|
|||
|
||||
assert(!cycle.empty());
|
||||
is = cycle.end();
|
||||
is--;
|
||||
--is;
|
||||
id = cycle.begin();
|
||||
strs = automata_->format_state(is->first);
|
||||
strd = automata_->format_state(id->first);
|
||||
|
|
@ -647,7 +647,7 @@ namespace spot
|
|||
iter = a->succ_iter(s);
|
||||
iter->first();
|
||||
stack.push_front(state_pair(s, iter));
|
||||
depth_mode++;
|
||||
++depth_mode;
|
||||
}
|
||||
else
|
||||
s = stack.front().first;
|
||||
|
|
@ -722,7 +722,7 @@ namespace spot
|
|||
iter = a->succ_iter(s);
|
||||
iter->first();
|
||||
stack.push_front(state_pair(s, iter));
|
||||
depth_mode++;
|
||||
++depth_mode;
|
||||
goto recurse;
|
||||
}
|
||||
|
||||
|
|
@ -745,7 +745,7 @@ namespace spot
|
|||
iter = a->succ_iter(s);
|
||||
iter->first();
|
||||
stack.push_front(state_pair(s, iter));
|
||||
depth_mode++;
|
||||
++depth_mode;
|
||||
goto recurse;
|
||||
}
|
||||
|
||||
|
|
@ -772,7 +772,7 @@ namespace spot
|
|||
iter = a->succ_iter(s);
|
||||
iter->first();
|
||||
stack.push_front(state_pair(s, iter));
|
||||
depth_mode++;
|
||||
++depth_mode;
|
||||
goto recurse;
|
||||
}
|
||||
else
|
||||
|
|
@ -786,7 +786,7 @@ namespace spot
|
|||
|
||||
delete iter;
|
||||
|
||||
depth_mode--;
|
||||
--depth_mode;
|
||||
if (depth_mode_memory == depth_mode)
|
||||
{
|
||||
depth_mode_memory = -1;
|
||||
|
|
@ -945,7 +945,7 @@ namespace spot
|
|||
{
|
||||
//std::cout << os.str() << "save counter" << std::endl;
|
||||
|
||||
nb_found++;
|
||||
++nb_found;
|
||||
if (min_ce->empty())
|
||||
delete min_ce;
|
||||
|
||||
|
|
|
|||
|
|
@ -306,7 +306,7 @@ namespace spot
|
|||
i1 != spoiler_vertice_.end(); ++i1)
|
||||
{
|
||||
os << (*i1)->to_string(automata_);
|
||||
n++;
|
||||
++n;
|
||||
if (n > 20)
|
||||
{
|
||||
n = 0;
|
||||
|
|
@ -326,7 +326,7 @@ namespace spot
|
|||
i2 != duplicator_vertice_.end(); ++i2)
|
||||
{
|
||||
os << (*i2)->to_string(automata_);
|
||||
n++;
|
||||
++n;
|
||||
if (n > 20)
|
||||
{
|
||||
n = 0;
|
||||
|
|
@ -508,7 +508,7 @@ namespace spot
|
|||
si->current_acceptance_conditions()))
|
||||
{
|
||||
(*j)->add_succ(*i);
|
||||
nb_ds++;
|
||||
++nb_ds;
|
||||
}
|
||||
delete s;
|
||||
}
|
||||
|
|
@ -529,7 +529,7 @@ namespace spot
|
|||
si->current_acceptance_conditions()))
|
||||
{
|
||||
(*i)->add_succ(*j);
|
||||
nb_sd++;
|
||||
++nb_sd;
|
||||
}
|
||||
delete s;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -51,10 +51,10 @@ namespace spot
|
|||
: spoiler_node(d_node, s_node, num),
|
||||
acceptance_condition_visited_(a)
|
||||
{
|
||||
nb_spoiler++;
|
||||
++nb_spoiler;
|
||||
progress_measure_ = 0;
|
||||
if (acceptance_condition_visited_ != bddfalse)
|
||||
nb_spoiler_loose_++;
|
||||
++nb_spoiler_loose_;
|
||||
lead_2_acc_all_ = false;
|
||||
|
||||
seen_ = false;
|
||||
|
|
@ -62,8 +62,8 @@ namespace spot
|
|||
|
||||
spoiler_node_delayed::~spoiler_node_delayed()
|
||||
{
|
||||
if (acceptance_condition_visited_ != bddfalse)
|
||||
nb_spoiler_loose_--;
|
||||
if (acceptance_condition_visited_ != bddfalse)
|
||||
--nb_spoiler_loose_;
|
||||
}
|
||||
|
||||
bool
|
||||
|
|
@ -110,7 +110,7 @@ namespace spot
|
|||
// then we increment the progress measure of 1.
|
||||
if ((acceptance_condition_visited_ != bddfalse) &&
|
||||
(tmpmax < (nb_spoiler_loose_ + 1)))
|
||||
tmpmax++;
|
||||
++tmpmax;
|
||||
|
||||
change = (progress_measure_ < tmpmax);
|
||||
|
||||
|
|
@ -211,7 +211,7 @@ namespace spot
|
|||
int num)
|
||||
: duplicator_node(d_node, s_node, l, a, num)
|
||||
{
|
||||
nb_duplicator++;
|
||||
++nb_duplicator;
|
||||
progress_measure_ = 0;
|
||||
all_acc_cond |= a;
|
||||
lead_2_acc_all_ = false;
|
||||
|
|
@ -348,7 +348,7 @@ namespace spot
|
|||
{
|
||||
sub_set_acc_cond_.push_back(bdd_satone(all));
|
||||
all -= bdd_satone(all);
|
||||
count++;
|
||||
++count;
|
||||
}
|
||||
return count;
|
||||
}
|
||||
|
|
@ -369,7 +369,7 @@ namespace spot
|
|||
i2 != tgba_state_.end(); ++i2)
|
||||
{
|
||||
//std::cout << "add spoiler node" << std::endl;
|
||||
nb_spoiler++;
|
||||
++nb_spoiler;
|
||||
spoiler_node_delayed* n1
|
||||
= new spoiler_node_delayed(*i1, *i2,
|
||||
bddfalse,
|
||||
|
|
|
|||
|
|
@ -109,8 +109,7 @@ namespace spot
|
|||
void
|
||||
tarjan_on_fly::push(const state* s)
|
||||
{
|
||||
h[s] = top;
|
||||
top++;
|
||||
h[s] = top++;
|
||||
|
||||
struct_state ss = { s, 0, top, dftop, 0 };
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue