{-# LANGUAGE BangPatterns #-} {-# LANGUAGE LambdaCase #-} {-# LANGUAGE MagicHash #-} {-# LANGUAGE UnboxedSums #-} {-# LANGUAGE UnboxedTuples #-} module Data.Maybe.Unpacked.Numeric.Double ( 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 (Double#,Double(D#)) 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 (# (# #) | Double# #) instance Eq Maybe where Maybe ma == :: Maybe -> Maybe -> Bool == Maybe mb = forall a. a -> (Double -> a) -> Maybe -> a maybe (Maybe -> Bool isNothing Maybe mb) (\Double a -> forall a. a -> (Double -> a) -> Maybe -> a maybe Bool False (\Double b -> Double a forall a. Eq a => a -> a -> Bool == Double b) Maybe mb) Maybe ma instance Ord Maybe where compare :: Maybe -> Maybe -> Ordering compare Maybe ma Maybe mb = forall a. a -> (Double -> a) -> Maybe -> a maybe Ordering LT (\Double a -> forall a. a -> (Double -> a) -> Maybe -> a maybe Ordering GT (forall a. Ord a => a -> a -> Ordering compare Double a) Maybe mb) Maybe ma instance Show Maybe where showsPrec :: Int -> Maybe -> ShowS showsPrec Int p (Maybe (# (# #) | Double# #) m) = case (# (# #) | Double# #) m of (# (# #) | #) -> String -> ShowS showString String "nothing" (# | Double# d #) -> 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 (Double# -> Double D# Double# d) 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 Double a <- forall a. ReadPrec a -> ReadPrec a step forall a. Read a => ReadPrec a readPrec forall (m :: * -> *) a. Monad m => a -> m a return (Double -> Maybe just Double a) listToMaybe :: [Double] -> Maybe listToMaybe :: [Double] -> Maybe listToMaybe [] = Maybe nothing listToMaybe (Double x:[Double] _) = Double -> Maybe just Double x maybeToList :: Maybe -> [Double] maybeToList :: Maybe -> [Double] maybeToList = forall a. a -> (Double -> a) -> Maybe -> a maybe [] (forall a. a -> [a] -> [a] : []) catMaybes :: [Maybe] -> [Double] catMaybes :: [Maybe] -> [Double] catMaybes = forall a. (a -> Maybe) -> [a] -> [Double] mapMaybe forall a. a -> a id mapMaybe :: (a -> Maybe) -> [a] -> [Double] mapMaybe :: forall a. (a -> Maybe) -> [a] -> [Double] mapMaybe a -> Maybe _ [] = [] mapMaybe a -> Maybe f (a a : [a] as) = let ws :: [Double] ws = forall a. (a -> Maybe) -> [a] -> [Double] mapMaybe a -> Maybe f [a] as in forall a. a -> (Double -> a) -> Maybe -> a maybe [Double] ws (forall a. a -> [a] -> [a] : [Double] 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 :: (Double -> r -> r) -> (a -> Maybe) -> a -> r -> r mapMaybeFB :: forall r a. (Double -> r -> r) -> (a -> Maybe) -> a -> r -> r mapMaybeFB Double -> r -> r cons a -> Maybe f a x r next = forall a. a -> (Double -> a) -> Maybe -> a maybe r next (forall a b c. (a -> b -> c) -> b -> a -> c flip Double -> r -> r cons r next) (a -> Maybe f a x) isNothing :: Maybe -> Bool isNothing :: Maybe -> Bool isNothing = forall a. a -> (Double -> 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 -> (Double -> a) -> Maybe -> a maybe Bool False (forall a b. a -> b -> a const Bool True) nothing :: Maybe nothing :: Maybe nothing = (# (# #) | Double# #) -> Maybe Maybe (# (# #) | #) just :: Double -> Maybe just :: Double -> Maybe just (D# Double# d) = (# (# #) | Double# #) -> Maybe Maybe (# | Double# d #) fromMaybe :: Double -> Maybe -> Double fromMaybe :: Double -> Maybe -> Double fromMaybe Double a (Maybe (# (# #) | Double# #) m) = case (# (# #) | Double# #) m of (# (# #) | #) -> Double a (# | Double# d #) -> Double# -> Double D# Double# d maybe :: a -> (Double -> a) -> Maybe -> a maybe :: forall a. a -> (Double -> a) -> Maybe -> a maybe a a Double -> a f (Maybe (# (# #) | Double# #) m) = case (# (# #) | Double# #) m of (# (# #) | #) -> a a (# | Double# d #) -> Double -> a f (Double# -> Double D# Double# d) toBaseMaybe :: Maybe -> P.Maybe Double toBaseMaybe :: Maybe -> Maybe Double toBaseMaybe = forall a. a -> (Double -> a) -> Maybe -> a maybe forall a. Maybe a P.Nothing forall a. a -> Maybe a P.Just fromBaseMaybe :: P.Maybe Double -> Maybe fromBaseMaybe :: Maybe Double -> Maybe fromBaseMaybe = forall b a. b -> (a -> b) -> Maybe a -> b P.maybe Maybe nothing Double -> Maybe just