1. 03 Jun, 2001 1 commit
  2. 02 Jun, 2001 6 commits
  3. 01 Jun, 2001 1 commit
  4. 31 May, 2001 2 commits
  5. 30 May, 2001 3 commits
  6. 29 May, 2001 22 commits
  7. 28 May, 2001 2 commits
  8. 27 May, 2001 1 commit
    • Tim Peters's avatar
      Implement an old idea of Christian Tismer's: use polynomial division · 15d4929a
      Tim Peters authored
      instead of multiplication to generate the probe sequence.  The idea is
      recorded in Python-Dev for Dec 2000, but that version is prone to rare
      infinite loops.
      
      The value is in getting *all* the bits of the hash code to participate;
      and, e.g., this speeds up querying every key in a dict with keys
       [i << 16 for i in range(20000)] by a factor of 500.  Should be equally
      valuable in any bad case where the high-order hash bits were getting
      ignored.
      
      Also wrote up some of the motivations behind Python's ever-more-subtle
      hash table strategy.
      15d4929a
  9. 26 May, 2001 2 commits