Safe Haskell	None
Language	Haskell2010

IdeSession.Util.PrettyVal

Contents

Re-exports

Description

(Orphan) PrettyVal instances for various standard datatypes

Synopsis

Re-exports

class PrettyVal a where

A class for types that may be reified into a value. Instances of this class may be derived automatically, for datatypes that support Generics.

Minimal complete definition

Nothing

Methods

prettyVal :: a -> Value

Instances

PrettyVal Bool
PrettyVal Char
PrettyVal Double
PrettyVal Float
PrettyVal Int
PrettyVal Int8
PrettyVal Int16
PrettyVal Int32
PrettyVal Int64
PrettyVal Integer
PrettyVal Word8
PrettyVal Word16
PrettyVal Word32
PrettyVal Word64
PrettyVal ByteString
PrettyVal Text
PrettyVal Progress
PrettyVal UpdateStatus
PrettyVal Targets
PrettyVal BreakInfo
PrettyVal RunResult
PrettyVal RunBufferMode
PrettyVal SpanInfo
PrettyVal Import
PrettyVal ImportEntities
PrettyVal PackageId
PrettyVal ModuleId
PrettyVal SourceErrorKind
PrettyVal SourceError
PrettyVal EitherSpan
PrettyVal SourceSpan
PrettyVal IdScope
PrettyVal IdProp
PrettyVal IdInfo
PrettyVal IdNameSpace
PrettyVal RunCmd
PrettyVal GhcRequest
PrettyVal GhcInitRequest
PrettyVal ExplicitSharingCache
PrettyVal BreakInfo
PrettyVal RunResult
PrettyVal Import
PrettyVal ImportEntities
PrettyVal ExpMap
PrettyVal IdMap
PrettyVal SpanInfo
PrettyVal PackageId
PrettyVal ModuleId
PrettyVal SourceError
PrettyVal EitherSpan
PrettyVal SourceSpan
PrettyVal IdScope
PrettyVal IdProp
PrettyVal IdInfo
PrettyVal IdPropPtr
PrettyVal FilePathPtr
PrettyVal GhcVersion
PrettyVal GhcRunResponse
PrettyVal GhcCompileResult
PrettyVal GhcCompileResponse
PrettyVal GhcInitResponse
PrettyVal a => PrettyVal [a]
(PrettyVal a, Integral a) => PrettyVal (Ratio a)
PrettyVal a => PrettyVal (Maybe a)
PrettyVal a => PrettyVal (Trie a)
PrettyVal a => PrettyVal (IntMap a)
PrettyVal a => PrettyVal (Diff a)
(PrettyVal a1, PrettyVal a2) => PrettyVal (a1, a2)
(PrettyVal k, PrettyVal a) => PrettyVal (Map k a)
(Ord v, PrettyVal v, PrettyVal a) => PrettyVal (StrictIntervalMap v a)
PrettyVal a => PrettyVal (Strict [] a)
(PrettyVal k, PrettyVal v) => PrettyVal (Strict (Map k) v)
PrettyVal a => PrettyVal (Strict Maybe a)
PrettyVal a => PrettyVal (Strict Trie a)
PrettyVal v => PrettyVal (Strict IntMap v)
(PrettyVal a1, PrettyVal a2, PrettyVal a3) => PrettyVal (a1, a2, a3)
(PrettyVal a1, PrettyVal a2, PrettyVal a3, PrettyVal a4) => PrettyVal (a1, a2, a3, a4)
(PrettyVal a1, PrettyVal a2, PrettyVal a3, PrettyVal a4, PrettyVal a5) => PrettyVal (a1, a2, a3, a4, a5)
(PrettyVal a1, PrettyVal a2, PrettyVal a3, PrettyVal a4, PrettyVal a5, PrettyVal a6) => PrettyVal (a1, a2, a3, a4, a5, a6)
(PrettyVal a1, PrettyVal a2, PrettyVal a3, PrettyVal a4, PrettyVal a5, PrettyVal a6, PrettyVal a7) => PrettyVal (a1, a2, a3, a4, a5, a6, a7)