2000000000000000
  Home FAQ Contact Sign in
 
 Advanced search
MATCHING GROUPS



more...
POPULAR GROUPS

more...
found 7 articles for 0.302 sec
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     

Group: alt.lang.asm · Group Profile · Search for 2000000000000000 in alt.lang.asm
Author: Skybuck Flying
Date: Oct 25, 2007 01:12

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
Show full article (9.41Kb)
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     

Group: alt.comp.lang.borlanddelphi · Group Profile · Search for 2000000000000000 in alt.comp.lang.borlanddelphi
Author: Skybuck Flying
Date: Oct 25, 2007 01:12

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
Show full article (9.41Kb)
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     

Group: alt.lang.asm · Group Profile · Search for 2000000000000000 in alt.lang.asm
Author: Skybuck Flying
Date: Oct 25, 2007 01:04

"René Guilbault" <rene.guilbault@wanadoo.fr> a écrit dans le message de news: 45c2541f$0$5110$ba4acef3@news.orange.fr... Tapez 0,2 dans la cellule A1, puis en dessous, tapez =A1*11-2. Bien sûr on retrouve 0,2? Tirez ensuite cette cellule vers le bas, on ne devrait trouver que des 0,2 et hélas ça diverge très vite et beaucoup. Pourquoi?? Merci! j'en sais rien. Mais pour faire
Show full article (10.07Kb)
robert bristow-johnson <rbj@audioimagination.com> wrote: > > Gerold Schrutz wrote: >> Hello Bob, >> >> I'll send it to you via email. >> > > why not post it? c'mon! spread the joy. it's the christmas season. My solution : ======================== fs=48000; %% Analog filter B=[1 0 0 0 0]; Ar=[-20.6 -20.6 -107.7 -737.9 -12200 -12200 ]*2*pi; A=poly(Ar); %% Digital filter     

Group: alt.comp.lang.borlanddelphi · Group Profile · Search for 2000000000000000 in alt.comp.lang.borlanddelphi
Author: Skybuck Flying
Date: Oct 25, 2007 01:04

Show full article (10.07Kb) · Show article thread
    

Group: alt.comp.lang.borlanddelphi · Group Profile · Search for 2000000000000000 in alt.comp.lang.borlanddelphi
Author: Skybuck Flying
Date: Oct 25, 2007 00:31

Show full article (9.72Kb)
    

Group: fr.sci.maths · Group Profile · Search for 2000000000000000 in fr.sci.maths
Author: Vicnent
Date: Feb 1, 2007 13:29

Show full article (2.15Kb) · Show article thread
    

Group: comp.dsp · Group Profile · Search for 2000000000000000 in comp.dsp
Author: pisz_na.mirek
Date: Dec 19, 2006 05:27

Show full article (1.12Kb)