{-# LANGUAGE MagicHash #-}
{-# LANGUAGE UnboxedTuples #-}

module Data.Maybe.Unpacked.Numeric.Float
  ( 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 (Float (F#), Float#)

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

data Maybe = Maybe (# (# #) | Float# #)

instance Eq Maybe where
  Maybe
ma == :: Maybe -> Maybe -> Bool
== Maybe
mb =
    Bool -> (Float -> Bool) -> Maybe -> Bool
forall a. a -> (Float -> a) -> Maybe -> a
maybe
      (Maybe -> Bool
isNothing Maybe
mb)
      (\Float
a -> Bool -> (Float -> Bool) -> Maybe -> Bool
forall a. a -> (Float -> a) -> Maybe -> a
maybe Bool
False (\Float
b -> Float
a Float -> Float -> Bool
forall a. Eq a => a -> a -> Bool
== Float
b) Maybe
mb)
      Maybe
ma

instance Ord Maybe where
  compare :: Maybe -> Maybe -> Ordering
compare (Maybe (# (# #) | Float# #)
ma) (Maybe (# (# #) | Float# #)
mb) = case (# (# #) | Float# #)
ma of
    (# (# #) | #) -> case (# (# #) | Float# #)
mb of
      (# (# #) | #) -> Ordering
EQ
      (# | Float#
_ #) -> Ordering
LT
    (# | Float#
a #) -> case (# (# #) | Float# #)
mb of
      (# (# #) | #) -> Ordering
GT
      (# | Float#
b #) -> Float -> Float -> Ordering
forall a. Ord a => a -> a -> Ordering
compare (Float# -> Float
F# Float#
a) (Float# -> Float
F# Float#
b)

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

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

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

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

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

mapMaybe :: (a -> Maybe) -> [a] -> [Float]
mapMaybe :: forall a. (a -> Maybe) -> [a] -> [Float]
mapMaybe a -> Maybe
_ [] = []
mapMaybe a -> Maybe
f (a
a : [a]
as) =
  let ws :: [Float]
ws = (a -> Maybe) -> [a] -> [Float]
forall a. (a -> Maybe) -> [a] -> [Float]
mapMaybe a -> Maybe
f [a]
as
   in [Float] -> (Float -> [Float]) -> Maybe -> [Float]
forall a. a -> (Float -> a) -> Maybe -> a
maybe [Float]
ws (Float -> [Float] -> [Float]
forall a. a -> [a] -> [a]
: [Float]
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 :: (Float -> r -> r) -> (a -> Maybe) -> a -> r -> r
mapMaybeFB :: forall r a. (Float -> r -> r) -> (a -> Maybe) -> a -> r -> r
mapMaybeFB Float -> r -> r
cons a -> Maybe
f a
x r
next = r -> (Float -> r) -> Maybe -> r
forall a. a -> (Float -> a) -> Maybe -> a
maybe r
next ((Float -> r -> r) -> r -> Float -> r
forall a b c. (a -> b -> c) -> b -> a -> c
flip Float -> r -> r
cons r
next) (a -> Maybe
f a
x)

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

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

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

just :: Float -> Maybe
just :: Float -> Maybe
just (F# Float#
d) = (# (# #) | Float# #) -> Maybe
Maybe (# | Float#
d #)

fromMaybe :: Float -> Maybe -> Float
fromMaybe :: Float -> Maybe -> Float
fromMaybe Float
a (Maybe (# (# #) | Float# #)
m) = case (# (# #) | Float# #)
m of
  (# (# #) | #) -> Float
a
  (# | Float#
d #) -> Float# -> Float
F# Float#
d

maybe :: a -> (Float -> a) -> Maybe -> a
maybe :: forall a. a -> (Float -> a) -> Maybe -> a
maybe a
a Float -> a
f (Maybe (# (# #) | Float# #)
m) = case (# (# #) | Float# #)
m of
  (# (# #) | #) -> a
a
  (# | Float#
d #) -> Float -> a
f (Float# -> Float
F# Float#
d)

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

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