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

fix some typos

Browse source 
* spot/graph/graph.hh, spot/ltsmin/spins_kripke.hxx,
spot/mc/bloemen.hh, spot/mc/lpar13.hh, spot/twaalgos/determinize.cc:
Here.
This commit is contained in:
Alexandre Duret-Lutz 2022-10-11 13:28:15 +02:00
parent 583ca38d91
commit 9de5455552
5 changed files with 25 additions and 25 deletions
Download patch file Download diff file Expand all files Collapse all files

8
spot/graph/graph.hh
View file

@ -1295,10 +1295,10 @@ namespace spot
static std::vector<std::thread> tv;
SPOT_ASSERT(tv.empty());
tv.resize(nthreads);
// FIXME: Due to the way these thread advence into the sate
// vectors, they access very close memory location. It
// would seems more cache friendly to have thread work on
// blocks of continuous states.
// FIXME: Due to the way these thread advance into the state
// vector, they access very close memory location. It would
// seems more cache friendly to have threads work on blocks
// of continuous states.
for (unsigned id = 0; id < nthreads; ++id)
tv[id] = std::thread(
[bne, id, ns, &idx_list, p, nthreads]()

12
spot/ltsmin/spins_kripke.hxx
View file

@ -1,6 +1,6 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2017, 2018, 2020 Laboratoire de Recherche et Développement de
// l'Epita (LRDE)
// Copyright (C) 2017, 2018, 2020, 2022 Laboratoire de Recherche et
// Développement de l'Epita (LRDE)
//
// This file is part of Spot, a model checking library.
//
@ -400,10 +400,10 @@ namespace spot
}
}
// FIXME I think we only need visbles aps, i.e. if the system has
// following variables, i.e. P_0.var1 and P_0.var2 but the property
// automaton only mention P_0.var2, we do not need to capture (in
// the resulting cube) any atomic proposition for P_0.var1
// FIXME: I think we only need visible aps. E.g., if the system has
// variables P_0.var1 and P_0.var2 but the property automaton only
// mentions P_0.var2, we do not need to capture (in the resulting
// cube) any atomic proposition for P_0.var1
void
kripkecube<cspins_state,
cspins_iterator>::match_aps(std::vector<std::string>& aps,

4
spot/mc/bloemen.hh
View file

@ -1,5 +1,5 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2015, 2016, 2017, 2018, 2019, 2020 Laboratoire de Recherche et
// Copyright (C) 2015-2020, 2022 Laboratoire de Recherche et
// Developpement de l'Epita
//
// This file is part of Spot, a model checking library.
@ -127,7 +127,7 @@ namespace spot
bool b = it.isnew();
// Insertion failed, delete element
// FIXME Should we add a local cache to avoid useless allocations?
// FIXME: Should we add a local cache to avoid useless allocations?
if (!b)
p_.deallocate(v);
else

16
spot/mc/lpar13.hh
View file

@ -1,5 +1,5 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2015-2016, 2018-2021 Laboratoire de Recherche et
// Copyright (C) 2015-2016, 2018-, 20222022 Laboratoire de Recherche et
// Developpement de l'Epita
//
// This file is part of Spot, a model checking library.
@ -32,9 +32,9 @@ namespace spot
{
/// \brief This class implements the sequential emptiness check as
/// presented in "Three SCC-based Emptiness Checks for Generalized
/// B\¨uchi Automata" (Renault et al, LPAR 2013). Among the three
/// emptiness check that has been proposed we opted to implement
/// the Gabow's one.
/// Büchi Automata" (Renault et al, LPAR 2013). Among the three
/// emptiness checks that have been proposed, we opted to implement
/// yGabow's one.
template<typename State, typename SuccIterator,
typename StateHash, typename StateEqual>
class SPOT_API lpar13
@ -62,8 +62,8 @@ namespace spot
size_t
operator()(const product_state that) const noexcept
{
// FIXME! wang32_hash(that.st_prop) could have
// been pre-calculated!
// FIXME: wang32_hash(that.st_prop) could have been
// pre-calculated!
StateHash hasher;
return wang32_hash(that.st_prop) ^ hasher(that.st_kripke);
}
@ -135,7 +135,7 @@ namespace spot
map[newtop])))
{
sys_.recycle(todo.back().it_kripke, tid_);
// FIXME a local storage for twacube iterator?
// FIXME: a local storage for twacube iterator?
todo.pop_back();
if (SPOT_UNLIKELY(found_))
{
@ -346,7 +346,7 @@ namespace spot
ctrx_element* current = front;
while (current != nullptr)
{
// FIXME also display acc?
// FIXME: also display acc?
res = res + " " +
std::to_string(current->prod_st->st_prop) +
+ "*" +

10
spot/twaalgos/determinize.cc
View file

@ -1,5 +1,5 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2015-2021 Laboratoire de Recherche et
// Copyright (C) 2015-2022 Laboratoire de Recherche et
// Développement de l'Epita.
//
// This file is part of Spot, a model checking library.
@ -476,7 +476,7 @@ namespace spot
std::vector<int> tmp;
while (brace >= 0)
{
// FIXME is not there a smarter way?
// FIXME: is there a smarter way?
tmp.insert(tmp.begin(), brace);
brace = s.braces_[brace];
}
@ -781,7 +781,7 @@ namespace spot
bool
safra_state::operator<(const safra_state& other) const
{
// FIXME what is the right, if any, comparison to perform?
// FIXME: what is the right, if any, comparison to perform?
return braces_ == other.braces_ ? nodes_ < other.nodes_
: braces_ < other.braces_;
}
@ -887,7 +887,7 @@ namespace spot
// NB spot::simulation() does not remove unreachable states, as it
// would invalidate the contents of 'implications'.
// so we need to explicitly test for unreachable states
// FIXME based on the scc_info, we could remove the unreachable
// FIXME: based on the scc_info, we could remove the unreachable
// states, both in the input automaton and in 'implications'
// to reduce the size of 'implies'.
if (!scc.reachable_state(i))
@ -922,7 +922,7 @@ namespace spot
std::vector<bdd> support(aut->num_states());
if (use_stutter && aut->prop_stutter_invariant())
{
// FIXME this could be improved
// FIXME: this could be improved
// supports of states should account for possible stuttering if we plan
// to use stuttering invariance
for (unsigned c = 0; c != scc.scc_count(); ++c)