package core

  1. Overview
  2. Docs
package core
Legend:
Library
Module
Module type
Parameter
Class
Class type
val names : Base.String.t Base.List.t
val stack_size : (t, Base.Int.t) Fieldslib.Field.t
val top_heap_words : (t, Base.Int.t) Fieldslib.Field.t
val compactions : (t, Base.Int.t) Fieldslib.Field.t
val fragments : (t, Base.Int.t) Fieldslib.Field.t
val largest_free : (t, Base.Int.t) Fieldslib.Field.t
val free_blocks : (t, Base.Int.t) Fieldslib.Field.t
val free_words : (t, Base.Int.t) Fieldslib.Field.t
val live_blocks : (t, Base.Int.t) Fieldslib.Field.t
val live_words : (t, Base.Int.t) Fieldslib.Field.t
val heap_chunks : (t, Base.Int.t) Fieldslib.Field.t
val heap_words : (t, Base.Int.t) Fieldslib.Field.t
val major_collections : (t, Base.Int.t) Fieldslib.Field.t
val minor_collections : (t, Base.Int.t) Fieldslib.Field.t
val major_words : (t, Base.Float.t) Fieldslib.Field.t
val promoted_words : (t, Base.Float.t) Fieldslib.Field.t
val minor_words : (t, Base.Float.t) Fieldslib.Field.t
val fold : init:'acc__0 -> minor_words:('acc__0 -> (t, Base.Float.t) Fieldslib.Field.t -> 'acc__1) -> promoted_words:('acc__1 -> (t, Base.Float.t) Fieldslib.Field.t -> 'acc__2) -> major_words:('acc__2 -> (t, Base.Float.t) Fieldslib.Field.t -> 'acc__3) -> minor_collections:('acc__3 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__4) -> major_collections:('acc__4 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__5) -> heap_words:('acc__5 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__6) -> heap_chunks:('acc__6 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__7) -> live_words:('acc__7 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__8) -> live_blocks:('acc__8 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__9) -> free_words:('acc__9 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__10) -> free_blocks:('acc__10 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__11) -> largest_free:('acc__11 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__12) -> fragments:('acc__12 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__13) -> compactions:('acc__13 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__14) -> top_heap_words:('acc__14 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__15) -> stack_size:('acc__15 -> (t, Base.Int.t) Fieldslib.Field.t -> 'acc__16) -> 'acc__16
val make_creator : minor_words: ((t, Base.Float.t) Fieldslib.Field.t -> 'acc__0 -> ('input__ -> Base.Float.t) * 'acc__1) -> promoted_words: ((t, Base.Float.t) Fieldslib.Field.t -> 'acc__1 -> ('input__ -> Base.Float.t) * 'acc__2) -> major_words: ((t, Base.Float.t) Fieldslib.Field.t -> 'acc__2 -> ('input__ -> Base.Float.t) * 'acc__3) -> minor_collections: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__3 -> ('input__ -> Base.Int.t) * 'acc__4) -> major_collections: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__4 -> ('input__ -> Base.Int.t) * 'acc__5) -> heap_words: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__5 -> ('input__ -> Base.Int.t) * 'acc__6) -> heap_chunks: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__6 -> ('input__ -> Base.Int.t) * 'acc__7) -> live_words: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__7 -> ('input__ -> Base.Int.t) * 'acc__8) -> live_blocks: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__8 -> ('input__ -> Base.Int.t) * 'acc__9) -> free_words: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__9 -> ('input__ -> Base.Int.t) * 'acc__10) -> free_blocks: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__10 -> ('input__ -> Base.Int.t) * 'acc__11) -> largest_free: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__11 -> ('input__ -> Base.Int.t) * 'acc__12) -> fragments: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__12 -> ('input__ -> Base.Int.t) * 'acc__13) -> compactions: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__13 -> ('input__ -> Base.Int.t) * 'acc__14) -> top_heap_words: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__14 -> ('input__ -> Base.Int.t) * 'acc__15) -> stack_size: ((t, Base.Int.t) Fieldslib.Field.t -> 'acc__15 -> ('input__ -> Base.Int.t) * 'acc__16) -> 'acc__0 -> ('input__ -> t) * 'acc__16
val create : minor_words:Base.Float.t -> promoted_words:Base.Float.t -> major_words:Base.Float.t -> minor_collections:Base.Int.t -> major_collections:Base.Int.t -> heap_words:Base.Int.t -> heap_chunks:Base.Int.t -> live_words:Base.Int.t -> live_blocks:Base.Int.t -> free_words:Base.Int.t -> free_blocks:Base.Int.t -> largest_free:Base.Int.t -> fragments:Base.Int.t -> compactions:Base.Int.t -> top_heap_words:Base.Int.t -> stack_size:Base.Int.t -> t
val map : minor_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Float.t) -> promoted_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Float.t) -> major_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Float.t) -> minor_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> major_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> heap_chunks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> live_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> live_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> free_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> free_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> largest_free:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> fragments:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> compactions:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> top_heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> stack_size:((t, Base.Int.t) Fieldslib.Field.t -> Base.Int.t) -> t
val iter : minor_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Unit.t) -> promoted_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Unit.t) -> major_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Unit.t) -> minor_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> major_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> heap_chunks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> live_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> live_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> free_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> free_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> largest_free:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> fragments:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> compactions:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> top_heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> stack_size:((t, Base.Int.t) Fieldslib.Field.t -> Base.Unit.t) -> Base.Unit.t
val for_all : minor_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Bool.t) -> promoted_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Bool.t) -> major_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Bool.t) -> minor_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> major_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> heap_chunks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> live_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> live_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> free_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> free_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> largest_free:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> fragments:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> compactions:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> top_heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> stack_size:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> Base.Bool.t
val exists : minor_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Bool.t) -> promoted_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Bool.t) -> major_words:((t, Base.Float.t) Fieldslib.Field.t -> Base.Bool.t) -> minor_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> major_collections:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> heap_chunks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> live_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> live_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> free_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> free_blocks:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> largest_free:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> fragments:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> compactions:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> top_heap_words:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> stack_size:((t, Base.Int.t) Fieldslib.Field.t -> Base.Bool.t) -> Base.Bool.t
val to_list : minor_words:((t, Base.Float.t) Fieldslib.Field.t -> 'elem__) -> promoted_words:((t, Base.Float.t) Fieldslib.Field.t -> 'elem__) -> major_words:((t, Base.Float.t) Fieldslib.Field.t -> 'elem__) -> minor_collections:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> major_collections:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> heap_words:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> heap_chunks:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> live_words:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> live_blocks:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> free_words:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> free_blocks:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> largest_free:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> fragments:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> compactions:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> top_heap_words:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> stack_size:((t, Base.Int.t) Fieldslib.Field.t -> 'elem__) -> 'elem__ Base.List.t
val map_poly : ([< `Read | `Set_and_create ], t, 'x0) Fieldslib.Field.user -> 'x0 Base.List.t
module Direct : sig ... end
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct