389ef16b1b
* spot/kripke/kripkegraph.hh, spot/priv/bddalloc.hh, spot/priv/freelist.hh, spot/priv/satcommon.hh, spot/ta/taexplicit.cc spot/twa/bdddict.cc, spot/twa/twagraph.hh, spot/twaalgos/alternation.hh, spot/twaalgos/dtwasat.cc, spot/twaalgos/ltl2taa.cc, spot/twaalgos/stutter.cc, tests/core/ngraph.cc: Add default constructors, copy constructors, or remove useless destructors.
95 lines
2.9 KiB
C++
95 lines
2.9 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2008,2013,2018 Laboratoire de Recherche et
|
|
// Développement de l'Epita (LRDE).
|
|
// Copyright (C) 2004, 2006 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 <list>
|
|
#include <utility>
|
|
#include <iosfwd>
|
|
|
|
namespace spot
|
|
{
|
|
|
|
/// \ingroup misc_tools
|
|
/// \brief Manage list of free integers.
|
|
class free_list
|
|
{
|
|
public:
|
|
virtual ~free_list();
|
|
|
|
free_list()
|
|
{
|
|
}
|
|
|
|
free_list(const free_list& other)
|
|
: fl(other.fl)
|
|
{
|
|
}
|
|
|
|
free_list& operator=(const free_list& other)
|
|
{
|
|
fl = other.fl;
|
|
return *this;
|
|
}
|
|
|
|
/// \brief Find \a n consecutive integers.
|
|
///
|
|
/// Browse the list of free integers until \a n consecutive
|
|
/// integers are found. Extend the list (using extend()) otherwise.
|
|
/// \return the first integer of the range
|
|
int register_n(int n);
|
|
|
|
/// Release \a n consecutive integers starting at \a base.
|
|
void release_n(int base, int n);
|
|
|
|
/// Dump the list to \a os for debugging.
|
|
std::ostream& dump_free_list(std::ostream& os) const;
|
|
|
|
/// Extend the list by inserting a new pos-lenght pair.
|
|
void insert(int base, int n);
|
|
|
|
/// Remove \a n consecutive entries from the list, starting at \a base.
|
|
void remove(int base, int n = 0);
|
|
|
|
/// Return the number of free integers on the list.
|
|
int free_count() const;
|
|
|
|
protected:
|
|
|
|
/// Allocate \a n integer.
|
|
///
|
|
/// This function is called by register_n() when the free list is
|
|
/// empty or if \a n consecutive integers could not be found. It
|
|
/// should allocate more integers, possibly changing the list, and
|
|
/// return the first integer on a range of n consecutive integer
|
|
/// requested by the user.
|
|
virtual int extend(int n) = 0;
|
|
|
|
/// Such pairs describe \c second free integer starting at \c first.
|
|
typedef std::pair<int, int> pos_lenght_pair;
|
|
typedef std::list<pos_lenght_pair> free_list_type;
|
|
free_list_type fl; ///< Tracks unused BDD variables.
|
|
|
|
/// Remove \a n consecutive entries from the list, starting at \a base.
|
|
void remove(free_list_type::iterator i, int base, int n);
|
|
};
|
|
}
|