Commit 4ecd066c authored by Clément Gillard's avatar Clément Gillard Committed by Alexandre Duret-Lutz
Browse files

Several typos

* 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.
parent 0c32f6b7
...@@ -354,7 +354,7 @@ Exporting symbols ...@@ -354,7 +354,7 @@ Exporting symbols
header. header.
* The directory src/priv/ can be used to store files that are * The directory src/priv/ can be used to store files that are
globaly private the library, and that do not really belongs to globaly private to the library, and that do not really belong to
other directories. other directories.
* Functions and classes that are public should be marked with * Functions and classes that are public should be marked with
......
...@@ -290,7 +290,7 @@ namespace spot ...@@ -290,7 +290,7 @@ namespace spot
tm_type tm; 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 typedef struct process_timer
{ {
void start() void start()
......
...@@ -429,7 +429,7 @@ namespace spot ...@@ -429,7 +429,7 @@ namespace spot
} sub; } sub;
}; };
/// \brief An acceptance formulas. /// \brief An acceptance formula.
/// ///
/// Acceptance formulas are stored as a vector of acc_word in a /// Acceptance formulas are stored as a vector of acc_word in a
/// kind of reverse polish notation. The motivation for this /// kind of reverse polish notation. The motivation for this
...@@ -1356,13 +1356,13 @@ namespace spot ...@@ -1356,13 +1356,13 @@ namespace spot
uses_fin_acceptance_ = check_fin_acceptance(); uses_fin_acceptance_ = check_fin_acceptance();
} }
/// \brief Retrieve teh acceptance formula /// \brief Retrieve the acceptance formula
const acc_code& get_acceptance() const const acc_code& get_acceptance() const
{ {
return code_; return code_;
} }
/// \brief Retrieve teh acceptance formula /// \brief Retrieve the acceptance formula
acc_code& get_acceptance() acc_code& get_acceptance()
{ {
return code_; return code_;
...@@ -1793,7 +1793,7 @@ namespace spot ...@@ -1793,7 +1793,7 @@ namespace spot
/// \brief Check potential acceptance of an SCC. /// \brief Check potential acceptance of an SCC.
/// ///
/// Assuming that an SCC intersects all sets in \a /// 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 /// there exist one marked transition in the SCC), and is
/// included in all sets in \a always_present (i.e., all /// included in all sets in \a always_present (i.e., all
/// transitions are marked with \a always_present), this returns /// transitions are marked with \a always_present), this returns
...@@ -1809,7 +1809,7 @@ namespace spot ...@@ -1809,7 +1809,7 @@ namespace spot
/// \brief Return an accepting subset of \a inf /// \brief Return an accepting subset of \a inf
/// ///
/// This function works only on Fin-less acceptance, and returns a /// 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 /// condition. This is typically used when an accepting SCC that
/// visits all sets in \a inf has been found, and we want to find /// 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 /// an accepting cycle: maybe it is not necessary for the accepting
......
...@@ -24,7 +24,7 @@ ...@@ -24,7 +24,7 @@
namespace spot namespace spot
{ {
/// \ingroup emptiness_check_algorithms /// \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 SPOT_API bool
generic_emptiness_check(const const_twa_graph_ptr& aut); generic_emptiness_check(const const_twa_graph_ptr& aut);
......
...@@ -185,7 +185,7 @@ namespace spot ...@@ -185,7 +185,7 @@ namespace spot
if (accept) if (accept)
one_acc_scc_ = num; one_acc_scc_ = num;
bool reject = triv || bool reject = triv ||
aut->acc().maybe_accepting(acc, common).is_false(); aut->acc().maybe_accepting(acc, common).is_false();
node_.back().rejecting_ = reject; node_.back().rejecting_ = reject;
root_.pop_back(); root_.pop_back();
} }
......
...@@ -364,7 +364,7 @@ namespace spot ...@@ -364,7 +364,7 @@ namespace spot
/// ///
/// Additionally this class can be used on alternating automata, but /// Additionally this class can be used on alternating automata, but
/// in this case, universal transitions are handled like existential /// 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 /// to the same SCC, but the acceptance information computed by
/// this class is meaningless. /// this class is meaningless.
class SPOT_API scc_info class SPOT_API scc_info
......
...@@ -206,11 +206,11 @@ ...@@ -206,11 +206,11 @@
spot.acc_code("(Fin(0) & Inf(1)) | (Fin(2) & Inf(3))") spot.acc_code("(Fin(0) & Inf(1)) | (Fin(2) & Inf(3))")
%% Cell type:markdown id: tags: %% Cell type:markdown id: tags:
The recognized names are the valide values for `acc-name:` in the [HOA format](http://adl.github.io/hoaf/). Additionally numbers may be replaced by ranges of the form `n..m`, in which case a random number is selected in that range. The recognized names are the valid values for `acc-name:` in the [HOA format](http://adl.github.io/hoaf/). Additionally, numbers may be replaced by ranges of the form `n..m`, in which case a random number is selected in that range.
%% Cell type:code id: tags: %% Cell type:code id: tags:
``` python ``` python
print(spot.acc_code('Streett 2..4')) print(spot.acc_code('Streett 2..4'))
......
...@@ -532,11 +532,11 @@ ...@@ -532,11 +532,11 @@
``` python ``` python
aut = spot.translate('(Ga -> Gb) W c') aut = spot.translate('(Ga -> Gb) W c')
si = spot.scc_info(aut) si = spot.scc_info(aut)
for scc in range(si.scc_count()): for scc in range(si.scc_count()):
print("SCC #{} containts states {}".format(scc, list(si.states_of(scc)))) print("SCC #{} contains states {}".format(scc, list(si.states_of(scc))))
display(aut) display(aut)
spot.decompose_scc(si, '0,2') spot.decompose_scc(si, '0,2')
``` ```
%%%% Output: display_data %%%% Output: display_data
......
...@@ -4,11 +4,11 @@ ...@@ -4,11 +4,11 @@
import spot import spot
import spot.ltsmin import spot.ltsmin
# The following line causes the notebook to exit with 77 if divine is not # The following line causes the notebook to exit with 77 if divine is not
# installed, therefore skipping this test in the test suite. # installed, therefore skipping this test in the test suite.
spot.ltsmin.require('divine') spot.ltsmin.require('divine')
# This is notebook also tests the limitation of the number of states in the GraphViz output # This notebook also tests the limitation of the number of states in the GraphViz output
spot.setup(max_states=10) spot.setup(max_states=10)
``` ```
%% Cell type:markdown id: tags: %% Cell type:markdown id: tags:
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment