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.0.tbz
sha256=9640f418cbacedb41d888908e99d3ad349d473c35876271acc9185d5c6ca1104
sha512=7353542380fcd419569fd729017ba592d817c284209033016c6921bd6bf0568fc51c8f47f88a82713bebbfacc9bdd841f512d984dd49c014632d27910089c935
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)"
>