dune/src/top_closure.mli

open Stdune

module type Elt = sig
  type t
  type graph
  type key
  val key : t -> key
  val deps : t -> graph -> t list
end

module Make(Key : Comparable.S)(Elt : Elt with type key := Key.t) : sig
  (** Returns [Error cycle] in case the graph is not a DAG *)
  val top_closure : Elt.graph -> Elt.t list -> (Elt.t list, Elt.t list) result
end
Split src/import.ml into a new library src/stdune (#548) - make sure type t always come first - Map.map, Map.fold, ... never pass the key to the callback while Map.mapi, Map.foldi, ... do - removed the ~key and ~data labels, I find them useless and annoying - Set.elements --> Set.to_list - Map.bindings --> Map.to_list - Map.of_alist --> Map.of_list - added Ordering.t for comparison functions - renamed Inl/Inr to Left/Right. The latter seems clearer - moved List.longest to String.longest - added a Pp module with a nicer API than Format 2018-02-25 16:35:25 +00:00			`open Stdune`
114.20+69 2016-12-02 13:54:32 +00:00
			`module type Elt = sig`
			`type t`
			`type graph`
			`type key`
			`val key : t -> key`
			`val deps : t -> graph -> t list`
			`end`

Split src/import.ml into a new library src/stdune (#548) - make sure type t always come first - Map.map, Map.fold, ... never pass the key to the callback while Map.mapi, Map.foldi, ... do - removed the ~key and ~data labels, I find them useless and annoying - Set.elements --> Set.to_list - Map.bindings --> Map.to_list - Map.of_alist --> Map.of_list - added Ordering.t for comparison functions - renamed Inl/Inr to Left/Right. The latter seems clearer - moved List.longest to String.longest - added a Pp module with a nicer API than Format 2018-02-25 16:35:25 +00:00			`module Make(Key : Comparable.S)(Elt : Elt with type key := Key.t) : sig`
114.20+69 2016-12-02 13:54:32 +00:00			`(** Returns [Error cycle] in case the graph is not a DAG *)`
			`val top_closure : Elt.graph -> Elt.t list -> (Elt.t list, Elt.t list) result`
			`end`