package base
Module Map.PolySource
A polymorphic Map.
Source
type ('key, +'value) tree =
('key, 'value, Comparator.Poly.comparator_witness) Using_comparator.Tree.tSource
val iteri_until :
('a, 'b) t ->
f:(key:'a -> data:'b -> Continue_or_stop.t) ->
Finished_or_unfinished.tSource
val fold_until :
('k, 'v) t ->
init:'a ->
f:(key:'k -> data:'v -> 'a -> ('a, 'final) Container.Continue_or_stop.t) ->
finish:('a -> 'final) ->
'finalSource
val symmetric_diff :
('a, 'b) t ->
('a, 'b) t ->
data_equal:('b -> 'b -> bool) ->
('a * [ `Left of 'b | `Right of 'b | `Unequal of 'b * 'b ]) Sequence.tSource
val subrange :
('a, 'b) t ->
lower_bound:'a Maybe_bound.t ->
upper_bound:'a Maybe_bound.t ->
('a, 'b) tSource
val to_sequence :
?order:[ `Increasing_key | `Decreasing_key ] ->
?keys_greater_or_equal_to:'a ->
?keys_less_or_equal_to:'a ->
('a, 'b) t ->
('a * 'b) Sequence.tSource
val binary_search :
('k, 'v) t ->
compare:(key:'k -> data:'v -> 'key -> int) ->
Binary_searchable.Which_target_by_key.t ->
'key ->
('k * 'v) optionSource
val binary_search_segmented :
('k, 'v) t ->
segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) ->
Binary_searchable.Which_target_by_segment.t ->
('k * 'v) optionSource
val binary_search_subrange :
('k, 'v) t ->
compare:(key:'k -> data:'v -> 'bound -> int) ->
lower_bound:'bound Maybe_bound.t ->
upper_bound:'bound Maybe_bound.t ->
('k, 'v) t