alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Fix make check in sanity.

Browse source 
* src/tgba/taa.cc, src/tgbaalgos/ltl2taa.cc: Fix style.
This commit is contained in:
Damien Lefortier 2009-10-17 13:47:59 +02:00
parent 84060b49e5
commit 9f47dde5a7
3 changed files with 13 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

6
ChangeLog
View file

@ -1,3 +1,9 @@
2009-10-17 Damien Lefortier <dam@lrde.epita.fr>
Fix make check in sanity.
* src/tgba/taa.cc, src/tgbaalgos/ltl2taa.cc: Fix style.
2009-10-16 Damien Lefortier <dam@lrde.epita.fr> 2009-10-16 Damien Lefortier <dam@lrde.epita.fr>
Minor fixes. Minor fixes.

6
src/tgba/taa.cc
View file

@ -156,7 +156,7 @@ namespace spot
state_set::const_iterator i1 = ss->begin(); state_set::const_iterator i1 = ss->begin();
sn_map::const_iterator i2; sn_map::const_iterator i2;
if (ss->size() == 0) if (ss->empty())
return std::string("{}"); return std::string("{}");
if (ss->size() == 1) if (ss->size() == 1)
{ {
@ -346,7 +346,7 @@ namespace spot
{ {
if (std::distance(its_[i], bounds_[i].second) > 1) if (std::distance(its_[i], bounds_[i].second) > 1)
{ {
its_[i]++; ++its_[i];
break; break;
} }
else else
@ -370,7 +370,7 @@ namespace spot
for (unsigned i = 0; i < its_.size(); ++i) for (unsigned i = 0; i < its_.size(); ++i)
if (its_[i] == bounds_[i].second) if (its_[i] == bounds_[i].second)
return true; return true;
return its_.size() == 0 ? true : false; return its_.empty() ? true : false;
} }
spot::state_set* spot::state_set*

8
src/tgbaalgos/ltl2taa.cc
View file

@ -108,7 +108,7 @@ namespace spot
switch (node->op()) switch (node->op())
{ {
case unop::X: case unop::X:
if (v.succ_.size() == 0) // Handle X(0) if (v.succ_.empty()) // Handle X(0)
return; return;
dst.push_back(v.init_); dst.push_back(v.init_);
res_->create_transition(init_, dst); res_->create_transition(init_, dst);
@ -197,7 +197,7 @@ namespace spot
for (unsigned n = 0; n < node->size(); ++n) for (unsigned n = 0; n < node->size(); ++n)
{ {
vs.push_back(recurse(node->nth(n))); vs.push_back(recurse(node->nth(n)));
if (vs[n].succ_.size() == 0) // Handle 0 if (vs[n].succ_.empty()) // Handle 0
ok = false; ok = false;
} }
@ -281,7 +281,7 @@ namespace spot
formula* f = constant::true_instance(); formula* f = constant::true_instance();
for (unsigned i = 0; i < vs.size(); ++i) for (unsigned i = 0; i < vs.size(); ++i)
{ {
if (vs[i].succ_.size() == 0) if (vs[i].succ_.empty())
continue; continue;
const succ_state& ss(vs[i].succ_[pos[i] - 1]); const succ_state& ss(vs[i].succ_[pos[i] - 1]);
std::copy(ss.first.begin(), ss.first.end(), ii(u, u.begin())); std::copy(ss.first.begin(), ss.first.end(), ii(u, u.begin()));
@ -292,7 +292,7 @@ namespace spot
for (int i = vs.size() - 1; i >= 0; --i) for (int i = vs.size() - 1; i >= 0; --i)
{ {
if (vs[i].succ_.size() == 0) if (vs[i].succ_.empty())
continue; continue;
if (pos[i] > 1 || (i == 0 && pos[0] == 1)) if (pos[i] > 1 || (i == 0 && pos[0] == 1))
{ {