| Copyright | Copyright (c) 2008--2021 wren gayle romano |
|---|---|
| License | BSD3 |
| Maintainer | wren@cpan.org |
| Stability | experimental |
| Portability | portable |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.Trie
Description
An efficient implementation of finite maps from 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. For further details on the latter, see
- Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452
- D.R. Morrison, "PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric", Journal of the ACM, 15(4), October 1968, pages 514-534.
This module aims to provide an austere interface, while being detailed enough for most users. For an extended interface with many additional functions, see Data.Trie.Convenience. For functions that give more detailed (potentially abstraction-breaking) access to the data strucuture, or for experimental functions which aren't quite ready for the public API, see Data.Trie.Internal.
Synopsis
- data Trie a
- empty :: Trie a
- null :: Trie a -> Bool
- singleton :: ByteString -> a -> Trie a
- size :: Trie a -> Int
- fromList :: [(ByteString, a)] -> Trie a
- toListBy :: (ByteString -> a -> b) -> Trie a -> [b]
- toList :: Trie a -> [(ByteString, a)]
- keys :: Trie a -> [ByteString]
- elems :: Trie a -> [a]
- lookupBy :: (Maybe a -> Trie a -> b) -> ByteString -> Trie a -> b
- lookup :: ByteString -> Trie a -> Maybe a
- member :: ByteString -> Trie a -> Bool
- submap :: ByteString -> Trie a -> Trie a
- match :: Trie a -> ByteString -> Maybe (ByteString, a, ByteString)
- minMatch :: Trie a -> ByteString -> Maybe (ByteString, a, ByteString)
- matches :: Trie a -> ByteString -> [(ByteString, a, ByteString)]
- insert :: ByteString -> a -> Trie a -> Trie a
- adjust :: (a -> a) -> ByteString -> Trie a -> Trie a
- adjustBy :: (ByteString -> a -> a -> a) -> ByteString -> a -> Trie a -> Trie a
- alterBy :: (ByteString -> a -> Maybe a -> Maybe a) -> ByteString -> a -> Trie a -> Trie a
- delete :: ByteString -> Trie a -> Trie a
- deleteSubmap :: ByteString -> Trie a -> Trie a
- mergeBy :: (a -> a -> Maybe a) -> Trie a -> Trie a -> Trie a
- unionL :: Trie a -> Trie a -> Trie a
- unionR :: Trie a -> Trie a -> Trie a
- intersectBy :: (a -> b -> Maybe c) -> Trie a -> Trie b -> Trie c
- intersectL :: Trie a -> Trie b -> Trie a
- intersectR :: Trie a -> Trie b -> Trie b
- mapBy :: (ByteString -> a -> Maybe b) -> Trie a -> Trie b
- filterMap :: (a -> Maybe b) -> Trie a -> Trie b
Data type
A map from ByteStrings to a. For all the generic functions,
note that tries are strict in the Maybe but not in a.
The Monad instance is strange. If a key k1 is a prefix of
other keys, then results from binding the value at k1 will
override values from longer keys when they collide. If this is
useful for anything, or if there's a more sensible instance, I'd
be curious to know.
Instances
| Monad Trie Source # | |
| Functor Trie Source # | |
| Applicative Trie Source # | |
| Foldable Trie Source # | |
Defined in Data.Trie.Internal Methods fold :: Monoid m => Trie m -> m # foldMap :: Monoid m => (a -> m) -> Trie a -> m # foldMap' :: Monoid m => (a -> m) -> Trie a -> m # foldr :: (a -> b -> b) -> b -> Trie a -> b # foldr' :: (a -> b -> b) -> b -> Trie a -> b # foldl :: (b -> a -> b) -> b -> Trie a -> b # foldl' :: (b -> a -> b) -> b -> Trie a -> b # foldr1 :: (a -> a -> a) -> Trie a -> a # foldl1 :: (a -> a -> a) -> Trie a -> a # elem :: Eq a => a -> Trie a -> Bool # maximum :: Ord a => Trie a -> a # | |
| Traversable Trie Source # | |
| Eq a => Eq (Trie a) Source # | |
| Show a => Show (Trie a) Source # | |
| Semigroup a => Semigroup (Trie a) Source # | |
| Monoid a => Monoid (Trie a) Source # | |
| Binary a => Binary (Trie a) Source # | |
Basic functions
singleton :: ByteString -> a -> Trie a Source #
O(1), Construct a singleton trie.
Conversion functions
fromList :: [(ByteString, a)] -> Trie a Source #
Convert association list into a trie. On key conflict, values earlier in the list shadow later ones.
toListBy :: (ByteString -> a -> b) -> Trie a -> [b] Source #
Convert a trie into a list using a function. Resulting values are in key-sorted order.
toList :: Trie a -> [(ByteString, a)] Source #
Convert trie into association list. Keys will be in sorted order.
keys :: Trie a -> [ByteString] Source #
Return all keys in the trie, in sorted order.
elems :: Trie a -> [a] Source #
Return all values in the trie, in sorted order according to the keys.
Query functions
lookupBy :: (Maybe a -> Trie a -> b) -> ByteString -> Trie a -> b Source #
Generic function to find a value (if it exists) and the subtrie rooted at the prefix.
lookup :: ByteString -> Trie a -> Maybe a Source #
Return the value associated with a query string if it exists.
submap :: ByteString -> Trie a -> Trie a Source #
Return the subtrie containing all keys beginning with a prefix.
match :: Trie a -> ByteString -> Maybe (ByteString, a, ByteString) Source #
Given a query, find the longest prefix with an associated value in the trie, and return that prefix, it's value, and the remainder of the query.
minMatch :: Trie a -> ByteString -> Maybe (ByteString, a, ByteString) Source #
Given a query, find the shortest prefix with an associated value in the trie, and return that prefix, it's value, and the remainder of the query.
Since: 0.2.6
matches :: Trie a -> ByteString -> [(ByteString, a, ByteString)] Source #
Given a query, find all prefixes with associated values in the trie, and return their (prefix, value, remainder) triples in order from shortest prefix to longest. This function is a good producer for list fusion.
Simple modification
insert :: ByteString -> a -> Trie a -> Trie a Source #
Insert a new key. If the key is already present, overrides the old value
adjust :: (a -> a) -> ByteString -> Trie a -> Trie a Source #
Apply a function to the value at a key. If the key is not present, then the trie is returned unaltered.
adjustBy :: (ByteString -> a -> a -> a) -> ByteString -> a -> Trie a -> Trie a Source #
Alter the value associated with a given key. If the key is not
present, then the trie is returned unaltered. See alterBy if
you are interested in inserting new keys or deleting old keys.
Because this function does not need to worry about changing the
trie structure, it is somewhat faster than alterBy.
Since: 0.2.6 for being exported from Data.Trie. Before then it was only exported from Data.Trie.Internal.
alterBy :: (ByteString -> a -> Maybe a -> Maybe a) -> ByteString -> a -> Trie a -> Trie a Source #
Generic function to alter a trie by one element with a function to resolve conflicts (or non-conflicts).
deleteSubmap :: ByteString -> Trie a -> Trie a Source #
Remove all keys beginning with a prefix.
Since: 0.2.6
Combining tries
mergeBy :: (a -> a -> Maybe a) -> Trie a -> Trie a -> Trie a Source #
Take the union of two tries, using a function to resolve collisions. This can only define the space of functions between union and symmetric difference but, with those two, all set operations can be defined (albeit inefficiently).
unionL :: Trie a -> Trie a -> Trie a Source #
Take the union of two tries, resolving conflicts by choosing the value from the left trie.
unionR :: Trie a -> Trie a -> Trie a Source #
Take the union of two tries, resolving conflicts by choosing the value from the right trie.
intersectBy :: (a -> b -> Maybe c) -> Trie a -> Trie b -> Trie c Source #
Take the intersection of two tries, using a function to resolve collisions.
Since: 0.2.6
intersectL :: Trie a -> Trie b -> Trie a Source #
Take the intersection of two tries, with values from the left trie.
Since: 0.2.6
intersectR :: Trie a -> Trie b -> Trie b Source #
Take the intersection of two tries, with values from the right trie.
Since: 0.2.6