An efficient finite map from (byte)strings to values
  • Overview
  • Builds
  • Updates
  • Bugs
  • Contents
  • Changelog
  • Sources


An efficient finite map from bytestrings to values. The implementation is based on big-endian patricia trees, like "Data.IntMap". We first trie on the elements of "Data.ByteString" and then trie on the big-endian bit representation of those elements. Patricia trees have efficient algorithms for union and other merging operations, but they're also quick for lookups and insertions.

Active Releases Overview

Release Latest Released Version Version in Testing
{{html release}} 
{{html stable_version}} {{html testing_version}}

Upstream Summary



Koji build ghc-bytestring-trie-0.2.4-2.fc23.ppc64.rpm signed with sigkey '873529b8'

Details 9 days ago - 2015-08-20 07:19:51


Koji build ghc-bytestring-trie-0.2.4-2.fc23.src.rpm signed with sigkey '81b46521'

Details 13 days ago - 2015-08-16 02:24:50


Koji build ghc-bytestring-trie-0.2.4-2.fc23.x86_64.rpm signed with sigkey '81b46521'

Details 16 days ago - 2015-08-13 14:33:05


Koji build ghc-bytestring-trie-0.2.4-2.fc23.i686.rpm signed with sigkey '81b46521'

Details 16 days ago - 2015-08-12 21:20:23


Koji build ghc-bytestring-trie-0.2.4-2.fc23.armv7hl.rpm signed with sigkey '81b46521'

Details 17 days ago - 2015-08-12 02:06:23

Found a bug? File a ticket. Note: There's some caching going on here. If you expect something and don't see it, check back in 5 minutes.

This Web Site is licensed under the GNU Affero General Public License. You may get sources for the current running code from these repositories: