Timeline for answer to What is the difference between a hash and a dictionary? by dan_waterworth
Current License: CC BY-SA 2.5
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 13, 2018 at 17:15 | comment | added | Sean Burton | There are languages that use 'Hash' to refer to a dictionary-type structure rather than just to the hash function operation. Ruby, for example. | |
| Feb 24, 2013 at 1:02 | comment | added | johannes | @jk Actually the "hash" is the result of applying a "hash function/algorithm" to some input. An "hash table" or "hash map" omehoe relates and hashable object to some object (object in a generic form, not limited to OOP) | |
| Jan 9, 2013 at 13:04 | comment | added | jk. | @Sairam I think its far more common for 'hash' to mean a hash function rather than a hash table. | |
| Dec 28, 2010 at 8:23 | comment | added | Sairam | Hash is also an ADT . HashTable is an implementation of a Hash | |
| Dec 28, 2010 at 7:39 | history | answered | dan_waterworth | CC BY-SA 2.5 |