[[Int]] -> [Int] -base

getPath :: Node -> RTree -> Path
fgl Data.Graph.Inductive.Internal.RootPath
bfsn :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.BFS
dfs :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.DFS
rdfs :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.DFS
udfs :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.DFS
dfsM :: GraphM m gr => [Node] -> m (gr a b) -> m [Node]
fgl Data.Graph.Inductive.Query.Monad
depth-first search yielding number of nodes
heapsort :: Ord a => [a] -> [a]
fgl Data.Graph.Inductive.Internal.Heap
shrinkList :: (a -> [a]) -> [a] -> [[a]]
QuickCheck Test.QuickCheck.Arbitrary
negotiate :: Acceptable a => [a] -> Maybe (Accept a) -> [a]
cgi Network.CGI
ext0 :: (Typeable a, Typeable b) => c a -> c b -> c a
syb Data.Generics.Aliases
Flexible type extension
ext1 :: (Data a, Typeable1 t) => c a -> (forall d. Data d => c (t d)) -> c a
syb Data.Generics.Aliases
Flexible type extension
bfsnWith :: Graph gr => (Context a b -> c) -> [Node] -> gr a b -> [c]
fgl Data.Graph.Inductive.Query.BFS
dfsWith :: Graph gr => CFun a b c -> [Node] -> gr a b -> [c]
fgl Data.Graph.Inductive.Query.DFS
buf_concat :: BufferOp a -> [a] -> a
HTTP Network.BufferType
mkR :: (MonadPlus m, Typeable a, Typeable b) => m b -> m a
syb Data.Generics.Aliases
Make a generic builder; start from a type-specific ase; resort to no build (i.e., mzero) otherwise
replace :: Eq a => a -> a -> [a] -> [a]
cgi Network.CGI.Protocol
Replaces all instances of a value in a list by another value.
parMap :: Strategy b -> (a -> b) -> [a] -> [b]
parallel Control.Parallel.Strategies
A combination of parList and map, encapsulating a common pattern: > parMap strat f = withStrategy (parList strat) . map f
censor :: MonadWriter w m => (w -> w) -> m a -> m a
mtl Control.Monad.Writer.Class, mtl Control.Monad.Writer.Lazy, mtl Control.Monad.Writer.Strict
censor f m is an action that executes the action m and applies the function f to its output, leaving the return value unchanged. *  f m = pass (liftM (\x -> > (x,f))  
local :: MonadReader r m => (r -> r) -> m a -> m a
mtl Control.Monad.Reader.Class, mtl Control.Monad.Reader
catchError :: MonadError e m => m a -> (e -> m a) -> m a
mtl Control.Monad.Error.Class, mtl Control.Monad.Error

Show more results