Strip trailing whitespace

Use
```bash
git grep --name-only ' $' | xargs sed s'/ \+$//g' -i
```

Author: JasonGross

Makefile.in

@@ -3,7 +3,7 @@
 #  Copyright (C) 2009-2015 Anne Pacalet ([email protected])
 #                      and Yves Bertot ([email protected])
 #                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-#      This file is distributed under the terms of the 
+#      This file is distributed under the terms of the
 #       GNU Lesser General Public License Version 2.1
 #~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 
@@ -98,7 +98,7 @@ $(DPDUSAGE) : $(CMOS_DPDUSAGE)
 	$(ECHO_CIBLE)
 	@OCAMLLEX@ $<
 
-GENERATED+=$(PRE)_lex.ml 
+GENERATED+=$(PRE)_lex.ml
 
 %.ml : %.mly
 	$(ECHO_CIBLE)
@@ -108,7 +108,7 @@ GENERATED+=$(PRE)_parse.ml $(PRE)_parse.mli
 
 depend: .depend
 
-.depend : $(ML_ALL) 
+.depend : $(ML_ALL)
 	$(ECHO_CIBLE)
 	@OCAMLDEP@ $(ML_ALL) *.mli > $@
 
@@ -221,12 +221,12 @@ clean_coq : Make_coq
 	$(MAKE) -f $< clean
 
 clean_test :
-	rm -f $(TESTS) $(TESTS_LOG) $(TESTS_OK) 
+	rm -f $(TESTS) $(TESTS_LOG) $(TESTS_OK)
 	rm -f $(TESTDIR)/Test.vo  $(TESTDIR)/Test.glob
 	rm -f $(TESTDIR)/Morph.vo  $(TESTDIR)/Morph.glob
 
 clean : clean_coq clean_test
-	rm -f $(GENERATED) 
+	rm -f $(GENERATED)
 	rm -f $(CMOS_DPDUSAGE) $(CMOS_DPD2DOT) $(CMXS) $(ML_ALL:%.ml=%.o) *.cmi
 	rm -f $(ML_ALL:%.ml=%.annot)
 	rm -f $(DPD2DOT) $(DPDUSAGE) $(DPDPLUGIN)

README.md

@@ -51,7 +51,7 @@ This should produce a plug-in library for Coq and an executable :
 - `./dpd2dot` : a tool to transform .dpd files into .dot graphs.
 
 If you prefer all compiled files to stay in the coq-dpdgraph directory, you can
-skip the make install command.  However, you will have to use 
+skip the make install command.  However, you will have to use
    $ coqtop -R <coq-dpdgraph-directory> dpdgraph -I <coq-dpdgraph-directory>
 
 #### install using opam

TODO

@@ -3,11 +3,11 @@ TODO: transfer this to GitHub issues !
 
 Rebuild a demo !
 
--[2014-01-07] 
+-[2014-01-07]
   - utiliser ocamlgraph pour le calcul de le cloture transitive
     dans la fonction reduce_graph (cf. mail Julien Narboux)
 
--[2013-09-12] 
+-[2013-09-12]
   - adaptation for OCaml 4.00.1 and Coq 8.4pl1 (April 2013)
     (.ml -> .ml4 + change in Declarations types)
   - tests are nor working as before : TODO

configure.in

@@ -3,7 +3,7 @@
 #  Copyright (C) 2009-2015 Anne Pacalet ([email protected])
 #                      and Yves Bertot ([email protected])
 #                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-#      This file is distributed under the terms of the 
+#      This file is distributed under the terms of the
 #       GNU Lesser General Public License Version 2.1
 #~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 # the script generated by autoconf from this input will set the following
@@ -169,7 +169,7 @@ if test "$OCAMLFIND" = ""; then
 else
   OCAMLGRAPH_PATH=`ocamlfind query ocamlgraph | tr -d '\\r\\n'`
   if test "$OCAMLGRAPH_PATH" = "" ;then
