"Olivier " <m.olivier.lemaire@gmail.com> writes: Peter Boettcher <boettcher@ll.mit.edu> wrote in message <muyprp45poc.fsf@G99-Boettcher.llan.ll.mit.edu>... format long datadlm = dlmread('sParamToxOrderedDataSet.txt', '\t', 1,0); datadlm datadlm(:,1), datadlm(:,5) ans = 1.0e+10 * 0.100000000000000 0.200000000000000 0.300000000000000 0.400000000000000

And here is the same code in unit/module form with tables commented out: The possible table lookups/optimizations are left in in case I or any one else wants to test those ;) // *** Begin of Module Code *** unit UnitStringToUint64_version_003; interface function TryStrToUint64( S : string; var Value : Uint64 ) : boolean; implementation { Skybuck's TryStrToUint64 conversion

Hello, Sometimes I google for my own code and then it sucks if I one can't find it or too it's incomplete. So one more time the complete code as it now is, all 3 versions embedded. Version 0.03 is now active... big 1600 bytes lookup tables still active but those could be commented out. Maybe somebody else could write a nice benchmark program for it ? Tomorrow maybe I write one, but

Hello, Here is my version 0.01 and my optimized version 0.02 which uses only one lookup and one addition per character/digit. Also the checks will be pretty fast because it's very unlike the checks will: 1. Happen at all for lesser/smaller values/strings. 2. Happen at full length, full length for maximum value only ;) So pretty fast "safety" checks. And finally 3. Pretty damn

"Valentino Volonghi aka Dialtone" ha scritto quello che sento invece quando li uso e` la mancanza di un editor che sia veloce quanto sono veloce io a scrivere Guarda, la parte del superman la salto (questa e quella dei 3 minuti in fondo) perchè mi sembra estremamente poco significativa Sara` anche che in linguaggi statici i nomi di una classe sono ripetuti 200000000000000