package ocaml-solo5
Build not yet checked sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
OCaml cross-compiler to the freestanding Solo5 backend
Install
dune-project
Dependency
Authors
Maintainers
Sources
v1.3.5.tar.gz
md5=ea2abfe4436990ed71c823b212c78a0f
sha512=a0b048a9fb97e8fb0902ba9e9f76818dd9a250001b8f35d08eb5df52f4e978aa74ea3fc149ad5270a595431b68e574adf97762954f5e2a0b3661490357737774
doc/stdlib/Stdlib/MoreLabels/Map/index.html
Module MoreLabels.MapSource
Association tables over ordered types.
This module implements applicative association tables, also known as finite maps or dictionaries, given a total ordering function over the keys. All operations over maps are purely applicative (no side-effects). The implementation uses balanced binary trees, and therefore searching and insertion take time logarithmic in the size of the map.
For instance:
module IntPairs =
struct
type t = int * int
let compare (x0,y0) (x1,y1) =
match Stdlib.compare x0 x1 with
0 -> Stdlib.compare y0 y1
| c -> c
end
module PairsMap = Map.Make(IntPairs)
let m = PairsMap.(empty |> add (0,1) "hello" |> add (1,0) "world")This creates a new module PairsMap, with a new type 'a PairsMap.t of maps from int * int to 'a. In this example, m contains string values so its type is string PairsMap.t.
Input signature of the functor Make.
Functor building an implementation of the map structure given a totally ordered type.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>