Ledger.Utils

This is the bottom of the module hierarchy. It provides a number of standard modules and utilities which are useful everywhere (or, are needed low in the hierarchy). The hledger prelude.

Documentation

module Char

module Control.Monad

module Data.List

module Data.Maybe

module Data.Ord

module Data.Tree

module Data.Time.Clock

module Data.Time.Calendar

module Data.Time.LocalTime

module Debug.Trace

concatTopPadded :: [String] -> String

Join multi-line strings as side-by-side rectangular strings of the same height, top-padded.

concatBottomPadded :: [String] -> String

Join multi-line strings as side-by-side rectangular strings of the same height, bottom-padded.

padtop :: Int -> String -> String

Convert a multi-line string to a rectangular string top-padded to the specified height.

padbottom :: Int -> String -> String

Convert a multi-line string to a rectangular string bottom-padded to the specified height.

padleft :: Int -> String -> String

Convert a multi-line string to a rectangular string left-padded to the specified width.

padright :: Int -> String -> String

Convert a multi-line string to a rectangular string right-padded to the specified width.

cliptopleft :: Int -> Int -> String -> String

Clip a multi-line string to the specified width and height from the top left.

fitto :: Int -> Int -> String -> String

Clip and pad a multi-line string to fill the specified width and height.

difforzero :: (Num a, Ord a) => a -> a -> a

containsRegex :: Regex -> String -> Bool

splitAtElement :: Eq a => a -> [a] -> [[a]]

leaves :: Tree a -> [a]

List just the leaf nodes of a tree

subtreeat :: Eq a => a -> Tree a -> Maybe (Tree a)

get the sub-tree rooted at the first (left-most, depth-first) occurrence of the specified node value

subtreeinforest :: Eq a => a -> [Tree a] -> Maybe (Tree a)

get the sub-tree for the specified node value in the first tree in forest in which it occurs.

treeprune :: Int -> Tree a -> Tree a

remove all nodes past a certain depth

treemap :: (a -> b) -> Tree a -> Tree b

apply f to all tree nodes

treefilter :: (a -> Bool) -> Tree a -> Tree a

remove all subtrees whose nodes do not fulfill predicate

treeany :: (a -> Bool) -> Tree a -> Bool

is predicate true in any node of tree ?

showtree :: Show a => Tree a -> String

show a compact ascii representation of a tree

showforest :: Show a => Forest a -> String

show a compact ascii representation of a forest

strace :: Show a => a -> a

trace (print on stdout at runtime) a showable expression (for easily tracing in the middle of a complex expression)

parsewith :: Parser a -> String -> Either ParseError a

fromparse :: Either ParseError a -> a

nonspace :: GenParser Char st Char

spacenonewline :: GenParser Char st Char

restofline :: GenParser Char st String

module Text.Printf

module Text.Regex

module Text.RegexPR

module Test.HUnit