package ocaml-unikraft-arm64
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
OCaml cross compiler to the freestanding Unikraft arm64 backends
Install
dune-project
Dependency
Authors
Maintainers
Sources
v1.2.0.tar.gz
sha256=ca18a45ef86791d5ffa18436945fbec850b6f3dd68a6a62753b4cb1b6999b19a
doc/compiler-libs.common/Stable_matching/index.html
Module Stable_matching
module Item : sig ... endtype unstable_matching = {first : left_index * right_index;second : left_index * right_index;current_rank : rank * rank;optimal : rank * rank;
}val stable_matches :
distance:(int -> int -> int) ->
(_, int) matches ->
(unit, unstable_matching) Result.tval strong_stable_matches :
distance:(int -> int -> int) ->
(_, int) matches ->
(unit, unstable_matching) Result.tval matches :
compatible:(left_index -> right_index -> bool) ->
preferences:(right_index -> (left_index * rank) array) ->
size:(int * int) ->
(int, int) matchesmatches ~compatible ~preferences ~size:(ls,rs) computes a matching between a set of ls left items and rs right items favoring the right side. The matches are compatible and weakly stable according to the preferences matrix. The size of the matching is at least 2/3 of the optimal matching size (computing optimal matching with partial preferences and ties is in NP).
val fuzzy_match_names :
compatibility:('k -> 'k -> bool) ->
max_right_items:int ->
cutoff:(string -> int) ->
('v, 'k) Item.t list ->
('v, 'k) Item.t list ->
('v, 'k) item_matchesfuzzy_match_names ~compatibility ~max_right_item ~cutoff left right calls the matches function using the OSA edit distance to compute preferences with a cutoff function. To avoid quadratic complexity on large module size we limit the right side to the first max_right_item items
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>