graph: rename num_transitions() as num_edges()
And in fact, rename most "trans*" as "edges*", because that what they really are. * src/bin/autfilt.cc, src/bin/ltlcross.cc, src/bin/randaut.cc, src/dstarparse/dra2ba.cc, src/dstarparse/dstarparse.yy, src/dstarparse/nra2nba.cc, src/dstarparse/nsa2tgba.cc, src/graph/graph.hh, src/graph/ngraph.hh, src/ltlvisit/exclusive.cc, src/parseaut/parseaut.yy, src/tests/complementation.cc, src/tests/graph.cc, src/tests/ltl2tgba.cc, src/tests/ngraph.cc, src/tests/twagraph.cc, src/twa/twagraph.cc, src/twa/twagraph.hh, src/twa/twamask.hh, src/twaalgos/are_isomorphic.cc, src/twaalgos/are_isomorphic.hh, src/twaalgos/canonicalize.cc, src/twaalgos/cleanacc.cc, src/twaalgos/complete.cc, src/twaalgos/compsusp.cc, src/twaalgos/cycles.cc, src/twaalgos/degen.cc, src/twaalgos/dot.cc, src/twaalgos/dtbasat.cc, src/twaalgos/dtgbacomp.cc, src/twaalgos/dtgbasat.cc, src/twaalgos/dupexp.cc, src/twaalgos/emptiness.cc, src/twaalgos/isunamb.cc, src/twaalgos/isweakscc.cc, src/twaalgos/ltl2tgba_fm.cc, src/twaalgos/mask.hh, src/twaalgos/minimize.cc, src/twaalgos/postproc.cc, src/twaalgos/powerset.cc, src/twaalgos/product.cc, src/twaalgos/randomgraph.cc, src/twaalgos/randomize.cc, src/twaalgos/randomize.hh, src/twaalgos/relabel.cc, src/twaalgos/remfin.cc, src/twaalgos/safety.cc, src/twaalgos/sbacc.cc, src/twaalgos/sccfilter.cc, src/twaalgos/sepsets.cc, src/twaalgos/simulation.cc, src/twaalgos/stutter.cc, src/twaalgos/totgba.cc: Rename these.
This commit is contained in:
parent
a1ba0a89c5
commit
af8634d8c4
53 changed files with 685 additions and 693 deletions
|
|
@ -1,5 +1,5 @@
|
|||
// -*- coding: utf-8 -*-
|
||||
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
|
||||
// Copyright (C) 2013, 2014, 2015 Laboratoire de Recherche et Développement
|
||||
// de l'Epita (LRDE).
|
||||
//
|
||||
// This file is part of Spot, a model checking library.
|
||||
|
|
@ -247,12 +247,12 @@ namespace spot
|
|||
unsigned in_scc = sm_.scc_of_state(sin);
|
||||
|
||||
bdd cond = si->current_condition();
|
||||
unsigned t = out_->new_transition(in, out, cond);
|
||||
unsigned t = out_->new_edge(in, out, cond);
|
||||
|
||||
if (realizable_[in_scc])
|
||||
{
|
||||
if (final_.find(sin) != final_.end())
|
||||
out_->trans_data(t).acc = acc_;
|
||||
out_->edge_data(t).acc = acc_;
|
||||
}
|
||||
else if (sm_.scc_of_state(sout) == in_scc)
|
||||
{
|
||||
|
|
@ -278,12 +278,11 @@ namespace spot
|
|||
// implementation create more transitions than needed:
|
||||
// we do not need more than one transition per
|
||||
// accepting cycle.
|
||||
out_->new_transition(in, out + shift, cond);
|
||||
out_->new_edge(in, out + shift, cond);
|
||||
|
||||
// Acceptance transitions are those in the Li
|
||||
// set. (Löding's Fi set.)
|
||||
out_->new_acc_transition(in + shift, out + shift, cond,
|
||||
l.get(i));
|
||||
out_->new_acc_edge(in + shift, out + shift, cond, l.get(i));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -275,7 +275,7 @@ states:
|
|||
{
|
||||
for (map_t::const_iterator i = result.dest_map.begin();
|
||||
i != result.dest_map.end(); ++i)
|
||||
result.d->aut->new_transition(result.cur_state, i->first, i->second);
|
||||
result.d->aut->new_edge(result.cur_state, i->first, i->second);
|
||||
}
|
||||
%%
|
||||
|
||||
|
|
|
|||
|
|
@ -70,7 +70,7 @@ namespace spot
|
|||
int out = d_->aut->state_number(sout);
|
||||
|
||||
bdd cond = si->current_condition();
|
||||
out_->new_transition(in, out, cond);
|
||||
out_->new_edge(in, out, cond);
|
||||
|
||||
// Create one clone of the automaton per accepting pair,
|
||||
// removing states from the Ui part of the (Li, Ui) pairs.
|
||||
|
|
@ -94,12 +94,11 @@ namespace spot
|
|||
// implementation create more transitions than needed:
|
||||
// we do not need more than one transition per
|
||||
// accepting cycle.
|
||||
out_->new_transition(in, out + shift, cond);
|
||||
out_->new_edge(in, out + shift, cond);
|
||||
|
||||
// A transition is accepting if it is in the Li
|
||||
// set. (Löding's Fi set.)
|
||||
out_->new_acc_transition(in + shift, out + shift, cond,
|
||||
l.get(i));
|
||||
out_->new_acc_edge(in + shift, out + shift, cond, l.get(i));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -155,7 +155,7 @@ namespace spot
|
|||
dest = dres.first->second = res->new_state();
|
||||
todo.push_back(d);
|
||||
}
|
||||
res->new_transition(src, dest, t.cond, acc);
|
||||
res->new_edge(src, dest, t.cond, acc);
|
||||
|
||||
// Jump to level ∅
|
||||
if (s.pend == 0)
|
||||
|
|
@ -175,7 +175,7 @@ namespace spot
|
|||
dest = dres.first->second = res->new_state();
|
||||
todo.push_back(d);
|
||||
}
|
||||
res->new_transition(src, dest, t.cond);
|
||||
res->new_edge(src, dest, t.cond);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue