* src/sanity/style.test: New file.

* src/sanity/Makefile.am (check-local): Run it.
* src/ltlvisit/nenoform.cc, src/ltlvisit/tostring.cc,
src/tgba/bdddict.cc, src/tgba/bddprint.cc, src/tgba/tgba.cc,
src/tgba/tgbaproduct.cc, src/tgbaalgos/lbtt.cc,
src/tgbaalgos/magic.cc, src/tgbaalgos/powerset.cc,
src/tgbaalgos/reachiter.cc, src/tgbaalgos/gtec/ce.cc,
src/tgbaalgos/gtec/gtec.cc, src/tgbatest/ltl2tgba.cc: Fix style
issues reported by style.test.

src/tgbaalgos/gtec/ce.cc

@@ -169,7 +169,7 @@ namespace spot
     // If by change or period already ends on the state we have
     // to reach back, we are done.
     if (from == to
-	&& ! period.empty())
+	&& !period.empty())
       return;
 
     // Records backlinks to parent state during the BFS.

src/tgbaalgos/gtec/gtec.cc

@@ -377,7 +377,7 @@ namespace spot
 	todo.push(pair_state_successors(succ.s, succ_queue()));
 	succ_queue& new_queue = todo.top().second;
 	tgba_succ_iterator* iter = ecs_->aut->succ_iter(succ.s);
-	for (iter->first(); ! iter->done(); iter->next())
+	for (iter->first(); !iter->done(); iter->next())
 	  new_queue.push_back(successor(iter->current_acceptance_conditions(),
 					iter->current_state()));
 	delete iter;

src/tgbaalgos/lbtt.cc

@@ -222,7 +222,7 @@ namespace spot
 	      g->get_init_state(), g, mmp, state_number, true);
     acceptance_cond_splitter acs(g->all_acceptance_conditions());
 
-    while(! todo.empty())
+    while (!todo.empty())
       {
 	state_acc_pair sap = *todo.begin();
 	todo.erase(todo.begin());

src/tgbaalgos/magic.cc

@@ -44,7 +44,7 @@ namespace spot
     if (x)
       delete x;
     // Release all iterators on the stack.
-    while (! stack.empty())
+    while (!stack.empty())
       {
 	delete stack.front().second;
 	stack.pop_front();
@@ -101,14 +101,14 @@ namespace spot
 
     assert(stack.size() == 1 + tstack.size());
 
-    while (! stack.empty())
+    while (!stack.empty())
       {
       recurse:
 	magic_search::state_iter_pair& p = stack.front();
 	tgba_succ_iterator* i = p.second;
 	const bool magic = p.first.m;
 
-	while (! i->done())
+	while (!i->done())
 	  {
 	    const state* s_prime = i->current_state();
 	    bdd c = i->current_condition();
@@ -120,7 +120,7 @@ namespace spot
 		assert(stack.size() == tstack.size());
 		return true;
 	      }
-	    if (! has(s_prime, magic))
+	    if (!has(s_prime, magic))
 	      {
 		push(s_prime, magic);
 		tstack.push_front(c);
@@ -133,9 +133,9 @@ namespace spot
 	delete i;
 	stack.pop_front();
 
-	if (! magic && a->state_is_accepting(s))
+	if (!magic && a->state_is_accepting(s))
 	  {
-	    if (! has(s, true))
+	    if (!has(s, true))
 	      {
 		if (x)
 		  delete x;
@@ -144,7 +144,7 @@ namespace spot
 		continue;
 	      }
 	  }
-	if (! stack.empty())
+	if (!stack.empty())
 	  tstack.pop_front();
       }
 

src/tgbaalgos/powerset.cc

@@ -55,7 +55,7 @@ namespace spot
 
     unsigned state_num = 1;
 
-    while (! todo.empty())
+    while (!todo.empty())
       {
 	power_state src = todo.front();
 	todo.pop_front();
@@ -78,7 +78,7 @@ namespace spot
 	    for (i = src.begin(); i != src.end(); ++i)
 	      {
 		tgba_succ_iterator *si = aut->succ_iter(*i);
-		for (si->first(); ! si->done(); si->next())
+		for (si->first(); !si->done(); si->next())
 		  if ((cond >> si->current_condition()) == bddtrue)
 		    {
 		      const state* s = si->current_state();

src/tgbaalgos/reachiter.cc

@@ -59,7 +59,7 @@ namespace spot
 	int tn = seen[t];
 	tgba_succ_iterator* si = automata_->succ_iter(t);
 	process_state(t, tn, si);
-	for (si->first(); ! si->done(); si->next())
+	for (si->first(); !si->done(); si->next())
 	  {
 	    const state* current = si->current_state();
 	    seen_map::const_iterator s = seen.find(current);