MathGroup Archive 2012

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: How best to implement a hash table in Mathematica

  • To: mathgroup at smc.vnet.net
  • Subject: [mg125049] Re: How best to implement a hash table in Mathematica
  • From: Richard Fateman <fateman at cs.berkeley.edu>
  • Date: Sun, 19 Feb 2012 06:33:34 -0500 (EST)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • References: <jho21j$5sb$1@smc.vnet.net>

On 2/18/2012 3:28 AM, Joseph Gwinn wrote:
> I have an application that resembles dictionary lookup, with significant
> rates of collision.
>
>...

Mathematica presumably already uses hashing for storage of stuff like

f[{a,b,c}] = value1
f[{1,2,c}] = value2

etc.

Initializing a hashtable with 10^4 (identical?) empty keys makes no
sense. Did I misunderstand your message?





  • Prev by Date: How to specify the gradient of this function?
  • Next by Date: Re: multiple selection control
  • Previous by thread: How best to implement a hash table in Mathematica
  • Next by thread: Re: How best to implement a hash table in Mathematica