Update to compile with the Intel compiler.

src/ltlvisit/syntimpl.cc

@@ -301,16 +301,6 @@ namespace spot
 	    }
 	}
 
-	bool
-	recurse(const formula* f1, const formula* f2)
-	{
-	  if (f1 == f2)
-	    return true;
-	  inf_right_recurse_visitor v(f2);
-	  const_cast<formula*>(f1)->accept(v);
-	  return v.result();
-	}
-
       protected:
 	bool result_; /* true if f < f1, false otherwise. */
 	const formula* f;

src/misc/optionmap.cc

@@ -157,4 +157,4 @@ namespace spot
       os << "\"" << it->first << "\" = " << it->second << std::endl;
     return os;
   }
-};
+}

src/misc/optionmap.hh

@@ -82,6 +82,6 @@ namespace spot
   private:
     std::map<std::string, int> options_;
   };
-};
+}
 
 #endif // SPOT_MISC_OPTIONMAP_HH

src/tgba/tgbabddconcreteproduct.cc

@@ -56,12 +56,6 @@ namespace spot
 	return data_;
       }
 
-      bdd_dict*
-      get_dict() const
-      {
-	return dict_;
-      }
-
       bdd
       get_init_state() const
       {

src/tgbaalgos/emptiness.cc

@@ -50,13 +50,13 @@ namespace spot
     for (steps::const_iterator i = run.prefix.begin();
 	 i != run.prefix.end(); ++i)
       {
-	step s = { s.s->clone(), i->label, i->acc };
+	step s = { i->s->clone(), i->label, i->acc };
 	prefix.push_back(s);
       }
     for (steps::const_iterator i = run.cycle.begin();
 	 i != run.cycle.end(); ++i)
       {
-	step s = { s.s->clone(), i->label, i->acc };
+	step s = { i->s->clone(), i->label, i->acc };
 	cycle.push_back(s);
       }
   }

src/tgbaalgos/lbtt.cc

@@ -62,12 +62,6 @@ namespace spot
 	return os;
       }
 
-      unsigned
-      count() const
-      {
-	return sm.size();
-      }
-
     private:
       typedef std::map<bdd, unsigned, bdd_less_than> split_map;
       split_map sm;

src/tgbaalgos/ltl2tgba_fm.cc

@@ -117,21 +117,6 @@ namespace spot
 	return num;
       }
 
-      std::ostream&
-      dump(std::ostream& os) const
-      {
-	fv_map::const_iterator fi;
-	os << "Next Variables:" << std::endl;
-	for (fi = next_map.begin(); fi != next_map.end(); ++fi)
-	{
-	  os << "  " << fi->second << ": Next[";
-	  fi->first->to_string(os) << "]" << std::endl;
-	}
-	os << "Shared Dict:" << std::endl;
-	dict->dump(os);
-	return os;
-      }
-
       formula*
       var_to_formula(int var) const
       {

src/tgbaalgos/reductgba_sim.cc

@@ -276,16 +276,16 @@ namespace spot
 
   void
   parity_game_graph::process_state(const state* s,
-				    int ,
-				    tgba_succ_iterator*)
+				   int,
+				   tgba_succ_iterator*)
   {
     tgba_state_.push_back(s);
   }
 
   void
-  parity_game_graph::process_link(int ,
-				   int ,
-				   const tgba_succ_iterator*)
+  parity_game_graph::process_link(int,
+				  int,
+				  const tgba_succ_iterator*)
   {
   }
 

src/tgbaalgos/tau03opt.cc

@@ -530,13 +530,6 @@ namespace spot
                               &(ic->second.first), &(ic->second.second));
         }
 
-      void add_new_state(const state* s, color c)
-        {
-          assert(hc.find(s)==hc.end() && h.find(s)==h.end());
-          assert(c != CYAN);
-          h.insert(std::make_pair(s, std::make_pair(c, bddfalse)));
-        }
-
       void add_new_state(const state* s, color c, const weight& w)
         {
           assert(hc.find(s)==hc.end() && h.find(s)==h.end());