Data.Map.Word8

Documentation

data Map a

A map whose keys are 8-bit words.

Instances

Functor Map

Defined in Data.Map.Word8

Methods

fmap :: (a -> b) -> Map a -> Map b

(<$) :: a -> Map b -> Map a

Semigroup a => Monoid (Map a)

Defined in Data.Map.Word8

Methods

mempty :: Map a

mappend :: Map a -> Map a -> Map a

mconcat :: [Map a] -> Map a

Semigroup a => Semigroup (Map a)

Defined in Data.Map.Word8

Methods

(<>) :: Map a -> Map a -> Map a

sconcat :: NonEmpty (Map a) -> Map a

stimes :: Integral b => b -> Map a -> Map a

Show a => Show (Map a)

Defined in Data.Map.Word8

Methods

showsPrec :: Int -> Map a -> ShowS

show :: Map a -> String

showList :: [Map a] -> ShowS

Eq a => Eq (Map a)

Defined in Data.Map.Word8

Methods

(==) :: Map a -> Map a -> Bool

(/=) :: Map a -> Map a -> Bool

lookup :: Word8 -> Map a -> Maybe a

Lookup the value at a key in the map.

null :: Map a -> Bool

Is the passed map empty?

size :: Map a -> Int

The number of elements the passed map contains.

empty :: Map a

The empty map.

singleton :: Word8 -> a -> Map a

union :: Map a -> Map a -> Map a

The expression union t1 t2 takes the left-biased union of t1 and t2. It prefers t1 when duplicate keys are encountered (i.e. union == unionWith const).

unionWith :: (a -> a -> a) -> Map a -> Map a -> Map a

Union with a combining function.

insert :: Word8 -> a -> Map a -> Map a

insertWith :: (a -> a -> a) -> Word8 -> a -> Map a -> Map a

Insert with a function, combining new value and old value. insertWith f key value mp will insert the pair (key, value) into mp if key does not exist in the map. If the key does exist, the function will insert the pair (key, f new_value old_value).

foldrWithKeys :: (Word8 -> a -> b -> b) -> b -> Map a -> b

foldl' :: (b -> a -> b) -> b -> Map a -> b

traverse_ :: Applicative m => (a -> m b) -> Map a -> m ()

toList :: Map a -> [(Word8, a)]

fromList :: [(Word8, a)] -> Map a