On 3/27/06 1:01 PM, Craig A. Finseth at [EMAIL PROTECTED] wrote:
> final = final * (hi - lo + 1) + (numbers(i) - lo)
Thanks, I knew about this method, but I was hoping for an idea that would
let me get the final product into 64-bit integer.
I feel there should be a way to take a series of numbers and combine them in
a way that will let you retrieve the series later while storing a minimal
amount of information about the series. In my dream world, you could take a
million integers, store some information about the whole series, and come
out with a number or numbers that would let you work backwards to retrieve
every element of the series later.
So, {a, b, c, ... } would combine into X with Y, Z, etc., storing some
additional information. X, Y, Z, etc., would be not-too-large integers in
the 64 or 128-bit range. Later, you could use some fn(X,Y,Z) to get back {a,
b, c, ... }.
Next, I'd like a supercomputer made out of a box of paperclips...
__________________________________________________________________________
Kem Tekinay (212) 201-1465
MacTechnologies Consulting Fax (914) 242-7294
545 Eighth Avenue, Suite 401 Pager (917) 491-5546
New York, New York 10018 http://www.mactechnologies.com
To join the MacTechnologies Consulting mailing list, send an e-mail to:
[EMAIL PROTECTED]
_______________________________________________
Unsubscribe or switch delivery mode:
<http://www.realsoftware.com/support/listmanager/>
Search the archives of this list here:
<http://support.realsoftware.com/listarchives/lists.html>
