Roos, you didn't study the jpg of the machine code I sent. add edx,$04
The only way you are going to know which algorithm is the fastest is to study the machine code. John Dammeyer Wireless CAN with the CANRF module now available. http://www.autoartisans.com/products Automation Artisans Inc. Ph. 1 250 544 4950 > -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of Ross Levis > Sent: Monday, November 07, 2005 12:52 AM > To: Borland's Delphi Discussion List > Subject: Re: Test memory block > > > Malcolm Clark wrote: > > > p:=pLongWord(AddrOfDataToSearch); > > result:=false; > > for i:=0 to ((LengthInBytes div 4)-1) do > > if p^ <> 0 then exit > > else inc(p); > .... > > I had to activate this thread again as I'm not convinced that inc(p) > will increment 4 bytes at a time. I'm thinking that p^ will access 4 > bytes, but inc(p) will only increment 1 byte of the block, and then > access the same 3 bytes overlapped plus 1 new byte. Or am I wrong? > > I think it will need to be inc(p,4) ? > > Ross. > > _______________________________________________ > Delphi mailing list -> [email protected] > http://www.elists.org/mailman/listinfo/delphi > > _______________________________________________ Delphi mailing list -> [email protected] http://www.elists.org/mailman/listinfo/delphi
