Source file `array_intf.ml`

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
module type S = sig
  module Set : sig
    type elt
    type t

    val empty : t
    val is_empty : t -> bool
    val mem : t -> elt -> bool
    val of_list : elt list -> t
    val of_sorted_list : elt list -> t
    val union : t -> t -> t
    val equal : t -> t -> bool
    val is_subset : t -> of_:t -> bool
    val are_disjoint : t -> t -> bool
    val diff : t -> t -> t
    val filter : t -> f:(elt -> bool) -> t
    val fold : t -> init:'a -> f:(elt -> 'a -> 'a) -> 'a
    val to_list : t -> elt list
    val to_list_map : t -> f:(elt -> 'a) -> 'a list
  end

  module Map : sig
    type key = Set.elt
    type 'a t

    val empty : 'a t
    val is_empty : 'a t -> bool
    val mem : 'a t -> key -> bool
    val find : 'a t -> key -> 'a option
    val of_list_exn : (key * 'a) list -> 'a t
    val of_sorted_list_exn : (key * 'a) list -> 'a t
    val union_left_biased : 'a t -> 'a t -> 'a t
    val keys : _ t -> Set.t
    val filter_mapi : 'a t -> f:(key -> 'a -> 'b option) -> 'b t
    val to_list : 'a t -> (key * 'a) list
    val to_list_map : 'a t -> f:(key -> 'a -> 'b) -> 'b list
    val equal : 'a t -> 'a t -> equal:('a -> 'a -> bool) -> bool
    val iteri : 'a t -> f:(key -> 'a -> unit) -> unit
  end
end