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