On 2011-09-13 15:40:23 +0200, Ludo Brands wrote: > Procedure XorMemPrim(var Mem1; const Mem2; Count : Cardinal); > Var i:integer; > p1,p2:pointer; > Begin > p1:=@Mem1; > p2:=@Mem2; > for i:=1 to count div 4 do > begin > pdword(p1)^:=pdword(p1)^ xor pdword(p2)^; > p1:=p1+4; > p2:=p2+4; > end; > For i:=1 to count mod 4 do > begin > pbyte(p1)^:=pbyte(p1)^ xor pbyte(p2)^; > p1:=p1+1; > p2:=p2+1; > end; > End; > > Ludo
Wow!, that was fast. Thanks Ludo, I'll try it. -- Leonardo M. Ramé http://leonardorame.blogspot.com -- _______________________________________________ Lazarus mailing list [email protected] http://lists.lazarus.freepascal.org/mailman/listinfo/lazarus
