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: [mg125085] Re: How best to implement a hash table in Mathematica
  • From: Richard Fateman <fateman at cs.berkeley.edu>
  • Date: Tue, 21 Feb 2012 06:10:16 -0500 (EST)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • References: <jho21j$5sb$1@smc.vnet.net> <jhqmsq$fbt$1@smc.vnet.net> <jhstus$nku$1@smc.vnet.net>

On 2/19/2012 11:49 PM, Joseph Gwinn wrote:
> In article<jhqmsq$fbt$1 at smc.vnet.net>,
>   Richard Fateman<fateman at cs.berkeley.edu>  wrote:

>> Initializing a hashtable with 10^4 (identical?) empty keys makes no
>> sense. Did I misunderstand your message?
>
> No, you understood correctly.  Please see my response to David Bailey
> for the rationale.
>
> Joe Gwinn
>
Again, I may misunderstand, but I think you can accomplish the same 
thing by typing

f[x_]:= {}

if {} is the default empty value.

RJF





  • Prev by Date: Re: Print Selection, Mathematica 7, in Lion
  • Next by Date: Binning data points
  • Previous by thread: Re: How best to implement a hash table in Mathematica
  • Next by thread: Re: How best to implement a hash table in Mathematica