Reuse s->second to avoid a hash lookup. * src/tgbaalgos/save.cc (save_bfs::process_state): Delete dest.
37 lines
1.4 KiB
C++
37 lines
1.4 KiB
C++
// Copyright (C) 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// et Marie Curie.
|
|
//
|
|
// This file is part of Spot, a model checking library.
|
|
//
|
|
// Spot is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Spot is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
// License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Spot; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
// 02111-1307, USA.
|
|
|
|
#ifndef SPOT_TGBAALGOS_POWERSET_HH
|
|
# define SPOT_TGBAALGOS_POWERSET_HH
|
|
|
|
# include "tgba/tgbaexplicit.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \brief Build a deterministic automaton, ignoring acceptance conditions.
|
|
///
|
|
/// This create a deterministic automaton that recognize the
|
|
/// same language as \a aut would if its acceptance conditions
|
|
/// were ignored. This is the classical powerset algorithm.
|
|
tgba_explicit* tgba_powerset(const tgba* aut);
|
|
}
|
|
|
|
#endif // SPOT_TGBAALGOS_POWERSET_HH
|