Copyright	(c) Galois Inc 2015-2020
License	BSD3
Maintainer	Joe Hendrix <jhendrix@galois.com>
Safe Haskell	Safe
Language	Haskell2010

What4.Utils.LeqMap

Description

This module defines a strict map.

It is similiar to Data.Map.Strict, but provides some additional operations including splitEntry, splitLeq, fromDistinctDescList.

Synopsis

data LeqMap k p
toList :: LeqMap k p -> [(k, p)]
findMin :: LeqMap k p -> (k, p)
findMax :: LeqMap k p -> (k, p)
null :: LeqMap k p -> Bool
empty :: LeqMap k p
mapKeysMonotonic :: (k1 -> k2) -> LeqMap k1 p -> LeqMap k2 p
union :: Ord k => LeqMap k p -> LeqMap k p -> LeqMap k p
fromDistinctAscList :: [(k, p)] -> LeqMap k p
fromDistinctDescList :: [(k, p)] -> LeqMap k p
toDescList :: LeqMap k p -> [(k, p)]
deleteFindMin :: LeqMap k p -> ((k, p), LeqMap k p)
deleteFindMax :: LeqMap k p -> ((k, p), LeqMap k p)
minViewWithKey :: LeqMap k p -> Maybe ((k, p), LeqMap k p)
filterGt :: Ord k => k -> LeqMap k p -> LeqMap k p
filterLt :: Ord k => k -> LeqMap k p -> LeqMap k p
insert :: Ord k => k -> p -> LeqMap k p -> LeqMap k p
lookupLE :: Ord k => k -> LeqMap k p -> Maybe (k, p)
lookupLT :: Ord k => k -> LeqMap k p -> Maybe (k, p)
lookupGE :: Ord k => k -> LeqMap k p -> Maybe (k, p)
lookupGT :: Ord k => k -> LeqMap k p -> Maybe (k, p)
keys :: LeqMap k p -> [k]
mergeWithKey :: forall a b c. (a -> b -> IO c) -> (a -> IO c) -> (b -> IO c) -> LeqMap Integer a -> LeqMap Integer b -> IO (LeqMap Integer c)
singleton :: k -> p -> LeqMap k p
foldlWithKey' :: (a -> k -> b -> a) -> a -> LeqMap k b -> a
size :: LeqMap k p -> Int
splitEntry :: LeqMap k p -> Maybe (LeqMap k p, (k, p), LeqMap k p)
splitLeq :: Ord k => k -> LeqMap k p -> (LeqMap k p, LeqMap k p)

Documentation

Instances

Functor (LeqMap k) Source #
Instance details Defined in What4.Utils.LeqMap Methods fmap :: (a -> b) -> LeqMap k a -> LeqMap k b # (<$) :: a -> LeqMap k b -> LeqMap k a #
Foldable (LeqMap k) Source #
Instance details Defined in What4.Utils.LeqMap Methods fold :: Monoid m => LeqMap k m -> m # foldMap :: Monoid m => (a -> m) -> LeqMap k a -> m # foldr :: (a -> b -> b) -> b -> LeqMap k a -> b # foldr' :: (a -> b -> b) -> b -> LeqMap k a -> b # foldl :: (b -> a -> b) -> b -> LeqMap k a -> b # foldl' :: (b -> a -> b) -> b -> LeqMap k a -> b # foldr1 :: (a -> a -> a) -> LeqMap k a -> a # foldl1 :: (a -> a -> a) -> LeqMap k a -> a # toList :: LeqMap k a -> [a] # null :: LeqMap k a -> Bool # length :: LeqMap k a -> Int # elem :: Eq a => a -> LeqMap k a -> Bool # maximum :: Ord a => LeqMap k a -> a # minimum :: Ord a => LeqMap k a -> a # sum :: Num a => LeqMap k a -> a # product :: Num a => LeqMap k a -> a #
Traversable (LeqMap k) Source #
Instance details Defined in What4.Utils.LeqMap Methods traverse :: Applicative f => (a -> f b) -> LeqMap k a -> f (LeqMap k b) # sequenceA :: Applicative f => LeqMap k (f a) -> f (LeqMap k a) # mapM :: Monad m => (a -> m b) -> LeqMap k a -> m (LeqMap k b) # sequence :: Monad m => LeqMap k (m a) -> m (LeqMap k a) #
(Ord k, Eq p) => Eq (LeqMap k p) Source #
Instance details Defined in What4.Utils.LeqMap Methods (==) :: LeqMap k p -> LeqMap k p -> Bool # (/=) :: LeqMap k p -> LeqMap k p -> Bool #