package lsp
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
LSP protocol implementation in OCaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
jsonrpc-1.6.0.tbz
sha256=35e8c7341f8eb1fa39fb0f0e0701a7ed90b9a0bb89ccf84b7ed997cd258cbec3
sha512=c96a7a3ca845ec193e9edc4a74804a22d6e37efc852b54575011879bd2105e0df021408632219f542ca3ad85b36b5c8b72f2b417204d154d5f0dd0839535afa5
doc/lsp.stdune/Stdune/Monoid/index.html
Module Stdune.MonoidSource
This functor extends the basic definition of a monoid by adding a convenient operator synonym ( @ ) = combine, as well as derived functions reduce and map_reduce.
The string concatenation monoid with empty = "" and combine = ( ^ ).
The list monoid with empty = [] and combine = ( @ ).
The list monoid with empty = [] and combine = ( @ ).
The addition monoid with empty = zero and combine = ( + ).
The multiplication monoid with empty = one and combine = ( * ).
The union monoid with empty = M.empty and combine = M.union.
The product of monoids where pairs are combined component-wise.
Same as Product but for 3 monoids.
Functions that return a monoid form the following monoid:
Endofunctions, i.e., functions of type t -> t form the following monoid:
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>