Re: Idea for ECMA/C# Standard - compile time hash for performance

Oh, yes. I forgot to ask: what is your ratio of inserts to reads? Do
you ever delete entries from the hash table? These things impact the
kinds of data structures you could potentially use for the mapping.

I'm assuming that the hash table is established once (at compile time)
and never changed, otherwise your scheme of having the compiler do the
mapping for you would not work.

.

Relevant Pages

  • Re: If not readdir() then what?
    ... All we have to do is cache the open files. ... We keep these in an LRU list and a hash table. ... hash LRU chain, but rather a number of LRU chains. ... Have a rbtree for storing directory entries. ...
    (Linux-Kernel)
  • Re: NEWBIE: Read/write IO (Random Access)/:overwrite- replace?
    ... enumerate the keys present in the db, like you do with a hash table. ... Keep in one db file a mapping, ... Here is a prototype in Lisp using hash ... (setf (gethash 1 data) ...
    (comp.lang.lisp)
  • [PATCH 2/2] Futex non-page-pinning fix
    ... it hashes on mapping + offset, ... The hash table is usually fairly empty. ... long do_futex(unsigned long uaddr, int op, int val, ... ret = -EWOULDBLOCK; ...
    (Linux-Kernel)
  • Re: UTF-8 and case-insensitivity
    ... characters have a upper/lower mapping. ... the filesystem makes sense. ... use a filesystem provided case-insensitive hash in the dcache. ...
    (Linux-Kernel)
  • Re: Suggestions for double-hashing scheme
    ... chain style and reprobe style are basically a wash. ... will be a smaller chance of encountering deleted entries before it. ... Once you sufficiently optimize a hash table, ... by computing of the hash function). ...
    (comp.programming)
Loading