From 4911e7dc1fd99ce8a9a85deebb06dc6e479a2536 Mon Sep 17 00:00:00 2001
From: Alexandre Duret-Lutz <adl@lrde.epita.fr>
Date: Wed, 5 Feb 2014 15:07:10 +0100
Subject: [PATCH] Fix warning of Clang-3.5 against Doxygen comments.

* src/dstarparse/public.hh: Avoid LaTeX in comments to please clang-3.5.
* src/tgbaalgos/isdet.hh: Typo in Doxygen comment.
---
 src/dstarparse/public.hh | 10 +++++-----
 src/tgbaalgos/isdet.hh   |  4 ++--
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/src/dstarparse/public.hh b/src/dstarparse/public.hh
index 7e79f2852..4b4a41245 100644
--- a/src/dstarparse/public.hh
+++ b/src/dstarparse/public.hh
@@ -1,6 +1,6 @@
 // -*- coding: utf-8 -*-
-// Copyright (C) 2013 Laboratoire de Recherche et Développement de
-// l'Epita (LRDE).
+// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
+// de l'Epita (LRDE).
 //
 // This file is part of Spot, a model checking library.
 //
@@ -55,9 +55,9 @@ namespace spot
     /// \brief acceptance sets encoded as 2*num_state bit-vectors of
     /// num_pairs bits
     ///
-    /// Assuming $F=\{(L_0,U_0),\ldots,(L_i,U_i),\ldots\}$,
-    /// $s\in L_i$ iff <code>accsets->at(s * 2).get(i)$</code>,
-    /// an $s\in $U_i$ iff <code>accsets->at(s * 2 + 1).get(i)</code>.
+    /// Assuming F={(L₀,U₀),…,(Lᵢ,Uᵢ),…},
+    /// s∈Lᵢ iff <code>accsets->at(s * 2).get(i)</code>,
+    /// s∈Uᵢ iff <code>accsets->at(s * 2 + 1).get(i)</code>.
     bitvect_array* accsets;
 
     ~dstar_aut()
diff --git a/src/tgbaalgos/isdet.hh b/src/tgbaalgos/isdet.hh
index 294bab1bf..3f17079fd 100644
--- a/src/tgbaalgos/isdet.hh
+++ b/src/tgbaalgos/isdet.hh
@@ -1,5 +1,5 @@
 // -*- coding: utf-8 -*-
-// Copyright (C) 2012, 2013 Laboratoire de Recherche et
+// Copyright (C) 2012, 2013, 2014 Laboratoire de Recherche et
 // Développement de l'Epita (LRDE).
 //
 // This file is part of Spot, a model checking library.
@@ -43,7 +43,7 @@ namespace spot
   SPOT_API bool
   is_deterministic(const tgba* aut);
 
-  /// \Brief Return true iff \a aut is complete.
+  /// \brief Return true iff \a aut is complete.
   ///
   /// An automaton is complete if its translation relation is total,
   /// i.e., each state as a successor for any possible configuration.