| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Debug.Hoed.Render
- data CompStmt = CompStmt {
- stmtLabel :: !String
- stmtIdentifier :: !UID
- stmtDetails :: !StmtDetails
- data StmtDetails
- = StmtCon {
- stmtCon :: !String
- stmtPretty :: !String
- | StmtLam {
- stmtLamArgs :: ![String]
- stmtLamRes :: !String
- stmtPretty :: !String
- = StmtCon {
- stmtRes :: CompStmt -> String
- renderCompStmts :: (?statementWidth :: Int) => CDSSet -> [CompStmt]
- data CDS
- eventsToCDS :: [Event] -> CDSSet
- noNewlines :: String -> String
- sortOn :: Ord b => (a -> b) -> [a] -> [a]
Documentation
Constructors
| CompStmt | |
Fields
| |
data StmtDetails Source #
Constructors
| StmtCon | |
Fields
| |
| StmtLam | |
Fields
| |
Instances
renderCompStmts :: (?statementWidth :: Int) => CDSSet -> [CompStmt] Source #
eventsToCDS :: [Event] -> CDSSet Source #
noNewlines :: String -> String Source #
sortOn :: Ord b => (a -> b) -> [a] -> [a] #
Sort a list by comparing the results of a key function applied to each
element. sortOn f is equivalent to sortBy (comparing f), but has the
performance advantage of only evaluating f once for each element in the
input list. This is called the decorate-sort-undecorate paradigm, or
Schwartzian transform.
Elements are arranged from from lowest to highest, keeping duplicates in the order they appeared in the input.
Since: 4.8.0.0