package lsp
LSP protocol implementation in OCaml
Install
Dune Dependency
Authors
-
AAndrey Popp <8mayday@gmail.com>
-
RRusty Key <iam@stfoo.ru>
-
LLouis Roché <louis@louisroche.net>
-
OOleksiy Golovko <alexei.golovko@gmail.com>
-
RRudi Grinberg <me@rgrinberg.com>
-
SSacha Ayoun <sachaayoun@gmail.com>
-
Ccannorin <cannorin@gmail.com>
-
UUlugbek Abdullaev <ulugbekna@gmail.com>
-
Thibaut Mattio
-
MMax Lantas <mnxndev@outlook.com>
Maintainers
Sources
jsonrpc-1.10.1.tbz
sha256=23006064074617974a7237443f4db6234e305b3b74eb7134bf870499cb59aafe
sha512=f6925524a9c947c104cf2b054dae118186f4c559c572fec1426bdbdc33cfc5c8e097581ad82c52f0872f8c5721852d96cff86fd66abf452350cb1d04f2f2110d
doc/src/lsp.ordering/ordering.ml.html
Source file ordering.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
# 1 "submodules/dune/otherlibs/ordering/ordering.ml" type t = | Lt | Eq | Gt let of_int n = if n < 0 then Lt else if n = 0 then Eq else Gt let to_int = function | Lt -> -1 | Eq -> 0 | Gt -> 1 let to_string = function | Lt -> "<" | Eq -> "=" | Gt -> ">" let is_eq = function | Eq -> true | Lt | Gt -> false let min f x y = match f x y with | Eq | Lt -> x | Gt -> y let max f x y = match f x y with | Eq | Gt -> x | Lt -> y module O = struct let ( let= ) t f = match t with | (Lt | Gt) as result -> result | Eq -> f () end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>