-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | The method of previewing data (instead of wholly show-ing it)
--   
--   The method of previewing data (instead of wholly show-ing it)
@package preview
@version 0.1.0.4

module Data.Preview

-- | Conversion of values to short readable strings. Preview allows
--   defining short and readable representations of potentially huge data
--   structures that can be used in logs for example. E.g. the Preview
--   instance for lists may only print the values at the beginning of the
--   list and omit the rest.
class Preview a

-- | Create a preview String for the given value.
--   
--   <a>previewsPrec</a> should satisfy the law
--   
--   <pre>
--   previewsPrec d x r ++ s == previewsPrec d x (r ++ s)
--   </pre>
previewsPrec :: Preview a => Int -> a -> String -> String
preview :: Preview a => a -> String
previewNamedSet :: String -> t -> Set a -> String -> String
previewNamedList :: String -> t -> [a] -> String -> String
previewList :: Preview a => Int -> [a] -> String -> String
previews :: Preview a => a -> String -> String
previewRec :: Int -> String -> [(String, Int -> String -> String)] -> String -> String
previewRec' :: Int -> String -> [String -> String] -> String -> String
previewKv :: Preview a => String -> a -> String -> String
showKv :: Show a => String -> a -> String -> String
previewElems :: (Foldable t, Preview a) => t a -> String
previewsElems :: (Foldable f, Preview a) => Int -> f a -> String -> String
pprMapping :: (Ppr a, Ppr b) => [(a, b)] -> Doc
previewList' :: Preview a => Maybe Int -> Int -> [a] -> String -> String
previewsPrecMapping :: (Preview k, Preview v) => t -> [(k, v)] -> String -> String
class Ppr a where pprMany xs = brackets (sep $ punctuate comma $ fmap ppr (toList xs))
ppr :: Ppr a => a -> Doc
pprMany :: (Ppr a, Foldable f) => f a -> Doc
class Ppr' k
ppr' :: (Ppr' k, Ppr a) => k a -> Doc

-- | The abstract type of documents. A Doc represents a <i>set</i> of
--   layouts. A Doc with no occurrences of Union or NoDoc represents just
--   one layout.
data Doc :: *
pretty :: Ppr a => a -> String
prettyText :: Ppr a => a -> Text
docFromStr :: String -> Doc
shortPreviewStr :: Int -> String -> String
docFromText :: Text -> Doc
angles :: Doc -> Doc
instance Data.Preview.Preview ()
instance Data.Preview.Preview GHC.Types.Char
instance Data.Preview.Preview GHC.Types.Int
instance Data.Preview.Preview GHC.Types.Bool
instance Data.Preview.Preview a => Data.Preview.Preview [a]
instance Data.Preview.Preview Data.Text.Internal.Text
instance Data.Preview.Ppr Data.Text.Internal.Text
instance (Data.Preview.Preview a, Data.Preview.Preview b) => Data.Preview.Preview (Data.Either.Either a b)
instance Data.Preview.Preview a => Data.Preview.Preview (GHC.Base.Maybe a)
instance (Data.Preview.Preview a, Data.Preview.Preview b) => Data.Preview.Preview (a, b)
instance (Data.Preview.Preview a, Data.Preview.Preview b, Data.Preview.Preview c) => Data.Preview.Preview (a, b, c)
instance Data.Preview.Preview GHC.Word.Word8
instance Data.Preview.Preview GHC.Word.Word64
instance Data.Preview.Preview GHC.Int.Int32
instance Data.Preview.Preview GHC.Int.Int64
instance (Data.Preview.Preview k, Data.Preview.Preview v) => Data.Preview.Preview (Data.Map.Base.Map k v)
instance Data.Preview.Preview a => Data.Preview.Preview (Data.Fail.Types.Fail a)
instance (Data.Preview.Preview a, Data.Preview.Preview b) => Data.Preview.Preview (Data.Strict.Tuple.Pair a b)
instance (Data.Preview.Ppr a, Data.Preview.Ppr b) => Data.Preview.Ppr (Data.Strict.Tuple.Pair a b)
instance Data.Preview.Preview a => Data.Preview.Preview (Data.Option.Option a)
instance Data.Preview.Preview a => Data.Preview.Preview (Data.StrictList.Types.StrictList a)
instance Data.Preview.Ppr a => Data.Preview.Ppr (Data.StrictList.Types.StrictList a)
instance Data.Preview.Ppr a => Data.Preview.Ppr (Data.Option.Option a)
instance (Data.Preview.Preview a, Data.Preview.Preview b) => Data.Preview.Preview (Data.Choice.Choice a b)
instance (Data.Preview.Preview k, Data.Preview.Preview v) => Data.Preview.Preview (Data.Map.Ordered.OSMap k v)
instance Data.Preview.Ppr ()
instance Data.Preview.Ppr GHC.Int.Int64
instance Data.Preview.Ppr GHC.Types.Char
instance Data.Preview.Ppr GHC.Types.Bool
instance Data.Preview.Ppr a => Data.Preview.Ppr [a]
instance Data.Preview.Ppr a => Data.Preview.Ppr (Data.Set.Base.Set a)
instance (Data.Preview.Ppr a, Data.Preview.Ppr b) => Data.Preview.Ppr (Data.Map.Base.Map a b)
instance Data.Preview.Ppr Text.PrettyPrint.HughesPJ.Doc
instance Data.Preview.Ppr a => Data.Preview.Ppr (Data.Fail.Types.Fail a)
instance (Data.Preview.Ppr a, Data.Preview.Ppr b) => Data.Preview.Ppr (a, b)
instance Data.Preview.Ppr GHC.Types.Int
instance Data.Preview.Ppr GHC.Integer.Type.Integer
instance Data.Preview.Ppr GHC.Int.Int32
instance Data.Preview.Ppr GHC.Word.Word8
instance Data.Preview.Ppr GHC.Types.Double
instance Data.Preview.Ppr a => Data.Preview.Ppr (GHC.Base.Maybe a)
instance Data.Preview.Ppr GHC.Word.Word64
instance (Data.Preview.Ppr k, Data.Preview.Ppr v) => Data.Preview.Ppr (Data.Map.Ordered.OSMap k v)
instance (Data.Preview.Ppr k, Data.Preview.Ppr v) => Data.Preview.Ppr (Data.Map.Unordered.USMap k v)
instance (Data.Preview.Ppr a, Data.Preview.Ppr b) => Data.Preview.Ppr (Data.Choice.Choice a b)