package lsp
LSP protocol implementation in OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
jsonrpc-1.4.1.tbz
sha256=cee8371e7048e24c90e916c373ef6f3aba6f474d8a5fcf507ab6650fd8575eeb
sha512=150ebf71d3484d3beec1a145877cf30d84581bd072dd20159e878ed07cc4fc647b019b98bb0c9fede839b87f7bd13de4a64b534c0760a2ec57d0e4a4deac6f0f
doc/src/lsp.stdune/result.ml.html
Source file result.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 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132
type ('a, 'error) t = ('a, 'error) result = | Ok of 'a | Error of 'error let ok x = Ok x let return = ok let is_ok = function | Ok _ -> true | Error _ -> false let is_error = function | Ok _ -> false | Error _ -> true let ok_exn = function | Ok x -> x | Error e -> raise e let try_with f = match f () with | s -> Ok s | exception e -> Error e let bind t ~f = match t with | Ok x -> f x | Error _ as t -> t let ( >>= ) x f = bind x ~f let map x ~f = match x with | Ok x -> Ok (f x) | Error _ as x -> x let map_error x ~f = match x with | Ok _ as res -> res | Error x -> Error (f x) let iter t ~f = match t with | Ok x -> f x | Error _ -> () let to_option = function | Ok p -> Some p | Error _ -> None let errorf fmt = Printf.ksprintf (fun x -> Error x) fmt let both a b = match a with | Error e -> Error e | Ok a -> ( match b with | Error e -> Error e | Ok b -> Ok (a, b) ) module O = struct let ( >>= ) t f = bind t ~f let ( >>| ) t f = map t ~f let ( let* ) = ( >>= ) let ( let+ ) = ( >>| ) let ( and+ ) = both end open O type ('a, 'error) result = ('a, 'error) t module List = struct let map t ~f = let rec loop acc = function | [] -> Ok (List.rev acc) | x :: xs -> f x >>= fun x -> loop (x :: acc) xs in loop [] t let all = let rec loop acc = function | [] -> Ok (List.rev acc) | t :: l -> t >>= fun x -> loop (x :: acc) l in fun l -> loop [] l let concat_map = let rec loop f acc = function | [] -> Ok (List.rev acc) | x :: l -> f x >>= fun y -> loop f (List.rev_append y acc) l in fun l ~f -> loop f [] l let rec iter t ~f = match t with | [] -> Ok () | x :: xs -> f x >>= fun () -> iter xs ~f let rec fold_left t ~f ~init = match t with | [] -> Ok init | x :: xs -> f init x >>= fun init -> fold_left xs ~f ~init end let hash h1 h2 t = Stdlib.Hashtbl.hash ( match t with | Ok s -> h1 s | Error e -> h2 e ) let equal e1 e2 x y = match (x, y) with | Ok x, Ok y -> e1 x y | Error x, Error y -> e2 x y | _, _ -> false module Option = struct let iter t ~f = match t with | None -> Ok () | Some x -> x >>= f end let to_dyn ok err = function | Ok e -> Dyn.Encoder.constr "Ok" [ ok e ] | Error e -> Dyn.Encoder.constr "Error" [ err e ]
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>