Next | Query returned 4 messages, browsing 1 to 10 | previous

History of commit frequency

CVS Commit History:


   2014-08-29 16:09:59 by Ryosuke Moro | Files touched by this commit (104)
Log message:
make it clear what package depend on

discussed with wiz@.
   2012-03-04 06:54:43 by PHO / phonohawk | Files touched by this commit (4) | Package updated
Log message:
Upstream update to bytestring-trie-0.2.3
   2009-10-11 12:44:40 by Thomas Klausner | Files touched by this commit (286)
Log message:
Remove obsolete @dirrm lines.
   2009-10-02 05:26:52 by PHO / phonohawk | Files touched by this commit (5) | Imported package
Log message:
Import hs-bytestring-trie-0.1.4 as wip/hs-bytestring-trie.

An efficient finite map from (byte)strings 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.

Next | Query returned 4 messages, browsing 1 to 10 | previous