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/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)"
>