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


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



Package list change for ghc-bytestring-trie: 'epel7'

4 months ago - 2013-12-16 00:25:04

petersen's ghc-bytestring-trie-0.2.3-12.fc20 was deleted

5 months ago - 2013-11-13 08:36:57


petersen's ghc-bytestring-trie-0.2.3-12.fc20 tagged into trashcan by oscar

6 months ago - 2013-10-15 13:56:01

petersen's ghc-bytestring-trie-0.2.3-10.fc19 was deleted

7 months ago - 2013-09-21 08:26:06


petersen's ghc-bytestring-trie-0.2.3-10.fc19 tagged into trashcan by oscar

8 months ago - 2013-08-23 13:09:06

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: