rename src/ as spot/ and use include <spot/...>
* NEWS: Mention the change. * src/: Rename as ... * spot/: ... this, adjust all headers to include <spot/...> instead of "...", and adjust all Makefile.am to search headers from the top-level directory. * HACKING: Add conventions about #include. * spot/sanity/style.test: Add a few more grep to catch cases that do not follow these conventions. * .gitignore, Makefile.am, README, bench/stutter/Makefile.am, bench/stutter/stutter_invariance_formulas.cc, bench/stutter/stutter_invariance_randomgraph.cc, configure.ac, debian/rules, doc/Doxyfile.in, doc/Makefile.am, doc/org/.dir-locals.el.in, doc/org/g++wrap.in, doc/org/init.el.in, doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org, doc/org/tut10.org, doc/org/tut20.org, doc/org/tut21.org, doc/org/tut22.org, doc/org/tut30.org, iface/ltsmin/Makefile.am, iface/ltsmin/kripke.test, iface/ltsmin/ltsmin.cc, iface/ltsmin/ltsmin.hh, iface/ltsmin/modelcheck.cc, wrap/python/Makefile.am, wrap/python/ajax/spotcgi.in, wrap/python/spot_impl.i, wrap/python/tests/ltl2tgba.py, wrap/python/tests/randgen.py, wrap/python/tests/run.in: Adjust.
This commit is contained in:
Alexandre Duret-Lutz
parent
1fddfe60ec
commit
f120dd3206
529 changed files with 1308 additions and 1262 deletions
|
|
@ -1,273 +0,0 @@
|
|||
// -*- coding: utf-8 -*-
|
||||
// Copyright (C) 2015 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.
|
||||
//
|
||||
// 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 3 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <cassert>
|
||||
#include <map>
|
||||
#include "misc/ltstr.hh"
|
||||
|
||||
namespace spot
|
||||
{
|
||||
|
||||
/// \addtogroup emptiness_check_stats
|
||||
/// @{
|
||||
|
||||
struct unsigned_statistics
|
||||
{
|
||||
virtual
|
||||
~unsigned_statistics()
|
||||
{
|
||||
}
|
||||
|
||||
unsigned
|
||||
get(const char* str) const
|
||||
{
|
||||
auto i = stats.find(str);
|
||||
assert(i != stats.end());
|
||||
return (this->*i->second)();
|
||||
}
|
||||
|
||||
typedef unsigned (unsigned_statistics::*unsigned_fun)() const;
|
||||
typedef std::map<const char*, unsigned_fun, char_ptr_less_than> stats_map;
|
||||
stats_map stats;
|
||||
};
|
||||
|
||||
/// \brief comparable statistics
|
||||
///
|
||||
/// This must be built from a spot::unsigned_statistics. But unlike
|
||||
/// spot::unsigned_statistics, it supports equality and inequality tests.
|
||||
/// (It's the only operations it supports, BTW.)
|
||||
class unsigned_statistics_copy
|
||||
{
|
||||
public:
|
||||
unsigned_statistics_copy()
|
||||
: set(false)
|
||||
{
|
||||
}
|
||||
|
||||
unsigned_statistics_copy(const unsigned_statistics& o)
|
||||
: set(false)
|
||||
{
|
||||
seteq(o);
|
||||
}
|
||||
|
||||
bool
|
||||
seteq(const unsigned_statistics& o)
|
||||
{
|
||||
if (!set)
|
||||
{
|
||||
for (auto& i: o.stats)
|
||||
stats[i.first] = (o.*i.second)();
|
||||
set = true;
|
||||
return true;
|
||||
}
|
||||
if (*this == o)
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
|
||||
typedef std::map<const char*, unsigned, char_ptr_less_than> stats_map;
|
||||
stats_map stats;
|
||||
|
||||
|
||||
bool
|
||||
operator==(const unsigned_statistics_copy& o) const
|
||||
{
|
||||
for (auto& i: stats)
|
||||
{
|
||||
auto i2 = o.stats.find(i.first);
|
||||
if (i2 == o.stats.end())
|
||||
return false;
|
||||
if (i.second != i2->second)
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
bool
|
||||
operator!=(const unsigned_statistics_copy& o) const
|
||||
{
|
||||
return !(*this == o);
|
||||
}
|
||||
|
||||
bool set;
|
||||
};
|
||||
|
||||
/// \brief Emptiness-check statistics
|
||||
///
|
||||
/// Implementations of spot::emptiness_check may also implement
|
||||
/// this interface. Try to dynamic_cast the spot::emptiness_check
|
||||
/// pointer to know whether these statistics are available.
|
||||
class ec_statistics: public unsigned_statistics
|
||||
{
|
||||
public :
|
||||
ec_statistics()
|
||||
: states_(0), transitions_(0), depth_(0), max_depth_(0)
|
||||
{
|
||||
stats["states"] =
|
||||
static_cast<unsigned_statistics::unsigned_fun>(&ec_statistics::states);
|
||||
stats["transitions"] =
|
||||
static_cast<unsigned_statistics::unsigned_fun>
|
||||
(&ec_statistics::transitions);
|
||||
stats["max. depth"] =
|
||||
static_cast<unsigned_statistics::unsigned_fun>
|
||||
(&ec_statistics::max_depth);
|
||||
}
|
||||
|
||||
void
|
||||
set_states(unsigned n)
|
||||
{
|
||||
states_ = n;
|
||||
}
|
||||
|
||||
void
|
||||
inc_states()
|
||||
{
|
||||
++states_;
|
||||
}
|
||||
|
||||
void
|
||||
inc_transitions()
|
||||
{
|
||||
++transitions_;
|
||||
}
|
||||
|
||||
void
|
||||
inc_depth(unsigned n = 1)
|
||||
{
|
||||
depth_ += n;
|
||||
if (depth_ > max_depth_)
|
||||
max_depth_ = depth_;
|
||||
}
|
||||
|
||||
void
|
||||
dec_depth(unsigned n = 1)
|
||||
{
|
||||
assert(depth_ >= n);
|
||||
depth_ -= n;
|
||||
}
|
||||
|
||||
unsigned
|
||||
states() const
|
||||
{
|
||||
return states_;
|
||||
}
|
||||
|
||||
unsigned
|
||||
transitions() const
|
||||
{
|
||||
return transitions_;
|
||||
}
|
||||
|
||||
unsigned
|
||||
max_depth() const
|
||||
{
|
||||
return max_depth_;
|
||||
}
|
||||
|
||||
unsigned
|
||||
depth() const
|
||||
{
|
||||
return depth_;
|
||||
}
|
||||
|
||||
private :
|
||||
unsigned states_; /// number of disctint visited states
|
||||
unsigned transitions_; /// number of visited transitions
|
||||
unsigned depth_; /// maximal depth of the stack(s)
|
||||
unsigned max_depth_; /// maximal depth of the stack(s)
|
||||
};
|
||||
|
||||
/// \brief Accepting Run Search statistics.
|
||||
///
|
||||
/// Implementations of spot::emptiness_check_result may also implement
|
||||
/// this interface. Try to dynamic_cast the spot::emptiness_check_result
|
||||
/// pointer to know whether these statistics are available.
|
||||
class ars_statistics: public unsigned_statistics
|
||||
{
|
||||
public:
|
||||
ars_statistics()
|
||||
: prefix_states_(0), cycle_states_(0)
|
||||
{
|
||||
stats["(non unique) states for prefix"] =
|
||||
static_cast<unsigned_statistics::unsigned_fun>
|
||||
(&ars_statistics::ars_prefix_states);
|
||||
stats["(non unique) states for cycle"] =
|
||||
static_cast<unsigned_statistics::unsigned_fun>
|
||||
(&ars_statistics::ars_cycle_states);
|
||||
}
|
||||
|
||||
void
|
||||
inc_ars_prefix_states()
|
||||
{
|
||||
++prefix_states_;
|
||||
}
|
||||
|
||||
unsigned
|
||||
ars_prefix_states() const
|
||||
{
|
||||
return prefix_states_;
|
||||
}
|
||||
|
||||
void
|
||||
inc_ars_cycle_states()
|
||||
{
|
||||
++cycle_states_;
|
||||
}
|
||||
|
||||
unsigned
|
||||
ars_cycle_states() const
|
||||
{
|
||||
return cycle_states_;
|
||||
}
|
||||
|
||||
private:
|
||||
unsigned prefix_states_; /// states visited to construct the prefix
|
||||
unsigned cycle_states_; /// states visited to construct the cycle
|
||||
};
|
||||
|
||||
/// \brief Accepting Cycle Search Space statistics
|
||||
///
|
||||
/// Implementations of spot::emptiness_check_result may also implement
|
||||
/// this interface. Try to dynamic_cast the spot::emptiness_check_result
|
||||
/// pointer to know whether these statistics are available.
|
||||
class acss_statistics: public ars_statistics
|
||||
{
|
||||
public:
|
||||
acss_statistics()
|
||||
{
|
||||
stats["search space states"] =
|
||||
static_cast<unsigned_statistics::unsigned_fun>
|
||||
(&acss_statistics::acss_states);
|
||||
}
|
||||
|
||||
virtual
|
||||
~acss_statistics()
|
||||
{
|
||||
}
|
||||
|
||||
/// Number of states in the search space for the accepting cycle.
|
||||
virtual unsigned acss_states() const = 0;
|
||||
};
|
||||
/// @}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue