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

Fix typos in doc, comments and messages

Browse source 
* bin/README, bin/common_conv.hh, bin/common_trans.cc,
    bin/ltlsynt.cc, bin/spot-x.cc, spot/gen/automata.hh,
    spot/graph/graph.hh, spot/ltsmin/ltsmin.hh,
    spot/ltsmin/spins_interface.hh, spot/ltsmin/spins_kripke.hh,
    spot/mc/bloemen.hh, spot/mc/bloemen_ec.hh, spot/mc/cndfs.hh,
    spot/mc/deadlock.hh, spot/mc/intersect.hh, spot/mc/lpar13.hh,
    spot/mc/mc_instanciator.hh, spot/misc/bareword.cc,
    spot/misc/fixpool.hh, spot/misc/formater.hh, spot/misc/minato.hh,
    spot/misc/satsolver.hh, spot/misc/timer.hh,
    spot/parseaut/public.hh, spot/priv/partitioned_relabel.cc,
    spot/priv/satcommon.hh, spot/ta/ta.hh, spot/ta/taexplicit.cc,
    spot/ta/taproduct.hh, spot/ta/tgta.hh, spot/taalgos/reachiter.hh,
    spot/taalgos/tgba2ta.hh, spot/tl/apcollect.cc,
    spot/tl/apcollect.hh, spot/tl/formula.cc, spot/tl/parse.hh,
    spot/tl/randomltl.hh, spot/tl/relabel.hh, spot/tl/simplify.cc,
    spot/twa/acc.hh, spot/twa/bddprint.hh, spot/twa/formula2bdd.cc,
    spot/twa/twa.hh, spot/twa/twagraph.cc, spot/twa/twagraph.hh,
    spot/twaalgos/aiger.cc, spot/twaalgos/aiger.hh,
    spot/twaalgos/alternation.hh,  spot/twaalgos/cleanacc.cc,
    spot/twaalgos/cobuchi.cc, spot/twaalgos/contains.cc,
    spot/twaalgos/couvreurnew.cc, spot/twaalgos/cycles.hh,
    spot/twaalgos/degen.cc, spot/twaalgos/degen.hh,
    spot/twaalgos/dot.hh, spot/twaalgos/dtbasat.cc,
    spot/twaalgos/dtwasat.cc, spot/twaalgos/dtwasat.hh,
    spot/twaalgos/dualize.cc, spot/twaalgos/emptiness.hh,
    spot/twaalgos/emptiness_stats.hh, spot/twaalgos/game.cc,
    spot/twaalgos/genem.hh, spot/twaalgos/hoa.hh,
    spot/twaalgos/langmap.hh, spot/twaalgos/ltl2tgba_fm.hh,
    spot/twaalgos/magic.cc, spot/twaalgos/magic.hh,
    spot/twaalgos/mask.hh, spot/twaalgos/mealy_machine.cc,
    spot/twaalgos/mealy_machine.hh,
    spot/twaalgos/minimize.hh, spot/twaalgos/parity.cc,
    spot/twaalgos/parity.hh, spot/twaalgos/postproc.cc,
    spot/twaalgos/product.hh, spot/twaalgos/reachiter.hh,
    spot/twaalgos/relabel.cc, spot/twaalgos/remfin.cc,
    spot/twaalgos/remfin.hh, spot/twaalgos/sccfilter.cc,
    spot/twaalgos/sccinfo.hh, spot/twaalgos/se05.cc,
    spot/twaalgos/se05.hh, spot/twaalgos/simulation.hh,
    spot/twaalgos/split.hh, spot/twaalgos/stats.hh,
    spot/twaalgos/synthesis.cc, spot/twaalgos/synthesis.hh,
    spot/twaalgos/tau03.hh, spot/twaalgos/tau03opt.hh,
    spot/twaalgos/toparity.hh, spot/twaalgos/totgba.hh,
    spot/twaalgos/translate.hh, spot/twaalgos/word.cc,
    spot/twaalgos/word.hh, spot/twaalgos/zlktree.cc,
    spot/twaalgos/zlktree.hh, spot/twacube/cube.hh,
    spot/twacube/twacube.hh, tests/core/cube.cc,
    tests/core/ltlsynt.test, tests/core/parity.cc,
    tests/core/safra.cc, tests/core/twagraph.cc: here
This commit is contained in:
Florian Renkin 2024-04-16 16:24:54 +02:00
parent 952e502480
commit 96ff2225e3
106 changed files with 228 additions and 228 deletions
Download patch file Download diff file Expand all files Collapse all files

2
spot/priv/partitioned_relabel.cc
View file

@ -88,7 +88,7 @@ bdd_partition::to_relabeling_map(twa_graph& for_me) const
bdd_partition
try_partition_me(const std::vector<bdd>& all_cond, unsigned max_letter)
{
// We create vector that will be succesively filled.
// We create vector that will be successively filled.
// Each entry corresponds to a "letter", of the partition
const size_t Norig = all_cond.size();

20
spot/priv/satcommon.hh
View file

@ -111,12 +111,12 @@ public:
unsigned size_nacc, unsigned size_path, bool state_based,
bool dtbasat);
/// \brief Compute min_t litteral as well as min_ta, min_p and max_p.
/// After this step, all litterals are known.
/// \brief Compute min_t literal as well as min_ta, min_p and max_p.
/// After this step, all literals are known.
void
declare_all_vars(int& min_t);
/// \brief Return the transition's litteral corresponding to parameters.
/// \brief Return the transition's literal corresponding to parameters.
inline int
get_t(unsigned src, unsigned cond, unsigned dst) const
{
@ -134,12 +134,12 @@ public:
return min_t_ + src * cd_mult_ + cond * size_dst_ + dst;
}
/// \brief Return the transition_acc's litteral corresponding to parameters.
/// \brief Return the transition_acc's literal corresponding to parameters.
/// If (state_based), all outgoing transitions use the same acceptance
/// variable. Therefore, for each combination (src, nacc) there is only one
/// litteral.
/// literal.
/// Note that with Büchi automata, there is only one nacc, thus, only one
/// litteral for each src.
/// literal for each src.
inline int
get_ta(unsigned src, unsigned cond, unsigned dst, unsigned nacc = 0) const
{
@ -162,7 +162,7 @@ public:
: min_ta_ + src * cdn_mult_ + cond * dn_mult_ + dst * size_nacc_ + nacc;
}
/// \brief Return the path's litteral corresponding to parameters.
/// \brief Return the path's literal corresponding to parameters.
inline int
get_p(unsigned path, unsigned src, unsigned dst) const
{
@ -181,9 +181,9 @@ public:
return min_p_ + path * sd_mult_ + src * size_dst_ + dst;
}
/// \brief Return the path's litteral corresponding to parameters.
/// \brief Return the path's literal corresponding to parameters.
/// Argument ref serves to say whether it is a candidate or a reference
/// litteral. false -> ref | true -> cand
/// literal. false -> ref | true -> cand
inline int
get_prc(unsigned path, unsigned src, unsigned dst, bool cand) const
{
@ -238,7 +238,7 @@ public:
int target_state_number, const twa_graph_ptr& res,
const satsolver& solver);
/// \brief Returns the number of distinct values containted in a vector.
/// \brief Returns the number of distinct values contained in a vector.
int
get_number_of_distinct_vals(std::vector<unsigned> v);
}