From: "Sarcar, Shourya (MED)" <Shourya.Sarcar@xxxxxxxxxxxx>
Reply-To: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx
To: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx
Subject: RE: [LIP] Algorithm
Date: Fri, 27 Oct 2000 18:57:12 +0530
i figure that could be tough, even with gperf
even raw-hashing could create duplicates, although I have heard taht gperf
creates a good hashing function.never used it as yet.
i assume you are talking about an unsigned integer ID.
Your ID space for the string would be
pow(26+26+10+allowed_special_characters,255) which I think is mucho larger
(is it ?) that the MAXINT of a machine with 64 bit ints (long long in
Linux).
#-----Original Message-----
#From: Balakrishnan Kalidas [mailto:kalidasbala@xxxxxxxxx]
#Sent: Friday, October 27, 2000 6:27 PM
#To: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx
#Subject: [LIP] Algorithm
#
#
#Hi,
# Does anybody know how to generate an unique ID for a
#given 255 char(max) string. I need it urgently for my
#project.
#
#Thanx in advance.
#
#Kalidas Balakrishnan
#
#
#__________________________________________________
#Do You Yahoo!?
#Yahoo! Messenger - Talk while you surf! It's FREE.
#http://im.yahoo.com/
#
#---------------------------------------------
#The mailing list archives are available at
#http://lists.linux-india.org/cgi-bin/wilma/LIP
#
---------------------------------------------
The mailing list archives are available at
http://lists.linux-india.org/cgi-bin/wilma/LIP