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

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
header.
* 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.
* Functions and classes that are public should be marked with
......
......@@ -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()
......
......@@ -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
......
......@@ -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);
......
......@@ -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();
}
......
......@@ -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
......
......@@ -421,7 +421,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"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."
]
},
{
......
......@@ -5667,17 +5667,17 @@
},
{
"cell_type": "code",
"execution_count": 22,
"execution_count": 21,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"SCC #0 containts states [1]\n",
"SCC #1 containts states [2]\n",
"SCC #2 containts states [4]\n",
"SCC #3 containts states [0, 3]\n"
"SCC #0 contains states [1]\n",
"SCC #1 contains states [2]\n",
"SCC #2 contains states [4]\n",
"SCC #3 contains states [0, 3]\n"
]
},
{
......@@ -5986,7 +5986,7 @@
"<spot.impl.twa_graph; proxy of <Swig Object of type 'std::shared_ptr< spot::twa_graph > *' at 0x7fd3d860a240> >"
]
},
"execution_count": 22,
"execution_count": 21,
"metadata": {},
"output_type": "execute_result"
}
......@@ -5995,7 +5995,7 @@
"aut = spot.translate('(Ga -> Gb) W c')\n",
"si = spot.scc_info(aut)\n",
"for scc in range(si.scc_count()):\n",
" print(\"SCC #{} containts states {}\".format(scc, list(si.states_of(scc))))\n",
" print(\"SCC #{} contains states {}\".format(scc, list(si.states_of(scc))))\n",
"display(aut)\n",
"spot.decompose_scc(si, '0,2')"
]
......@@ -6009,7 +6009,7 @@
},
{
"cell_type": "code",
"execution_count": 23,
"execution_count": 22,
"metadata": {},
"outputs": [
{
......@@ -6089,7 +6089,7 @@
"<spot.impl.twa_graph; proxy of <Swig Object of type 'std::shared_ptr< spot::twa_graph > *' at 0x7fd3d850d8d0> >"
]
},
"execution_count": 23,
"execution_count": 22,
"metadata": {},
"output_type": "execute_result"
}
......@@ -6115,7 +6115,7 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.6.5+"
"version": "3.6.6+"
}
},
"nbformat": 4,
......
......@@ -11,7 +11,7 @@
"# The following line causes the notebook to exit with 77 if divine is not \n",
"# installed, therefore skipping this test in the test suite.\n",
"spot.ltsmin.require('divine')\n",
"# This is notebook also tests the limitation of the number of states in the GraphViz output\n",
"# This notebook also tests the limitation of the number of states in the GraphViz output\n",
"spot.setup(max_states=10)"
]
},
......
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