package ocaml-compiler

  1. Overview
  2. Docs
Official release of OCaml 5.5.0

Install 

dune-project
 Dependency

ocaml.org Edit opam file Versions (17)

Authors

  1. Xavier Leroy
  2. Damien Doligez
  3. Alain Frisch
  4. Jacques Garrigue
  5. Didier Rémy
  6. K
    KC Sivaramakrishnan
  7. J
    Jérôme Vouillon

Maintainers

  1. David Allsopp
  2. F
    Florian Angeletti <florian.angeletti@inria.fr>

Sources

ocaml-5.5.0.tar.gz
sha256=c018052c8264a3791a8f54f84179e6bcc78ed82eb889bacc2773df445259aed3

doc/compiler-libs.common/Stable_matching/index.html

Module Stable_matching

module Item : sig ... end
type left_index = int
type right_index = int
type rank = int
type ('a, 'v) matches = {
  1. left : 'a list;
  2. pairs : ('v * 'v) list;
  3. right : 'a list;
}
type ('v, 'k) item_matches = (('v, 'k) Item.t, 'v) matches
type unstable_matching = {
  1. first : left_index * right_index;
  2. second : left_index * right_index;
  3. current_rank : rank * rank;
  4. optimal : rank * rank;
}
val stable_matches : distance:(int -> int -> int) -> (_, int) matches -> (unit, unstable_matching) Result.t
val strong_stable_matches : distance:(int -> int -> int) -> (_, int) matches -> (unit, unstable_matching) Result.t
val matches : compatible:(left_index -> right_index -> bool) -> preferences:(right_index -> (left_index * rank) array) -> size:(int * int) -> (int, int) matches

matches ~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_matches

fuzzy_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