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.

spot/twa/twa.cc

@@ -0,0 +1,120 @@
+// -*- coding: utf-8 -*-
+// Copyright (C) 2011, 2014, 2015 Laboratoire de Recherche et Developpement de
+// l'EPITA (LRDE).
+// Copyright (C) 2003, 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/>.
+
+#include <spot/twa/twa.hh>
+#include <spot/twa/twagraph.hh>
+#include <spot/twaalgos/gtec/gtec.hh>
+#include <spot/twaalgos/remfin.hh>
+#include <utility>
+
+namespace spot
+{
+  twa::twa(const bdd_dict_ptr& d)
+    : iter_cache_(nullptr),
+      dict_(d),
+      last_support_conditions_input_(nullptr)
+  {
+    props = 0U;
+    bddaps_ = bddtrue;
+  }
+
+  twa::~twa()
+  {
+    if (last_support_conditions_input_)
+      last_support_conditions_input_->destroy();
+    delete iter_cache_;
+    release_named_properties();
+  }
+
+  bdd
+  twa::support_conditions(const state* state) const
+  {
+    if (!last_support_conditions_input_
+	|| last_support_conditions_input_->compare(state) != 0)
+      {
+	last_support_conditions_output_ = compute_support_conditions(state);
+	if (last_support_conditions_input_)
+	  last_support_conditions_input_->destroy();
+	last_support_conditions_input_ = state->clone();
+      }
+    return last_support_conditions_output_;
+  }
+
+  state*
+  twa::project_state(const state* s,
+		      const const_twa_ptr& t) const
+  {
+    if (t.get() == this)
+      return s->clone();
+    return nullptr;
+  }
+
+  std::string
+  twa::transition_annotation(const twa_succ_iterator*) const
+  {
+    return "";
+  }
+
+  bool
+  twa::is_empty() const
+  {
+    // FIXME: This should be improved based on properties of the
+    // automaton.  For instance we do not need couvreur99 is we know
+    // the automaton is weak.
+    auto a = shared_from_this();
+    if (a->acc().uses_fin_acceptance())
+      {
+	auto aa = std::dynamic_pointer_cast<const twa_graph>(a);
+	if (!aa)
+	  aa = make_twa_graph(a, prop_set::all());
+	a = remove_fin(aa);
+      }
+    return !couvreur99(a)->check();
+  }
+
+  void
+  twa::set_named_prop(std::string s,
+		      void* val, std::function<void(void*)> destructor)
+  {
+    auto p = named_prop_.emplace(std::piecewise_construct,
+				 std::forward_as_tuple(s),
+				 std::forward_as_tuple(val, destructor));
+    if (!p.second)
+      {
+	p.first->second.second(p.first->second.first);
+	p.first->second = std::make_pair(val, destructor);
+      }
+  }
+
+  void*
+  twa::get_named_prop_(std::string s) const
+  {
+    auto i = named_prop_.find(s);
+    if (i == named_prop_.end())
+      return nullptr;
+    return i->second.first;
+  }
+
+
+
+
+}