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

Several typos

Browse source 
* HACKING: Missing "to", extraneous 's'.
* spot/misc/timer.hh: Extraneous space.
* spot/twa/acc.hh: Extraneous 's', typos.
* spot/twaalgos/genem.hh: Typo.
* spot/twaalgos/sccinfo.cc: Fix indentation.
* spot/twaalgos/sccinfo.hh: Missing 's'.
* tests/python/acc_cond.ipynb: Extraneous 'e', missing comma.
* tests/python/decompose.ipynb: Extraneous 't'.
* tests/python/ltsmin-dve.ipynb: Extraneous verb.
This commit is contained in:
Clément Gillard 2018-12-30 16:53:39 +01:00 • committed by Alexandre Duret-Lutz
parent 0c32f6b7ae
commit 4ecd066c0e
9 changed files with 22 additions and 22 deletions
Download patch file Download diff file Expand all files Collapse all files

2
spot/misc/timer.hh
View file

@ -290,7 +290,7 @@ namespace spot
tm_type tm;
};
/// \brief Struct used to start and stop both timer and stopwatch clocks.
/// \brief Struct used to start and stop both timer and stopwatch clocks.
typedef struct process_timer
{
void start()

10
spot/twa/acc.hh
View file

@ -429,7 +429,7 @@ namespace spot
} sub;
};
/// \brief An acceptance formulas.
/// \brief An acceptance formula.
///
/// Acceptance formulas are stored as a vector of acc_word in a
/// kind of reverse polish notation. The motivation for this
@ -1356,13 +1356,13 @@ namespace spot
uses_fin_acceptance_ = check_fin_acceptance();
}
/// \brief Retrieve teh acceptance formula
/// \brief Retrieve the acceptance formula
const acc_code& get_acceptance() const
{
return code_;
}
/// \brief Retrieve teh acceptance formula
/// \brief Retrieve the acceptance formula
acc_code& get_acceptance()
{
return code_;
@ -1793,7 +1793,7 @@ namespace spot
/// \brief Check potential acceptance of an SCC.
///
/// Assuming that an SCC intersects all sets in \a
/// infinitely_often (i.e., for each set in \a infinetely_often,
/// infinitely_often (i.e., for each set in \a infinitely_often,
/// there exist one marked transition in the SCC), and is
/// included in all sets in \a always_present (i.e., all
/// transitions are marked with \a always_present), this returns
@ -1809,7 +1809,7 @@ namespace spot
/// \brief Return an accepting subset of \a inf
///
/// This function works only on Fin-less acceptance, and returns a
/// subset of \a inf that is enough to satisfies the acceptance
/// subset of \a inf that is enough to satisfy the acceptance
/// condition. This is typically used when an accepting SCC that
/// visits all sets in \a inf has been found, and we want to find
/// an accepting cycle: maybe it is not necessary for the accepting

2
spot/twaalgos/genem.hh
View file

@ -24,7 +24,7 @@
namespace spot
{
/// \ingroup emptiness_check_algorithms
/// \brief Emptiness check of on automaton, for any acceptance condition.
/// \brief Emptiness check of an automaton, for any acceptance condition.
SPOT_API bool
generic_emptiness_check(const const_twa_graph_ptr& aut);

2
spot/twaalgos/sccinfo.cc
View file

@ -185,7 +185,7 @@ namespace spot
if (accept)
one_acc_scc_ = num;
bool reject = triv ||
aut->acc().maybe_accepting(acc, common).is_false();
aut->acc().maybe_accepting(acc, common).is_false();
node_.back().rejecting_ = reject;
root_.pop_back();
}

2
spot/twaalgos/sccinfo.hh
View file

@ -364,7 +364,7 @@ namespace spot
///
/// Additionally this class can be used on alternating automata, but
/// in this case, universal transitions are handled like existential
/// transitions. It still make sense to check which states belong
/// transitions. It still makes sense to check which states belong
/// to the same SCC, but the acceptance information computed by
/// this class is meaningless.
class SPOT_API scc_info