60 lines
1.2 KiB
OCaml
60 lines
1.2 KiB
OCaml
let (>>=) x f = match x with
|
|
| None -> None
|
|
| Some x -> f x
|
|
|
|
let first_some = fun a b -> match (a , b) with
|
|
| Some a , _ -> Some a
|
|
| _ , Some b -> Some b
|
|
| _ -> None
|
|
|
|
let unopt ~default x = match x with
|
|
| None -> default
|
|
| Some x -> x
|
|
|
|
let unopt_exn x = match x with
|
|
| None -> raise Not_found
|
|
| Some x -> x
|
|
|
|
let map ~f x = match x with
|
|
| Some x -> Some (f x)
|
|
| None -> None
|
|
|
|
let lr (a , b) = match (a , b) with
|
|
| Some x , _ -> Some (`Left x)
|
|
| None , Some x -> Some (`Right x)
|
|
| _ -> None
|
|
|
|
(* TODO: recursive terminal *)
|
|
let rec bind_list = fun lst ->
|
|
match lst with
|
|
| [] -> Some []
|
|
| hd :: tl -> (
|
|
match hd with
|
|
| None -> None
|
|
| Some hd' -> (
|
|
match bind_list tl with
|
|
| None -> None
|
|
| Some tl' -> Some (hd' :: tl')
|
|
)
|
|
)
|
|
|
|
|
|
let bind_pair = fun (a , b) ->
|
|
a >>= fun a' ->
|
|
b >>= fun b' ->
|
|
Some (a' , b')
|
|
|
|
let bind_map_list = fun f lst -> bind_list (X_list.map f lst)
|
|
|
|
let bind_map_pair = fun f (a , b) -> bind_pair (f a , f b)
|
|
|
|
let bind_smap (s:_ X_map.String.t) =
|
|
let open X_map.String in
|
|
let aux k v prev =
|
|
prev >>= fun prev' ->
|
|
v >>= fun v' ->
|
|
Some (add k v' prev') in
|
|
fold aux s (Some empty)
|
|
|
|
let bind_map_smap f smap = bind_smap (X_map.String.map f smap)
|