(a, b) -> b

snd :: (a, b) -> b
base Prelude, base Data.Tuple
Extract the second component of a pair.
uncurry :: (a -> b -> c) -> ((a, b) -> c)
base Prelude, base Data.Tuple
uncurry converts a curried function to a function on pairs.
fst :: (a, b) -> a
base Prelude, base Data.Tuple
Extract the first component of a pair.
typeOf2 :: Typeable2 t => t a b -> TypeRep
base Data.Typeable
orP :: (a -> Bool) -> (b -> Bool) -> (a, b) -> Bool
fgl Data.Graph.Inductive.Query.Monad
hasLoop :: Graph gr => gr a b -> Bool
fgl Data.Graph.Inductive.Basic
True if the graph has any edges of the form (A, A).
isConnected :: Graph gr => gr a b -> Bool
fgl Data.Graph.Inductive.Query.DFS
isEmpty :: Graph gr => gr a b -> Bool
fgl Data.Graph.Inductive.Graph
isSimple :: Graph gr => gr a b -> Bool
fgl Data.Graph.Inductive.Basic
The inverse of hasLoop.
noComponents :: Graph gr => gr a b -> Int
fgl Data.Graph.Inductive.Query.DFS
noNodes :: Graph gr => gr a b -> Int
fgl Data.Graph.Inductive.Graph
typeOf1Default :: (Typeable2 t, Typeable a) => t a b -> TypeRep
base Data.Typeable
For defining a Typeable1 instance from any Typeable2 instance.
LP :: [LNode a] -> LPath a
fgl Data.Graph.Inductive.Graph
fromAscList :: [(Key, a)] -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(n). Build a map from a list of key/value pairs are in ascending order. > fromAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")] > fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]
fromDistinctAscList :: [(Key, a)] -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(n). Build a map from a list of key/value pairs are in ascending order and all distinct. The precondition (input list is strictly ascending) is not checked. > fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]
fromList :: [(Key, a)] -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(n*min(n,W)). Create a map from a list of key/value pairs. > fromList [] == empty > fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")] > fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]
MultiIfE :: [(Guard, Exp)] -> Exp
template-haskell Language.Haskell.TH.Syntax, template-haskell Language.Haskell.TH
> { if | g1 -> e1 | g2 -> e2 }
lookup :: Eq a => a -> [(a, b)] -> Maybe b
base Prelude, base Data.List
lookup key assocs looks up a key in an association list.
range :: Ix a => (a, a) -> [a]
base Data.Ix
randomRIO :: Random a => (a, a) -> IO a
random System.Random

Show more results