2 * Copyright (C) 2000, HELM Team.
4 * This file is part of HELM, an Hypertextual, Electronic
5 * Library of Mathematics, developed at the Computer Science
6 * Department, University of Bologna, Italy.
8 * HELM is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version 2
11 * of the License, or (at your option) any later version.
13 * HELM is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with HELM; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
23 * For details, see the HELM World-Wide-Web page,
24 * http://cs.unibo.it/helm/.
27 let fold_file f init fname =
28 let inchan = open_in fname in
29 let rec fold_lines' value =
31 let line = input_line inchan in
32 fold_lines' (f value line)
33 with End_of_file -> value
35 let res = (try fold_lines' init with e -> (close_in inchan; raise e)) in
38 let iter_file f = fold_file (fun _ line -> f line) ()
40 let hashtbl_sorted_fold f tbl init =
42 List.sort compare (Hashtbl.fold (fun key _ keys -> key::keys) tbl [])
44 List.fold_left (fun acc k -> f k (Hashtbl.find tbl k) acc) init sorted_keys