1Identifiable.S.Map(3) OCaml library Identifiable.S.Map(3)
2
3
4
6 Identifiable.S.Map - no description
7
9 Module Identifiable.S.Map
10
12 Module Map
13 : sig end
14
15
16
17
18
19
20
21 module T : Map.OrderedType
22
23
24
25
26 include Map.S
27
28
29
30
31 val filter_map : 'a t -> f:(key -> 'a -> 'b option) -> 'b t
32
33
34
35
36 val of_list : (key * 'a) list -> 'a t
37
38
39
40
41 val disjoint_union : ?eq:('a -> 'a -> bool) -> ?print:(Format.formatter
42 -> 'a -> unit) -> 'a t -> 'a t -> 'a t
43
44
45 disjoint_union m1 m2 contains all bindings from m1 and m2 . If some
46 binding is present in both and the associated value is not equal, a
47 Fatal_error is raised
48
49
50
51 val union_right : 'a t -> 'a t -> 'a t
52
53
54 union_right m1 m2 contains all bindings from m1 and m2 . If some bind‐
55 ing is present in both, the one from m2 is taken
56
57
58
59 val union_left : 'a t -> 'a t -> 'a t
60
61
62 union_left m1 m2 = union_right m2 m1
63
64
65
66
67 val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
68
69
70
71
72 val rename : key t -> key -> key
73
74
75
76
77 val map_keys : (key -> key) -> 'a t -> 'a t
78
79
80
81
82 val keys : 'a t -> Set.Make(T).t
83
84
85
86
87 val data : 'a t -> 'a list
88
89
90
91
92 val of_set : (key -> 'a) -> Set.Make(T).t -> 'a t
93
94
95
96
97 val transpose_keys_and_data : key t -> key t
98
99
100
101
102 val transpose_keys_and_data_set : key t -> Set.Make(T).t t
103
104
105
106
107 val print : (Format.formatter -> 'a -> unit) -> Format.formatter -> 'a
108 t -> unit
109
110
111
112
113
114
115OCamldoc 2019-02-02 Identifiable.S.Map(3)