package codex
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
The Codex library for building static analysers based on abstract interpretation
Install
dune-project
Dependency
Authors
Maintainers
Sources
1.0-rc4.tar.gz
md5=bc7266a140c6886add673ede90e335d3
sha512=8da42c0ff2c1098c5f9cb2b5b43b306faf7ac93b8f5ae00c176918cee761f249ff45b29309f31a05bbcf6312304f86a0d5a000eb3f1094d3d3c2b9b4c7f5c386
doc/src/immutable_array/immutable_array.ml.html
Source file immutable_array.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(**************************************************************************) (* This file is part of the Codex semantics library. *) (* *) (* Copyright (C) 2013-2025 *) (* CEA (Commissariat à l'énergie atomique et aux énergies *) (* alternatives) *) (* *) (* 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, version 2.1. *) (* *) (* It 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. *) (* *) (* See the GNU Lesser General Public License version 2.1 *) (* for more details (enclosed in the file LICENSE). *) (* *) (**************************************************************************) include Array type 'a t = 'a array let empty = [| |] type sformat = (unit,Format.formatter,unit) Stdlib.format type 'a formatter = Format.formatter -> 'a -> unit let iter3 f a b c = let alen = Array.length a in assert(Array.length b == alen); assert(Array.length c == alen); for i = 0 to alen - 1 do f (Array.unsafe_get a i) (Array.unsafe_get b i) (Array.unsafe_get c i); done ;; let pp_iter ?(pre=format_of_string "@[") ?(sep=format_of_string "") ?(suf=format_of_string "@]") iter pp fmt v = let need_sep = ref false in Format.fprintf fmt pre; iter (fun v -> if !need_sep then Format.fprintf fmt sep else need_sep := true; pp fmt v; ) v; Format.fprintf fmt suf; ;; let pp_array ?pre ?sep ?suf func = let iter f ar = for i = 0 to (Array.length ar) - 1 do f (unsafe_get ar i) done in pp_iter ?pre ?sep ?suf iter func let fold_left2 f init a1 a2 = let l1 = Array.length a1 and l2 = Array.length a2 in assert (l1 == l2); let rec loop i acc = if i == l1 then acc else let acc = f acc (unsafe_get a1 i) (unsafe_get a2 i) in loop (i+1) acc in loop 0 init ;; let fold_left3 f init a1 a2 a3 = let l1 = Array.length a1 and l2 = Array.length a2 and l3 = Array.length a3 in assert (l1 == l2); assert(l1 == l3); let rec loop i acc = if i == l1 then acc else let acc = f acc (unsafe_get a1 i) (unsafe_get a2 i) (unsafe_get a3 i) in loop (i+1) acc in loop 0 init ;; let _cast_from_array x = x
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>