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

1 files changed, 30 insertions, 30 deletions

diff --git a/plugins/funind/rawtermops.mli b/plugins/funind/rawtermops.mli
index 358c6ba6c7..455e7c89b2 100644
--- a/plugins/funind/rawtermops.mli
+++ b/plugins/funind/rawtermops.mli
@@ -7,12 +7,12 @@ val idmap_is_empty : 'a Names.Idmap.t -> bool
 (* [get_pattern_id pat] returns a list of all the variable appearing in [pat] *)
 val get_pattern_id : cases_pattern -> Names.identifier list
 
-(* [pattern_to_term pat] returns a rawconstr corresponding to [pat]. 
-   [pat] must not contain occurences of anonymous pattern 
+(* [pattern_to_term pat] returns a rawconstr corresponding to [pat].
+   [pat] must not contain occurences of anonymous pattern
 *)
-val pattern_to_term : cases_pattern -> rawconstr 
+val pattern_to_term : cases_pattern -> rawconstr
 
-(* 
+(*
    Some basic functions to rebuild rawconstr
    In each of them the location is Util.dummy_loc
 *)
@@ -23,35 +23,35 @@ val mkRLambda : Names.name*rawconstr*rawconstr -> rawconstr
 val mkRProd : Names.name*rawconstr*rawconstr -> rawconstr
 val mkRLetIn : Names.name*rawconstr*rawconstr -> rawconstr
 val mkRCases : rawconstr option * tomatch_tuples * cases_clauses -> rawconstr
-val mkRSort : rawsort -> rawconstr 
+val mkRSort : rawsort -> rawconstr
 val mkRHole : unit -> rawconstr (* we only build Evd.BinderType Anonymous holes *)
-val mkRCast : rawconstr* rawconstr -> rawconstr 
+val mkRCast : rawconstr* rawconstr -> rawconstr
 (*
   Some basic functions to decompose rawconstrs
   These are analogous to the ones constrs
 *)
 val raw_decompose_prod : rawconstr -> (Names.name*rawconstr) list * rawconstr
-val raw_decompose_prod_or_letin : 
+val raw_decompose_prod_or_letin :
   rawconstr -> (Names.name*rawconstr option*rawconstr option) list * rawconstr
 val raw_decompose_prod_n : int -> rawconstr -> (Names.name*rawconstr) list * rawconstr
-val raw_decompose_prod_or_letin_n : int -> rawconstr -> 
+val raw_decompose_prod_or_letin_n : int -> rawconstr ->
   (Names.name*rawconstr option*rawconstr option) list * rawconstr
-val raw_compose_prod : rawconstr -> (Names.name*rawconstr) list  ->  rawconstr 
-val raw_compose_prod_or_letin: rawconstr -> 
+val raw_compose_prod : rawconstr -> (Names.name*rawconstr) list  ->  rawconstr
+val raw_compose_prod_or_letin: rawconstr ->
   (Names.name*rawconstr option*rawconstr option) list  ->  rawconstr
 val raw_decompose_app : rawconstr -> rawconstr*(rawconstr list)
 
 
-(* [raw_make_eq t1 t2] build the rawconstr corresponding to [t2 = t1] *) 
+(* [raw_make_eq t1 t2] build the rawconstr corresponding to [t2 = t1] *)
 val  raw_make_eq : ?typ:rawconstr -> rawconstr -> rawconstr -> rawconstr
-(* [raw_make_neq t1 t2] build the rawconstr corresponding to [t1 <> t2] *) 
+(* [raw_make_neq t1 t2] build the rawconstr corresponding to [t1 <> t2] *)
 val  raw_make_neq : rawconstr -> rawconstr -> rawconstr
-(* [raw_make_or P1 P2] build the rawconstr corresponding to [P1 \/ P2] *) 
+(* [raw_make_or P1 P2] build the rawconstr corresponding to [P1 \/ P2] *)
 val  raw_make_or : rawconstr -> rawconstr -> rawconstr
 
-(* [raw_make_or_list [P1;...;Pn]] build the rawconstr corresponding 
-   to [P1 \/ ( .... \/ Pn)] 
-*) 
+(* [raw_make_or_list [P1;...;Pn]] build the rawconstr corresponding
+   to [P1 \/ ( .... \/ Pn)]
+*)
 val  raw_make_or_list : rawconstr list -> rawconstr
 
 
@@ -64,8 +64,8 @@ val change_vars : Names.identifier Names.Idmap.t -> rawconstr -> rawconstr
 
 
 
-(* [alpha_pat avoid pat] rename all the variables present in [pat] s.t. 
-   the result does not share variables with [avoid]. This function create 
+(* [alpha_pat avoid pat] rename all the variables present in [pat] s.t.
+   the result does not share variables with [avoid]. This function create
    a fresh variable for each occurence of the anonymous pattern.
 
    Also returns a mapping  from old variables to new ones and the concatenation of
@@ -77,8 +77,8 @@ val change_vars : Names.identifier Names.Idmap.t -> rawconstr -> rawconstr
     Rawterm.cases_pattern * Names.Idmap.key list *
       Names.identifier Names.Idmap.t
 
-(* [alpha_rt avoid rt] alpha convert [rt] s.t. the result repects barendregt 
-   conventions and  does not share bound variables with avoid 
+(* [alpha_rt avoid rt] alpha convert [rt] s.t. the result repects barendregt
+   conventions and  does not share bound variables with avoid
 *)
 val alpha_rt : Names.identifier list -> rawconstr -> rawconstr
 
@@ -90,35 +90,35 @@ val alpha_br : Names.identifier list ->
     Rawterm.rawconstr
 
 
-(* Reduction function *) 
-val replace_var_by_term  :     
+(* Reduction function *)
+val replace_var_by_term  :
   Names.identifier ->
   Rawterm.rawconstr -> Rawterm.rawconstr -> Rawterm.rawconstr
 
 
 
-(* 
+(*
    [is_free_in id rt] checks if [id] is a free variable in [rt]
 *)
 val is_free_in : Names.identifier -> rawconstr -> bool
 
 
-val are_unifiable : cases_pattern -> cases_pattern -> bool 
+val are_unifiable : cases_pattern -> cases_pattern -> bool
 val eq_cases_pattern : cases_pattern -> cases_pattern -> bool
 
 
 
-(* 
-   ids_of_pat : cases_pattern -> Idset.t 
-   returns the set of variables appearing in a pattern 
+(*
+   ids_of_pat : cases_pattern -> Idset.t
+   returns the set of variables appearing in a pattern
 *)
-val   ids_of_pat : cases_pattern -> Names.Idset.t 
+val   ids_of_pat : cases_pattern -> Names.Idset.t
 
 (* TODO: finish this function (Fix not treated) *)
 val ids_of_rawterm: rawconstr -> Names.Idset.t
 
-(* 
-   removing let_in construction in a rawterm 
+(*
+   removing let_in construction in a rawterm
 *)
 val zeta_normalize : Rawterm.rawconstr -> Rawterm.rawconstr