https://github.com/gelisam/queues

Compare the performance of a few Haskell queue implementations.
https://github.com/gelisam/queues

Last synced: 22 days ago
JSON representation

Compare the performance of a few Haskell queue implementations.

• Host: GitHub
• URL: https://github.com/gelisam/queues
• Owner: gelisam
• Created: 2013-06-09T14:09:25.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2013-06-09T14:18:05.000Z (over 11 years ago)
• Last Synced: 2023-04-13T07:57:05.805Z (over 1 year ago)
• Language: Haskell
• Size: 113 KB
• Stars: 2
• Watchers: 3
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
queues

======

Compare the performance of a few Haskell queue implementations.

results

-------

If your queue has 100 items or less in it, then it doesn't matter.

Otherwise, use [Data.Sequence](http://hackage.haskell.org/package/containers), it has the same or slightly better performance as everything else I have tried, and its API is much simpler than those.