Data.Map.Syntax

An API implementing a convenient syntax for defining maps. This module was born from the observation that a list of tuples is semantically ambiguous about how duplicate keys should be handled. Additionally, the syntax is inherently rather cumbersome and difficult to work with. This API takes advantage of do notation to provide a very light syntax for defining maps while at the same time eliminating the semantic ambiguity of alists.

Here's an example:

foo :: MapSyntax Text Text
foo = do
  "firstName" ## "John"
  "lastName"  ## "Smith"

Core API

data MapSyntaxM k v a

A monad providing convenient syntax for defining maps.

Instances

Monad (MapSyntaxM k v)

Methods

(>>=) :: MapSyntaxM k v a -> (a -> MapSyntaxM k v b) -> MapSyntaxM k v b

(>>) :: MapSyntaxM k v a -> MapSyntaxM k v b -> MapSyntaxM k v b

return :: a -> MapSyntaxM k v a

fail :: String -> MapSyntaxM k v a

Functor (MapSyntaxM k v)

Methods

fmap :: (a -> b) -> MapSyntaxM k v a -> MapSyntaxM k v b

(<$) :: a -> MapSyntaxM k v b -> MapSyntaxM k v a

Applicative (MapSyntaxM k v)

Methods

pure :: a -> MapSyntaxM k v a

(<*>) :: MapSyntaxM k v (a -> b) -> MapSyntaxM k v a -> MapSyntaxM k v b

liftA2 :: (a -> b -> c) -> MapSyntaxM k v a -> MapSyntaxM k v b -> MapSyntaxM k v c

(*>) :: MapSyntaxM k v a -> MapSyntaxM k v b -> MapSyntaxM k v b

(<*) :: MapSyntaxM k v a -> MapSyntaxM k v b -> MapSyntaxM k v a

Semigroup (MapSyntax k v)

Methods

(<>) :: MapSyntax k v -> MapSyntax k v -> MapSyntax k v

sconcat :: NonEmpty (MapSyntax k v) -> MapSyntax k v

stimes :: Integral b => b -> MapSyntax k v -> MapSyntax k v

Monoid (MapSyntax k v)

Methods

mempty :: MapSyntax k v

mappend :: MapSyntax k v -> MapSyntax k v -> MapSyntax k v

mconcat :: [MapSyntax k v] -> MapSyntax k v

type MapSyntax k v = MapSyntaxM k v ()

Convenient type alias that will probably be used most of the time.

runMap :: Ord k => MapSyntaxM k v a -> Either [k] (Map k v)

Runs the MapSyntaxM monad to generate a map.

(##) :: k -> v -> MapSyntax k v infixr 0

Forces an entry to be added. If the key already exists, its value is overwritten.

(#!) :: k -> v -> MapSyntax k v infixr 0

Tries to add an entry, but if the key already exists, then runMap will return a Left with the list of offending keys. This may be useful if name collisions are bad and you want to know when they occur.

(#?) :: k -> v -> MapSyntax k v infixr 0

Inserts into the map only if the key does not already exist. If the key does exist, it silently continues without overwriting or generating an error indication.

mapK :: (k1 -> k2) -> MapSyntaxM k1 v a -> MapSyntax k2 v

Maps a function over all the keys.

mapV :: (v1 -> v2) -> MapSyntaxM k v1 a -> MapSyntax k v2

Maps a function over all the values.

runMapSyntax

Arguments

:: Monoid map

=> (k -> map -> Maybe v)

Function that gets a key's value

-> (k -> v -> map -> map)

Function to force-insert a key-value pair into the map

-> MapSyntaxM k v a

-> Either [k] map

Runs the MapSyntaxM monad to generate a map.

runMapSyntax'

Arguments

:: Monoid map

=> (k -> v -> v -> Maybe v)

Function to handle duplicate key insertion, similar to the first argument to insertWith. If this function returns Nothing, then this is interpreted as an error. If it is a Just, then the resulting value will be inserted into the map.

-> (k -> map -> Maybe v)

Function that gets a key's value

-> (k -> v -> map -> map)

Function to force-insert a key-value pair into the map

-> MapSyntaxM k v a

-> Either [k] map

Runs the MapSyntaxM monad to generate a map. This function gives you the full power of insertWith when duplicate keys are encountered.

Example:

runMapSyntax' (\k new_val old_val -> Just $ old_val ++ new_val)

Lower level functions

data DupStrat

Strategy to use for duplicates

Constructors

Replace

Ignore

Error

data ItemRep k v

Representation of an indivdual item in a map

Constructors

ItemRep

Fields

• irStrat :: DupStrat
• irKey :: k
• irVal :: v

addStrat :: DupStrat -> k -> v -> MapSyntax k v

Low level add function for adding a specific DupStrat, key, and value.