| SHA-1, MD5, etc inquiry [message #61214] |
Tue, 08 July 2008 19:50 |
cgh1
Messages: 3
Registered: July 2008
|
Junior Member |
|
|
Hello:
I am using a homegrown implementation of ISODATA to cluster data in
IDL. As the program runs, an array is created that is the same size as
the data (ie, same # of elements) to track the cluster assignment of
each point. I would like to check for the possibility of being caught
in a loop with the clustering. I strongly suggest that, in some cases,
my data might be passing back and forth between up to 20 or 25 states.
I tried the checksum32.pro routine, but that didn't do what I needed
(ie, if only 2 points are flipped, the checksum is the same value). I
don't think I have the memory to store full state information for each
step - I'm working with up to 100,000 data points and frequently will
allow the ISODATA program to loop up to 10,000 times.
I'm looking for an IDL implementation of SHA1 or MD5 - or, any
suggested equivalent. I realize that there is a hit to the runtime for
computing the checksum, but, it is a lot less memory needed to store
the hash. I'm hoping that loops are fairly common, and can save more
time from finding the loops than I spend on checking for them.
Does anyone know of an implementation in IDL of either of these
algorithms, or some other equivalent?
Thanks for any replies!
--Topher Hughes
|
|
|
|
comp.lang.idl-pvwave archive
Members
Search
Help
Login
Home
