[Int] -> Int -base -hunit

buf_concat :: BufferOp a -> [a] -> a
HTTP Network.BufferType
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
gregorianMonthLength :: Integer -> Int -> Int
time Data.Time.Calendar
The number of days in a given month according to the proleptic Gregorian calendar. First argument is year, second is month.
julianMonthLength :: Integer -> Int -> Int
time Data.Time.Calendar.Julian
The number of days in a given month according to the proleptic Julian calendar. First argument is year, second is month.
monthLength :: Bool -> Int -> Int
time Data.Time.Calendar.MonthDay
the length of a given month in the Gregorian or Julian calendars. First arg is leap year flag
elements :: [a] -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Generates one of the given values. The input list must be non-empty.
growingElements :: [a] -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Takes a list of elements of increasing size, and chooses among an initial segment of the list. The size of this initial segment increases with the size parameter. The input list must be non-empty.
NonEmpty :: [a] -> NonEmptyList a
QuickCheck Test.QuickCheck.Modifiers, QuickCheck Test.QuickCheck
Ordered :: [a] -> OrderedList a
QuickCheck Test.QuickCheck.Modifiers, QuickCheck Test.QuickCheck
fromList :: [a] -> Seq a
containers Data.Sequence
O(n). Create a sequence from a finite list of elements. There is a function toList in the opposite direction for all instances of the Foldable class, including Seq.
fromDistinctAscList :: [a] -> Set a
containers Data.Set
O(n). Build a set from an ascending list of distinct elements in linear time. The precondition (input list is strictly ascending) is not checked.
CyclicSCC :: [vertex] -> SCC vertex
containers Data.Graph
A maximal set of mutually reachable vertices.
scheduleAlarm :: Int -> IO Int
unix System.Posix.Signals
scheduleAlarm i calls alarm to schedule a real time alarm at least i seconds in the future.
sleep :: Int -> IO Int
unix System.Posix.Unistd
Sleep for the specified duration (in seconds). Returns the time remaining (if the sleep was interrupted by a signal, for example). GHC Note: the comment for usleep also applies here.
deg :: Graph gr => gr a b -> Node -> Int
fgl Data.Graph.Inductive.Graph
The degree of the Node.
indeg :: Graph gr => gr a b -> Node -> Int
fgl Data.Graph.Inductive.Graph
The inward-bound degree of the Node.
outdeg :: Graph gr => gr a b -> Node -> Int
fgl Data.Graph.Inductive.Graph
The outward-bound degree of the Node.

Show more results