06b176991e
Fixes #125. * src/kripke/kripkegraph.hh, src/ta/ta.cc, src/ta/ta.hh, src/ta/taexplicit.cc, src/ta/taexplicit.hh, src/ta/taproduct.cc, src/ta/taproduct.hh, src/ta/tgtaproduct.cc, src/ta/tgtaproduct.hh, src/taalgos/dot.cc, src/taalgos/emptinessta.cc, src/taalgos/emptinessta.hh, src/taalgos/minimize.cc, src/taalgos/reachiter.cc, src/taalgos/tgba2ta.cc, src/twa/twa.hh, src/twa/twagraph.hh, src/twa/twaproduct.cc, src/twa/twaproduct.hh, src/twaalgos/compsusp.cc, src/twaalgos/gtec/gtec.cc, src/twaalgos/ltl2tgba_fm.cc, src/twaalgos/reachiter.cc, src/twaalgos/stutter.cc: Adjust.
77 lines
1.5 KiB
C++
77 lines
1.5 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2010, 2011, 2014 Laboratoire de Recherche et
|
|
// Developpement de l Epita (LRDE).
|
|
//
|
|
// 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/>.
|
|
|
|
|
|
#include "ta.hh"
|
|
|
|
namespace spot
|
|
{
|
|
|
|
|
|
scc_stack_ta::connected_component::connected_component(int i)
|
|
{
|
|
index = i;
|
|
is_accepting = false;
|
|
condition = 0U;
|
|
}
|
|
|
|
scc_stack_ta::connected_component&
|
|
scc_stack_ta::top()
|
|
{
|
|
return s.front();
|
|
}
|
|
|
|
const scc_stack_ta::connected_component&
|
|
scc_stack_ta::top() const
|
|
{
|
|
return s.front();
|
|
}
|
|
|
|
void
|
|
scc_stack_ta::pop()
|
|
{
|
|
// assert(rem().empty());
|
|
s.pop_front();
|
|
}
|
|
|
|
void
|
|
scc_stack_ta::push(int index)
|
|
{
|
|
s.emplace_front(index);
|
|
}
|
|
|
|
std::list<const state*>&
|
|
scc_stack_ta::rem()
|
|
{
|
|
return top().rem;
|
|
}
|
|
|
|
size_t
|
|
scc_stack_ta::size() const
|
|
{
|
|
return s.size();
|
|
}
|
|
|
|
bool
|
|
scc_stack_ta::empty() const
|
|
{
|
|
return s.empty();
|
|
}
|
|
|
|
}
|