# my kingdom for a hash table!

Ben Jackson (bjj@sequent.com)
Mon, 30 Jun 97 17:39:06 PDT

- Messages sorted by:[ date ][ thread ][ subject ][ author ]

    Amy Bruckman wrote:
    >
    > In MOOSE, I'm using hash tables for verb lookup for in-db parsing.
    > I implemented this by having each hash slot be a property on the object.

    If you don't like that, keep in mind that:

    	object.(propname)

    is almost exactly the same as:

    	values[propname in keys]

    I would have to do some experiments to determine which one is faster,
    but in most situations I would expect them to be very nearly equal.
    Both are linear searches, of course, but take advantage of the fact that
    it's a linear search in C code rather than any other kind of search in
    MOO code.

    > hash tables incorporated into the server.  It's really key to making
    > cool things with in-db parsing possible.

    s/possible/fast, maybe.

    --Ben