{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE AllowAmbiguousTypes #-}
{-# LANGUAGE TypeApplications #-}
{-# OPTIONS_GHC -fwarn-incomplete-patterns #-}
module Control.MapReduce.Engines.List
(
listEngine
, listEngineM
, groupByHashableKey
, groupByOrderedKey
, unpackList
, unpackListM
)
where
import qualified Control.MapReduce.Core as MRC
import qualified Control.MapReduce.Engines as MRE
import qualified Control.Foldl as FL
import qualified Data.List as L
import qualified Data.Foldable as F
import Data.Hashable ( Hashable )
import qualified Data.HashMap.Strict as HMS
import qualified Data.Map.Strict as MS
import qualified Data.Sequence as Seq
import Control.Monad ( filterM )
import Control.Arrow ( second )
unpackList :: MRC.Unpack x y -> [x] -> [y]
unpackList :: forall x y. Unpack x y -> [x] -> [y]
unpackList (MRC.Filter x -> Bool
t) = forall a. (a -> Bool) -> [a] -> [a]
L.filter x -> Bool
t
unpackList (MRC.Unpack x -> g y
f) = forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
L.concatMap (forall (t :: * -> *) a. Foldable t => t a -> [a]
F.toList forall b c a. (b -> c) -> (a -> b) -> a -> c
. x -> g y
f)
{-# INLINABLE unpackList #-}
unpackListM :: MRC.UnpackM m x y -> [x] -> m [y]
unpackListM :: forall (m :: * -> *) x y. UnpackM m x y -> [x] -> m [y]
unpackListM (MRC.FilterM x -> m Bool
t) = forall (m :: * -> *) a.
Applicative m =>
(a -> m Bool) -> [a] -> m [a]
filterM x -> m Bool
t
unpackListM (MRC.UnpackM x -> m (g y)
f) = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall (t :: * -> *) a. Foldable t => t [a] -> [a]
L.concat forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall (t :: * -> *) a. Foldable t => t a -> [a]
F.toList forall b c a. (b -> c) -> (a -> b) -> a -> c
. x -> m (g y)
f)
{-# INLINABLE unpackListM #-}
groupByHashableKey :: (Hashable k, Eq k) => [(k, c)] -> [(k, Seq.Seq c)]
groupByHashableKey :: forall k c. (Hashable k, Eq k) => [(k, c)] -> [(k, Seq c)]
groupByHashableKey =
forall k v. HashMap k v -> [(k, v)]
HMS.toList forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall k v.
(Eq k, Hashable k) =>
(v -> v -> v) -> [(k, v)] -> HashMap k v
HMS.fromListWith forall a. Semigroup a => a -> a -> a
(<>) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (d, b) (d, c)
second forall a. a -> Seq a
Seq.singleton)
{-# INLINABLE groupByHashableKey #-}
groupByOrderedKey :: Ord k => [(k, c)] -> [(k, Seq.Seq c)]
groupByOrderedKey :: forall k c. Ord k => [(k, c)] -> [(k, Seq c)]
groupByOrderedKey =
forall k a. Map k a -> [(k, a)]
MS.toList forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall k a. Ord k => (a -> a -> a) -> [(k, a)] -> Map k a
MS.fromListWith forall a. Semigroup a => a -> a -> a
(<>) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (d, b) (d, c)
second forall a. a -> Seq a
Seq.singleton)
{-# INLINABLE groupByOrderedKey #-}
listEngine
:: (Foldable g, Functor g)
=> ([(k, c)] -> [(k, g c)])
-> MRE.MapReduceFold y k c [] x d
listEngine :: forall (g :: * -> *) k c y x d.
(Foldable g, Functor g) =>
([(k, c)] -> [(k, g c)]) -> MapReduceFold y k c [] x d
listEngine [(k, c)] -> [(k, g c)]
groupByKey Unpack x y
u (MRC.Assign y -> (k, c)
a) Reduce k c d
r = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap
(forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry forall a b. (a -> b) -> a -> b
$ forall (h :: * -> *) k x d.
(Foldable h, Functor h) =>
Reduce k x d -> k -> h x -> d
MRE.reduceFunction Reduce k c d
r) forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(k, c)] -> [(k, g c)]
groupByKey forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap y -> (k, c)
a forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall x y. Unpack x y -> [x] -> [y]
unpackList Unpack x y
u)
forall a. Fold a [a]
FL.list
{-# INLINABLE listEngine #-}
listEngineM
:: (Monad m, Traversable g)
=> ([(k, c)] -> [(k, g c)])
-> MRE.MapReduceFoldM m y k c [] x d
listEngineM :: forall (m :: * -> *) (g :: * -> *) k c y x d.
(Monad m, Traversable g) =>
([(k, c)] -> [(k, g c)]) -> MapReduceFoldM m y k c [] x d
listEngineM [(k, c)] -> [(k, g c)]
groupByKey UnpackM m x y
u (MRC.AssignM y -> m (k, c)
a) ReduceM m k c d
rM = forall (m :: * -> *) a b x.
Monad m =>
(a -> m b) -> FoldM m x a -> FoldM m x b
MRC.postMapM
( (forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse (forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry forall a b. (a -> b) -> a -> b
$ forall (h :: * -> *) (m :: * -> *) k x d.
(Traversable h, Monad m) =>
ReduceM m k x d -> k -> h x -> m d
MRE.reduceFunctionM ReduceM m k c d
rM) forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<<)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap [(k, c)] -> [(k, g c)]
groupByKey
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse y -> m (k, c)
a forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<<)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (m :: * -> *) x y. UnpackM m x y -> [x] -> m [y]
unpackListM UnpackM m x y
u
)
(forall (m :: * -> *) a b. Monad m => Fold a b -> FoldM m a b
FL.generalize forall a. Fold a [a]
FL.list)
{-# INLINABLE listEngineM #-}