val iter : t -> minor_heap_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) ->
major_heap_increment:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) ->
space_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) -> verbose:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) ->
max_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) -> stack_limit:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) ->
allocation_policy:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) -> window_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) ->
custom_major_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) ->
custom_minor_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) ->
custom_minor_max_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Unit.t) -> Base.Unit.t
val fold : t -> init:'acc__0 ->
minor_heap_size:('acc__0 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__1) ->
major_heap_increment:('acc__1 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__2) ->
space_overhead:('acc__2 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__3) ->
verbose:('acc__3 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__4) ->
max_overhead:('acc__4 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__5) ->
stack_limit:('acc__5 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__6) ->
allocation_policy:('acc__6 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__7) ->
window_size:('acc__7 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__8) ->
custom_major_ratio:('acc__8 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__9) ->
custom_minor_ratio:('acc__9 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__10) ->
custom_minor_max_size:('acc__10 -> (t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'acc__11) -> 'acc__11
val for_all : t -> minor_heap_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
major_heap_increment:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
space_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> verbose:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
max_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> stack_limit:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
allocation_policy:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> window_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
custom_major_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
custom_minor_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
custom_minor_max_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> Base.Bool.t
val exists : t -> minor_heap_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
major_heap_increment:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
space_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> verbose:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
max_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> stack_limit:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
allocation_policy:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> window_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
custom_major_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
custom_minor_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) ->
custom_minor_max_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Bool.t) -> Base.Bool.t
val to_list : t -> minor_heap_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
major_heap_increment:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
space_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
verbose:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
max_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
stack_limit:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
allocation_policy:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
window_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
custom_major_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
custom_minor_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) ->
custom_minor_max_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> 'elem__) -> 'elem__ Base.List.t
val map : t -> minor_heap_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) ->
major_heap_increment:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) ->
space_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) -> verbose:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) ->
max_overhead:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) -> stack_limit:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) ->
allocation_policy:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) -> window_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) ->
custom_major_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) ->
custom_minor_ratio:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) ->
custom_minor_max_size:((t, Base.Int.t) Fieldslib.Field.t -> t -> Base.Int.t -> Base.Int.t) -> t