-     OCAMLGRAPH=no 
+     OCAMLGRAPH=no
   fi
 fi
 

coqdoc.css

@@ -1,5 +1,5 @@
 body { padding: 0px 0px;
-       margin: 0px 0px; 
+       margin: 0px 0px;
        background-color: white }
 
 #page { display: block;
@@ -15,7 +15,7 @@ body { padding: 0px 0px;
           border-bottom-style: solid;
           border-width: thin }
 
-#header h1 { padding: 0; 
+#header h1 { padding: 0;
              margin: 0;}
 
 
@@ -53,46 +53,46 @@ body { padding: 0px 0px;
              background-color: #90bdff;
              border-style: plain}
 
-.inlinecode { 
+.inlinecode {
     display: inline;
-    font-family: monospace } 
+    font-family: monospace }
 
-.code { 
+.code {
     display: block;
-    font-family: monospace } 
+    font-family: monospace }
 
 /* Pied de page */
 
 #footer { font-size: 65%;
           font-family: sans-serif; }
 
 #footer a:visited { color: blue; }
-#footer a:link { text-decoration: none; 
+#footer a:link { text-decoration: none;
                  color: #888888; }
 
 .id { display: inline; }
 
-.id[type="constructor"] { 
+.id[type="constructor"] {
     color: rgb(60%,0%,0%);
 }
 
-.id[type="var"] { 
+.id[type="var"] {
     color: rgb(40%,0%,40%);
 }
 
-.id[type="definition"] { 
+.id[type="definition"] {
     color: rgb(0%,40%,0%);
 }
 
-.id[type="lemma"] { 
+.id[type="lemma"] {
     color: rgb(0%,40%,0%);
 }
 
-.id[type="inductive"] { 
+.id[type="inductive"] {
     color: rgb(0%,0%,80%);
 }
 
-.id[type="keyword"] { 
+.id[type="keyword"] {
  color : #cf1d1d;
 /*     color: black; */
 }

dpd2dot.ml

@@ -13,19 +13,19 @@ let out_file = ref None
 let set_out_file file = out_file := Some file
 
 let spec_args = [
-  ("-o", Arg.String set_out_file, 
+  ("-o", Arg.String set_out_file,
       ": name of output file (default: name of input file .dot)");
-  ("-with-defs", Arg.Set Dpd_compute.with_defs, 
+  ("-with-defs", Arg.Set Dpd_compute.with_defs,
       ": show everything (default)");
-  ("-without-defs", Arg.Clear Dpd_compute.with_defs, 
+  ("-without-defs", Arg.Clear Dpd_compute.with_defs,
       ": show only Prop objects");
-  ("-rm-trans", Arg.Set Dpd_compute.reduce_trans, 
+  ("-rm-trans", Arg.Set Dpd_compute.reduce_trans,
       ": remove transitive dependencies (default)");
-  ("-keep-trans", Arg.Clear Dpd_compute.reduce_trans, 
+  ("-keep-trans", Arg.Clear Dpd_compute.reduce_trans,
       ": keep transitive dependencies");
-  ("-debug", Arg.Set Dpd_compute.debug_flag, 
+  ("-debug", Arg.Set Dpd_compute.debug_flag,
       ": set debug mode");
-  ("-v", Arg.Set version_option, 
+  ("-v", Arg.Set version_option,
       ": print version and exit");
 ]
 
@@ -35,10 +35,10 @@ let do_file n f =
     let g = Dpd_lex.read f in
     let g = Dpd_compute.build_graph g in
       Dpd_compute.simplify_graph g;
-    let dotfile = match !out_file with 
-      | None -> (Filename.chop_extension f)^".dot" 
-      | Some f -> 
-          if n = 0 then f 
+    let dotfile = match !out_file with
+      | None -> (Filename.chop_extension f)^".dot"
+      | Some f ->
+          if n = 0 then f
           else (Filename.chop_extension f)^"."^(string_of_int n)^".dot"
     in
       Dpd_dot.graph_file dotfile g
@@ -49,14 +49,14 @@ let main () =
   let args = ref [] in
   let memo_arg arg = args := arg :: !args in
     Arg.parse spec_args memo_arg usage_msg;
-    if !version_option 
+    if !version_option
     then Format.printf "This is '%s' (part of DpdGraph tools - version %s)@."
            (Filename.basename Sys.argv.(0)) Version.version
     else match !args with
       |  [] -> Dpd_compute.error "no source file to process ?@.";
                Arg.usage spec_args usage_msg
       | f::[]  -> do_file 0 f
-      | l  -> 
+      | l  ->
           ignore (List.fold_left (fun n f -> do_file n f; n+1) 1 l)
 
 let () = main ()

dpd_compute.ml

@@ -7,13 +7,13 @@
 (*        (see the enclosed LICENSE file for mode details)                    *)
 (*~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*)
 
-let debug_flag = ref false 
+let debug_flag = ref false
 let with_defs = ref true
 let reduce_trans = ref true
 
 let pp intro format = Format.printf "%s" intro ; Format.printf format
 
-let debug format = 
+let debug format =
   if !debug_flag then pp "(debug): " format
   else Format.ifprintf Format.std_formatter format
 
@@ -30,7 +30,7 @@ let pp_lex_pos fmt p = Format.fprintf fmt "(l:%d, c:%d)"
 let pp_lex_inter fmt (p1, p2) =
   Format.fprintf fmt "between %a and %a" pp_lex_pos p1 pp_lex_pos p2
 
-let get_attrib a attribs = 
+let get_attrib a attribs =
   try Some (List.assoc a attribs) with Not_found -> None
 
 let bool_attrib a attribs = match get_attrib a attribs with
@@ -71,11 +71,11 @@ let build_graph lobj =
   let g = G.create () in
   let node_tbl = Hashtbl.create 10 in
   let get_node id = Hashtbl.find node_tbl id in
-  let add_obj o = match o with 
-    | N ((id, _, _) as n) -> 
+  let add_obj o = match o with
+    | N ((id, _, _) as n) ->
         Hashtbl.add node_tbl id n; let n = G.V.create n in G.add_vertex g n
-    | E (id1, id2, attribs) -> 
-        try 
+    | E (id1, id2, attribs) ->
+        try
           let e = G.E.create (get_node id1) attribs (get_node id2) in
           G.add_edge_e g e
         with Not_found -> raise (Error "Cannot build edge : node doesn't exist")
@@ -86,14 +86,14 @@ let build_graph lobj =
 
 (** remove edge (n1 -> n2) iff n2 is indirectly reachable by n1 *)
 (* TODO : not sure this is working for graphs with cycles *)
-let reduce_graph g = 
+let reduce_graph g =
   (* a table in which each node is mapped to the set of indirected accessible
    * nodes *)
   let module Vset = Set.Make (G.V) in
   let reach_tbl = Hashtbl.create (G.nb_vertex g) in
-  let rec reachable v = 
+  let rec reachable v =
     try Hashtbl.find reach_tbl v (* already done *)
-    with Not_found -> 
+    with Not_found ->
       let nb_succ_before = List.length (G.succ g v) in
       let add_succ_reachable acc s =
         let acc = (* add [s] successors *)
@@ -113,9 +113,9 @@ let reduce_graph g =
     G.iter_vertex (fun v -> ignore (reachable v)) g
 
 let remove_node g n =
-  let transfer_edges p = 
+  let transfer_edges p =
     G.remove_edge g p n;
-    List.iter (fun s -> G.add_edge g p s) (G.succ g n) 
+    List.iter (fun s -> G.add_edge g p s) (G.succ g n)
   in
     List.iter transfer_edges (G.pred g n);
     G.remove_vertex g n (* also remove edges n -> s *)