| Portability | portable |
|---|---|
| Stability | experimental |
| Maintainer | Drew Day <drewday@gmail.com> |
| Safe Haskell | Safe-Infered |
Aprog
Contents
Description
Code adapted from: http://web.engr.oregonstate.edu/~erwig/meta/
Documentation (and further updates in technique) forthcoming.
- sum' :: (Eq a, Num a) => [a] -> a
- sumset :: (Eq a, Num a) => [a] -> a
- fac1 :: Int -> Int
- countdown :: Int -> [Int]
- fac2 :: Int -> Int
- log2 :: Int -> Int
- double :: Int -> Int
- minus :: Num c => (c, c) -> c
- eq0 :: (Eq b, Num b) => (a, b) -> Bool
- eq0' :: (Eq b, Num b) => (b, b1) -> Bool
- lt0' :: (Ord b, Num b) => (b, b1) -> Bool
- mult :: IxI -> Int
- power :: IxI -> Int
- mod' :: IxI -> Maybe Int
- gcd' :: IxI -> Maybe Int
- fac3 :: Int -> Int
- length1 :: [t] -> Int
- length2 :: [a] -> Int
- length3 :: [a] -> Int
- length4 :: [a] -> Int
- card :: (Eq a, Num a) => [a] -> Int
- card_alt :: (Eq a, Num a) => [a] -> Int
- quicksort :: Ord a => [a] -> [a]
- histogram :: Ord a => [a] -> FiniteMap a Int
- any2 :: (a -> Bool) -> [a] -> Bool
- all2 :: (a -> Bool) -> [a] -> Bool
- size :: A s (II a) t -> t -> Int
- mapset :: (Eq a, Eq b, Num a, Num b) => (a -> b) -> [a] -> [b]
- flipTree :: Tree a -> Tree a
- preorder :: Tree a -> [a]
- dfsr :: Rose a -> [a]
- bfsr :: [Rose a] -> [a]
- binSearch :: Ord a => a -> Tree a -> Bool
- tree' :: (Tree a -> t) -> (Tree a -> Tree a) -> A () (II t) (Tree a)
- rose1 :: Num a => Rose a
- rose2 :: Num a => Rose a
- build :: [Context a b] -> Graph a b
- gmap :: (Context a b -> Context c d) -> Graph a b -> Graph c d
- nodes :: Graph a b -> [Node]
- labNodes :: Graph a b -> [(Node, a)]
- member :: Node -> Graph a b -> Bool
- noEdges :: Graph a b -> Int
- edges :: Graph a b -> [(Node, Node)]
- labEdges :: Graph a b -> [(Node, Node, b)]
- mapNodes :: (a -> a') -> Graph a b -> Graph a' b
- mapEdges :: (b -> b') -> Graph a b -> Graph a b'
- grev :: Graph a b -> Graph a b
- mlist :: A (II (Maybe a) [a]) (II a) [a]
- nodeId :: II (MContext a b) c -> II (Maybe Node) c
- dfsn :: [Node] -> Graph a b -> [Node]
- bfs :: Node -> Graph a b -> [Node]
- dfs :: Graph a b -> [Node]
- sp :: (Num b, Ord b) => Node -> Graph a b -> [Node]
- sp1 :: (Num b, Ord b) => Node -> Graph a b -> [Node]
- remdup :: (Num a, Eq a) => [a] -> [a]
- rev :: [a] -> [a]
- heapsort :: Ord a => [a] -> [a]
- bucketsort' :: Ord a => [a] -> [a]
- bucketsort :: Ord a => [a] -> [a]
- l :: [Integer]
- nats :: [Integer]
- l1 :: [Integer]
- l2 :: [Integer]
- l3 :: [Integer]
- l4 :: [Integer]
- forceList :: [a] -> a
- listToTree :: [a] -> Tree a
- t :: Tree Integer
- t1 :: Tree Integer
- t2 :: Tree Integer
- t3 :: Tree Integer
- t4 :: Tree Integer
- sucs :: Functor f => t -> (t1, t2, t3, f (a, b)) -> f b
- labSucs :: Num t4 => (t4, t) -> (t1, t2, t3, [(t4, t5)]) -> [(t4, t5)]
- labnl :: (Enum a, Enum b, Num a) => b -> Int -> [(a, b)]
- noLab :: (t, t1) -> (t, t1, ())
Simple Fold Examples
Numeric ( Nat ) Transformers
Numeric ( N * N ) Transformers
List and Set Transformers
Tree Transformers
Graph Transformers
ADT Streams
bucketsort' :: Ord a => [a] -> [a]Source
bucketsort :: Ord a => [a] -> [a]Source
Example Data
listToTree :: [a] -> Tree aSource