Copyright | (c) 2013-2016 Galois Inc. |
---|---|
License | BSD3 |
Maintainer | cryptol@galois.com |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
Documentation
Instances
class TrieMap m k | m -> k where Source #
nullTM :: m a -> Bool Source #
lookupTM :: k -> m a -> Maybe a Source #
alterTM :: k -> (Maybe a -> Maybe a) -> m a -> m a Source #
unionTM :: (a -> a -> a) -> m a -> m a -> m a Source #
toListTM :: m a -> [(k, a)] Source #
mapMaybeWithKeyTM :: (k -> a -> Maybe b) -> m a -> m b Source #
Instances
insertWithTM :: TrieMap m k => (a -> a -> a) -> k -> a -> m a -> m a Source #
mapWithKeyTM :: TrieMap m k => (k -> a -> b) -> m a -> m b Source #
mapMaybeTM :: TrieMap m k => (a -> Maybe b) -> m a -> m b Source #
Instances
Functor m => Functor (List m) Source # | |
Foldable m => Foldable (List m) Source # | |
Defined in Cryptol.TypeCheck.TypeMap fold :: Monoid m0 => List m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> List m a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> List m a -> m0 # foldr :: (a -> b -> b) -> b -> List m a -> b # foldr' :: (a -> b -> b) -> b -> List m a -> b # foldl :: (b -> a -> b) -> b -> List m a -> b # foldl' :: (b -> a -> b) -> b -> List m a -> b # foldr1 :: (a -> a -> a) -> List m a -> a # foldl1 :: (a -> a -> a) -> List m a -> a # elem :: Eq a => a -> List m a -> Bool # maximum :: Ord a => List m a -> a # minimum :: Ord a => List m a -> a # | |
Traversable m => Traversable (List m) Source # | |
TrieMap m a => TrieMap (List m) [a] Source # | |
Defined in Cryptol.TypeCheck.TypeMap nullTM :: List m a0 -> Bool Source # lookupTM :: [a] -> List m a0 -> Maybe a0 Source # alterTM :: [a] -> (Maybe a0 -> Maybe a0) -> List m a0 -> List m a0 Source # unionTM :: (a0 -> a0 -> a0) -> List m a0 -> List m a0 -> List m a0 Source # toListTM :: List m a0 -> [([a], a0)] Source # mapMaybeWithKeyTM :: ([a] -> a0 -> Maybe b) -> List m a0 -> List m b Source # | |
(Traversable m, TVars a) => TVars (List m a) Source # | |