Delete trailing whitespaces in all *.{v,ml*} files

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12337 85f007b7-540e-0410-9357-904b9bb8a0f7

4 files changed, 9 insertions, 9 deletions

diff --git a/test-suite/output/Cases.v b/test-suite/output/Cases.v
index 37ee71e95..b63375867 100644
--- a/test-suite/output/Cases.v
+++ b/test-suite/output/Cases.v
@@ -12,7 +12,7 @@ Require Import Arith.
 
 Definition proj (x y:nat) (P:nat -> Type) (def:P x) (prf:P y) : P y :=
   match eq_nat_dec x y return P y with
-  | left eqprf => 
+  | left eqprf =>
     match eqprf in (_ = z) return (P z) with
     | refl_equal => def
     end
diff --git a/test-suite/output/Fixpoint.v b/test-suite/output/Fixpoint.v
index 2b13c2041..af5f05f65 100644
--- a/test-suite/output/Fixpoint.v
+++ b/test-suite/output/Fixpoint.v
@@ -1,7 +1,7 @@
 Require Import List.
 
 Check
-  (fix F (A B : Set) (f : A -> B) (l : list A) {struct l} : 
+  (fix F (A B : Set) (f : A -> B) (l : list A) {struct l} :
    list B := match l with
              | nil => nil
              | a :: l => f a :: F _ _ f l
diff --git a/test-suite/output/Notations.v b/test-suite/output/Notations.v
index b37c3638a..8d16dff5b 100644
--- a/test-suite/output/Notations.v
+++ b/test-suite/output/Notations.v
@@ -64,26 +64,26 @@ Open Scope nat_scope.
 
 Inductive znat : Set := Zpos (n : nat) | Zneg (m : nat).
 Coercion Zpos: nat >-> znat.
- 
+
 Delimit Scope znat_scope with znat.
 Open Scope znat_scope.
- 
+
 Variable addz : znat -> znat -> znat.
 Notation "z1 + z2" := (addz z1 z2) : znat_scope.
 
   (* Check that "3+3", where 3 is in nat and the coercion to znat is implicit,
-     is printed the same way, and not "S 2 + S 2" as if numeral printing was 
+     is printed the same way, and not "S 2 + S 2" as if numeral printing was
      only tested with coercion still present *)
 
 Check (3+3).
 
 (**********************************************************************)
 (* Check recursive notations                                          *)
- 
+
 Require Import List.
 Notation "[ x ; .. ; y ]" := (cons x .. (cons y nil) ..).
 Check [1;2;4].
-  
+
 Reserved Notation "( x ; y , .. , z )" (at level 0).
 Notation "( x ; y , .. , z )" := (pair .. (pair x y) .. z).
 Check (1;2,4).
@@ -102,7 +102,7 @@ Check (pred 3).
 Check (fun n => match n with 0 => 0 | S n => n end).
 Check (fun n => match n with S p as x => p | y => 0 end).
 
-Notation "'ifn' x 'is' 'succ' n 'then' t 'else' u" := 
+Notation "'ifn' x 'is' 'succ' n 'then' t 'else' u" :=
   (match x with O => u | S n => t end) (at level 0, u at level 0).
 Check fun x => ifn x is succ n then n else 0.
 
diff --git a/test-suite/output/reduction.v b/test-suite/output/reduction.v
index 4a460a83f..c4592369f 100644
--- a/test-suite/output/reduction.v
+++ b/test-suite/output/reduction.v
@@ -9,5 +9,5 @@ Eval simpl in (fix plus (n m : nat) {struct n} : nat :=
   | S p => S (p + m)
   end) a a.
 
-Eval hnf in match (plus (S n) O) with S n => n | _ => O end.  
+Eval hnf in match (plus (S n) O) with S n => n | _ => O end.