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.3.tbz
sha256=a3ac1073b0728b94f4bdb0111772c0abaf7ff70324399450eab7156bfac151f1
sha512=bed6ddbde28088e43db0d40ab27056ba22537d19ffe8117a3da4c77676948f18708b06937dd2c972dce5c5822ea751c9c85cfa1ce3c1b3739460d4a24ebc2282
doc/src/lsp.stdune/set_intf.ml.html
Source file set_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 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
# 1 "submodules/dune/otherlibs/stdune/set_intf.ml" module type S = sig type elt type t type 'a map val empty : t val is_empty : t -> bool val mem : t -> elt -> bool val add : t -> elt -> t val singleton : elt -> t val remove : t -> elt -> t val union : t -> t -> t val inter : t -> t -> t val diff : t -> t -> t val compare : t -> t -> Ordering.t val equal : t -> t -> bool val is_subset : t -> of_:t -> bool val iter : t -> f:(elt -> unit) -> unit val map : t -> f:(elt -> elt) -> t val fold : t -> init:'a -> f:(elt -> 'a -> 'a) -> 'a val for_all : t -> f:(elt -> bool) -> bool val exists : t -> f:(elt -> bool) -> bool val filter : t -> f:(elt -> bool) -> t val partition : t -> f:(elt -> bool) -> t * t val cardinal : t -> int val min_elt : t -> elt option val max_elt : t -> elt option val choose : t -> elt option val choose_exn : t -> elt val split : t -> elt -> t * bool * t val of_list : elt list -> t val of_list_map : 'a list -> f:('a -> elt) -> t val to_list : t -> elt list val to_seq : t -> elt Seq.t (** Convert to a list and map every element. *) val to_list_map : t -> f:(elt -> 'a) -> 'a list val find : t -> f:(elt -> bool) -> elt option val union_all : t list -> t val union_map : 'a list -> f:('a -> t) -> t val to_dyn : t -> Dyn.t val of_keys : _ map -> t val to_map : t -> f:(elt -> 'a) -> 'a map end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>