Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Commits on Jan 5, 2015
Commits on Apr 2, 2014
  1. Remove slow fromList[With] benchmarks

    authored
    We know that fromList[With] is faster than a naive version using
    insert[With]. No need to check that every time we run our benchmark
    suite.
Commits on Jan 15, 2013
Commits on Oct 18, 2012
  1. Group all HashMap benchmarks

    authored
Commits on Oct 16, 2012
  1. Bryan O'Sullivan
Commits on Mar 9, 2012
  1. Add benchmarks for fromListWith

    authored
Commits on Mar 8, 2012
  1. Twan van Laarhoven
Commits on Mar 7, 2012
  1. Merge new hash array mapped trie implementation

    authored
    This essentially wipes out the old implementation.
    
    Conflicts:
    	Data/HashMap/Array.hs
    	Data/HashMap/Internal.hs
    	Data/HashMap/PopCount.hs
    	Data/HashMap/UnsafeShift.hs
    	cbits/popc.c
Commits on Mar 3, 2012
  1. Remove unused benchmark

    authored
Commits on Feb 29, 2012
  1. Fix error in foldr benchmark

    authored
  2. Fix error in foldr benchmark

    authored
Commits on Feb 25, 2012
  1. Backport benchmark

    authored
Commits on Feb 23, 2012
  1. Twan van Laarhoven
Commits on Sep 25, 2011
Commits on Aug 19, 2011
  1. Backport benchmarks

    authored
Commits on Jul 15, 2011
  1. Fix faulty benchmark

    authored
Commits on Jun 23, 2011
  1. Add benchmark for delete

    authored
Commits on Jun 22, 2011
Commits on Apr 27, 2011
  1. Jan-Willem Maessen

    Benchmarks for fromList

    jmaessen authored
Commits on Apr 12, 2011
Commits on Feb 26, 2011
  1. Jan-Willem Maessen

    Added benchmarks for size.

    jmaessen authored
  2. Jan-Willem Maessen
Commits on Feb 18, 2011
  1. Finish D.H.Strict

    authored
  2. Add folds without keys

    authored
  3. Better match the Data.Map API

    authored
Commits on Feb 17, 2011
  1. Rename folds

    authored
  2. Switch back to the Patricia trie implementation

    authored
    The Patricia trie isn't as fast as the HAMT for lookups, but is much
    faster for e.g. inserts and deletes.  Once GHC provides faster array
    copying, it might be worth revisiting the HAMT.
Commits on Feb 14, 2011
  1. Bryan O'Sullivan

    Add an updateWithDefault function, and implement insert in terms of it

    bos authored
    Performance is largely unchanged under GHC 6.12.3.
    
    Before:
      Int        2.680412 ms
      ByteString 2.959931 ms
      String     3.337718 ms
    
    After (insert via updateWithDefault):
      Int        2.757437 ms (2.8% slower)
      ByteString 3.022355 ms (2.1% slower)
      String     3.306249 ms (1% faster)
Commits on Jan 31, 2011
Commits on Jan 23, 2011
Something went wrong with that request. Please try again.