package incr_dom
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
A library for building dynamic webapps, using Js_of_ocaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
incr_dom-v0.15.0.tar.gz
sha256=e79e64efca79b5def4e636b84225710f982bf5f5dda31fcab8e6b4bfab583d10
doc/incr_dom.ui_incr/Ui_incr/Map/index.html
Module Ui_incr.Map
val of_set : ('k, 'cmp) Core.Set.t Incr.t -> ('k, unit, 'cmp) Core.Map.t Incr.tval filter_mapi :
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval mapi :
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> data:'v1 -> 'v2) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval filter_map :
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:('v1 -> 'v2 option) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval map :
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:('v1 -> 'v2) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval filter_mapi' :
?cutoff:'v1 Incr.Cutoff.t ->
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> data:'v1 Incr.t -> 'v2 option Incr.t) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval mapi' :
?cutoff:'v1 Incr.Cutoff.t ->
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> data:'v1 Incr.t -> 'v2 Incr.t) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval filter_map' :
?cutoff:'v1 Incr.Cutoff.t ->
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:('v1 Incr.t -> 'v2 option Incr.t) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval map' :
?cutoff:'v1 Incr.Cutoff.t ->
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:('v1 Incr.t -> 'v2 Incr.t) ->
('k, 'v2, 'cmp) Core.Map.t Incr.tval partition_mapi :
?data_equal:('v1 -> 'v1 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> data:'v1 -> ('v2, 'v3) Core.Either.t) ->
(('k, 'v2, 'cmp) Core.Map.t * ('k, 'v3, 'cmp) Core.Map.t) Incr.tval unordered_fold :
?data_equal:('v -> 'v -> bool) ->
?update:(key:'k -> old_data:'v -> new_data:'v -> 'acc -> 'acc) ->
?specialized_initial:(init:'acc -> ('k, 'v, 'cmp) Core.Map.t -> 'acc) ->
?revert_to_init_when_empty:bool ->
('k, 'v, 'cmp) Core.Map.t Incr.t ->
init:'acc ->
add:(key:'k -> data:'v -> 'acc -> 'acc) ->
remove:(key:'k -> data:'v -> 'acc -> 'acc) ->
'acc Incr.tval mapi_count :
?data_equal:('v -> 'v -> bool) ->
('k1, 'v, 'cmp1) Core.Map.t Incr.t ->
comparator:('k2, 'cmp2) Core.Map.comparator ->
f:(key:'k1 -> data:'v -> 'k2) ->
('k2, int, 'cmp2) Core.Map.t Incr.tval map_count :
?data_equal:('v -> 'v -> bool) ->
('k1, 'v, 'cmp1) Core.Map.t Incr.t ->
comparator:('k2, 'cmp2) Core.Map.comparator ->
f:('v -> 'k2) ->
('k2, int, 'cmp2) Core.Map.t Incr.tval mapi_min :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('r, 'b) Core.Map.comparator ->
f:(key:'k -> data:'v -> 'r) ->
'r option Incr.tval mapi_max :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('r, 'b) Core.Map.comparator ->
f:(key:'k -> data:'v -> 'r) ->
'r option Incr.tval mapi_mn :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('r, 'b) Core.Map.comparator ->
f:('v -> 'r) ->
'r option Incr.tval map_max :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('r, 'b) Core.Map.comparator ->
f:('v -> 'r) ->
'r option Incr.tval min_value :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('v, 'b) Core.Map.comparator ->
'v option Incr.tval max_value :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('v, 'b) Core.Map.comparator ->
'v option Incr.tval mapi_bounds :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('r, 'b) Core.Map.comparator ->
f:(key:'k -> data:'v -> 'r) ->
('r * 'r) option Incr.tval map_bounds :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('r, 'b) Core.Map.comparator ->
f:('v -> 'r) ->
('r * 'r) option Incr.tval value_bounds :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
comparator:('v, 'b) Core.Map.comparator ->
('v * 'v) option Incr.tval merge :
?data_equal_left:('v1 -> 'v1 -> bool) ->
?data_equal_right:('v2 -> 'v2 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
('k, 'v2, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> ('v1, 'v2) Core.Map.Merge_element.t -> 'v3 option) ->
('k, 'v3, 'cmp) Core.Map.t Incr.tval unzip :
?left_result_equal:('v1 -> 'v1 -> bool) ->
?right_result_equal:('v2 -> 'v2 -> bool) ->
('k, 'v1 * 'v2, 'cmp) Core.Map.t Incr.t ->
('k, 'v1, 'cmp) Core.Map.t Incr.t * ('k, 'v2, 'cmp) Core.Map.t Incr.tval unzip_mapi :
?data_equal:('v -> 'v -> bool) ->
?left_result_equal:('v1 -> 'v1 -> bool) ->
?right_result_equal:('v2 -> 'v2 -> bool) ->
('k, 'v, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> data:'v -> 'v1 * 'v2) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t * ('k, 'v2, 'cmp) Core.Map.t Incr.tval unzip_mapi' :
?cutoff:'v Incr.Cutoff.t ->
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> data:'v Incr.t -> 'v1 Incr.t * 'v2 Incr.t) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t * ('k, 'v2, 'cmp) Core.Map.t Incr.tval merge' :
?cutoff:('v1, 'v2) Core.Map.Merge_element.t Incr.Cutoff.t ->
?data_equal_left:('v1 -> 'v1 -> bool) ->
?data_equal_right:('v2 -> 'v2 -> bool) ->
('k, 'v1, 'cmp) Core.Map.t Incr.t ->
('k, 'v2, 'cmp) Core.Map.t Incr.t ->
f:(key:'k -> ('v1, 'v2) Core.Map.Merge_element.t Incr.t -> 'v3 option Incr.t) ->
('k, 'v3, 'cmp) Core.Map.t Incr.tval flatten :
('k, 'v Incr.t, 'cmp) Core.Map.t ->
('k, 'v, 'cmp) Core.Map.t Incr.tval join :
('k, 'v Incr.t, 'cmp) Core.Map.t Incr.t ->
('k, 'v, 'cmp) Core.Map.t Incr.tval separate :
('k, 'v, 'cmp) Core.Map.t Incr.t ->
data_equal:('v -> 'v -> bool) ->
('k, 'v Incr.t, 'cmp) Core.Map.t Incr.tval keys : ('k, 'v, 'c) Core.Map.t Incr.t -> ('k, 'c) Core.Set.t Incr.tval subrange :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'cmp) Core.Map.t Incr.t ->
('k Core.Maybe_bound.As_lower_bound.t * 'k Core.Maybe_bound.As_upper_bound.t)
option
Incr.t ->
('k, 'v, 'cmp) Core.Map.t Incr.tval subrange_by_rank :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'cmp) Core.Map.t Incr.t ->
(int Core.Maybe_bound.As_lower_bound.t
* int Core.Maybe_bound.As_upper_bound.t)
Incr.t ->
('k, 'v, 'cmp) Core.Map.t Incr.tval rekey :
?data_equal:('v -> 'v -> bool) ->
('k1, 'v, 'cmp1) Core.Map.t Incr.t ->
comparator:('k2, 'cmp2) Core.Map.comparator ->
f:(key:'k1 -> data:'v -> 'k2) ->
('k2, 'v, 'cmp2) Core.Map.t Incr.tval index_byi :
?data_equal:('v -> 'v -> bool) ->
('inner_key, 'v, 'inner_cmp) Core.Map.t Incr.t ->
comparator:('outer_key, 'outer_cmp) Core.Map.comparator ->
index:(key:'inner_key -> data:'v -> 'outer_key option) ->
('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t
Incr.tval index_by :
?data_equal:('v -> 'v -> bool) ->
('inner_key, 'v, 'inner_cmp) Core.Map.t Incr.t ->
comparator:('outer_key, 'outer_cmp) Core.Map.comparator ->
index:('v -> 'outer_key option) ->
('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t
Incr.tval unordered_fold_nested_maps :
?data_equal:('v -> 'v -> bool) ->
?revert_to_init_when_empty:bool ->
?update:
(outer_key:'outer_key ->
inner_key:'inner_key ->
old_data:'v ->
new_data:'v ->
'acc ->
'acc) ->
('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t
Incr.t ->
init:'acc ->
add:(outer_key:'outer_key -> inner_key:'inner_key -> data:'v -> 'acc -> 'acc) ->
remove:
(outer_key:'outer_key -> inner_key:'inner_key -> data:'v -> 'acc -> 'acc) ->
'acc Incr.tval transpose :
?data_equal:('v -> 'v -> bool) ->
('k2, 'k2_cmp) Core.Map.comparator ->
('k1, ('k2, 'v, 'k2_cmp) Core.Map.t, 'k1_cmp) Core.Map.t Incr.t ->
('k2, ('k1, 'v, 'k1_cmp) Core.Map.t, 'k2_cmp) Core.Map.t Incr.tval collapse :
?data_equal:('v -> 'v -> bool) ->
('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t
Incr.t ->
comparator:('inner_key, 'inner_cmp) Core.Map.comparator ->
('outer_key * 'inner_key,
'v,
('outer_cmp, 'inner_cmp) Core.Tuple2.comparator_witness)
Core.Map.t
Incr.tval collapse_by :
?data_equal:('v -> 'v -> bool) ->
('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t
Incr.t ->
merge_keys:('outer_key -> 'inner_key -> 'combined_key) ->
comparator:('combined_key, 'combined_cmp) Core.Map.comparator ->
('combined_key, 'v, 'combined_cmp) Core.Map.t Incr.tval expand :
?data_equal:('v -> 'v -> bool) ->
('outer_key * 'inner_key, 'v, 'tuple_cmp) Core.Map.t Incr.t ->
outer_comparator:('outer_key, 'outer_cmp) Core.Map.comparator ->
inner_comparator:('inner_key, 'inner_cmp) Core.Map.comparator ->
('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t
Incr.tval counti :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
f:(key:'k -> data:'v -> bool) ->
int Incr.tval count :
?data_equal:('v -> 'v -> bool) ->
('a, 'v, 'b) Core.Map.t Incr.t ->
f:('v -> bool) ->
int Incr.tval for_alli :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
f:(key:'k -> data:'v -> bool) ->
bool Incr.tval for_all :
?data_equal:('v -> 'v -> bool) ->
('a, 'v, 'b) Core.Map.t Incr.t ->
f:('v -> bool) ->
bool Incr.tval existsi :
?data_equal:('v -> 'v -> bool) ->
('k, 'v, 'a) Core.Map.t Incr.t ->
f:(key:'k -> data:'v -> bool) ->
bool Incr.tval exists :
?data_equal:('v -> 'v -> bool) ->
('a, 'v, 'b) Core.Map.t Incr.t ->
f:('v -> bool) ->
bool Incr.tval sum :
?data_equal:('v -> 'v -> bool) ->
('a, 'v, 'b) Core.Map.t Incr.t ->
(module Abstract_algebra.Commutative_group.Without_sexp with type t = 'u) ->
f:('v -> 'u) ->
'u Incr.tmodule Lookup : sig ... endmodule For_testing : sig ... end sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>