package binsec
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Semantic analysis of binary executables
Install
dune-project
Dependency
Authors
-
AAdel Djoudi
-
BBenjamin Farinier
-
CChakib Foulani
-
DDorian Lesbre
-
FFrédéric Recoules
-
GGuillaume Girol
-
JJosselin Feist
-
LLesly-Ann Daniel
-
MMahmudul Faisal Al Ameen
-
MManh-Dung Nguyen
-
MMathéo Vergnolle
-
MMathilde Ollivier
-
MMatthieu Lemerre
-
NNicolas Bellec
-
OOlivier Nicole
-
RRichard Bonichon
-
RRobin David
-
SSébastien Bardin
-
SSoline Ducousso
-
TTa Thanh Dinh
-
YYaëlle Vinçont
-
YYanis Sellami
Maintainers
Sources
binsec-0.11.0.tbz
sha256=4cf70a0367fef6f33ee3165f05255914513ea0539b94ddfef0bd46fc9b42fa8a
sha512=cd67a5b7617f661a7786bef0c828ee55307cef5260dfecbb700a618be795d81b1ac49fc1a18c4904fd2eb8a182dc862b0159093028651e78e7dc743f5babf9e3
doc/src/binsec.base/collection.ml.html
Source file collection.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(**************************************************************************) (* This file is part of BINSEC. *) (* *) (* Copyright (C) 2016-2026 *) (* 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 licenses/LGPLv2.1). *) (* *) (**************************************************************************) module type S = sig include Sigs.HASHABLE module Map : sig include Map.S with type key = t val pop : 'a t -> (key * 'a) * 'a t val keys : 'a t -> key list val values : 'a t -> 'a list end module Set : sig include Set.S with type elt = t val pop : t -> elt * t end module Htbl : sig include Hashtbl.S with type key = t val filter : (key -> 'a -> bool) -> 'a t -> 'a t val bindings : 'a t -> (key * 'a) list end end module MapSetMaker (C : Sigs.COMPARABLE) = struct module Map = struct include Map.Make (C) let pop m = let ((k, _) as elt) = choose m in (elt, remove k m) let keys m = fold (fun k _ acc -> k :: acc) m [] |> List.rev let values m = fold (fun _ v acc -> v :: acc) m [] |> List.rev end module Set = struct include Set.Make (C) let pop set = let a = choose set in (a, remove a set) end end module Hashed (C : Sigs.HASHABLE) = struct include C include MapSetMaker (C) module Htbl = struct include Hashtbl.Make (C) let filter p h = let h' = create (length h) in iter (fun k v -> if p k v then add h' k v) h; h' let bindings h = fold (fun k v acc -> (k, v) :: acc) h [] end end module Auto (C : Sigs.COMPARABLE_EXT) = Hashed (struct include C let hash = Hashtbl.hash end) module Default (C : Sigs.COMPARABLE) = Auto (struct include C let equal a b = compare a b = 0 end)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>