Module Bonsai_proc.Set

val union : here:lexing_position -> ('a, 'cmp) Core.Set.t Value.t -> ('a, 'cmp) Core.Set.t Value.t -> ('a, 'cmp) Core.Set.t Computation.t
val inter : here:lexing_position -> ('a, 'cmp) Core.Set.t Value.t -> ('a, 'cmp) Core.Set.t Value.t -> ('a, 'cmp) Core.Set.t Computation.t
val diff : here:lexing_position -> ('a, 'cmp) Core.Set.t Value.t -> ('a, 'cmp) Core.Set.t Value.t -> ('a, 'cmp) Core.Set.t Computation.t
val filter : here:lexing_position -> ('a, 'cmp) Core.Set.t Value.t -> f:('a -> bool) -> ('a, 'cmp) Core.Set.t Computation.t
val unordered_fold : here:lexing_position -> ('a, 'cmp) Core.Set.t Value.t -> init:'acc -> add:('acc -> 'a -> 'acc) -> remove:('acc -> 'a -> 'acc) -> 'acc Computation.t
val cartesian_product : here:lexing_position -> ('a1, 'cmp1) Core.Set.t Value.t -> ('a2, 'cmp2) Core.Set.t Value.t -> ('a1 * 'a2, ('cmp1, 'cmp2) Core.Tuple2.comparator_witness) Core.Set.t Computation.t
val union_map_data : here:lexing_position -> comparator:('a, 'cmp) Core.Comparator.t -> ('b, ('a, 'cmp) Core.Set.t, 'c) Core.Map.t Value.t -> ('a, 'cmp) Core.Set.t Computation.t