Copyright	(C) 2015-2016 Oleg Grenrus
License	BSD3
Maintainer	Oleg Grenrus <oleg.grenrus@iki.fi>
Safe Haskell	None
Language	Haskell2010

Data.Aeson.Extra.Merge

Description

Synopsis

merge :: (forall a. (a -> a -> a) -> ValueF a -> ValueF a -> ValueF a) -> Value -> Value -> Value
mergeA :: Functor f => (forall a. (a -> a -> f a) -> ValueF a -> ValueF a -> f (ValueF a)) -> Value -> Value -> f Value
lodashMerge :: Value -> Value -> Value
data ValueF a
- = ObjectF (ObjectF a)
- | ArrayF !(ArrayF a)
- | StringF !Text
- | NumberF !Scientific
- | BoolF !Bool
- | NullF
type ObjectF a = HashMap Text a
type ArrayF a = Vector a

Documentation

merge :: (forall a. (a -> a -> a) -> ValueF a -> ValueF a -> ValueF a) -> Value -> Value -> Value Source #

Generic merge.

For example see lodashMerge.

Since: aeson-extra-0.3.1.0

mergeA :: Functor f => (forall a. (a -> a -> f a) -> ValueF a -> ValueF a -> f (ValueF a)) -> Value -> Value -> f Value Source #

Generic merge, in arbitrary context.

Since: aeson-extra-0.3.1.0

lodashMerge :: Value -> Value -> Value Source #

Example of using merge. see https://lodash.com/docs#merge:

Note: not tested against JavaScript lodash, so may disagree in the results.

Since: 0.4.1.0

data ValueF a Source #

An algebra of Value

Since: aeson-extra-0.3.1.0

Constructors

ObjectF (ObjectF a)
ArrayF !(ArrayF a)
StringF !Text
NumberF !Scientific
BoolF !Bool
NullF

Instances

Instances details

Functor ValueF Source #
Instance details Defined in Data.Aeson.Extra.Recursive Methods fmap :: (a -> b) -> ValueF a -> ValueF b # (<$) :: a -> ValueF b -> ValueF a #
Foldable ValueF Source #
Instance details Defined in Data.Aeson.Extra.Recursive Methods fold :: Monoid m => ValueF m -> m # foldMap :: Monoid m => (a -> m) -> ValueF a -> m # foldMap' :: Monoid m => (a -> m) -> ValueF a -> m # foldr :: (a -> b -> b) -> b -> ValueF a -> b # foldr' :: (a -> b -> b) -> b -> ValueF a -> b # foldl :: (b -> a -> b) -> b -> ValueF a -> b # foldl' :: (b -> a -> b) -> b -> ValueF a -> b # foldr1 :: (a -> a -> a) -> ValueF a -> a # foldl1 :: (a -> a -> a) -> ValueF a -> a # toList :: ValueF a -> [a] # null :: ValueF a -> Bool # length :: ValueF a -> Int # elem :: Eq a => a -> ValueF a -> Bool # maximum :: Ord a => ValueF a -> a # minimum :: Ord a => ValueF a -> a # sum :: Num a => ValueF a -> a # product :: Num a => ValueF a -> a #
Traversable ValueF Source #
Instance details Defined in Data.Aeson.Extra.Recursive Methods traverse :: Applicative f => (a -> f b) -> ValueF a -> f (ValueF b) # sequenceA :: Applicative f => ValueF (f a) -> f (ValueF a) # mapM :: Monad m => (a -> m b) -> ValueF a -> m (ValueF b) # sequence :: Monad m => ValueF (m a) -> m (ValueF a) #
Eq a => Eq (ValueF a) Source #
Instance details Defined in Data.Aeson.Extra.Recursive Methods (==) :: ValueF a -> ValueF a -> Bool # (/=) :: ValueF a -> ValueF a -> Bool #
Data a => Data (ValueF a) Source #
Instance details Defined in Data.Aeson.Extra.Recursive Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ValueF a -> c (ValueF a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ValueF a) # toConstr :: ValueF a -> Constr # dataTypeOf :: ValueF a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ValueF a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ValueF a)) # gmapT :: (forall b. Data b => b -> b) -> ValueF a -> ValueF a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ValueF a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ValueF a -> r # gmapQ :: (forall d. Data d => d -> u) -> ValueF a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ValueF a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ValueF a -> m (ValueF a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ValueF a -> m (ValueF a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ValueF a -> m (ValueF a) #
Read a => Read (ValueF a) Source #
Instance details Defined in Data.Aeson.Extra.Recursive Methods readsPrec :: Int -> ReadS (ValueF a) # readList :: ReadS [ValueF a] # readPrec :: ReadPrec (ValueF a) # readListPrec :: ReadPrec [ValueF a] #
Show a => Show (ValueF a) Source #
Instance details Defined in Data.Aeson.Extra.Recursive Methods showsPrec :: Int -> ValueF a -> ShowS # show :: ValueF a -> String # showList :: [ValueF a] -> ShowS #

type ObjectF a = HashMap Text a Source #

A JSON "object" (key/value map).

Since: aeson-extra-0.3.1.0

type ArrayF a = Vector a Source #

A JSON "array" (sequence).

Since: aeson-extra-0.3.1.0