Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!zaphod.mps.ohio-state.edu!caen!uflorida!gatech!purdue!haven!ni.umd.edu!uc780.umd.edu!cs450a03
From: cs450a03@uc780.umd.edu
Newsgroups: comp.lang.misc
Subject: RE: Dynamic typing (part 3)
Message-ID: <25MAR91.21515980@uc780.umd.edu>
Date: 25 Mar 91 21:51:59 GMT
References: <731@optima.cs.arizona.edu> <1991Mar20.185308.8275@maths.nott.ac.uk> <22MAR91.09242511@uc780.umd.edu> <5045@goanna.cs.rmit.oz.au>
Sender: usenet@ni.umd.edu (USENET News System)
Organization: The University of Maryland University College
Lines: 19

Richard O'Keefe   >
Me                >>
>> But even C ... doesn't have a hashed search (for un-ordered items)
>> in any of the libraries I know of.
> 
>Log on to a UNIX System V box and type
>	man hsearch
>It has been around for _years_.  (See also lsearch and tsearch.)

I did.  Thought I was going to see a horrendous call with a table arg,
function args, etc. (leaving all the work to be done elsewhere).
Instead I saw something that scared me worse: A global hash table
(now, THAT's useful)!  I want to use hashing to speed up this little
old function here, and all I have to do is make sure it's a unique
instance of the solution...

Maybe my nonlocality gripes are petty, but geez...

Raul Rockwell