TrieMap-0.5.3: Automatic type inference of generalized tries. Source code Contents Index

Data.TrieMap

Contents Map type Operators Query Construction Insertion Delete/Update Combine Union Difference Intersection Traversal Map Traverse Fold Conversion Lists Ordered lists Filter Submap Indexed Min/Max

Synopsis

class (Repr k, TrieKey (Rep k) (TrieMap (Rep k))) => TKey k data TMap k a (!) :: TKey k => TMap k a -> k -> a (\\) :: TKey k => TMap k a -> TMap k b -> TMap k a null :: TKey k => TMap k a -> Bool size :: TKey k => TMap k a -> Int member :: TKey k => k -> TMap k a -> Bool notMember :: TKey k => k -> TMap k a -> Bool lookup :: TKey k => k -> TMap k a -> Maybe a findWithDefault :: TKey k => a -> k -> TMap k a -> a empty :: TKey k => TMap k a singleton :: TKey k => k -> a -> TMap k a insert :: TKey k => k -> a -> TMap k a -> TMap k a insertWith :: TKey k => (a -> a -> a) -> k -> a -> TMap k a -> TMap k a insertWithKey :: TKey k => (k -> a -> a -> a) -> k -> a -> TMap k a -> TMap k a delete :: TKey k => k -> TMap k a -> TMap k a adjust :: TKey k => (a -> a) -> k -> TMap k a -> TMap k a adjustWithKey :: TKey k => (k -> a -> a) -> k -> TMap k a -> TMap k a update :: TKey k => (a -> Maybe a) -> k -> TMap k a -> TMap k a updateWithKey :: TKey k => (k -> a -> Maybe a) -> k -> TMap k a -> TMap k a alter :: TKey k => (Maybe a -> Maybe a) -> k -> TMap k a -> TMap k a union :: TKey k => TMap k a -> TMap k a -> TMap k a unionWith :: TKey k => (a -> a -> a) -> TMap k a -> TMap k a -> TMap k a unionWithKey :: TKey k => (k -> a -> a -> a) -> TMap k a -> TMap k a -> TMap k a unionMaybeWith :: TKey k => (a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k a unionMaybeWithKey :: TKey k => (k -> a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k a difference :: TKey k => TMap k a -> TMap k b -> TMap k a differenceWith :: TKey k => (a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k a differenceWithKey :: TKey k => (k -> a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k a intersection :: TKey k => TMap k a -> TMap k b -> TMap k a intersectionWith :: TKey k => (a -> b -> c) -> TMap k a -> TMap k b -> TMap k c intersectionWithKey :: TKey k => (k -> a -> b -> c) -> TMap k a -> TMap k b -> TMap k c intersectionMaybeWith :: TKey k => (a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k c intersectionMaybeWithKey :: TKey k => (k -> a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k c map :: TKey k => (a -> b) -> TMap k a -> TMap k b mapWithKey :: TKey k => (k -> a -> b) -> TMap k a -> TMap k b mapKeys :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' a mapKeysWith :: (TKey k, TKey k') => (a -> a -> a) -> (k -> k') -> TMap k a -> TMap k' a mapKeysMonotonic :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' a traverseWithKey :: (TKey k, Applicative f) => (k -> a -> f b) -> TMap k a -> f (TMap k b) fold :: TKey k => (a -> b -> b) -> b -> TMap k a -> b foldWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> b foldrWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> b foldlWithKey :: TKey k => (b -> k -> a -> b) -> b -> TMap k a -> b elems :: TKey k => TMap k a -> [a] keys :: TKey k => TMap k a -> [k] assocs :: TKey k => TMap k a -> [(k, a)] fromList :: TKey k => [(k, a)] -> TMap k a fromListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k a fromListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k a fromAscList :: TKey k => [(k, a)] -> TMap k a fromAscListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k a fromAscListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k a fromDistinctAscList :: TKey k => [(k, a)] -> TMap k a filter :: TKey k => (a -> Bool) -> TMap k a -> TMap k a filterWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> TMap k a partition :: TKey k => (a -> Bool) -> TMap k a -> (TMap k a, TMap k a) partitionWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> (TMap k a, TMap k a) mapMaybe :: TKey k => (a -> Maybe b) -> TMap k a -> TMap k b mapMaybeWithKey :: TKey k => (k -> a -> Maybe b) -> TMap k a -> TMap k b mapEither :: TKey k => (a -> Either b c) -> TMap k a -> (TMap k b, TMap k c) mapEitherWithKey :: TKey k => (k -> a -> Either b c) -> TMap k a -> (TMap k b, TMap k c) split :: TKey k => k -> TMap k a -> (TMap k a, TMap k a) splitLookup :: TKey k => k -> TMap k a -> (TMap k a, Maybe a, TMap k a) isSubmapOf :: (TKey k, Eq a) => TMap k a -> TMap k a -> Bool isSubmapOfBy :: TKey k => (a -> b -> Bool) -> TMap k a -> TMap k b -> Bool predecessor :: TKey k => k -> TMap k a -> Maybe (Int, k, a) lookupWithIndex :: TKey k => k -> TMap k a -> Maybe (Int, k, a) successor :: TKey k => k -> TMap k a -> Maybe (Int, k, a) neighborhood :: TKey k => k -> TMap k a -> (Maybe (Int, k, a), Maybe (Int, k, a), Maybe (Int, k, a)) lookupIndex :: TKey k => k -> TMap k a -> Maybe Int predecessorAt :: TKey k => Int -> TMap k a -> Maybe (Int, k, a) lookupAt :: TKey k => Int -> TMap k a -> Maybe (Int, k, a) successorAt :: TKey k => Int -> TMap k a -> Maybe (Int, k, a) neighborhoodAt :: TKey k => Int -> TMap k a -> (Maybe (Int, k, a), Maybe (Int, k, a), Maybe (Int, k, a)) findMin :: TKey k => TMap k a -> (k, a) findMax :: TKey k => TMap k a -> (k, a) deleteMin :: TKey k => TMap k a -> TMap k a deleteMax :: TKey k => TMap k a -> TMap k a deleteFindMin :: TKey k => TMap k a -> ((k, a), TMap k a) deleteFindMax :: TKey k => TMap k a -> ((k, a), TMap k a) updateMin :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k a updateMax :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k a updateMinWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k a updateMaxWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k a minView :: TKey k => TMap k a -> Maybe (a, TMap k a) maxView :: TKey k => TMap k a -> Maybe (a, TMap k a) minViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a) maxViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a)

Map type

class (Repr k, TrieKey (Rep k) (TrieMap (Rep k))) => TKey k Source

data TMap k a Source

Instances TKey k => Functor (TMap k) TKey k => Traversable (TMap k) TKey k => Foldable (TMap k) TKey k => ReprT (TMap k) (Eq k, TKey k, Eq a) => Eq (TMap k a) (Ord k, TKey k, Ord a) => Ord (TMap k a) (Show k, Show a, TKey k) => Show (TMap k a) TKey k => Monoid (TMap k a)

Operators

(!) :: TKey k => TMap k a -> k -> a Source

(\\) :: TKey k => TMap k a -> TMap k b -> TMap k a Source

Query

null :: TKey k => TMap k a -> Bool Source

size :: TKey k => TMap k a -> Int Source

member :: TKey k => k -> TMap k a -> Bool Source

notMember :: TKey k => k -> TMap k a -> Bool Source

lookup :: TKey k => k -> TMap k a -> Maybe a Source

findWithDefault :: TKey k => a -> k -> TMap k a -> a Source

Construction

empty :: TKey k => TMap k a Source

singleton :: TKey k => k -> a -> TMap k a Source

Insertion

insert :: TKey k => k -> a -> TMap k a -> TMap k a Source

insertWith :: TKey k => (a -> a -> a) -> k -> a -> TMap k a -> TMap k a Source

insertWithKey :: TKey k => (k -> a -> a -> a) -> k -> a -> TMap k a -> TMap k a Source

Delete/Update

delete :: TKey k => k -> TMap k a -> TMap k a Source

adjust :: TKey k => (a -> a) -> k -> TMap k a -> TMap k a Source

adjustWithKey :: TKey k => (k -> a -> a) -> k -> TMap k a -> TMap k a Source

update :: TKey k => (a -> Maybe a) -> k -> TMap k a -> TMap k a Source

updateWithKey :: TKey k => (k -> a -> Maybe a) -> k -> TMap k a -> TMap k a Source

alter :: TKey k => (Maybe a -> Maybe a) -> k -> TMap k a -> TMap k a Source

Combine

Union

union :: TKey k => TMap k a -> TMap k a -> TMap k a Source

unionWith :: TKey k => (a -> a -> a) -> TMap k a -> TMap k a -> TMap k a Source

unionWithKey :: TKey k => (k -> a -> a -> a) -> TMap k a -> TMap k a -> TMap k a Source

unionMaybeWith :: TKey k => (a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k a Source

unionMaybeWithKey :: TKey k => (k -> a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k a Source

Difference

difference :: TKey k => TMap k a -> TMap k b -> TMap k a Source

differenceWith :: TKey k => (a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k a Source

differenceWithKey :: TKey k => (k -> a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k a Source

Intersection

intersection :: TKey k => TMap k a -> TMap k b -> TMap k a Source

intersectionWith :: TKey k => (a -> b -> c) -> TMap k a -> TMap k b -> TMap k c Source

intersectionWithKey :: TKey k => (k -> a -> b -> c) -> TMap k a -> TMap k b -> TMap k c Source

intersectionMaybeWith :: TKey k => (a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k c Source

intersectionMaybeWithKey :: TKey k => (k -> a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k c Source

Traversal

Map

map :: TKey k => (a -> b) -> TMap k a -> TMap k b Source

mapWithKey :: TKey k => (k -> a -> b) -> TMap k a -> TMap k b Source

mapKeys :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' a Source

mapKeysWith :: (TKey k, TKey k') => (a -> a -> a) -> (k -> k') -> TMap k a -> TMap k' a Source

mapKeysMonotonic :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' a Source

Traverse

traverseWithKey :: (TKey k, Applicative f) => (k -> a -> f b) -> TMap k a -> f (TMap k b) Source

Fold

fold :: TKey k => (a -> b -> b) -> b -> TMap k a -> b Source

foldWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> b Source

foldrWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> b Source

foldlWithKey :: TKey k => (b -> k -> a -> b) -> b -> TMap k a -> b Source

Conversion

elems :: TKey k => TMap k a -> [a] Source

keys :: TKey k => TMap k a -> [k] Source

assocs :: TKey k => TMap k a -> [(k, a)] Source

Lists

fromList :: TKey k => [(k, a)] -> TMap k a Source

fromListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k a Source

fromListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k a Source

Ordered lists

fromAscList :: TKey k => [(k, a)] -> TMap k a Source

fromAscListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k a Source

fromAscListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k a Source

fromDistinctAscList :: TKey k => [(k, a)] -> TMap k a Source

Filter

filter :: TKey k => (a -> Bool) -> TMap k a -> TMap k a Source

filterWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> TMap k a Source

partition :: TKey k => (a -> Bool) -> TMap k a -> (TMap k a, TMap k a) Source

partitionWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> (TMap k a, TMap k a) Source

mapMaybe :: TKey k => (a -> Maybe b) -> TMap k a -> TMap k b Source

mapMaybeWithKey :: TKey k => (k -> a -> Maybe b) -> TMap k a -> TMap k b Source

mapEither :: TKey k => (a -> Either b c) -> TMap k a -> (TMap k b, TMap k c) Source

mapEitherWithKey :: TKey k => (k -> a -> Either b c) -> TMap k a -> (TMap k b, TMap k c) Source

split :: TKey k => k -> TMap k a -> (TMap k a, TMap k a) Source

splitLookup :: TKey k => k -> TMap k a -> (TMap k a, Maybe a, TMap k a) Source

Submap

isSubmapOf :: (TKey k, Eq a) => TMap k a -> TMap k a -> Bool Source

isSubmapOfBy :: TKey k => (a -> b -> Bool) -> TMap k a -> TMap k b -> Bool Source

Indexed

predecessor :: TKey k => k -> TMap k a -> Maybe (Int, k, a) Source

predecessor k a returns the index, key, and value of the immediate predecessor of k in the map. The predecessor is the element with the largest key < k.

lookupWithIndex :: TKey k => k -> TMap k a -> Maybe (Int, k, a) Source

successor :: TKey k => k -> TMap k a -> Maybe (Int, k, a) Source

neighborhood :: TKey k => k -> TMap k a -> (Maybe (Int, k, a), Maybe (Int, k, a), Maybe (Int, k, a)) Source

lookupIndex :: TKey k => k -> TMap k a -> Maybe Int Source

predecessorAt :: TKey k => Int -> TMap k a -> Maybe (Int, k, a) Source

lookupAt :: TKey k => Int -> TMap k a -> Maybe (Int, k, a) Source

successorAt :: TKey k => Int -> TMap k a -> Maybe (Int, k, a) Source

neighborhoodAt :: TKey k => Int -> TMap k a -> (Maybe (Int, k, a), Maybe (Int, k, a), Maybe (Int, k, a)) Source

Min/Max

findMin :: TKey k => TMap k a -> (k, a) Source

findMax :: TKey k => TMap k a -> (k, a) Source

deleteMin :: TKey k => TMap k a -> TMap k a Source

deleteMax :: TKey k => TMap k a -> TMap k a Source

deleteFindMin :: TKey k => TMap k a -> ((k, a), TMap k a) Source

deleteFindMax :: TKey k => TMap k a -> ((k, a), TMap k a) Source

updateMin :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k a Source

updateMax :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k a Source

updateMinWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k a Source

updateMaxWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k a Source

minView :: TKey k => TMap k a -> Maybe (a, TMap k a) Source

maxView :: TKey k => TMap k a -> Maybe (a, TMap k a) Source

minViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a) Source

maxViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a) Source

Produced by Haddock version 2.4.2