-
Notifications
You must be signed in to change notification settings - Fork 0
An efficient Patricia tree implementation
License
cpettitt/haskell-ptree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
An efficient Patricia tree implementation that maps strict 'ByteString's to values. The interface for this module is intended to look similar to that for 'Data.Map' and 'Data.IntMap', where appropriate. It differs from 'Data.Map' in the restriction of the key type to 'ByteString's, its functions for looking up all prefixes of a key, and improved looked up performance. It differs from 'Data.IntMap' in that it supports variable length keys.
About
An efficient Patricia tree implementation
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published