empty -base +fgl

Empty :: FiniteMap a b
fgl Data.Graph.Inductive.Internal.FiniteMap
Empty :: Heap a b
fgl Data.Graph.Inductive.Internal.Heap
empty :: Graph gr => gr a b
fgl Data.Graph.Inductive.Graph
empty :: Ord a => Heap a b
fgl Data.Graph.Inductive.Internal.Heap
emptyFM :: Ord a => FiniteMap a b
fgl Data.Graph.Inductive.Internal.FiniteMap
emptyM :: GraphM m gr => m (gr a b)
fgl Data.Graph.Inductive.Monad
emptyN :: Int -> IO (SGr a b)
fgl Data.Graph.Inductive.Monad.IOArray
isEmpty :: Graph gr => gr a b -> Bool
fgl Data.Graph.Inductive.Graph
isEmpty :: Ord a => Heap a b -> Bool
fgl Data.Graph.Inductive.Internal.Heap
isEmptyFM :: FiniteMap a b -> Bool
fgl Data.Graph.Inductive.Internal.FiniteMap
isEmptyM :: GraphM m gr => m (gr a b) -> m Bool
fgl Data.Graph.Inductive.Monad
queueEmpty :: Queue a -> Bool
fgl Data.Graph.Inductive.Internal.Queue