{-# LANGUAGE DeriveFunctor, DeriveFoldable, DeriveTraversable #-}

module Data.JsonRpc.Success (
  Success (..), success,
  ) where

import Data.Text (Text, pack)
import Data.Foldable (Foldable)
import Data.Traversable (Traversable)

import Data.JsonRpc.Id (Id)


data Success a =
  Success
  { Success a -> Text
_jsonrpc :: !Text
  , Success a -> Id
_id      :: !Id
  , Success a -> a
_result  :: !a
  } deriving (Success a -> Success a -> Bool
(Success a -> Success a -> Bool)
-> (Success a -> Success a -> Bool) -> Eq (Success a)
forall a. Eq a => Success a -> Success a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Success a -> Success a -> Bool
$c/= :: forall a. Eq a => Success a -> Success a -> Bool
== :: Success a -> Success a -> Bool
$c== :: forall a. Eq a => Success a -> Success a -> Bool
Eq, Int -> Success a -> ShowS
[Success a] -> ShowS
Success a -> String
(Int -> Success a -> ShowS)
-> (Success a -> String)
-> ([Success a] -> ShowS)
-> Show (Success a)
forall a. Show a => Int -> Success a -> ShowS
forall a. Show a => [Success a] -> ShowS
forall a. Show a => Success a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Success a] -> ShowS
$cshowList :: forall a. Show a => [Success a] -> ShowS
show :: Success a -> String
$cshow :: forall a. Show a => Success a -> String
showsPrec :: Int -> Success a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Success a -> ShowS
Show, a -> Success b -> Success a
(a -> b) -> Success a -> Success b
(forall a b. (a -> b) -> Success a -> Success b)
-> (forall a b. a -> Success b -> Success a) -> Functor Success
forall a b. a -> Success b -> Success a
forall a b. (a -> b) -> Success a -> Success b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: a -> Success b -> Success a
$c<$ :: forall a b. a -> Success b -> Success a
fmap :: (a -> b) -> Success a -> Success b
$cfmap :: forall a b. (a -> b) -> Success a -> Success b
Functor, Success a -> Bool
(a -> m) -> Success a -> m
(a -> b -> b) -> b -> Success a -> b
(forall m. Monoid m => Success m -> m)
-> (forall m a. Monoid m => (a -> m) -> Success a -> m)
-> (forall m a. Monoid m => (a -> m) -> Success a -> m)
-> (forall a b. (a -> b -> b) -> b -> Success a -> b)
-> (forall a b. (a -> b -> b) -> b -> Success a -> b)
-> (forall b a. (b -> a -> b) -> b -> Success a -> b)
-> (forall b a. (b -> a -> b) -> b -> Success a -> b)
-> (forall a. (a -> a -> a) -> Success a -> a)
-> (forall a. (a -> a -> a) -> Success a -> a)
-> (forall a. Success a -> [a])
-> (forall a. Success a -> Bool)
-> (forall a. Success a -> Int)
-> (forall a. Eq a => a -> Success a -> Bool)
-> (forall a. Ord a => Success a -> a)
-> (forall a. Ord a => Success a -> a)
-> (forall a. Num a => Success a -> a)
-> (forall a. Num a => Success a -> a)
-> Foldable Success
forall a. Eq a => a -> Success a -> Bool
forall a. Num a => Success a -> a
forall a. Ord a => Success a -> a
forall m. Monoid m => Success m -> m
forall a. Success a -> Bool
forall a. Success a -> Int
forall a. Success a -> [a]
forall a. (a -> a -> a) -> Success a -> a
forall m a. Monoid m => (a -> m) -> Success a -> m
forall b a. (b -> a -> b) -> b -> Success a -> b
forall a b. (a -> b -> b) -> b -> Success a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: Success a -> a
$cproduct :: forall a. Num a => Success a -> a
sum :: Success a -> a
$csum :: forall a. Num a => Success a -> a
minimum :: Success a -> a
$cminimum :: forall a. Ord a => Success a -> a
maximum :: Success a -> a
$cmaximum :: forall a. Ord a => Success a -> a
elem :: a -> Success a -> Bool
$celem :: forall a. Eq a => a -> Success a -> Bool
length :: Success a -> Int
$clength :: forall a. Success a -> Int
null :: Success a -> Bool
$cnull :: forall a. Success a -> Bool
toList :: Success a -> [a]
$ctoList :: forall a. Success a -> [a]
foldl1 :: (a -> a -> a) -> Success a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Success a -> a
foldr1 :: (a -> a -> a) -> Success a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Success a -> a
foldl' :: (b -> a -> b) -> b -> Success a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Success a -> b
foldl :: (b -> a -> b) -> b -> Success a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Success a -> b
foldr' :: (a -> b -> b) -> b -> Success a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Success a -> b
foldr :: (a -> b -> b) -> b -> Success a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Success a -> b
foldMap' :: (a -> m) -> Success a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Success a -> m
foldMap :: (a -> m) -> Success a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Success a -> m
fold :: Success m -> m
$cfold :: forall m. Monoid m => Success m -> m
Foldable, Functor Success
Foldable Success
Functor Success
-> Foldable Success
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Success a -> f (Success b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    Success (f a) -> f (Success a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Success a -> m (Success b))
-> (forall (m :: * -> *) a.
    Monad m =>
    Success (m a) -> m (Success a))
-> Traversable Success
(a -> f b) -> Success a -> f (Success 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 (m :: * -> *) a. Monad m => Success (m a) -> m (Success a)
forall (f :: * -> *) a.
Applicative f =>
Success (f a) -> f (Success a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Success a -> m (Success b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Success a -> f (Success b)
sequence :: Success (m a) -> m (Success a)
$csequence :: forall (m :: * -> *) a. Monad m => Success (m a) -> m (Success a)
mapM :: (a -> m b) -> Success a -> m (Success b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Success a -> m (Success b)
sequenceA :: Success (f a) -> f (Success a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Success (f a) -> f (Success a)
traverse :: (a -> f b) -> Success a -> f (Success b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Success a -> f (Success b)
$cp2Traversable :: Foldable Success
$cp1Traversable :: Functor Success
Traversable)

success :: Id -> a -> Success a
success :: Id -> a -> Success a
success = Text -> Id -> a -> Success a
forall a. Text -> Id -> a -> Success a
Success (Text -> Id -> a -> Success a) -> Text -> Id -> a -> Success a
forall a b. (a -> b) -> a -> b
$ String -> Text
pack String
"2.0"