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/tl/contain.cc

@@ -0,0 +1,123 @@
+// -*- coding: utf-8 -*-
+// Copyright (C) 2009, 2010, 2011, 2012, 2014, 2015 Laboratoire de
+// Recherche et Développement de l'Epita (LRDE).
+// Copyright (C) 2006, 2007 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/tl/contain.hh>
+#include <spot/tl/simplify.hh>
+#include <spot/tl/formula.hh>
+#include <spot/twaalgos/product.hh>
+
+namespace spot
+{
+  language_containment_checker::language_containment_checker
+  (const bdd_dict_ptr& dict, bool exprop, bool symb_merge,
+   bool branching_postponement, bool fair_loop_approx)
+    : dict_(dict), exprop_(exprop), symb_merge_(symb_merge),
+      branching_postponement_(branching_postponement),
+      fair_loop_approx_(fair_loop_approx)
+  {
+  }
+
+  language_containment_checker::~language_containment_checker()
+  {
+    clear();
+  }
+
+  void
+  language_containment_checker::clear()
+  {
+    translated_.clear();
+  }
+
+  bool
+  language_containment_checker::incompatible_(record_* l, record_* g)
+  {
+    record_::incomp_map::const_iterator i = l->incompatible.find(g);
+    if (i != l->incompatible.end())
+      return i->second;
+
+    bool res = product(l->translation, g->translation)->is_empty();
+    l->incompatible[g] = res;
+    g->incompatible[l] = res;
+    return res;
+  }
+
+
+  // Check whether L(l) is a subset of L(g).
+  bool
+  language_containment_checker::contained(formula l,
+					  formula g)
+  {
+    if (l == g)
+      return true;
+    record_* rl = register_formula_(l);
+    record_* rng = register_formula_(formula::Not(g));
+    return incompatible_(rl, rng);
+  }
+
+  // Check whether L(!l) is a subset of L(g).
+  bool
+  language_containment_checker::neg_contained(formula l,
+					      formula g)
+  {
+    if (l == g)
+      return false;
+    formula nl = formula::Not(l);
+    record_* rnl = register_formula_(nl);
+    record_* rng = register_formula_(formula::Not(g));
+    if (nl == g)
+      return true;
+    return incompatible_(rnl, rng);
+  }
+
+  // Check whether L(l) is a subset of L(!g).
+  bool
+  language_containment_checker::contained_neg(formula l,
+					      formula g)
+  {
+    if (l == g)
+      return false;
+    record_* rl = register_formula_(l);
+    record_* rg = register_formula_(g);
+    return incompatible_(rl, rg);
+  }
+
+  // Check whether L(l) = L(g).
+  bool
+  language_containment_checker::equal(formula l, formula g)
+  {
+    return contained(l, g) && contained(g, l);
+  }
+
+  language_containment_checker::record_*
+  language_containment_checker::register_formula_(formula f)
+  {
+    trans_map::iterator i = translated_.find(f);
+    if (i != translated_.end())
+      return &i->second;
+
+    auto e = ltl_to_tgba_fm(f, dict_, exprop_, symb_merge_,
+			    branching_postponement_, fair_loop_approx_);
+    record_& r = translated_[f];
+    r.translation = e;
+    return &r;
+  }
+}