Safe Haskell	Safe-Inferred
Language	Haskell2010

Unison.Util.EnumContainers

Documentation

data EnumMap k a Source #

Instances

Instances details

Foldable (EnumMap k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods fold :: Monoid m => EnumMap k m -> m # foldMap :: Monoid m => (a -> m) -> EnumMap k a -> m # foldMap' :: Monoid m => (a -> m) -> EnumMap k a -> m # foldr :: (a -> b -> b) -> b -> EnumMap k a -> b # foldr' :: (a -> b -> b) -> b -> EnumMap k a -> b # foldl :: (b -> a -> b) -> b -> EnumMap k a -> b # foldl' :: (b -> a -> b) -> b -> EnumMap k a -> b # foldr1 :: (a -> a -> a) -> EnumMap k a -> a # foldl1 :: (a -> a -> a) -> EnumMap k a -> a # toList :: EnumMap k a -> [a] # null :: EnumMap k a -> Bool # length :: EnumMap k a -> Int # elem :: Eq a => a -> EnumMap k a -> Bool # maximum :: Ord a => EnumMap k a -> a # minimum :: Ord a => EnumMap k a -> a # sum :: Num a => EnumMap k a -> a # product :: Num a => EnumMap k a -> a #
Eq1 (EnumMap k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods liftEq :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool #
Ord1 (EnumMap k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods liftCompare :: (a -> b -> Ordering) -> EnumMap k a -> EnumMap k b -> Ordering #
Traversable (EnumMap k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods traverse :: Applicative f => (a -> f b) -> EnumMap k a -> f (EnumMap k b) # sequenceA :: Applicative f => EnumMap k (f a) -> f (EnumMap k a) # mapM :: Monad m => (a -> m b) -> EnumMap k a -> m (EnumMap k b) # sequence :: Monad m => EnumMap k (m a) -> m (EnumMap k a) #
Functor (EnumMap k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods fmap :: (a -> b) -> EnumMap k a -> EnumMap k b # (<$) :: a -> EnumMap k b -> EnumMap k a #
Monoid (EnumMap k a) Source #
Instance details Defined in Unison.Util.EnumContainers Methods mempty :: EnumMap k a # mappend :: EnumMap k a -> EnumMap k a -> EnumMap k a # mconcat :: [EnumMap k a] -> EnumMap k a #
Semigroup (EnumMap k a) Source #
Instance details Defined in Unison.Util.EnumContainers Methods (<>) :: EnumMap k a -> EnumMap k a -> EnumMap k a # sconcat :: NonEmpty (EnumMap k a) -> EnumMap k a # stimes :: Integral b => b -> EnumMap k a -> EnumMap k a #
Show a => Show (EnumMap k a) Source #
Instance details Defined in Unison.Util.EnumContainers Methods showsPrec :: Int -> EnumMap k a -> ShowS # show :: EnumMap k a -> String # showList :: [EnumMap k a] -> ShowS #
Eq a => Eq (EnumMap k a) Source #
Instance details Defined in Unison.Util.EnumContainers Methods (==) :: EnumMap k a -> EnumMap k a -> Bool # (/=) :: EnumMap k a -> EnumMap k a -> Bool #
Ord a => Ord (EnumMap k a) Source #
Instance details Defined in Unison.Util.EnumContainers Methods compare :: EnumMap k a -> EnumMap k a -> Ordering # (<) :: EnumMap k a -> EnumMap k a -> Bool # (<=) :: EnumMap k a -> EnumMap k a -> Bool # (>) :: EnumMap k a -> EnumMap k a -> Bool # (>=) :: EnumMap k a -> EnumMap k a -> Bool # max :: EnumMap k a -> EnumMap k a -> EnumMap k a # min :: EnumMap k a -> EnumMap k a -> EnumMap k a #

data EnumSet k Source #

Instances

Instances details

Monoid (EnumSet k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods mempty :: EnumSet k # mappend :: EnumSet k -> EnumSet k -> EnumSet k # mconcat :: [EnumSet k] -> EnumSet k #
Semigroup (EnumSet k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods (<>) :: EnumSet k -> EnumSet k -> EnumSet k # sconcat :: NonEmpty (EnumSet k) -> EnumSet k # stimes :: Integral b => b -> EnumSet k -> EnumSet k #
Show (EnumSet k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods showsPrec :: Int -> EnumSet k -> ShowS # show :: EnumSet k -> String # showList :: [EnumSet k] -> ShowS #
Eq (EnumSet k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods (==) :: EnumSet k -> EnumSet k -> Bool # (/=) :: EnumSet k -> EnumSet k -> Bool #
Ord (EnumSet k) Source #
Instance details Defined in Unison.Util.EnumContainers Methods compare :: EnumSet k -> EnumSet k -> Ordering # (<) :: EnumSet k -> EnumSet k -> Bool # (<=) :: EnumSet k -> EnumSet k -> Bool # (>) :: EnumSet k -> EnumSet k -> Bool # (>=) :: EnumSet k -> EnumSet k -> Bool # max :: EnumSet k -> EnumSet k -> EnumSet k # min :: EnumSet k -> EnumSet k -> EnumSet k #

class EnumKey k where Source #

Methods

keyToInt :: k -> Int Source #

intToKey :: Int -> k Source #

Instances

Instances details

EnumKey Word16 Source #
Instance details Defined in Unison.Util.EnumContainers Methods keyToInt :: Word16 -> Int Source # intToKey :: Int -> Word16 Source #
EnumKey Word64 Source #
Instance details Defined in Unison.Util.EnumContainers Methods keyToInt :: Word64 -> Int Source # intToKey :: Int -> Word64 Source #

mapFromList :: EnumKey k => [(k, a)] -> EnumMap k a Source #

setFromList :: EnumKey k => [k] -> EnumSet k Source #

setToList :: EnumKey k => EnumSet k -> [k] Source #

mapSingleton :: EnumKey k => k -> a -> EnumMap k a Source #

setSingleton :: EnumKey k => k -> EnumSet k Source #

mapInsert :: EnumKey k => k -> a -> EnumMap k a -> EnumMap k a Source #

mapFromSet :: EnumKey k => EnumSet k -> a -> EnumMap k a Source #

unionWith :: EnumKey k => (a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a Source #

intersectionWith :: (a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c Source #

hasKey :: EnumKey k => k -> EnumMap k a -> Bool Source #

keys :: EnumKey k => EnumMap k a -> [k] Source #

keysSet :: EnumKey k => EnumMap k a -> EnumSet k Source #

restrictKeys :: EnumKey k => EnumMap k a -> EnumSet k -> EnumMap k a Source #

withoutKeys :: EnumKey k => EnumMap k a -> EnumSet k -> EnumMap k a Source #

mapDifference :: EnumKey k => EnumMap k a -> EnumMap k b -> EnumMap k a Source #

member :: EnumKey k => k -> EnumSet k -> Bool Source #

lookup :: EnumKey k => k -> EnumMap k a -> Maybe a Source #

lookupWithDefault :: EnumKey k => a -> k -> EnumMap k a -> a Source #

mapWithKey :: EnumKey k => (k -> a -> b) -> EnumMap k a -> EnumMap k b Source #

foldMapWithKey :: EnumKey k => Monoid m => (k -> a -> m) -> EnumMap k a -> m Source #

foldlWithKey :: EnumKey k => (r -> k -> a -> r) -> r -> EnumMap k a -> r Source #

mapToList :: EnumKey k => EnumMap k a -> [(k, a)] Source #

(!) :: EnumKey k => EnumMap k a -> k -> a Source #

findMin :: EnumKey k => EnumSet k -> k Source #

interverse :: Applicative f => (a -> b -> f c) -> EnumMap k a -> EnumMap k b -> f (EnumMap k c) Source #

traverseSet_ :: Applicative f => EnumKey k => (k -> f ()) -> EnumSet k -> f () Source #

traverseWithKey :: Applicative f => EnumKey k => (k -> a -> f b) -> EnumMap k a -> f (EnumMap k b) Source #

setSize :: EnumSet k -> Int Source #

foldrSet :: EnumKey k => (k -> r -> r) -> r -> EnumSet k -> r Source #