package mm
The mm library contains high-level APIs to create and manipulate multimedia streams (audio, video, MIDI)
Install
Dune Dependency
Authors
Maintainers
Sources
v0.8.6.tar.gz
md5=003b6e873fe6158dda4627bb674fb57b
sha512=c486e8eaa5dd25a2629c9486c4048ffa2cdeae9e56f73bc8d01a86413038dd3473ebd383abb06f08a2a24a78a335f22aede98ac92436e42a9c6eb1a856f92dab
doc/src/mm.base/ringbuffer.ml.html
Source file ringbuffer.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 157 158 159 160
(* * Copyright 2011 The Savonet Team * * This file is part of ocaml-mm. * * ocaml-mm is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * ocaml-mm is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with ocaml-mm; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * As a special exception to the GNU Library General Public License, you may * link, statically or dynamically, a "work that uses the Library" with a publicly * distributed version of the Library to produce an executable file containing * portions of the Library, and distribute that executable file under terms of * your choice, without any of the additional requirements listed in clause 6 * of the GNU Library General Public License. * By "a publicly distributed version of the Library", we mean either the unmodified * Library as distributed by The Savonet Team, or a modified version of the Library that is * distributed under the conditions defined in clause 3 of the GNU Library General * Public License. This exception does not however invalidate any other reasons why * the executable file might be covered by the GNU Library General Public License. * *) module type Buffer = sig type t val create : int -> t val blit : t -> int -> t -> int -> int -> unit end module type R = sig type buffer type t val create : int -> t val read_space : t -> int val write_space : t -> int val read_advance : t -> int -> unit val write_advance : t -> int -> unit val read : t -> buffer -> int -> int -> unit val peek : t -> buffer -> int -> int -> unit val write : t -> buffer -> int -> int -> unit val transmit : t -> (buffer -> int -> int -> int) -> int end module Make (B : Buffer) = struct type buffer = B.t type t = { size : int; buffer : buffer; mutable rpos : int; (** current read position *) mutable wpos : int; (** current write position *) } let create size = { (* size + 1 so we can store full buffers, while keeping rpos and wpos different for implementation matters *) size = size + 1; buffer = B.create (size + 1); rpos = 0; wpos = 0; } let read_space t = if t.wpos >= t.rpos then t.wpos - t.rpos else t.size - (t.rpos - t.wpos) let write_space t = if t.wpos >= t.rpos then t.size - (t.wpos - t.rpos) - 1 else t.rpos - t.wpos - 1 let read_advance t n = assert (n <= read_space t); if t.rpos + n < t.size then t.rpos <- t.rpos + n else t.rpos <- t.rpos + n - t.size let write_advance t n = assert (n <= write_space t); if t.wpos + n < t.size then t.wpos <- t.wpos + n else t.wpos <- t.wpos + n - t.size let peek t buff off len = assert (len <= read_space t); let pre = t.size - t.rpos in let extra = len - pre in if extra > 0 then ( B.blit t.buffer t.rpos buff off pre; B.blit t.buffer 0 buff (off + pre) extra) else B.blit t.buffer t.rpos buff off len let read t buff off len = peek t buff off len; read_advance t len let write t buff off len = assert (len <= write_space t); let pre = t.size - t.wpos in let extra = len - pre in if extra > 0 then ( B.blit buff off t.buffer t.wpos pre; B.blit buff (off + pre) t.buffer 0 extra) else B.blit buff off t.buffer t.wpos len; write_advance t len let transmit t f = if t.wpos = t.rpos then 0 else ( let len0 = if t.wpos >= t.rpos then t.wpos - t.rpos else t.size - t.rpos in let len = f t.buffer t.rpos len0 in assert (len <= len0); read_advance t len; len) end module Make_ext (B : Buffer) = struct module R = Make (B) type buffer = R.buffer type t = { mutable ringbuffer : R.t } let prepare buf len = if R.write_space buf.ringbuffer >= len then buf.ringbuffer else ( let rb = R.create (R.read_space buf.ringbuffer + len) in while R.read_space buf.ringbuffer <> 0 do ignore (R.transmit buf.ringbuffer (fun buf ofs len -> R.write rb buf ofs len; len)) done; buf.ringbuffer <- rb; rb) let peek rb = R.peek rb.ringbuffer let read rb = R.read rb.ringbuffer let write rb buf ofs len = let rb = prepare rb len in R.write rb buf ofs len let transmit rb = R.transmit rb.ringbuffer let read_space rb = R.read_space rb.ringbuffer let write_space rb = R.write_space rb.ringbuffer let read_advance rb = R.read_advance rb.ringbuffer let write_advance rb = R.write_advance rb.ringbuffer let create len = { ringbuffer = R.create len } end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>