Fix errors reported by clang++-2.9.
* src/evtgbaalgos/tgba2evtgba.cc (process_link): Fix prototype to match tgba_reachable_iterator::process_link. * src/ltlvisit/tunabbrev.hh: Add using super::visit, so that the other visit() method are in scope when we overload one. * src/tgba/tgbareduc.hh, src/tgba/tgbareduc.cc (start, end, process_link): Remove these empty methods. The default implementations are empty too, and process_link had the wrong prototype. * src/tgbaalgos/reductgba_sim.hh, src/tgbaalgos/reductgba_sim.cc (start, end, process_link): Likewise.
This commit is contained in:
parent
92ef9d6e07
commit
101b18b24b
7 changed files with 28 additions and 46 deletions
|
|
@ -129,16 +129,6 @@ namespace spot
|
|||
////////////////////////////////////////////
|
||||
// for build tgba_reduc
|
||||
|
||||
void
|
||||
tgba_reduc::start()
|
||||
{
|
||||
}
|
||||
|
||||
void
|
||||
tgba_reduc::end()
|
||||
{
|
||||
}
|
||||
|
||||
void
|
||||
tgba_reduc::process_state(const spot::state* s, int, tgba_succ_iterator* si)
|
||||
{
|
||||
|
|
@ -158,11 +148,6 @@ namespace spot
|
|||
}
|
||||
}
|
||||
|
||||
void
|
||||
tgba_reduc::process_link(int, int, const tgba_succ_iterator*)
|
||||
{
|
||||
}
|
||||
|
||||
tgba_explicit::transition*
|
||||
tgba_reduc::create_transition(const spot::state* source,
|
||||
const spot::state* dest)
|
||||
|
|
|
|||
|
|
@ -1,4 +1,4 @@
|
|||
// Copyright (C) 2008, 2009, 2011 Laboratoire de Recherche et Développement
|
||||
// Copyright (C) 2008, 2009, 2011 Laboratoire de Recherche et Développement
|
||||
// de l'Epita (LRDE).
|
||||
// Copyright (C) 2004, 2005, 2006 Laboratoire d'Informatique de
|
||||
// Paris 6 (LIP6), département Systèmes Répartis Coopératifs (SRC),
|
||||
|
|
@ -81,10 +81,7 @@ namespace spot
|
|||
sp_map state_predecessor_map_;
|
||||
|
||||
// Interface of tgba_reachable_iterator_breadth_first
|
||||
void start();
|
||||
void end();
|
||||
void process_state(const spot::state* s, int n, tgba_succ_iterator* si);
|
||||
void process_link(int in, int out, const tgba_succ_iterator* si);
|
||||
|
||||
/// Create a transition using two state of a TGBA.
|
||||
transition* create_transition(const spot::state* source,
|
||||
|
|
@ -124,15 +121,15 @@ namespace spot
|
|||
/// this is explain in
|
||||
/// \verbatim
|
||||
/// @InProceedings{ etessami.00.concur,
|
||||
/// author = {Kousha Etessami and Gerard J. Holzmann},
|
||||
/// author = {Kousha Etessami and Gerard J. Holzmann},
|
||||
/// title = {Optimizing {B\"u}chi Automata},
|
||||
/// booktitle = {Proceedings of the 11th International Conference on
|
||||
/// Concurrency Theory (Concur'2000)},
|
||||
/// pages = {153--167},
|
||||
/// year = {2000},
|
||||
/// editor = {C. Palamidessi},
|
||||
/// volume = {1877},
|
||||
/// series = {Lecture Notes in Computer Science},
|
||||
/// editor = {C. Palamidessi},
|
||||
/// volume = {1877},
|
||||
/// series = {Lecture Notes in Computer Science},
|
||||
/// publisher = {Springer-Verlag}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue