package batteries
A community-maintained standard library extension
Install
Dune Dependency
Authors
Maintainers
Sources
v3.9.0.tar.gz
md5=ea26b5c72e6731e59d856626049cca4d
sha512=55975b62c26f6db77433a3ac31f97af609fc6789bb62ac38b267249c78fd44ff37fe81901f1cf560857b9493a6046dd37b0d1c0234c66bd59e52843aac3ce6cb
doc/src/batteries.unthreaded/batNumber.ml.html
Source file batNumber.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 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288
(* * Number - Generic interface for numbers * Copyright (C) 2007 Bluestorm <bluestorm dot dylc on-the-server gmail dot com> * 2008 David Teller * * This library 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.1 of the License, or (at your option) any later version, * with the special exception on linking described in file LICENSE. * * This library 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) type 'a numeric = { zero : 'a; one : 'a; neg : 'a -> 'a; succ : 'a -> 'a; pred : 'a -> 'a; abs : 'a -> 'a; add : 'a -> 'a -> 'a; sub : 'a -> 'a -> 'a; mul : 'a -> 'a -> 'a; div : 'a -> 'a -> 'a; modulo : 'a -> 'a -> 'a; pow : 'a -> 'a -> 'a; compare : 'a -> 'a -> int; of_int : int -> 'a; to_int : 'a -> int; of_string : string -> 'a; to_string : 'a -> string; of_float : float -> 'a; to_float : 'a -> float } (** The infix operators *) module type Infix = sig type bat__infix_t val ( + ) : bat__infix_t -> bat__infix_t -> bat__infix_t val ( - ) : bat__infix_t -> bat__infix_t -> bat__infix_t val ( * ) : bat__infix_t -> bat__infix_t -> bat__infix_t val ( / ) : bat__infix_t -> bat__infix_t -> bat__infix_t val ( ** ) : bat__infix_t -> bat__infix_t -> bat__infix_t val ( -- ): bat__infix_t -> bat__infix_t -> bat__infix_t BatEnum.t val ( --- ): bat__infix_t -> bat__infix_t -> bat__infix_t BatEnum.t end module type Compare = sig type bat__compare_t val ( <> ) : bat__compare_t -> bat__compare_t -> bool val ( >= ) : bat__compare_t -> bat__compare_t -> bool val ( <= ) : bat__compare_t -> bat__compare_t -> bool val ( > ) : bat__compare_t -> bat__compare_t -> bool val ( < ) : bat__compare_t -> bat__compare_t -> bool val ( = ) : bat__compare_t -> bat__compare_t -> bool end (** Idea from Shawn Wagner's mathlib *) module type RefOps = sig type bat__refops_t val (+=): bat__refops_t ref -> bat__refops_t -> unit val (-=): bat__refops_t ref -> bat__refops_t -> unit val ( *=): bat__refops_t ref -> bat__refops_t -> unit val (/=): bat__refops_t ref -> bat__refops_t -> unit end (** The full set of operations of a type of numbers *) module type Numeric = sig type t type discrete = t val zero : t val one : t val neg : t -> t val abs : t -> t val add : t -> t -> t val sub : t -> t -> t val mul : t -> t -> t val div : t -> t -> t val modulo : t -> t -> t val pow : t -> t -> t val compare : t -> t -> int val equal : t -> t -> bool val ord : t BatOrd.ord val of_int : int -> t val to_int : t -> int val of_float: float -> t val to_float: t -> float val of_string : string -> t val to_string : t -> string val operations : t numeric val succ : t -> t val pred : t -> t module Infix : Infix with type bat__infix_t = t module Compare : Compare with type bat__compare_t = t include Infix with type bat__infix_t = t (* Removed compare operators from base module, as they shadow polymorphic ones from stdlib include Compare with type bat__compare_t = t*) include RefOps with type bat__refops_t = t end module type Bounded = sig type bounded val min_num: bounded val max_num: bounded end module type Discrete = sig type discrete val to_int: discrete -> int val succ : discrete -> discrete val pred : discrete -> discrete val ( -- ): discrete -> discrete -> discrete BatEnum.t val ( --- ): discrete -> discrete -> discrete BatEnum.t end (** The smallest set of operations supported by every set of numbers *) module type NUMERIC_BASE = sig type t (** A type of numbers*) val zero : t val one : t (** {6 Arithmetic operations} Depending on the implementation, some of these operations {i may} raise exceptions at run-time to represent over/under-flows.*) val neg : t -> t val succ : t -> t val pred : t -> t val abs : t -> t val add : t -> t -> t val sub : t -> t -> t val mul : t -> t -> t val div : t -> t -> t val modulo : t -> t -> t val pow : t -> t -> t val compare : t -> t -> int (** {6 Conversions} *) val of_int : int -> t (** Convert this number to the closest integer.*) val to_int : t -> int (** Convert an integer to the closest element of set [t].*) val of_string : string -> t (** Convert the representation of a number to the corresponding number. @raise Invalid_argument if the string does not represent a valid number of type [t]*) val to_string : t -> string val of_float : float -> t val to_float : t -> float end (** Automatic generation of infix operators of a NUMERIC_BASE *) module MakeInfix (Base : NUMERIC_BASE) : Infix with type bat__infix_t = Base.t = struct type bat__infix_t = Base.t let ( + ), ( - ), ( * ), ( / ), ( ** ) = Base.add, Base.sub, Base.mul, Base.div, Base.pow let ( -- ) x y = BatEnum.seq x Base.succ (fun x -> Base.compare x y <= 0) let ( --- ) x y = if Base.compare x y <= 0 then x -- y else BatEnum.seq x Base.pred (fun x -> Base.compare x y >= 0) end (** Automatic generation of comparison operations of a NUMERIC_BASE *) module MakeCompare (Base : NUMERIC_BASE) : Compare with type bat__compare_t = Base.t = struct type bat__compare_t = Base.t let ( = ) a b = Base.compare a b = 0 let ( < ) a b = Base.compare a b < 0 let ( > ) a b = Base.compare a b > 0 let ( <= ) a b = Base.compare a b <= 0 let ( >= ) a b = Base.compare a b >= 0 let ( <> ) a b = Base.compare a b <> 0 end module MakeRefOps (Base: NUMERIC_BASE) : RefOps with type bat__refops_t = Base.t = struct type bat__refops_t = Base.t let (+=) a b = a := Base.add !a b let (-=) a b = a := Base.sub !a b let ( *=) a b = a := Base.mul !a b let (/=) a b = a := Base.div !a b end (** Automated definition of operators for a given numeric type. see open...in... *) module MakeNumeric (Base : NUMERIC_BASE) : Numeric with type t = Base.t = struct include Base let operations = { zero = Base.zero; one = Base.one; neg = Base.neg; succ = Base.succ; pred = Base.pred; abs = Base.abs; add = Base.add; sub = Base.sub; mul = Base.mul; div = Base.div; modulo = Base.modulo; pow = Base.pow; compare = Base.compare; of_int = Base.of_int; to_int = Base.to_int; of_float = Base.of_float; to_float = Base.to_float; of_string = Base.of_string; to_string = Base.to_string; } type discrete = t let equal x y = Base.compare x y = 0 let ord x y = BatOrd.ord0 (Base.compare x y) module Infix = MakeInfix (Base) module Compare = MakeCompare (Base) include Infix include MakeRefOps (Base) end (** A generic implementation of fast exponentiation *) let generic_pow ~zero ~one ~div_two ~mod_two ~mul:( * ) a n = let rec pow a n = if n = zero then one else if n = one then a else let b = pow a (div_two n) in b * b * (if mod_two n = zero then one else a) in if n < zero then invalid_arg "pow" else pow a n exception Overflow exception NaN
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>