This does the trick:
Code:
def complement_add_uint16(x) :
y = sum(x, dtype=uint64)
while y >= 2**16 :
y = (y & uint64(0xffff)) + (y >> uint64(16))
return y
Slaunger
Joined: Nov 15 '08
Location: Denmark
-
I got the answer on comp.python.num eric.general from Charles R. Harris.
This does the trick:
That just boosted my checksum processing speed from 413 kB/s to, hold on, 47400 kB/s, which is more than a 100-fold increase.... -
Efficient custom checksum of one-dim numpy arrays of uint16
Hi,
This is my first post here, I am looking forward to being here.
I have actually posted almost the same question on comp.lang.pytho n:
http://groups.google.dk/group/comp.l...eae3719c6e3fe8
and got some hints at what i could do, but it is a little bit too complicated for me (yet), and i was wondering if there is a simpler... -
OS: MS Server 2003
Python: 2.5.X with matching version of scipy
IDE: Eclipse with Pydev extension
Version control: SVN in Eclipse with SubClipse extension
Shell:IPythonLeave a comment:
No activity results to display
Leave a comment: