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.2.tbz
sha256=8bf1516829f8dcace133f21f633a275a1d9fdcc59339e0359c67b7b02e9ee6c6
sha512=1f8099b3b085ef0e58317802b180d7321e25a1393034c6cb9fe7b9158baee9868113751111a82352b236e1b3b1078188d2ed40b6316d230f3c81c5b69b5ad872
doc/lsp.ordering/Ordering/O/index.html
Module Ordering.O
Source
A convenient operator for efficiently chaining multiple comparisons together. For example, you can write
let compare { x; y; z } t = let open Ordering.O in let= () = compare_x x t.x in let= () = compare_y y t.y in compare_z z t.z
or, a bit less compactly but more symmetrically
let compare { x; y; z } t = let open Ordering.O in let= () = compare_x x t.x in let= () = compare_y y t.y in let= () = compare_z z t.z in Eq
to chain three comparisons instead of the usual triply nested match
.
Note that the resulting code can be up to 2x slower than nested match
ing due to extra allocations that we are unable to eliminate (as of Nov 2021), so you should use let=
only where appropriate.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>