Use 'const formula*' instead of 'formula*' everywhere.
The distinction makes no sense since Spot 0.5, where we switched from mutable furmulae to immutable formulae. The difference between const_visitor and visitor made no sense either. They have been merged into one: visitor. * iface/dve2/dve2check.cc, iface/gspn/ltlgspn.cc, src/eltlparse/eltlparse.yy, src/eltlparse/public.hh, src/evtgbatest/ltl2evtgba.cc, src/kripkeparse/kripkeparse.yy, src/ltlast/atomic_prop.cc, src/ltlast/atomic_prop.hh, src/ltlast/automatop.cc, src/ltlast/automatop.hh, src/ltlast/binop.cc, src/ltlast/binop.hh, src/ltlast/bunop.cc, src/ltlast/bunop.hh, src/ltlast/constant.cc, src/ltlast/constant.hh, src/ltlast/formula.cc, src/ltlast/formula.hh, src/ltlast/formula_tree.cc, src/ltlast/formula_tree.hh, src/ltlast/multop.cc, src/ltlast/multop.hh, src/ltlast/predecl.hh, src/ltlast/refformula.cc, src/ltlast/refformula.hh, src/ltlast/unop.cc, src/ltlast/unop.hh, src/ltlast/visitor.hh, src/ltlenv/declenv.cc, src/ltlenv/declenv.hh, src/ltlenv/defaultenv.cc, src/ltlenv/defaultenv.hh, src/ltlenv/environment.hh, src/ltlparse/ltlfile.cc, src/ltlparse/ltlfile.hh, src/ltlparse/ltlparse.yy, src/ltlparse/public.hh, src/ltltest/consterm.cc, src/ltltest/equals.cc, src/ltltest/genltl.cc, src/ltltest/kind.cc, src/ltltest/length.cc, src/ltltest/randltl.cc, src/ltltest/readltl.cc, src/ltltest/reduc.cc, src/ltltest/syntimpl.cc, src/ltltest/tostring.cc, src/ltlvisit/apcollect.cc, src/ltlvisit/apcollect.hh, src/ltlvisit/clone.cc, src/ltlvisit/clone.hh, src/ltlvisit/contain.cc, src/ltlvisit/contain.hh, src/ltlvisit/dotty.cc, src/ltlvisit/length.cc, src/ltlvisit/lunabbrev.cc, src/ltlvisit/lunabbrev.hh, src/ltlvisit/mark.cc, src/ltlvisit/mark.hh, src/ltlvisit/nenoform.cc, src/ltlvisit/nenoform.hh, src/ltlvisit/postfix.cc, src/ltlvisit/postfix.hh, src/ltlvisit/randomltl.cc, src/ltlvisit/randomltl.hh, src/ltlvisit/reduce.cc, src/ltlvisit/reduce.hh, src/ltlvisit/simpfg.cc, src/ltlvisit/simpfg.hh, src/ltlvisit/simplify.cc, src/ltlvisit/simplify.hh, src/ltlvisit/snf.cc, src/ltlvisit/snf.hh, src/ltlvisit/tostring.cc, src/ltlvisit/tunabbrev.cc, src/ltlvisit/tunabbrev.hh, src/ltlvisit/wmunabbrev.cc, src/ltlvisit/wmunabbrev.hh, src/neverparse/neverclaimparse.yy, src/sabatest/sabacomplementtgba.cc, src/tgba/bdddict.cc, src/tgba/formula2bdd.cc, src/tgba/taatgba.cc, src/tgba/taatgba.hh, src/tgbaalgos/eltl2tgba_lacim.cc, src/tgbaalgos/ltl2taa.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/ltl2tgba_lacim.cc, src/tgbaalgos/minimize.cc, src/tgbaalgos/randomgraph.cc, src/tgbaparse/tgbaparse.yy, src/tgbatest/complementation.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltlprod.cc, src/tgbatest/mixprod.cc, src/tgbatest/randtgba.cc: Massive adjustment! * src/tgbatest/reductgba.cc: Delete.
This commit is contained in:
parent
0f0ada825a
commit
bf62d439c9
98 changed files with 1318 additions and 1535 deletions
|
|
@ -33,9 +33,9 @@ namespace spot
|
|||
{
|
||||
// Can't build it on startup, because it uses
|
||||
// constant::true_instance that may not have been built yet...
|
||||
formula* bunop::one_star_ = 0;
|
||||
const formula* bunop::one_star_ = 0;
|
||||
|
||||
bunop::bunop(type op, formula* child, unsigned min, unsigned max)
|
||||
bunop::bunop(type op, const formula* child, unsigned min, unsigned max)
|
||||
: ref_formula(BUnOp), op_(op), child_(child), min_(min), max_(max)
|
||||
{
|
||||
props = child->get_props();
|
||||
|
|
@ -95,13 +95,7 @@ namespace spot
|
|||
}
|
||||
|
||||
void
|
||||
bunop::accept(visitor& v)
|
||||
{
|
||||
v.visit(this);
|
||||
}
|
||||
|
||||
void
|
||||
bunop::accept(const_visitor& v) const
|
||||
bunop::accept(visitor& v) const
|
||||
{
|
||||
v.visit(this);
|
||||
}
|
||||
|
|
@ -112,12 +106,6 @@ namespace spot
|
|||
return child_;
|
||||
}
|
||||
|
||||
formula*
|
||||
bunop::child()
|
||||
{
|
||||
return child_;
|
||||
}
|
||||
|
||||
unsigned
|
||||
bunop::min() const
|
||||
{
|
||||
|
|
@ -187,8 +175,9 @@ namespace spot
|
|||
|
||||
bunop::map bunop::instances;
|
||||
|
||||
formula*
|
||||
bunop::instance(type op, formula* child, unsigned min, unsigned max)
|
||||
const formula*
|
||||
bunop::instance(type op, const formula* child,
|
||||
unsigned min, unsigned max)
|
||||
{
|
||||
assert(min <= max);
|
||||
|
||||
|
|
@ -225,9 +214,8 @@ namespace spot
|
|||
|
||||
// - Exp[*i..j][*min..max] = Exp[*i(min)..j(max)]
|
||||
// if i*(min+1)<=j(min)+1.
|
||||
if (child->kind() == BUnOp)
|
||||
if (const bunop* s = is_bunop(child))
|
||||
{
|
||||
bunop* s = static_cast<bunop*>(child);
|
||||
unsigned i = s->min();
|
||||
unsigned j = s->max();
|
||||
|
||||
|
|
@ -242,7 +230,7 @@ namespace spot
|
|||
// (Because i<=j, this entails that the other intervals also
|
||||
// overlap).
|
||||
|
||||
formula* exp = s->child();
|
||||
const formula* exp = s->child();
|
||||
if (j == unbounded)
|
||||
{
|
||||
min *= i;
|
||||
|
|
@ -283,25 +271,26 @@ namespace spot
|
|||
child->destroy();
|
||||
return i->second->clone();
|
||||
}
|
||||
bunop* ap = new bunop(op, child, min, max);
|
||||
instances[p] = ap;
|
||||
return static_cast<bunop*>(ap->clone());
|
||||
const bunop* res = instances[p] = new bunop(op, child, min, max);
|
||||
res->clone();
|
||||
return res;
|
||||
}
|
||||
|
||||
formula*
|
||||
bunop::sugar_goto(formula* b, unsigned min, unsigned max)
|
||||
const formula*
|
||||
bunop::sugar_goto(const formula* b, unsigned min, unsigned max)
|
||||
{
|
||||
assert(b->is_boolean());
|
||||
// b[->min..max] is implemented as ((!b)[*];b)[*min..max]
|
||||
formula* s = bunop::instance(bunop::Star,
|
||||
unop::instance(unop::Not, b->clone()));
|
||||
const formula* s =
|
||||
bunop::instance(bunop::Star,
|
||||
unop::instance(unop::Not, b->clone()));
|
||||
return bunop::instance(bunop::Star,
|
||||
multop::instance(multop::Concat, s, b),
|
||||
min, max);
|
||||
}
|
||||
|
||||
formula*
|
||||
bunop::sugar_equal(formula* b, unsigned min, unsigned max)
|
||||
const formula*
|
||||
bunop::sugar_equal(const formula* b, unsigned min, unsigned max)
|
||||
{
|
||||
assert(b->is_boolean());
|
||||
// b[=0..] = 1[*]
|
||||
|
|
@ -312,12 +301,13 @@ namespace spot
|
|||
}
|
||||
|
||||
// b[=min..max] is implemented as ((!b)[*];b)[*min..max];(!b)[*]
|
||||
formula* s = bunop::instance(bunop::Star,
|
||||
unop::instance(unop::Not, b->clone()));
|
||||
formula* t = bunop::instance(bunop::Star,
|
||||
multop::instance(multop::Concat,
|
||||
s->clone(), b),
|
||||
min, max);
|
||||
const formula* s =
|
||||
bunop::instance(bunop::Star,
|
||||
unop::instance(unop::Not, b->clone()));
|
||||
const formula* t =
|
||||
bunop::instance(bunop::Star,
|
||||
multop::instance(multop::Concat,
|
||||
s->clone(), b), min, max);
|
||||
return multop::instance(multop::Concat, t, s);
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue