package lsp
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
sha256=8bf1516829f8dcace133f21f633a275a1d9fdcc59339e0359c67b7b02e9ee6c6
sha512=1f8099b3b085ef0e58317802b180d7321e25a1393034c6cb9fe7b9158baee9868113751111a82352b236e1b3b1078188d2ed40b6316d230f3c81c5b69b5ad872
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 monoid you get with empty = false and combine = ( || ).
The monoid you get with empty = true and combine = ( && ).
The string concatenation monoid with empty = "" and combine = ( ^ ).
The list monoid with empty = [] and combine = ( @ ).
The list monoid with empty = [] and combine = ( @ ).
The trivial 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.
module Product3
(A : sig ... end)
(B : sig ... end)
(C : sig ... end) :
S with type t = A.t * B.t * C.tSame as Product but for 3 monoids.
Functions that return a monoid form the following monoid:
Endofunctions, i.e., functions of type t -> t, form two monoids.