hop-2012/server/datastructures.ml

40 lines
1.3 KiB
OCaml
Raw Permalink Normal View History

2012-03-07 18:23:41 +00:00
(* Copyright 2012 Tony Garnock-Jones <tonygarnockjones@gmail.com>. *)
2012-05-01 21:36:38 +00:00
(* This file is part of Hop. *)
2012-03-07 18:23:41 +00:00
2012-05-01 21:36:38 +00:00
(* Hop is free software: you can redistribute it and/or modify it *)
2012-03-07 18:23:41 +00:00
(* under the terms of the GNU General Public License as published by the *)
(* Free Software Foundation, either version 3 of the License, or (at your *)
(* option) any later version. *)
2012-05-01 21:36:38 +00:00
(* Hop is distributed in the hope that it will be useful, but *)
2012-03-07 18:23:41 +00:00
(* WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *)
(* General Public License for more details. *)
(* You should have received a copy of the GNU General Public License *)
2012-05-01 21:36:38 +00:00
(* along with Hop. If not, see <http://www.gnu.org/licenses/>. *)
2012-03-07 18:23:41 +00:00
module BytesSet = Set.Make(Bytes)
module BytesMap = Map.Make(Bytes)
2012-05-10 19:22:58 +00:00
module SexpMap = Map.Make(Sexp)
module UuidSet = BytesSet
2012-04-29 23:41:28 +00:00
let bytes_map_keys m = BytesMap.fold (fun k _ acc -> k :: acc) m []
let classify f xs =
let rec loop acc xs =
match xs with
| [] -> acc
| x :: xs' ->
(match f x with
| Some (classification, v) ->
loop
(BytesMap.add
classification
(v :: (try BytesMap.find classification acc with Not_found -> []))
acc)
xs'
| None -> loop acc xs')
in loop BytesMap.empty xs