package lsp
LSP protocol implementation in OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
jsonrpc-1.6.1.tbz
sha256=bccc0d7194714a4c40c362766ad9095d3c58505a1d4f1dc4becd9b3d1bda8209
sha512=199bee8c74aec6822bc83bf9a7c3757206bdaa55a19cd1f5cf480127618a078baa1e917f6a90a6135a5277e4eb87977e685c10e6503f546997e6b985949e190f
doc/src/lsp.stdune/monoid_intf.ml.html
Source file monoid_intf.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
# 1 "submodules/dune/otherlibs/stdune-unstable/monoid_intf.ml" (** A type of values with an associative operation and an identity element, for example, integers with addition and zero. This module type is accessible as [Stdune.Monoid.Basic] outside of [Stdune]. *) module type Basic = sig type t (** Must be the identity of [combine]: - combine empty t = t - combine t empty = t *) val empty : t (** Must be associative: - combine a (combine b c) = combine (combine a b) c *) val combine : t -> t -> t end (** This module type extends the basic definition of a monoid by adding a convenient operator synonym [( @ ) = combine], as well as derived functions [reduce] and [map_reduce]. This module type is accessible as just [Stdune.Monoid] outside of [Stdune]. *) module type S = sig include Basic module O : sig (** An operator alias for [combine]. *) val ( @ ) : t -> t -> t end val reduce : t list -> t val map_reduce : f:('a -> t) -> 'a list -> t end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>