package mopsa

  1. Overview
  2. Docs
package mopsa
Legend:
Library
Module
Module type
Parameter
Class
Class type
include sig ... end
type elt = Parsing.Cst.var
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
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 diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> 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 split : elt -> t -> t * bool * t
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 of_list : elt list -> t
val iter2 : (elt -> unit) -> (elt -> unit) -> (elt -> unit) -> t -> t -> unit
val fold2 : (elt -> 'a -> 'a) -> (elt -> 'a -> 'a) -> (elt -> 'a -> 'a) -> t -> t -> 'a -> 'a
val for_all2 : (elt -> bool) -> (elt -> bool) -> (elt -> bool) -> t -> t -> bool
val exists2 : (elt -> bool) -> (elt -> bool) -> (elt -> bool) -> t -> t -> bool
val iter2_diff : (elt -> unit) -> (elt -> unit) -> t -> t -> unit
val fold2_diff : (elt -> 'a -> 'a) -> (elt -> 'a -> 'a) -> t -> t -> 'a -> 'a
val for_all2_diff : (elt -> bool) -> (elt -> bool) -> t -> t -> bool
val exists2_diff : (elt -> bool) -> (elt -> bool) -> t -> t -> bool
val diff_list : t -> t -> elt list
val sym_diff_list : t -> t -> elt list * elt list
val add_sym_diff : t -> (elt list * elt list) -> t
val iter_slice : (elt -> unit) -> t -> elt -> elt -> unit
val fold_slice : (elt -> 'a -> 'a) -> t -> elt -> elt -> 'a -> 'a
val for_all_slice : (elt -> bool) -> t -> elt -> elt -> bool
val exists_slice : (elt -> bool) -> t -> elt -> elt -> bool
val to_string : Containers__SetExtSig.set_printer -> (elt -> string) -> t -> string
val print : Containers__SetExtSig.set_printer -> (Stdlib.out_channel -> elt -> unit) -> Stdlib.out_channel -> t -> unit
val fprint : Containers__SetExtSig.set_printer -> (Stdlib.Format.formatter -> elt -> unit) -> Stdlib.Format.formatter -> t -> unit
val bprint : Containers__SetExtSig.set_printer -> (Stdlib.Buffer.t -> elt -> unit) -> Stdlib.Buffer.t -> t -> unit
val to_poly_set : t -> elt Containers.SetExtPoly.t
val uid_counter : int Stdlib.ref
val resolve : elt -> t -> elt
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct