hledger/Utils.hs

70 lines
1.7 KiB
Haskell
Raw Normal View History

2007-07-03 03:54:17 +04:00
-- standard imports and utilities
2007-02-16 14:51:30 +03:00
module Utils (
module Utils,
2007-07-03 23:01:13 +04:00
module Char,
2007-02-16 14:51:30 +03:00
module Data.List,
2007-03-10 06:16:19 +03:00
module Data.Tree,
2007-07-04 06:24:33 +04:00
module Data.Map,
2007-07-03 23:06:47 +04:00
module Data.Ord,
2007-02-16 14:51:30 +03:00
module Text.Printf,
module Text.Regex,
2007-03-12 12:38:02 +03:00
module Debug.Trace,
module Test.QuickCheck,
module Test.HUnit
2007-02-16 14:51:30 +03:00
)
where
2007-07-03 23:01:13 +04:00
import Char
2007-02-16 14:51:30 +03:00
import Data.List
2007-03-10 06:16:19 +03:00
import Data.Tree
2007-07-04 06:24:33 +04:00
import qualified Data.Map
2007-07-03 23:06:47 +04:00
import Data.Ord
2007-02-16 14:51:30 +03:00
import Text.Printf
import Text.Regex
2007-03-12 12:38:02 +03:00
import Debug.Trace
import Test.QuickCheck hiding (test, Testable)
import Test.HUnit
2007-02-16 14:51:30 +03:00
2007-07-03 03:54:17 +04:00
-- lists
splitAtElement :: Eq a => a -> [a] -> [[a]]
splitAtElement e l =
case dropWhile (e==) l of
[] -> []
l' -> first : splitAtElement e rest
where
(first,rest) = break (e==) l'
2007-07-03 03:54:17 +04:00
-- trees
2007-07-03 03:41:07 +04:00
-- aliases
root = rootLabel
branches = subForest
2007-03-11 02:05:30 +03:00
-- remove all nodes past a certain depth
treeprune :: Int -> Tree a -> Tree a
treeprune 0 t = Node (root t) []
2007-07-02 20:43:14 +04:00
treeprune d t = Node (root t) (map (treeprune $ d-1) $ branches t)
2007-03-11 02:05:30 +03:00
-- apply f to all tree nodes
treemap :: (a -> b) -> Tree a -> Tree b
treemap f t = Node (f $ root t) (map (treemap f) $ branches t)
-- remove all subtrees whose nodes do not fulfill predicate
treefilter :: (a -> Bool) -> Tree a -> Tree a
treefilter f t = Node
(root t)
(map (treefilter f) $ filter (treeany f) $ branches t)
-- is predicate true in any node of tree ?
treeany :: (a -> Bool) -> Tree a -> Bool
treeany f t = (f $ root t) || (any (treeany f) $ branches t)
-- treedrop -- remove the leaves which do fulfill predicate.
-- treedropall -- do this repeatedly.
2007-07-02 20:43:14 +04:00
-- debugging
2007-07-03 03:54:17 +04:00
strace a = trace (show a) a -- trace a showable expression
2007-07-02 20:43:14 +04:00