Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #16497 > unrolled thread
| Started by | Neal Becker <ndbecker2@gmail.com> |
|---|---|
| First post | 2011-12-01 08:55 -0500 |
| Last post | 2011-12-01 08:55 -0500 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.lang.python
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: order independent hash? Neal Becker <ndbecker2@gmail.com> - 2011-12-01 08:55 -0500
| From | Neal Becker <ndbecker2@gmail.com> |
|---|---|
| Date | 2011-12-01 08:55 -0500 |
| Subject | Re: order independent hash? |
| Message-ID | <mailman.3198.1322747760.27778.python-list@python.org> |
Gelonida N wrote: > On 11/30/2011 01:32 PM, Neal Becker wrote: >> I like to hash a list of words (actually, the command line args of my >> program) in such a way that different words will create different hash, but >> not sensitive >> to the order of the words. Any ideas? >> > Do youmean hash like digest like md5sum / sha1 ? > > > You should sort the words alphabetically, concatenate them with a space > or any character, that will NEVER be part of a word and calulate the hash. > > If words can exist multiple times, then youhad tu uniqufy them (u using > a python dict / set) first. Yes that sounds just like what I wanted - thanks!
Back to top | Article view | comp.lang.python
csiph-web