Safe Haskell	Safe
Language	Haskell2010

Data.Prd.Nan

Documentation

data Nan a Source #

Constructors

NaN
Def a

Instances

Functor Nan Source #
Instance details Defined in Data.Prd.Nan Methods fmap :: (a -> b) -> Nan a -> Nan b # (<$) :: a -> Nan b -> Nan a #
Applicative Nan Source #
Instance details Defined in Data.Prd.Nan Methods pure :: a -> Nan a # (<>) :: Nan (a -> b) -> Nan a -> Nan b # liftA2 :: (a -> b -> c) -> Nan a -> Nan b -> Nan c # (>) :: Nan a -> Nan b -> Nan b # (<*) :: Nan a -> Nan b -> Nan a #
Foldable Nan Source #
Instance details Defined in Data.Prd.Nan Methods fold :: Monoid m => Nan m -> m # foldMap :: Monoid m => (a -> m) -> Nan a -> m # foldr :: (a -> b -> b) -> b -> Nan a -> b # foldr' :: (a -> b -> b) -> b -> Nan a -> b # foldl :: (b -> a -> b) -> b -> Nan a -> b # foldl' :: (b -> a -> b) -> b -> Nan a -> b # foldr1 :: (a -> a -> a) -> Nan a -> a # foldl1 :: (a -> a -> a) -> Nan a -> a # toList :: Nan a -> [a] # null :: Nan a -> Bool # length :: Nan a -> Int # elem :: Eq a => a -> Nan a -> Bool # maximum :: Ord a => Nan a -> a # minimum :: Ord a => Nan a -> a # sum :: Num a => Nan a -> a # product :: Num a => Nan a -> a #
Traversable Nan Source #
Instance details Defined in Data.Prd.Nan Methods traverse :: Applicative f => (a -> f b) -> Nan a -> f (Nan b) # sequenceA :: Applicative f => Nan (f a) -> f (Nan a) # mapM :: Monad m => (a -> m b) -> Nan a -> m (Nan b) # sequence :: Monad m => Nan (m a) -> m (Nan a) #
Eq a => Eq (Nan a) Source #
Instance details Defined in Data.Prd.Nan Methods (==) :: Nan a -> Nan a -> Bool # (/=) :: Nan a -> Nan a -> Bool #
Data a => Data (Nan a) Source #
Instance details Defined in Data.Prd.Nan Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Nan a -> c (Nan a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Nan a) # toConstr :: Nan a -> Constr # dataTypeOf :: Nan a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Nan a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Nan a)) # gmapT :: (forall b. Data b => b -> b) -> Nan a -> Nan a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Nan a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Nan a -> r # gmapQ :: (forall d. Data d => d -> u) -> Nan a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Nan a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Nan a -> m (Nan a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Nan a -> m (Nan a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Nan a -> m (Nan a) #
Num a => Num (Nan a) Source #
Instance details Defined in Data.Prd.Nan Methods (+) :: Nan a -> Nan a -> Nan a # (-) :: Nan a -> Nan a -> Nan a # (*) :: Nan a -> Nan a -> Nan a # negate :: Nan a -> Nan a # abs :: Nan a -> Nan a # signum :: Nan a -> Nan a # fromInteger :: Integer -> Nan a #
Ord a => Ord (Nan a) Source #
Instance details Defined in Data.Prd.Nan Methods compare :: Nan a -> Nan a -> Ordering # (<) :: Nan a -> Nan a -> Bool # (<=) :: Nan a -> Nan a -> Bool # (>) :: Nan a -> Nan a -> Bool # (>=) :: Nan a -> Nan a -> Bool # max :: Nan a -> Nan a -> Nan a # min :: Nan a -> Nan a -> Nan a #
Show a => Show (Nan a) Source #
Instance details Defined in Data.Prd.Nan Methods showsPrec :: Int -> Nan a -> ShowS # show :: Nan a -> String # showList :: [Nan a] -> ShowS #
Generic (Nan a) Source #
Instance details Defined in Data.Prd.Nan Associated Types type Rep (Nan a) :: Type -> Type # Methods from :: Nan a -> Rep (Nan a) x # to :: Rep (Nan a) x -> Nan a #
Prd a => Prd (Nan a) Source #
Instance details Defined in Data.Prd.Nan Methods (<~) :: Nan a -> Nan a -> Bool Source # (>~) :: Nan a -> Nan a -> Bool Source # (=~) :: Nan a -> Nan a -> Bool Source # (?~) :: Nan a -> Nan a -> Bool Source # pcompare :: Nan a -> Nan a -> Maybe Ordering Source #
Generic1 Nan Source #
Instance details Defined in Data.Prd.Nan Associated Types type Rep1 Nan :: k -> Type # Methods from1 :: Nan a -> Rep1 Nan a # to1 :: Rep1 Nan a -> Nan a #
type Rep (Nan a) Source #
Instance details Defined in Data.Prd.Nan type Rep (Nan a) = D1 (MetaData "Nan" "Data.Prd.Nan" "connections-0.0.2-3bGTwkYWIphGQUrhB8xvK6" False) (C1 (MetaCons "NaN" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Def" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Rep1 Nan Source #
Instance details Defined in Data.Prd.Nan type Rep1 Nan = D1 (MetaData "Nan" "Data.Prd.Nan" "connections-0.0.2-3bGTwkYWIphGQUrhB8xvK6" False) (C1 (MetaCons "NaN" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Def" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

nan :: b -> (a -> b) -> Nan a -> b Source #

defined :: Nan a -> Bool Source #

mapNan :: (a -> b) -> Nan a -> Nan b Source #

maybeNan :: (forall a. a -> a) -> Maybe a -> Nan a Source #

nanMaybe :: (forall a. a -> a) -> Nan a -> Maybe a Source #

eitherNan :: Either a b -> Nan b Source #

nanEither :: a -> Nan b -> Either a b Source #

liftNan :: (Prd a, Fractional a) => (a -> b) -> a -> Nan b Source #

liftNan' :: RealFloat a => (a -> b) -> a -> Nan b Source #

liftAll :: (RealFloat a, Prd a, Bound b) => (a -> b) -> a -> Nan b Source #

isInf :: (RealFloat a, Prd a) => a -> Bool Source #

floatOrdering :: (RealFloat a, Prd a) => Trip a (Nan Ordering) Source #

nanflt :: Prd a => Fractional a => Conn (Nan a) a Source #

def :: Prd a => Prd b => Conn a b -> Conn (Nan a) (Nan b) Source #