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

Fix errors reported by clang++-2.9.

Browse source 
* 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:
Alexandre Duret-Lutz 2011-08-28 10:35:36 +02:00
parent 92ef9d6e07
commit 101b18b24b
7 changed files with 28 additions and 46 deletions
Download patch file Download diff file Expand all files Collapse all files

17
src/tgbaalgos/reductgba_sim.cc
View file

@ -267,16 +267,6 @@ namespace spot
///////////////////////////////////////////////////////////////////////
// parity_game_graph
void
parity_game_graph::start()
{
}
void
parity_game_graph::end()
{
}
void
parity_game_graph::process_state(const state* s,
int,
@ -285,13 +275,6 @@ namespace spot
tgba_state_.push_back(s);
}
void
parity_game_graph::process_link(int,
int,
const tgba_succ_iterator*)
{
}
void
parity_game_graph::print(std::ostream& os)
{

7
src/tgbaalgos/reductgba_sim.hh
View file

@ -1,5 +1,5 @@
// Copyright (C) 2009, 2010 Laboratoire de Recherche et Développement
// de l'Epita (LRDE).
// Copyright (C) 2009, 2010, 2011 Laboratoire de Recherche et
// Développement de l'Epita (LRDE).
// Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
// et Marie Curie.
@ -116,10 +116,7 @@ namespace spot
s_v tgba_state_;
int nb_node_parity_game;
void start();
void end();
void process_state(const state* s, int n, tgba_succ_iterator* si);
void process_link(int in, int out, const tgba_succ_iterator* si);
/// \brief Compute each node of the graph.
virtual void build_graph() = 0;