From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,918406c619dd104d
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news1.google.com!news.glorb.com!nlpi057.nbdc.sbc.com!prodigy.net!flph199.ffdc.sbc.com!prodigy.com!flpi107.ffdc.sbc.com!nlpi067.nbdc.sbc.com.POSTED!ca9b8ce5!not-for-mail
From: Mark Space <markspace@sbc.global.net>
User-Agent: Thunderbird 2.0.0.21 (Windows/20090302)
MIME-Version: 1.0
Newsgroups: comp.lang.java.programmer,comp.lang.ada
Subject: Re: find words that contains some specific letters
References: 
 <edaeda6b-3793-48f2-8f8f-6c9701759de5@r33g2000yqn.googlegroups.com>
 <f350aaae-d045-450d-b255-308eb7fb8f8a@e24g2000vbe.googlegroups.com>
 <d121e6f6-6afa-43e7-bcd1-c9a770e12704@z9g2000yqi.googlegroups.com>
 <nospam-83CE7B.07382201062009@news.aioe.org>
 <78i1lbF1m69gkU1@mid.individual.net> <78i2ajF1m4nglU1@mid.individual.net>
 <h00l40$r5h$1@news.albasani.net> <78i4i2F1magkfU1@mid.individual.net>
 <3f1d007f-bcae-42b4-afb0-215b18f51b9c@n21g2000vba.googlegroups.com>
 <78ib19F1mfh7qU1@mid.individual.net>
 <3b519936-3db9-4dad-85ba-371fa4b29c8f@z5g2000vba.googlegroups.com>
 <78quiaF1n95fsU1@mid.individual.net> <h09q6f$41t$1@news.albasani.net>
 <MJWdnUzVI6hADrXXnZ2dnUVZ_q2dnZ2d@earthlink.com>
 <78rpbkF1mqrc7U1@mid.individual.net>
 <nospam-B6C8E0.12131906062009@news.aioe.org>
In-Reply-To: <nospam-B6C8E0.12131906062009@news.aioe.org>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <frxWl.34710$ZP4.32560@nlpi067.nbdc.sbc.com>
NNTP-Posting-Host: 76.221.202.11
X-Complaints-To: abuse@prodigy.net
X-Trace: nlpi067.nbdc.sbc.com 1244308299 ST000 76.221.202.11 (Sat,
 06 Jun 2009 13:11:39 EDT)
NNTP-Posting-Date: Sat, 06 Jun 2009 13:11:39 EDT
Organization: at&t http://my.att.net/
X-UserInfo1: 
 FKPO@SRDTRRER_H[OZKNOFXBWR\HPCTL@XT^OBPLAH[\RYIBK^RAQFW[ML\THRCKV^GGZKJMGV^^_JSCFFUA_QXFGVSCYRPILH]TRVKC^LSN@DX_HCAFX__@J\DAJBVMY\ZWZCZLPA^MVH_P@\\EOMW\YSXHG__IJQY_@M[A[[AXQ_XDSTAR]\PG]NVAQUVM
Date: Sat, 06 Jun 2009 10:11:32 -0700
Xref: g2news2.google.com comp.lang.java.programmer:42909 comp.lang.ada:6337
Date: 2009-06-06T10:11:32-07:00
List-Id: <comp.lang.ada>

John B. Matthews wrote:

>> For example the Character class.
> 
> I think all of the primitive wrappers (except Double) have trivially 
> perfect integer hashes, as they wrap distinct values. Patricia was 
> perhaps referring to algorithms of the kind discussed here:
> 
> <http://en.wikipedia.org/wiki/Perfect_hash_function>


I remember in school we implemented a minimal perfect hash function on a 
given set of keys:  the keywords in the Pascal language.  We were given 
the parameters of the algorithm: use the length of the keyword, the 
first character and the last character only.

The concept was obviously to show how a fast look-up could be done when 
implementing a compiler, but the hash function itself was interesting at 
the time.