module Make:
Parameters: |
|
include Hashtbl.S
val iter_sorted : ?cmp:(key -> key -> int) -> (key -> 'a -> unit) -> 'a t -> unit
cmp
. Use Pervasives.compare
if cmp
not given.
If the table contains several bindings for the same key, they
are passed to f
in reverse order of introduction, that is,
the most recent binding is passed first.
val fold_sorted : ?cmp:(key -> key -> int) -> (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
cmp
. Use Pervasives.compare
if cmp
not given.
If the table contains several bindings for the same key, they
are passed to f
in reverse order of introduction, that is,
the most recent binding is passed first.
val iter_sorted_by_entry : cmp:(key * 'a -> key * 'a -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_entry : cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
cmp
. The table may contains several bindings for the
same key.val iter_sorted_by_value : cmp:('a -> 'a -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_value : cmp:('a -> 'a -> int) -> (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
cmp
. The relative order for entries whose values is
equal according to cmp, is not specified.