{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE UnboxedSums #-}
{-# LANGUAGE UnboxedTuples #-}

module Data.Maybe.Unpacked.Numeric.Int64
  ( Maybe(..)
  , just
  , nothing

  , maybe

  , isJust
  , isNothing
  , fromMaybe
  , listToMaybe
  , maybeToList
  , catMaybes
  , mapMaybe

  , toBaseMaybe
  , fromBaseMaybe
  ) where 

import Prelude hiding (Maybe,maybe)

import GHC.Base (build)
import GHC.Exts (Int#)
import GHC.Int (Int64(I64#))

import GHC.Read (Read(readPrec))
import Text.Read (parens, Lexeme(Ident), lexP, (+++))
import Text.ParserCombinators.ReadPrec (prec, step)

import qualified Prelude as P

data Maybe = Maybe (# (# #) | Int# #)

instance Eq Maybe where
  Maybe
ma == :: Maybe -> Maybe -> Bool
== Maybe
mb =
    forall a. a -> (Int64 -> a) -> Maybe -> a
maybe (Maybe -> Bool
isNothing Maybe
mb)
          (\Int64
a -> forall a. a -> (Int64 -> a) -> Maybe -> a
maybe Bool
False (\Int64
b -> Int64
a forall a. Eq a => a -> a -> Bool
== Int64
b) Maybe
mb) Maybe
ma
    
instance Ord Maybe where
  compare :: Maybe -> Maybe -> Ordering
compare Maybe
ma Maybe
mb = forall a. a -> (Int64 -> a) -> Maybe -> a
maybe Ordering
LT (\Int64
a -> forall a. a -> (Int64 -> a) -> Maybe -> a
maybe Ordering
GT (forall a. Ord a => a -> a -> Ordering
compare Int64
a) Maybe
mb) Maybe
ma  

instance Show Maybe where
  showsPrec :: Int -> Maybe -> ShowS
showsPrec Int
p (Maybe (# (# #) | Int# #)
m) = case (# (# #) | Int# #)
m of
    (# (# #) | #) -> String -> ShowS
showString String
"nothing"
    (# | Int#
i #) -> Bool -> ShowS -> ShowS
showParen (Int
p forall a. Ord a => a -> a -> Bool
> Int
10)
      forall a b. (a -> b) -> a -> b
$ String -> ShowS
showString String
"just "
      forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Show a => Int -> a -> ShowS
showsPrec Int
11 (Int# -> Int64
I64# Int#
i)

instance Read Maybe where
  readPrec :: ReadPrec Maybe
readPrec = forall a. ReadPrec a -> ReadPrec a
parens forall a b. (a -> b) -> a -> b
$ ReadPrec Maybe
nothingP forall a. ReadPrec a -> ReadPrec a -> ReadPrec a
+++ ReadPrec Maybe
justP
    where
      nothingP :: ReadPrec Maybe
nothingP = do
        Ident String
"nothing" <- ReadPrec Lexeme
lexP
        forall (m :: * -> *) a. Monad m => a -> m a
return Maybe
nothing
      justP :: ReadPrec Maybe
justP = forall a. Int -> ReadPrec a -> ReadPrec a
prec Int
10 forall a b. (a -> b) -> a -> b
$ do
        Ident String
"just" <- ReadPrec Lexeme
lexP
        Int64
a <- forall a. ReadPrec a -> ReadPrec a
step forall a. Read a => ReadPrec a
readPrec
        forall (m :: * -> *) a. Monad m => a -> m a
return (Int64 -> Maybe
just Int64
a)

listToMaybe :: [Int64] -> Maybe
listToMaybe :: [Int64] -> Maybe
listToMaybe [] = Maybe
nothing
listToMaybe (Int64
x:[Int64]
_) = Int64 -> Maybe
just Int64
x

maybeToList :: Maybe -> [Int64]
maybeToList :: Maybe -> [Int64]
maybeToList = forall a. a -> (Int64 -> a) -> Maybe -> a
maybe [] (forall a. a -> [a] -> [a]
: [])

catMaybes :: [Maybe] -> [Int64]
catMaybes :: [Maybe] -> [Int64]
catMaybes = forall a. (a -> Maybe) -> [a] -> [Int64]
mapMaybe forall a. a -> a
id

mapMaybe :: (a -> Maybe) -> [a] -> [Int64]
mapMaybe :: forall a. (a -> Maybe) -> [a] -> [Int64]
mapMaybe a -> Maybe
_ [] = []
mapMaybe a -> Maybe
f (a
a : [a]
as) =
  let ws :: [Int64]
ws = forall a. (a -> Maybe) -> [a] -> [Int64]
mapMaybe a -> Maybe
f [a]
as
  in forall a. a -> (Int64 -> a) -> Maybe -> a
maybe [Int64]
ws (forall a. a -> [a] -> [a]
: [Int64]
ws) (a -> Maybe
f a
a)
{-# NOINLINE [1] mapMaybe #-}

{-# RULES
"mapMaybe"     [~1] forall f xs. mapMaybe f xs
                    = build (\c n -> foldr (mapMaybeFB c f) n xs)
"mapMaybeList" [1]  forall f. foldr (mapMaybeFB (:) f) [] = mapMaybe f
  #-}

{-# NOINLINE [0] mapMaybeFB #-}
mapMaybeFB :: (Int64 -> r -> r) -> (a -> Maybe) -> a -> r -> r
mapMaybeFB :: forall r a. (Int64 -> r -> r) -> (a -> Maybe) -> a -> r -> r
mapMaybeFB Int64 -> r -> r
cons a -> Maybe
f a
x r
next = forall a. a -> (Int64 -> a) -> Maybe -> a
maybe r
next (forall a b c. (a -> b -> c) -> b -> a -> c
flip Int64 -> r -> r
cons r
next) (a -> Maybe
f a
x)

isNothing :: Maybe -> Bool
isNothing :: Maybe -> Bool
isNothing = forall a. a -> (Int64 -> a) -> Maybe -> a
maybe Bool
True (forall a b. a -> b -> a
const Bool
False)

isJust :: Maybe -> Bool
isJust :: Maybe -> Bool
isJust = forall a. a -> (Int64 -> a) -> Maybe -> a
maybe Bool
False (forall a b. a -> b -> a
const Bool
True)

nothing :: Maybe
nothing :: Maybe
nothing = (# (# #) | Int# #) -> Maybe
Maybe (# (# #) | #)

just :: Int64 -> Maybe
just :: Int64 -> Maybe
just (I64# Int#
i) = (# (# #) | Int# #) -> Maybe
Maybe (# | Int#
i #)

fromMaybe :: Int64 -> Maybe -> Int64
fromMaybe :: Int64 -> Maybe -> Int64
fromMaybe Int64
a (Maybe (# (# #) | Int# #)
m) = case (# (# #) | Int# #)
m of
  (# (# #) | #) -> Int64
a
  (# | Int#
i #) -> Int# -> Int64
I64# Int#
i

maybe :: a -> (Int64 -> a) -> Maybe -> a
maybe :: forall a. a -> (Int64 -> a) -> Maybe -> a
maybe a
a Int64 -> a
f (Maybe (# (# #) | Int# #)
m) = case (# (# #) | Int# #)
m of
  (# (# #) | #) -> a
a
  (# | Int#
i #) -> Int64 -> a
f (Int# -> Int64
I64# Int#
i)

toBaseMaybe :: Maybe -> P.Maybe Int64
toBaseMaybe :: Maybe -> Maybe Int64
toBaseMaybe = forall a. a -> (Int64 -> a) -> Maybe -> a
maybe forall a. Maybe a
P.Nothing forall a. a -> Maybe a
P.Just

fromBaseMaybe :: P.Maybe Int64 -> Maybe
fromBaseMaybe :: Maybe Int64 -> Maybe
fromBaseMaybe = forall b a. b -> (a -> b) -> Maybe a -> b
P.maybe Maybe
nothing Int64 -> Maybe
just