package piaf
An HTTP library with HTTP/2 support written entirely in OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
piaf-0.2.0.tbz
sha256=07fa9009a52faeaae6d86116e75007f5279b185c7bc7c95aab9455f2107370fb
sha512=dfde4bd0a5c8a3b795a8e3d6f6e1f9f1864a9eb0a1b96763c17515d771566af7623ca64db671a8dce2c7838dad08d8465db98f5e4f8dcf5e1a386ef5b29da56c
doc/src/piaf.stream/piaf_stream.ml.html
Source file piaf_stream.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 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156
(*---------------------------------------------------------------------------- * Copyright (c) 2022, António Nuno Monteiro * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * 3. Neither the name of the copyright holder nor the names of its * contributors may be used to endorse or promote products derived from * this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. *---------------------------------------------------------------------------*) open Eio.Std type 'a kind = | From of (unit -> 'a option) | Push of { stream : 'a Eio.Stream.t ; capacity : int } type 'a t = { stream : 'a kind ; is_closed : bool Atomic.t ; closed : unit Promise.t * unit Promise.u } let unsafe_eio_stream { stream; _ } = match stream with From _ -> assert false | Push { stream; _ } -> stream let is_closed { is_closed; _ } = Atomic.get is_closed let close t = if not (is_closed t) then ( let { closed = _, u; _ } = t in Atomic.set t.is_closed true; Promise.resolve u ()) let push t item = let stream = unsafe_eio_stream t in match item with Some item -> Eio.Stream.add stream item | None -> close t let create capacity = let stream = Eio.Stream.create capacity in let t = { stream = Push { stream; capacity } ; is_closed = Atomic.make false ; closed = Promise.create () } in t, push t let empty () = let t, _ = create 0 in close t; t let from ~f = { stream = From f; is_closed = Atomic.make false; closed = Promise.create () } let closed t = let { closed = p, _; _ } = t in p let when_closed ~f t = Promise.await (closed t); f () let of_list xs = let stream, _push = create (List.length xs) in List.iter (Eio.Stream.add (unsafe_eio_stream stream)) xs; (* TODO(anmonteiro): should this return a closed stream? *) stream let take t = match t.stream with | From f -> (match f () with | Some _ as item -> item | None -> close t; None) | Push { capacity = 0; _ } -> None | Push { stream; _ } -> Fiber.first (fun () -> Some (Eio.Stream.take stream)) (fun () -> let { closed = p, _; _ } = t in Promise.await p; None) let take_nonblocking t = match t.stream with | From _f -> None | Push { stream; _ } -> Eio.Stream.take_nonblocking stream let map ~f t = from ~f:(fun () -> match take t with Some item -> Some (f item) | None -> None) let rec iter ~f t = match t.stream with | Push { capacity = 0; _ } when is_closed t -> () | Push _ | From _ -> (match take t with | Some item -> f item; iter ~f t | None -> ()) let rec iter_p ~sw ~f t = match t.stream with | Push { capacity = 0; _ } when is_closed t -> () | Push _ | From _ -> (match take t with | Some item -> let result = Fiber.fork_promise ~sw (fun () -> f item) and rest = Fiber.fork_promise ~sw (fun () -> iter_p ~sw ~f t) in Promise.await_exn result; Promise.await_exn rest | None -> ()) let fold ~f ~init t = let rec loop ~f ~acc t = match take t with Some item -> loop ~f ~acc:(f acc item) t | None -> acc in loop ~f ~acc:init t let to_list t = let lst = fold ~f:(fun acc item -> item :: acc) ~init:[] t in List.rev lst let drain t = iter ~f:ignore t let rec drain_available t = match take_nonblocking t with Some _ -> drain_available t | None -> ()
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>