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.stdune/Stdune/Loc/Map/index.html
Module Loc.Map
Source
Like union
but raises a code error if a key appears in both maps.
superpose a b
is b
augmented with bindings of a
that are not in b
.
Return a map of (k, v)
bindings such that:
v = f init @@ f v1 @@ fv2 @@ ... @@ f vn
where v1
, v2
, ... vn
are the values associated to k
in the input list, in the order in which they appear. This is essentially a more efficient version of:
of_list_multi l |> map ~f:(List.fold_left ~init ~f)
is_subset t ~of_ ~f
is true
iff all keys in t
are in of_
and f
is true
for all keys that are in both.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>