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.4.tar.gz
md5=9316f8bce6e8b7a2c83aaab31d3326dc
sha512=489e082866fd7db77248cb7e3a5d0a7e5af6c3390c9b27b317cce9bb3a48f26e6a05d1d55a662a181b5dcbeeec59aded5d0f08bd33c0ee8554655c5cad69a782
doc/src/mm.image/imageBase.ml.html
Source file imageBase.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 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217
(* * 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. * *) exception Invalid_position exception Invalid_dimensions module List = struct include List let rec iter_right f = function | x :: l -> iter_right f l; f x | [] -> () end module Data = struct type t = (int, Bigarray.int8_unsigned_elt, Bigarray.c_layout) Bigarray.Array1.t (* Creates an 16-bytes aligned plane. Returns (stride*plane). *) (* external create_rounded_plane : int -> int -> int * t = "caml_data_aligned_plane" *) let alloc n = Bigarray.Array1.create Bigarray.int8_unsigned Bigarray.C_layout n (** [round n k] rounds [n] to the nearest upper multiple of [k]. *) let round k n = (n + (k - 1)) / k * k (** [aligned k n] allocates [n] bytes at a multiple of [k]. *) external aligned : int -> int -> t = "caml_data_aligned" (* Creates an 16-bytes aligned plane. Returns (stride*plane). *) let rounded_plane width height = let align = 16 in let stride = round 16 width in let data = aligned align (height * stride) in (stride, data) external to_string : t -> string = "caml_data_to_string" external to_bytes : t -> bytes = "caml_data_to_string" external of_string : string -> t = "caml_data_of_string" let blit_all src dst = Bigarray.Array1.blit src dst external blit : t -> int -> t -> int -> int -> unit = "caml_data_blit_off" (* [@@noalloc] *) external copy : t -> t = "caml_data_copy" let sub buf ofs len = Bigarray.Array1.sub buf ofs len let length img = Bigarray.Array1.dim img let size img = length img let get = Bigarray.Array1.get let fill buf x = Bigarray.Array1.fill buf x end module Pixel = struct type rgba = int * int * int * int type rgb = int * int * int type yuv = int * int * int type yuva = (int * int * int) * int module RGBA = struct type t = RGBA let black = (0, 0, 0, 0xff) let white = (0xff, 0xff, 0xff, 0xff) let transparent = (0, 0, 0, 0) end external yuv_of_rgb : rgb -> yuv = "caml_yuv_of_rgb" external rgb_of_yuv : yuv -> rgb = "caml_rgb_of_yuv" end module Point = struct type t = int * int let min (x, y) (x', y') = (min x x', min y y') let max (x, y) (x', y') = (max x x', max y y') let lt (x, y) (x', y') = x < x' && y < y' let le (x, y) (x', y') = x <= x' && y <= y' let neg (x, y) = (-x, -y) end module Fraction = struct type t = int * int let min (a, b) (a', b') = if a * b' < a' * b then (a, b) else (a', b') end module Draw = struct (* Besenham algorithm. *) let line p (sx, sy) (dx, dy) = let steep = abs (dy - sy) > abs (dx - sx) in let sx, sy, dx, dy = if steep then (sy, sx, dy, dx) else (sx, sy, dx, dy) in let sx, sy, dx, dy = if sx > dx then (dx, dy, sx, sy) else (sx, sy, dx, dy) in let deltax = dx - sx in let deltay = abs (dy - sy) in let error = ref (deltax / 2) in let ystep = if sy < dy then 1 else -1 in let j = ref sy in for i = sx to dx - 1 do if steep then p !j i else p i !j; error := !error - deltay; if !error < 0 then ( j := !j + ystep; error := !error + deltax) done end module Motion_multi = struct type vectors_data = (int, Bigarray.nativeint_elt, Bigarray.c_layout) Bigarray.Array1.t type vectors = { vectors : vectors_data; vectors_width : int; block_size : int; } external median_denoise : int -> vectors_data -> unit = "caml_rgb_motion_multi_median_denoise" let median_denoise v = median_denoise v.vectors_width v.vectors external mean : int -> vectors_data -> int * int = "caml_rgb_motion_multi_mean" let mean v = mean v.vectors_width v.vectors end module RGB8 = struct module Color = struct type t = int * int * int let of_int n = if n land lnot 0xffffff <> 0 then raise (Invalid_argument "Not a color"); ((n lsr 16) land 0xff, (n lsr 8) land 0xff, n land 0xff) let to_int (r, g, b) = (r lsl 16) + (g lsl 8) + b end end module ARGB8 = struct module Color = struct type t = int * RGB8.Color.t let of_int n : t = (n lsr 24, RGB8.Color.of_int (n land 0xffffff)) end end module Gray8 = struct (* TODO: stride ? *) type t = { data : Data.t; width : int } let make w d = { data = d; width = w } (* Don't use create_rounded_plane here since there is not stride.. *) let create w h = make w (Bigarray.Array1.create Bigarray.int8_unsigned Bigarray.c_layout (w * h)) module Motion = struct external compute : int -> int -> Data.t -> Data.t -> int * int = "caml_mm_Gray8_motion_compute" let compute bs o n = compute bs n.width o.data n.data module Multi = struct include Motion_multi external compute : int -> int -> Data.t -> Data.t -> vectors_data = "caml_mm_Gray8_motion_multi_compute" let compute bs o n = { vectors = compute bs n.width o.data n.data; vectors_width = n.width / bs; block_size = bs; } end end end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>