a2cd1de267
numbered_state_heap_hash_map_factory): New class. * src/tgbaalgos/gtec/nsheap.cc (numbered_state_heap_hash_map_factory): Implement it. * src/tgbaalgos/gtec/gtec.hh (emptiness_check::emptiness_check, emptiness_check_shy::emptiness_check_shy): Take a numbered_state_heap_factory argument. * tgbaalgos/gtec/status.hh (emptiness_check_status::emptiness_check_status): Likewise. (emptiness_check_status::h): Make it a numbered_state_heap*. * src/tgbaalgos/gtec/ce.cc, tgbaalgos/gtec/gtec.cc, tgbaalgos/gtec/status.cc: Adjust uses of ecs_->h.
47 lines
1.4 KiB
C++
47 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.
|
|
|
|
#include "status.hh"
|
|
|
|
namespace spot
|
|
{
|
|
emptiness_check_status::emptiness_check_status
|
|
(const tgba* aut,
|
|
const numbered_state_heap_factory* nshf)
|
|
: aut(aut),
|
|
h(nshf->build())
|
|
{
|
|
}
|
|
|
|
emptiness_check_status::~emptiness_check_status()
|
|
{
|
|
delete h;
|
|
}
|
|
|
|
void
|
|
emptiness_check_status::print_stats(std::ostream& os) const
|
|
{
|
|
os << h->size() << " unique states visited" << std::endl;
|
|
os << root.size()
|
|
<< " strongly connected components in search stack"
|
|
<< std::endl;
|
|
}
|
|
}
|