From: Dr Balwinder S Dheeman <bsd.SANSPAM@...>
Date: 2005-04-28T15:44:29+09:00
Subject: Re: Hash as Checklist

On 04/28/2005 07:48 AM, basi wrote:
> Hello,
> I need to check if a word is in a list. I'm using hash because the
> lists can be long (i'm under the impression hash is faster than array).

A hash have to store "key" => value pairs, how will be more efficient 
than an array? and why?

> Basically I'm only interested that a key exists. I have to create
> entries like:
> 
> h = {
> "one" => true,
> "two" => true,
> "three" => true,
> "four" => true,
> "five" => true
> }
> 
> So h["one"] gives true, and h["seven"] returns nil. But typing the
> dummy value "true" is a waste of effort, and there's an ugliness in
> there. Is there a better way to design a simple checklist?
> 
> Thank you for your help

irb(main):001:0> a = %w{one two three four five}
=> ["one", "two", "three", "four", "five"]
irb(main):002:0> a.member? 'one'
=> true
irb(main):003:0> a.member? 'seven'
=> false

Hope that helps.
-- 
Dr Balwinder Singh Dheeman            Registered Linux User: #229709
CLLO (Chief Linux Learning Officer)   Machines: #168573, 170593, 259192
Anu's Linux@HOME                      Distros: Ubuntu, Fedora, Knoppix
More: http://anu.homelinux.net/~bsd/  Visit: http://counter.li.org/