simon/ocaml-containers
1
0
Fork 0
mirror of https://github.com/c-cube/ocaml-containers.git synced 2025-12-05 19:00:31 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

feat(list): add sorted_diff

Browse source
This commit is contained in:
favonia 2021-05-22 21:02:15 -05:00
parent de7f445207
commit 130f0a63bb
3 changed files with 38 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
src/core/CCList.ml
View file

@ -745,6 +745,34 @@ let sorted_merge ~cmp l1 l2 =
List.length (sorted_merge ~cmp:CCInt.compare l1 l2) = List.length l1 + List.length l2)
*)
let sorted_diff ~cmp l1 l2 =
let rec recurse cmp acc l1 l2 = match l1,l2 with
| [], _ -> List.rev acc
| _, [] -> List.rev_append acc l1
| x1::l1', x2::l2' ->
let c = cmp x1 x2 in
if c < 0 then recurse cmp (x1::acc) l1' l2
else if c > 0 then recurse cmp acc l1 l2'
else recurse cmp acc l1' l2'
in
recurse cmp [] l1 l2
(*$T
equal CCInt.equal (sorted_diff ~cmp:CCInt.compare [0;1;1;2;4] [1;2;2;2;3]) [0;1;4]
equal CCInt.equal (sorted_diff ~cmp:CCInt.compare [2] [1;2;2;2;3]) []
*)
(*$Q
Q.(pair (list small_int) (list small_int)) (fun (l1,l2) -> \
List.length (sorted_merge ~cmp:CCInt.compare l1 l2) = List.length l1 + List.length l2)
Q.(pair (list small_int) (list small_int)) (fun (l1,l2) -> \
let l = sorted_diff ~cmp:CCInt.compare (List.sort CCInt.compare l1) (List.sort CCInt.compare l2) in \
l = sort CCInt.compare l) (* [is_sorted] is after this function *)
Q.(triple small_nat small_nat int) (fun (n1,n2,x) -> \
let l = sorted_diff ~cmp:CCInt.compare (List.init n1 (fun _ -> x)) (List.init n2 (fun _ -> x)) in \
count (CCInt.equal x) l = CCInt.max (n1 - n2) 0)
*)
let sort_uniq ~cmp l = List.sort_uniq cmp l
(*$T

5
src/core/CCList.mli
View file

@ -501,6 +501,11 @@ val sorted_merge : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
(** [sorted_merge ~cmp l1 l2] merges elements from both sorted list using
the given comparison function [cmp]. *)
val sorted_diff : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
(** [sorted_merge ~cmp l1 l2] returns the elements in [l1] that are not in [l2].
Both lists are assumed to be sorted with respect to [cmp] and
duplicate elements are treated individually. *)
val sort_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list
(** [sort_uniq ~cmp l] sorts the list [l] using the given comparison function [cmp]
and remove duplicate elements. *)

5
src/core/CCListLabels.mli
View file

@ -503,6 +503,11 @@ val all_ok : ('a, 'err) result t -> ('a t, 'err) result
val sorted_merge : cmp:(('a -> 'a -> int) [@keep_label]) -> 'a list -> 'a list -> 'a list
(** [sorted_merge ~cmp l1 l2] merges elements from both sorted list using
the given comparison function [cmp]. *)
val sorted_diff : cmp:(('a -> 'a -> int) [@keep_label]) -> 'a list -> 'a list -> 'a list
(** [sorted_merge ~cmp l1 l2] returns the elements in [l1] that are not in [l2].
Both lists are assumed to be sorted with respect to [cmp] and
duplicate elements are treated individually. *)
val sort_uniq : cmp:(('a -> 'a -> int) [@keep_label]) -> 'a list -> 'a list
(** [sort_uniq ~cmp l] sorts the list [l] using the given comparison function [cmp]