You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
96 lines
2.5 KiB
96 lines
2.5 KiB
(*
|
|
* Copyright (c) Facebook, Inc. and its affiliates.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*)
|
|
|
|
open NS0
|
|
include Core.List
|
|
|
|
let rec pp ?pre ?suf sep pp_elt fs = function
|
|
| [] -> ()
|
|
| x :: xs ->
|
|
Option.iter pre ~f:(Format.fprintf fs) ;
|
|
pp_elt fs x ;
|
|
( match xs with
|
|
| [] -> ()
|
|
| xs -> Format.fprintf fs "%( %)%a" sep (pp sep pp_elt) xs ) ;
|
|
Option.iter suf ~f:(Format.fprintf fs)
|
|
|
|
let findi x xs =
|
|
let rec findi_ i xs =
|
|
match xs with
|
|
| [] -> None
|
|
| x' :: _ when x == x' -> Some i
|
|
| _ :: xs -> findi_ (i + 1) xs
|
|
in
|
|
findi_ 0 xs
|
|
|
|
let pop_exn = function
|
|
| x :: xs -> (x, xs)
|
|
| [] -> raise (Not_found_s (Atom __LOC__))
|
|
|
|
let find_map_remove xs ~f =
|
|
let rec find_map_remove_ ys = function
|
|
| [] -> None
|
|
| x :: xs -> (
|
|
match f x with
|
|
| Some x' -> Some (x', rev_append ys xs)
|
|
| None -> find_map_remove_ (x :: ys) xs )
|
|
in
|
|
find_map_remove_ [] xs
|
|
|
|
let fold_option xs ~init ~f =
|
|
let@ {return} = with_return in
|
|
Some
|
|
(fold xs ~init ~f:(fun acc elt ->
|
|
match f acc elt with Some res -> res | None -> return None ))
|
|
|
|
let filter_map_endo t ~f = filter_map_endo filter_map t ~f
|
|
let map_endo t ~f = map_endo map t ~f
|
|
|
|
let rev_map_unzip xs ~f =
|
|
fold xs ~init:([], []) ~f:(fun (ys, zs) x ->
|
|
let y, z = f x in
|
|
(y :: ys, z :: zs) )
|
|
|
|
let remove_exn ?(equal = phys_equal) xs x =
|
|
let rec remove_ ys = function
|
|
| [] -> raise (Not_found_s (Atom __LOC__))
|
|
| z :: xs ->
|
|
if equal x z then rev_append ys xs else remove_ (z :: ys) xs
|
|
in
|
|
remove_ [] xs
|
|
|
|
let remove ?equal xs x =
|
|
try Some (remove_exn ?equal xs x) with Not_found_s _ -> None
|
|
|
|
let rec rev_init n ~f =
|
|
if n = 0 then []
|
|
else
|
|
let n = n - 1 in
|
|
let xs = rev_init n ~f in
|
|
f n :: xs
|
|
|
|
let symmetric_diff ~compare xs ys =
|
|
let rec symmetric_diff_ xxs yys : _ Either.t list =
|
|
match (xxs, yys) with
|
|
| x :: xs, y :: ys ->
|
|
let ord = compare x y in
|
|
if ord = 0 then symmetric_diff_ xs ys
|
|
else if ord < 0 then First x :: symmetric_diff_ xs yys
|
|
else Second y :: symmetric_diff_ xxs ys
|
|
| xs, [] -> map ~f:Either.first xs
|
|
| [], ys -> map ~f:Either.second ys
|
|
in
|
|
symmetric_diff_ (sort ~compare xs) (sort ~compare ys)
|
|
|
|
let pp_diff ~compare sep pp_elt fs (xs, ys) =
|
|
let pp_diff_elt fs elt =
|
|
match elt with
|
|
| First x -> Format.fprintf fs "-- %a" pp_elt x
|
|
| Second y -> Format.fprintf fs "++ %a" pp_elt y
|
|
in
|
|
pp sep pp_diff_elt fs (symmetric_diff ~compare xs ys)
|