package links

  1. Overview
  2. Docs
include Stdlib.Set.S with type elt = t
type elt = t
type t
val empty : t
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc
val map : (elt -> elt) -> t -> t
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val split : elt -> t -> t * bool * t
val is_empty : t -> bool
val mem : elt -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val subset : t -> t -> bool
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val to_list : t -> elt list
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val union_all : t list -> t
val pp : Stdlib.Format.formatter -> t -> unit
val show : t -> string
val of_seq : (unit -> elt Links_lens__.Lens_seq.node) -> t
val to_seq : t -> unit -> elt Links_lens__.Lens_seq.node
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val pp_pretty : Stdlib.Format.formatter -> t -> unit
val show_pretty : t -> string
val of_lists : (Alias.t list * Alias.t list) list -> t

Construct a set of functional dependencies of lists of lists of functional dependencies

val remove_defines : t -> cols:Alias.Set.t -> (t, Remove_defines_error.t) Stdlib.result

Remove all functional dependencies where the left side is contained by cols

val key_fds : keys:Alias.t list -> cols:Alias.t list -> t

Generate a single functional dependency as a set from the given keys and columns

val root_fds : t -> elt list

Get a root functional dependency

val defining_fd : t -> cols:Alias.Set.t -> elt

Get the functional dependency that defines the columns cols

val transitive_closure : t -> cols:Alias.Set.t -> Alias.Set.t

Get the transitive closure of a functional dependency

val checked_fds_of_lists : (Alias.t list * Alias.t list) list -> columns:Alias.Set.t -> (t, Check_error.t) Stdlib.result
val outputs : t -> Alias.Set.t

Get all columns which are defined by other columns.

val all_columns : t -> Alias.Set.t

Get the set of all columns.

val all_nodes : t -> Alias.Set.Set.t

Get the set of all nodes.

OCaml

Innovation. Community. Security.