{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE NamedFieldPuns #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TemplateHaskellQuotes #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}

module Data.Mergeable.OrdMap
  ( OrdMap,
  )
where

import Control.Monad.Except (MonadError)
import qualified Data.HashMap.Lazy as HM
import Data.List ((\\))
import Data.Mergeable.Internal.Merge (Merge (..))
import Data.Mergeable.Internal.NameCollision (NameCollision (..))
import Data.Mergeable.IsMap
  ( FromList (..),
    IsMap (..),
  )
import Data.Morpheus.Ext.Empty (Empty (..))
import Language.Haskell.TH.Syntax (Lift (..))
import Relude hiding (fromList)

-- OrdMap
data OrdMap k a = OrdMap
  { forall k a. OrdMap k a -> [k]
order :: [k],
    forall k a. OrdMap k a -> HashMap k a
entries :: HashMap k a
  }
  deriving
    ( Int -> OrdMap k a -> ShowS
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k a. (Show k, Show a) => Int -> OrdMap k a -> ShowS
forall k a. (Show k, Show a) => [OrdMap k a] -> ShowS
forall k a. (Show k, Show a) => OrdMap k a -> String
showList :: [OrdMap k a] -> ShowS
$cshowList :: forall k a. (Show k, Show a) => [OrdMap k a] -> ShowS
show :: OrdMap k a -> String
$cshow :: forall k a. (Show k, Show a) => OrdMap k a -> String
showsPrec :: Int -> OrdMap k a -> ShowS
$cshowsPrec :: forall k a. (Show k, Show a) => Int -> OrdMap k a -> ShowS
Show,
      OrdMap k a -> OrdMap k a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall k a. (Eq k, Eq a) => OrdMap k a -> OrdMap k a -> Bool
/= :: OrdMap k a -> OrdMap k a -> Bool
$c/= :: forall k a. (Eq k, Eq a) => OrdMap k a -> OrdMap k a -> Bool
== :: OrdMap k a -> OrdMap k a -> Bool
$c== :: forall k a. (Eq k, Eq a) => OrdMap k a -> OrdMap k a -> Bool
Eq,
      forall a b. a -> OrdMap k b -> OrdMap k a
forall a b. (a -> b) -> OrdMap k a -> OrdMap k b
forall k a b. a -> OrdMap k b -> OrdMap k a
forall k a b. (a -> b) -> OrdMap k a -> OrdMap k b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> OrdMap k b -> OrdMap k a
$c<$ :: forall k a b. a -> OrdMap k b -> OrdMap k a
fmap :: forall a b. (a -> b) -> OrdMap k a -> OrdMap k b
$cfmap :: forall k a b. (a -> b) -> OrdMap k a -> OrdMap k b
Functor,
      forall {k}. Hashable k => Functor (OrdMap k)
forall {k}. Hashable k => Foldable (OrdMap k)
forall k (m :: * -> *) a.
(Hashable k, Monad m) =>
OrdMap k (m a) -> m (OrdMap k a)
forall k (f :: * -> *) a.
(Hashable k, Applicative f) =>
OrdMap k (f a) -> f (OrdMap k a)
forall k (m :: * -> *) a b.
(Hashable k, Monad m) =>
(a -> m b) -> OrdMap k a -> m (OrdMap k b)
forall k (f :: * -> *) a b.
(Hashable k, Applicative f) =>
(a -> f b) -> OrdMap k a -> f (OrdMap k b)
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> OrdMap k a -> f (OrdMap k b)
sequence :: forall (m :: * -> *) a. Monad m => OrdMap k (m a) -> m (OrdMap k a)
$csequence :: forall k (m :: * -> *) a.
(Hashable k, Monad m) =>
OrdMap k (m a) -> m (OrdMap k a)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> OrdMap k a -> m (OrdMap k b)
$cmapM :: forall k (m :: * -> *) a b.
(Hashable k, Monad m) =>
(a -> m b) -> OrdMap k a -> m (OrdMap k b)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
OrdMap k (f a) -> f (OrdMap k a)
$csequenceA :: forall k (f :: * -> *) a.
(Hashable k, Applicative f) =>
OrdMap k (f a) -> f (OrdMap k a)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> OrdMap k a -> f (OrdMap k b)
$ctraverse :: forall k (f :: * -> *) a b.
(Hashable k, Applicative f) =>
(a -> f b) -> OrdMap k a -> f (OrdMap k b)
Traversable,
      forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall k a x. Rep (OrdMap k a) x -> OrdMap k a
forall k a x. OrdMap k a -> Rep (OrdMap k a) x
$cto :: forall k a x. Rep (OrdMap k a) x -> OrdMap k a
$cfrom :: forall k a x. OrdMap k a -> Rep (OrdMap k a) x
Generic,
      forall a. Eq a -> (Int -> a -> Int) -> (a -> Int) -> Hashable a
forall {k} {a}. (Hashable k, Hashable a) => Eq (OrdMap k a)
forall k a. (Hashable k, Hashable a) => Int -> OrdMap k a -> Int
forall k a. (Hashable k, Hashable a) => OrdMap k a -> Int
hash :: OrdMap k a -> Int
$chash :: forall k a. (Hashable k, Hashable a) => OrdMap k a -> Int
hashWithSalt :: Int -> OrdMap k a -> Int
$chashWithSalt :: forall k a. (Hashable k, Hashable a) => Int -> OrdMap k a -> Int
Hashable
    )

instance Empty (OrdMap k a) where
  empty :: OrdMap k a
empty = forall k a. [k] -> HashMap k a -> OrdMap k a
OrdMap [] forall k v. HashMap k v
HM.empty

instance (Lift a, Lift k, Eq k, Hashable k) => Lift (OrdMap k a) where
  lift :: forall (m :: * -> *). Quote m => OrdMap k a -> m Exp
lift (OrdMap [k]
ks HashMap k a
xs) = [|OrdMap ks (HM.fromList ls)|]
    where
      ls :: [(k, a)]
ls = forall k v. HashMap k v -> [(k, v)]
HM.toList HashMap k a
xs

#if MIN_VERSION_template_haskell(2,16,0)
  liftTyped :: forall (m :: * -> *). Quote m => OrdMap k a -> Code m (OrdMap k a)
liftTyped (OrdMap [k]
ks HashMap k a
x) = [||OrdMap ks (HM.fromList ls)||]
    where
      ls :: [(k, a)]
ls = forall k v. HashMap k v -> [(k, v)]
HM.toList HashMap k a
x
#endif

instance (Eq k, Hashable k) => Foldable (OrdMap k) where
  foldMap :: forall m a. Monoid m => (a -> m) -> OrdMap k a -> m
foldMap a -> m
f OrdMap {[k]
order :: [k]
order :: forall k a. OrdMap k a -> [k]
order, HashMap k a
entries :: HashMap k a
entries :: forall k a. OrdMap k a -> HashMap k a
entries} = forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap a -> m
f (forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe (forall k v. (Eq k, Hashable k) => k -> HashMap k v -> Maybe v
`HM.lookup` HashMap k a
entries) [k]
order)

instance (Eq k, Hashable k) => IsMap k (OrdMap k) where
  unsafeFromList :: forall a. [(k, a)] -> OrdMap k a
unsafeFromList [(k, a)]
xs = forall k a. [k] -> HashMap k a -> OrdMap k a
OrdMap (forall a b. (a -> b) -> [a] -> [b]
map forall a b. (a, b) -> a
fst [(k, a)]
xs) (forall k (m :: * -> *) a. IsMap k m => [(k, a)] -> m a
unsafeFromList [(k, a)]
xs)
  singleton :: forall a. k -> a -> OrdMap k a
singleton k
k a
x = forall k a. [k] -> HashMap k a -> OrdMap k a
OrdMap [k
k] (forall k (m :: * -> *) a. IsMap k m => k -> a -> m a
singleton k
k a
x)
  lookup :: forall a. k -> OrdMap k a -> Maybe a
lookup k
key OrdMap {HashMap k a
entries :: HashMap k a
entries :: forall k a. OrdMap k a -> HashMap k a
entries} = forall k (m :: * -> *) a. IsMap k m => k -> m a -> Maybe a
lookup k
key HashMap k a
entries
  toAssoc :: forall a. OrdMap k a -> [(k, a)]
toAssoc OrdMap {[k]
order :: [k]
order :: forall k a. OrdMap k a -> [k]
order, HashMap k a
entries :: HashMap k a
entries :: forall k a. OrdMap k a -> HashMap k a
entries} = forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe (\k
k -> (k
k,) forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall k v. (Eq k, Hashable k) => k -> HashMap k v -> Maybe v
HM.lookup k
k HashMap k a
entries) [k]
order

instance (NameCollision e a, Eq k, Hashable k, Monad m, MonadError e m) => Merge m (OrdMap k a) where
  merge :: Monad m => OrdMap k a -> OrdMap k a -> m (OrdMap k a)
merge (OrdMap [k]
ks1 HashMap k a
x) (OrdMap [k]
ks2 HashMap k a
y) = forall k a. [k] -> HashMap k a -> OrdMap k a
OrdMap (forall a. Eq a => [a] -> [a] -> [a]
mergeOrder [k]
ks1 [k]
ks2) forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (m :: * -> *) a. (Merge m a, Monad m) => a -> a -> m a
merge HashMap k a
x HashMap k a
y

mergeOrder :: Eq a => [a] -> [a] -> [a]
mergeOrder :: forall a. Eq a => [a] -> [a] -> [a]
mergeOrder [a]
ks1 [a]
ks2 = [a]
ks1 forall a. Semigroup a => a -> a -> a
<> ([a]
ks2 forall a. Eq a => [a] -> [a] -> [a]
\\ [a]
ks1)

instance
  ( Hashable k,
    Eq k,
    NameCollision e a,
    MonadError e m
  ) =>
  FromList m OrdMap k a
  where
  fromList :: Monad m => [(k, a)] -> m (OrdMap k a)
fromList [(k, a)]
xs = forall k a. [k] -> HashMap k a -> OrdMap k a
OrdMap (forall a b. (a -> b) -> [a] -> [b]
map forall a b. (a, b) -> a
fst [(k, a)]
xs) forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (m :: * -> *) (map :: * -> * -> *) k a.
(FromList m map k a, Monad m) =>
[(k, a)] -> m (map k a)
fromList [(k, a)]
xs