Commit 9dac95e4 authored by Ian Lynagh's avatar Ian Lynagh

Update ghci025 output

parent e3832db8
-- test :browse! functionality
:browse! *T
-- defined locally
T.length :: GHC.Num.Integer
T.length :: GHC.Integer.Integer
class N a
class S a
class C a b where
......@@ -34,8 +34,8 @@ class Monad m where
catMaybes :: [Maybe a] -> [a]
fromJust :: Maybe a -> a
fromMaybe :: a -> Maybe a -> a
isJust :: Maybe a -> GHC.Base.Bool
isNothing :: Maybe a -> GHC.Base.Bool
isJust :: Maybe a -> GHC.Bool.Bool
isNothing :: Maybe a -> GHC.Bool.Bool
listToMaybe :: [a] -> Maybe a
mapMaybe :: (a -> Maybe b) -> [a] -> [b]
maybe :: b -> (a -> b) -> Maybe a -> b
......@@ -48,15 +48,15 @@ Nothing :: Maybe a
(+) :: (GHC.Num.Num a) => a -> a -> a
(=<<) :: (Monad m) => (a -> m b) -> m a -> m b
class Eq a where
(GHC.Base.==) :: a -> a -> GHC.Base.Bool
(GHC.Base./=) :: a -> a -> GHC.Base.Bool
(GHC.Base.==) :: a -> a -> GHC.Bool.Bool
(GHC.Base./=) :: a -> a -> GHC.Bool.Bool
-- imported via Prelude, T
Prelude.length :: [a] -> GHC.Base.Int
-- imported via T
T.length :: Data.ByteString.Internal.ByteString -> GHC.Base.Int
:browse! T
-- defined locally
T.length :: GHC.Num.Integer
T.length :: GHC.Integer.Integer
class N a
class S a
class C a b where
......@@ -70,7 +70,7 @@ c3 :: (C a b) => a1 -> b
c4 :: (C a b) => a1 -> b
:browse! T -- with -fglasgow-exts
-- defined locally
T.length :: GHC.Num.Integer
T.length :: GHC.Integer.Integer
class N a
class S a
class C a b where
......
-- test :browse! functionality
:browse! *T
-- defined locally
T.length :: GHC.Num.Integer
class N a
class S a
class C a b where
c1 :: (N b) => a -> b
c2 :: (N b, S b) => a -> b
c3 :: a1 -> b
c4 :: a1 -> b
c1 :: (C a b, N b) => a -> b
c2 :: (C a b, N b, S b) => a -> b
c3 :: (C a b) => a1 -> b
c4 :: (C a b) => a1 -> b
-- imported via Control.Monad
class (Monad m) => MonadPlus m where
mzero :: m a
mplus :: m a -> m a -> m a
mplus :: (MonadPlus m) => m a -> m a -> m a
mzero :: (MonadPlus m) => m a
-- imported via Control.Monad, Prelude
(>>) :: (Monad m) => m a -> m b -> m b
(>>=) :: (Monad m) => m a -> (a -> m b) -> m b
fail :: (Monad m) => GHC.Base.String -> m a
return :: (Monad m) => a -> m a
-- imported via Control.Monad, Prelude, T
class Monad m where
(>>=) :: m a -> (a -> m b) -> m b
(>>) :: m a -> m b -> m b
return :: a -> m a
fail :: GHC.Base.String -> m a
-- imported via Data.Maybe
catMaybes :: [Maybe a] -> [a]
fromJust :: Maybe a -> a
fromMaybe :: a -> Maybe a -> a
isJust :: Maybe a -> GHC.Base.Bool
isNothing :: Maybe a -> GHC.Base.Bool
listToMaybe :: [a] -> Maybe a
mapMaybe :: (a -> Maybe b) -> [a] -> [b]
maybe :: b -> (a -> b) -> Maybe a -> b
maybeToList :: Maybe a -> [a]
-- imported via Data.Maybe, Prelude
Just :: a -> Maybe a
data Maybe a = Nothing | Just a
Nothing :: Maybe a
-- imported via Prelude
(+) :: (GHC.Num.Num a) => a -> a -> a
(=<<) :: (Monad m) => (a -> m b) -> m a -> m b
class Eq a where
(GHC.Base.==) :: a -> a -> GHC.Base.Bool
(GHC.Base./=) :: a -> a -> GHC.Base.Bool
-- imported via Prelude, T
Prelude.length :: [a] -> GHC.Base.Int
-- imported via T
T.length :: Data.ByteString.Internal.ByteString -> GHC.Base.Int
:browse! T
-- defined locally
T.length :: GHC.Num.Integer
class N a
class S a
class C a b where
c1 :: (N b) => a -> b
c2 :: (N b, S b) => a -> b
c3 :: a1 -> b
c4 :: a1 -> b
c1 :: (C a b, N b) => a -> b
c2 :: (C a b, N b, S b) => a -> b
c3 :: (C a b) => a1 -> b
c4 :: (C a b) => a1 -> b
:browse! T -- with -fglasgow-exts
-- defined locally
T.length :: GHC.Num.Integer
class N a
class S a
class C a b where
c1 :: (N b) => a -> b
c2 :: (N b, S b) => a -> b
c3 :: forall a1. a1 -> b
c4 :: forall a1. a1 -> b
c1 :: forall a b. (C a b, N b) => a -> b
c2 :: forall a b. (C a b, N b, S b) => a -> b
c3 :: forall a b. (C a b) => forall a1. a1 -> b
c4 :: forall a b. (C a b) => forall a1. a1 -> b
-- test :browse! <target> relative to different contexts
:browse! C -- from *C>
-- defined locally
g :: forall a. (Num a) => a -> a
h :: forall a. (Integral a) => a -> a
-- imported via D
f :: forall a. (Num a) => a -> a
:browse! C -- from *B>, after :add B
-- imported via C
g :: forall a. (Num a) => a -> a
h :: forall a. (Integral a) => a -> a
f :: forall a. (Num a) => a -> a
:browse! C -- from *C>, after :m *C
-- defined locally
g :: forall a. (Num a) => a -> a
h :: forall a. (Integral a) => a -> a
-- imported via D
f :: forall a. (Num a) => a -> a
:browse! C -- from *D>, after :m *D
-- not currently imported
C.g :: forall a. (Num a) => a -> a
C.h :: forall a. (Integral a) => a -> a
-- defined locally
f :: forall a. (Num a) => a -> a
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment