From 23b04dd211287eb1c841c129705af39afbe0ab15 Mon Sep 17 00:00:00 2001 From: varobert Date: Thu, 12 Apr 2012 11:31:33 +0000 Subject: Faster ndxes_of_sym_name ndxes_of_sym_name used to have an O(s^2) complexity where s was the number of symbols in the ELF file. It has now been reduced to an O(s*ln(s)) by pre-computing the sets of symbols corresponding to each normalized symbol name. git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1875 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e --- checklink/Library.ml | 2 ++ 1 file changed, 2 insertions(+) (limited to 'checklink/Library.ml') diff --git a/checklink/Library.ml b/checklink/Library.ml index 67d8a45..bb0d217 100644 --- a/checklink/Library.ml +++ b/checklink/Library.ml @@ -3,6 +3,8 @@ open BinPos type bitstring = Bitstring.bitstring +module StringMap = Map.Make (String) + let is_some: 'a option -> bool = function | Some(_) -> true | None -> false -- cgit v1.2.3