package patdiff

  1. Overview
  2. Docs
File Diff using the Patience Diff algorithm

Install

Dune Dependency

Authors

Maintainers

Sources

v0.16.1.tar.gz
md5=ed1fd8166e2e99774432c1e28515f37e
sha512=7833f95ce42eeb17ecbef514eab13a37a0ab125b3c6e7e8af09c5b0efa3be6b971c6c4a40f3d809f1c254c8bc720ddaa46b54ff0514ddb9db0f5be03d99f5fd0

doc/patdiff.kernel/Patdiff_kernel/Format/Style/Set/index.html

Module Style.SetSource

Sourcemodule Elt : sig ... end
include Core.Set_intf.S_plain with module Elt := Elt
include Ppx_compare_lib.Comparable.S with type t := t
Sourceval compare : t Base__.Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__.Ppx_compare_lib.equal
include Core.Set_intf.Creators_generic with type ('a, 'b) set := ('a, 'b) Base.Set.t with type ('a, 'b) t := t with type ('a, 'b) tree := (Elt.t, Elt.comparator_witness) Base.Set.Using_comparator.Tree.t with type 'a elt := Elt.t with type 'c cmp := Elt.comparator_witness with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Base.Set.Without_comparator.t
include Base.Set.Creators_generic with type ('a, 'b) set := ('a, 'b) Base.Set.t with type ('a, 'b) t := t with type ('a, 'b) tree := (Elt.t, Elt.comparator_witness) Base.Set.Using_comparator.Tree.t with type 'a elt := Elt.t with type 'c cmp := Elt.comparator_witness with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Base.Set.Without_comparator.t
Sourceval empty : ('a, 'cmp, t) Base.Set.Without_comparator.t
Sourceval singleton : ('a, 'cmp, Elt.t -> t) Base.Set.Without_comparator.t
Sourceval union_list : ('a, 'cmp, t list -> t) Base.Set.Without_comparator.t
Sourceval of_list : ('a, 'cmp, Elt.t list -> t) Base.Set.Without_comparator.t
Sourceval of_sequence : ('a, 'cmp, Elt.t Base__.Sequence.t -> t) Base.Set.Without_comparator.t
Sourceval of_array : ('a, 'cmp, Elt.t array -> t) Base.Set.Without_comparator.t
Sourceval of_sorted_array : ('a, 'cmp, Elt.t array -> t Base__.Or_error.t) Base.Set.Without_comparator.t
Sourceval of_sorted_array_unchecked : ('a, 'cmp, Elt.t array -> t) Base.Set.Without_comparator.t
Sourceval of_increasing_iterator_unchecked : ('a, 'cmp, len:int -> f:(int -> Elt.t) -> t) Base.Set.Without_comparator.t
Sourceval stable_dedup_list : ('a, _, Elt.t list -> Elt.t list) Base.Set.Without_comparator.t
Sourceval map : ('b, 'cmp, ('a, _) Base.Set.t -> f:('a -> Elt.t) -> t) Base.Set.Without_comparator.t

The types of map and filter_map are subtle. The input set, ('a, _) set, reflects the fact that these functions take a set of *any* type, with any comparator, while the output set, ('b, 'cmp) t, reflects that the output set has the particular 'cmp of the creation function. The comparator can come in one of three ways, depending on which set module is used

  • Set.map -- comparator comes as an argument
  • Set.Poly.map -- comparator is polymorphic comparison
  • Foo.Set.map -- comparator is Foo.comparator
Sourceval filter_map : ('b, 'cmp, ('a, _) Base.Set.t -> f:('a -> Elt.t option) -> t) Base.Set.Without_comparator.t
Sourceval of_hashtbl_keys : ('a, 'cmp, (Elt.t, _) Core.Hashtbl.t -> t) Base.Set.Without_comparator.t
Sourceval of_map_keys : (Elt.t, _, Elt.comparator_witness) Base.Map.t -> t

Never requires a comparator because it can get one from the input Map.t.

Sourcemodule Provide_of_sexp (Elt : sig ... end) : sig ... end
Sourcemodule Provide_bin_io (Elt : sig ... end) : Core.Set_intf.Binable.S with type t := t
Sourcemodule Provide_hash (Elt : Base.Hasher.S with type t := Elt.t) : sig ... end
include Base.Sexpable.S with type t := t
Sourceval t_of_sexp : Sexplib0.Sexp.t -> t
Sourceval sexp_of_t : t -> Sexplib0.Sexp.t
OCaml

Innovation. Community. Security.